/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-properties/splice-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:28:03,390 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:28:03,393 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:28:03,413 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:28:03,414 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:28:03,416 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:28:03,417 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:28:03,419 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:28:03,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:28:03,422 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:28:03,423 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:28:03,424 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:28:03,424 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:28:03,425 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:28:03,426 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:28:03,428 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:28:03,428 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:28:03,429 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:28:03,431 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:28:03,433 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:28:03,435 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:28:03,436 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:28:03,437 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:28:03,438 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:28:03,440 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:28:03,441 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:28:03,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:28:03,442 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:28:03,443 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:28:03,444 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:28:03,444 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:28:03,445 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:28:03,445 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:28:03,446 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:28:03,447 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:28:03,447 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:28:03,448 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:28:03,448 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:28:03,448 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:28:03,449 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:28:03,450 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:28:03,451 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:28:03,466 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:28:03,466 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:28:03,468 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:28:03,468 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:28:03,468 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:28:03,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:28:03,469 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:28:03,469 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:28:03,469 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:28:03,469 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:28:03,469 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:28:03,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:28:03,470 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:28:03,470 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:28:03,470 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:28:03,470 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:28:03,471 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:28:03,471 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:28:03,471 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:28:03,471 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:28:03,471 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:28:03,472 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:28:03,472 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:28:03,472 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:28:03,472 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:28:03,473 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:28:03,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:28:03,473 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:28:03,473 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:28:03,473 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:28:03,779 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:28:03,793 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:28:03,797 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:28:03,802 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:28:03,802 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:28:03,803 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/splice-1.i [2020-07-17 22:28:03,892 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/464daf16b/8305f062b9cc4aaf8c8813cf9d9ee8ff/FLAG59af3a649 [2020-07-17 22:28:04,495 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:28:04,495 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/splice-1.i [2020-07-17 22:28:04,509 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/464daf16b/8305f062b9cc4aaf8c8813cf9d9ee8ff/FLAG59af3a649 [2020-07-17 22:28:04,771 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/464daf16b/8305f062b9cc4aaf8c8813cf9d9ee8ff [2020-07-17 22:28:04,780 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:28:04,783 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:28:04,784 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:28:04,784 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:28:04,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:28:04,789 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:28:04" (1/1) ... [2020-07-17 22:28:04,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c79adff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:28:04, skipping insertion in model container [2020-07-17 22:28:04,792 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:28:04" (1/1) ... [2020-07-17 22:28:04,800 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:28:04,842 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:28:05,273 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:28:05,285 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:28:05,338 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:28:05,397 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:28:05,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:28:05 WrapperNode [2020-07-17 22:28:05,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:28:05,398 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:28:05,399 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:28:05,399 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:28:05,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:28:05" (1/1) ... [2020-07-17 22:28:05,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:28:05" (1/1) ... [2020-07-17 22:28:05,431 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:28:05" (1/1) ... [2020-07-17 22:28:05,432 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:28:05" (1/1) ... [2020-07-17 22:28:05,455 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:28:05" (1/1) ... [2020-07-17 22:28:05,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:28:05" (1/1) ... [2020-07-17 22:28:05,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:28:05" (1/1) ... [2020-07-17 22:28:05,472 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:28:05,473 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:28:05,473 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:28:05,473 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:28:05,474 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:28:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:28:05,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:28:05,549 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:28:05,550 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-17 22:28:05,550 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-17 22:28:05,550 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-07-17 22:28:05,550 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-07-17 22:28:05,550 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-07-17 22:28:05,550 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2020-07-17 22:28:05,551 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:28:05,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:28:05,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:28:05,551 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-17 22:28:05,551 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-17 22:28:05,551 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-17 22:28:05,552 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-17 22:28:05,552 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-17 22:28:05,552 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-17 22:28:05,552 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-17 22:28:05,552 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-17 22:28:05,553 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-17 22:28:05,553 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-17 22:28:05,553 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-17 22:28:05,553 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-17 22:28:05,553 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-17 22:28:05,553 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-17 22:28:05,553 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-17 22:28:05,554 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-17 22:28:05,554 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-17 22:28:05,554 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-17 22:28:05,554 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-07-17 22:28:05,554 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-07-17 22:28:05,554 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-07-17 22:28:05,555 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-17 22:28:05,555 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-17 22:28:05,555 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-17 22:28:05,555 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-17 22:28:05,555 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-17 22:28:05,555 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-17 22:28:05,555 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-17 22:28:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-17 22:28:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-17 22:28:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-17 22:28:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-17 22:28:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-17 22:28:05,556 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-17 22:28:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-17 22:28:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-17 22:28:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-17 22:28:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-17 22:28:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-17 22:28:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-17 22:28:05,557 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-17 22:28:05,558 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-17 22:28:05,558 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-17 22:28:05,558 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-17 22:28:05,558 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-17 22:28:05,558 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-17 22:28:05,558 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-17 22:28:05,558 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-17 22:28:05,559 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-17 22:28:05,559 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-17 22:28:05,559 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-17 22:28:05,559 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-17 22:28:05,559 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-17 22:28:05,559 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-17 22:28:05,559 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-17 22:28:05,560 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:28:05,560 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-17 22:28:05,560 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-17 22:28:05,560 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-17 22:28:05,560 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-17 22:28:05,560 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-17 22:28:05,561 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-17 22:28:05,561 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-17 22:28:05,561 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:28:05,561 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-17 22:28:05,561 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-17 22:28:05,561 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-17 22:28:05,562 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-17 22:28:05,562 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-17 22:28:05,562 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-17 22:28:05,562 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-17 22:28:05,562 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-17 22:28:05,562 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-17 22:28:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-17 22:28:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-17 22:28:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-17 22:28:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-17 22:28:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-17 22:28:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-17 22:28:05,563 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-17 22:28:05,564 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-17 22:28:05,564 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-17 22:28:05,564 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-17 22:28:05,564 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-17 22:28:05,564 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-17 22:28:05,564 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-17 22:28:05,564 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-17 22:28:05,565 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-17 22:28:05,565 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-17 22:28:05,565 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-17 22:28:05,565 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-17 22:28:05,565 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-17 22:28:05,565 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-17 22:28:05,566 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-17 22:28:05,566 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-17 22:28:05,566 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-17 22:28:05,566 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-17 22:28:05,566 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-17 22:28:05,566 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-17 22:28:05,566 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-17 22:28:05,567 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-17 22:28:05,567 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-17 22:28:05,567 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-17 22:28:05,567 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-17 22:28:05,567 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-17 22:28:05,567 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-17 22:28:05,567 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-17 22:28:05,568 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2020-07-17 22:28:05,568 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:28:05,568 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:28:05,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:28:05,568 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-17 22:28:05,568 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-17 22:28:05,569 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:28:05,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:28:05,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:28:05,569 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:28:05,961 INFO L728 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2020-07-17 22:28:06,217 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:28:06,217 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-17 22:28:06,221 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:28:06 BoogieIcfgContainer [2020-07-17 22:28:06,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:28:06,223 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:28:06,223 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:28:06,226 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:28:06,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:28:04" (1/3) ... [2020-07-17 22:28:06,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1585febf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:28:06, skipping insertion in model container [2020-07-17 22:28:06,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:28:05" (2/3) ... [2020-07-17 22:28:06,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1585febf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:28:06, skipping insertion in model container [2020-07-17 22:28:06,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:28:06" (3/3) ... [2020-07-17 22:28:06,230 INFO L109 eAbstractionObserver]: Analyzing ICFG splice-1.i [2020-07-17 22:28:06,241 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:28:06,250 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:28:06,264 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:28:06,289 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:28:06,289 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:28:06,289 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:28:06,290 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:28:06,290 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:28:06,290 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:28:06,290 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:28:06,291 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:28:06,310 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2020-07-17 22:28:06,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-17 22:28:06,317 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:28:06,318 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:28:06,319 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:28:06,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:28:06,325 INFO L82 PathProgramCache]: Analyzing trace with hash 661731879, now seen corresponding path program 1 times [2020-07-17 22:28:06,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:28:06,337 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584799259] [2020-07-17 22:28:06,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:28:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:28:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:28:06,552 INFO L280 TraceCheckUtils]: 0: Hoare triple {44#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {39#true} is VALID [2020-07-17 22:28:06,553 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-17 22:28:06,553 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #126#return; {39#true} is VALID [2020-07-17 22:28:06,571 INFO L263 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {44#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:28:06,572 INFO L280 TraceCheckUtils]: 1: Hoare triple {44#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {39#true} is VALID [2020-07-17 22:28:06,572 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-17 22:28:06,573 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #126#return; {39#true} is VALID [2020-07-17 22:28:06,573 INFO L263 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret13 := main(); {39#true} is VALID [2020-07-17 22:28:06,573 INFO L280 TraceCheckUtils]: 5: Hoare triple {39#true} ~flag~0 := 1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {39#true} is VALID [2020-07-17 22:28:06,574 INFO L280 TraceCheckUtils]: 6: Hoare triple {39#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {39#true} is VALID [2020-07-17 22:28:06,574 INFO L280 TraceCheckUtils]: 7: Hoare triple {39#true} havoc ~t~0.base, ~t~0.offset;havoc ~l1~0.base, ~l1~0.offset;havoc ~l2~0.base, ~l2~0.offset;havoc ~b~0.base, ~b~0.offset;havoc ~u~0.base, ~u~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {39#true} is VALID [2020-07-17 22:28:06,577 INFO L280 TraceCheckUtils]: 8: Hoare triple {39#true} assume !true; {40#false} is VALID [2020-07-17 22:28:06,577 INFO L280 TraceCheckUtils]: 9: Hoare triple {40#false} call write~int(3, ~p~0.base, ~p~0.offset, 4);call #t~mem6 := read~int(~a~0.base, ~a~0.offset, 4); {40#false} is VALID [2020-07-17 22:28:06,577 INFO L280 TraceCheckUtils]: 10: Hoare triple {40#false} assume !(3 == #t~mem6);havoc #t~mem6;~flag~0 := 1;~l1~0.base, ~l1~0.offset := 0, 0;~l2~0.base, ~l2~0.offset := 0, 0;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {40#false} is VALID [2020-07-17 22:28:06,578 INFO L280 TraceCheckUtils]: 11: Hoare triple {40#false} assume !true; {40#false} is VALID [2020-07-17 22:28:06,578 INFO L280 TraceCheckUtils]: 12: Hoare triple {40#false} ~p~0.base, ~p~0.offset := ~l1~0.base, ~l1~0.offset; {40#false} is VALID [2020-07-17 22:28:06,578 INFO L280 TraceCheckUtils]: 13: Hoare triple {40#false} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {40#false} is VALID [2020-07-17 22:28:06,579 INFO L280 TraceCheckUtils]: 14: Hoare triple {40#false} assume 2 != #t~mem9;havoc #t~mem9; {40#false} is VALID [2020-07-17 22:28:06,579 INFO L280 TraceCheckUtils]: 15: Hoare triple {40#false} assume !false; {40#false} is VALID [2020-07-17 22:28:06,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:28:06,581 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584799259] [2020-07-17 22:28:06,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:28:06,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:28:06,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013764400] [2020-07-17 22:28:06,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-17 22:28:06,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:28:06,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:28:06,634 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:28:06,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:28:06,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:28:06,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:28:06,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:28:06,647 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2020-07-17 22:28:06,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:28:06,866 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2020-07-17 22:28:06,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:28:06,867 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-17 22:28:06,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:28:06,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:28:06,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2020-07-17 22:28:06,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:28:06,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2020-07-17 22:28:06,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2020-07-17 22:28:06,998 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:28:07,010 INFO L225 Difference]: With dead ends: 54 [2020-07-17 22:28:07,011 INFO L226 Difference]: Without dead ends: 27 [2020-07-17 22:28:07,015 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:28:07,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-17 22:28:07,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-17 22:28:07,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:28:07,062 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2020-07-17 22:28:07,062 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-17 22:28:07,063 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-17 22:28:07,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:28:07,067 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2020-07-17 22:28:07,067 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2020-07-17 22:28:07,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:28:07,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:28:07,069 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-17 22:28:07,069 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-17 22:28:07,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:28:07,073 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2020-07-17 22:28:07,073 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2020-07-17 22:28:07,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:28:07,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:28:07,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:28:07,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:28:07,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-17 22:28:07,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2020-07-17 22:28:07,079 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 16 [2020-07-17 22:28:07,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:28:07,080 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2020-07-17 22:28:07,080 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:28:07,080 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2020-07-17 22:28:07,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-17 22:28:07,081 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:28:07,081 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:28:07,081 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:28:07,082 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:28:07,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:28:07,082 INFO L82 PathProgramCache]: Analyzing trace with hash 1973627133, now seen corresponding path program 1 times [2020-07-17 22:28:07,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:28:07,083 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507130858] [2020-07-17 22:28:07,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:28:07,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:28:07,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:28:07,211 INFO L280 TraceCheckUtils]: 0: Hoare triple {215#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {208#true} is VALID [2020-07-17 22:28:07,212 INFO L280 TraceCheckUtils]: 1: Hoare triple {208#true} assume true; {208#true} is VALID [2020-07-17 22:28:07,212 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {208#true} {208#true} #126#return; {208#true} is VALID [2020-07-17 22:28:07,214 INFO L263 TraceCheckUtils]: 0: Hoare triple {208#true} call ULTIMATE.init(); {215#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:28:07,214 INFO L280 TraceCheckUtils]: 1: Hoare triple {215#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {208#true} is VALID [2020-07-17 22:28:07,214 INFO L280 TraceCheckUtils]: 2: Hoare triple {208#true} assume true; {208#true} is VALID [2020-07-17 22:28:07,215 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} #126#return; {208#true} is VALID [2020-07-17 22:28:07,215 INFO L263 TraceCheckUtils]: 4: Hoare triple {208#true} call #t~ret13 := main(); {208#true} is VALID [2020-07-17 22:28:07,215 INFO L280 TraceCheckUtils]: 5: Hoare triple {208#true} ~flag~0 := 1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {208#true} is VALID [2020-07-17 22:28:07,216 INFO L280 TraceCheckUtils]: 6: Hoare triple {208#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {208#true} is VALID [2020-07-17 22:28:07,216 INFO L280 TraceCheckUtils]: 7: Hoare triple {208#true} havoc ~t~0.base, ~t~0.offset;havoc ~l1~0.base, ~l1~0.offset;havoc ~l2~0.base, ~l2~0.offset;havoc ~b~0.base, ~b~0.offset;havoc ~u~0.base, ~u~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {208#true} is VALID [2020-07-17 22:28:07,216 INFO L280 TraceCheckUtils]: 8: Hoare triple {208#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {208#true} is VALID [2020-07-17 22:28:07,217 INFO L280 TraceCheckUtils]: 9: Hoare triple {208#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {208#true} is VALID [2020-07-17 22:28:07,217 INFO L280 TraceCheckUtils]: 10: Hoare triple {208#true} call write~int(3, ~p~0.base, ~p~0.offset, 4);call #t~mem6 := read~int(~a~0.base, ~a~0.offset, 4); {208#true} is VALID [2020-07-17 22:28:07,218 INFO L280 TraceCheckUtils]: 11: Hoare triple {208#true} assume !(3 == #t~mem6);havoc #t~mem6;~flag~0 := 1;~l1~0.base, ~l1~0.offset := 0, 0;~l2~0.base, ~l2~0.offset := 0, 0;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {213#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} is VALID [2020-07-17 22:28:07,219 INFO L280 TraceCheckUtils]: 12: Hoare triple {213#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {213#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} is VALID [2020-07-17 22:28:07,220 INFO L280 TraceCheckUtils]: 13: Hoare triple {213#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} assume !(3 != #t~mem7);havoc #t~mem7; {213#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} is VALID [2020-07-17 22:28:07,221 INFO L280 TraceCheckUtils]: 14: Hoare triple {213#(and (= 0 main_~l1~0.offset) (= 0 main_~l1~0.base))} ~p~0.base, ~p~0.offset := ~l1~0.base, ~l1~0.offset; {214#(and (= 0 main_~p~0.offset) (= 0 main_~p~0.base))} is VALID [2020-07-17 22:28:07,222 INFO L280 TraceCheckUtils]: 15: Hoare triple {214#(and (= 0 main_~p~0.offset) (= 0 main_~p~0.base))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {209#false} is VALID [2020-07-17 22:28:07,222 INFO L280 TraceCheckUtils]: 16: Hoare triple {209#false} assume 2 != #t~mem9;havoc #t~mem9; {209#false} is VALID [2020-07-17 22:28:07,222 INFO L280 TraceCheckUtils]: 17: Hoare triple {209#false} assume !false; {209#false} is VALID [2020-07-17 22:28:07,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:28:07,224 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507130858] [2020-07-17 22:28:07,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:28:07,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:28:07,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409214167] [2020-07-17 22:28:07,227 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-17 22:28:07,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:28:07,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:28:07,252 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:28:07,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:28:07,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:28:07,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:28:07,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:28:07,254 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 5 states. [2020-07-17 22:28:07,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:28:07,527 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2020-07-17 22:28:07,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:28:07,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-17 22:28:07,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:28:07,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:28:07,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2020-07-17 22:28:07,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:28:07,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2020-07-17 22:28:07,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2020-07-17 22:28:07,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:28:07,625 INFO L225 Difference]: With dead ends: 44 [2020-07-17 22:28:07,625 INFO L226 Difference]: Without dead ends: 37 [2020-07-17 22:28:07,626 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:28:07,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-17 22:28:07,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2020-07-17 22:28:07,648 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:28:07,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 32 states. [2020-07-17 22:28:07,649 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 32 states. [2020-07-17 22:28:07,649 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 32 states. [2020-07-17 22:28:07,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:28:07,653 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2020-07-17 22:28:07,653 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2020-07-17 22:28:07,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:28:07,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:28:07,655 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 37 states. [2020-07-17 22:28:07,655 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 37 states. [2020-07-17 22:28:07,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:28:07,659 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2020-07-17 22:28:07,659 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2020-07-17 22:28:07,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:28:07,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:28:07,660 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:28:07,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:28:07,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-17 22:28:07,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2020-07-17 22:28:07,664 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 18 [2020-07-17 22:28:07,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:28:07,664 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2020-07-17 22:28:07,664 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:28:07,664 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2020-07-17 22:28:07,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:28:07,666 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:28:07,666 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:28:07,666 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:28:07,666 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:28:07,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:28:07,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1721544590, now seen corresponding path program 1 times [2020-07-17 22:28:07,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:28:07,668 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140126986] [2020-07-17 22:28:07,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:28:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:28:07,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:28:07,820 INFO L280 TraceCheckUtils]: 0: Hoare triple {404#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {397#true} is VALID [2020-07-17 22:28:07,820 INFO L280 TraceCheckUtils]: 1: Hoare triple {397#true} assume true; {397#true} is VALID [2020-07-17 22:28:07,821 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {397#true} {397#true} #126#return; {397#true} is VALID [2020-07-17 22:28:07,822 INFO L263 TraceCheckUtils]: 0: Hoare triple {397#true} call ULTIMATE.init(); {404#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:28:07,822 INFO L280 TraceCheckUtils]: 1: Hoare triple {404#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {397#true} is VALID [2020-07-17 22:28:07,822 INFO L280 TraceCheckUtils]: 2: Hoare triple {397#true} assume true; {397#true} is VALID [2020-07-17 22:28:07,823 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {397#true} {397#true} #126#return; {397#true} is VALID [2020-07-17 22:28:07,823 INFO L263 TraceCheckUtils]: 4: Hoare triple {397#true} call #t~ret13 := main(); {397#true} is VALID [2020-07-17 22:28:07,823 INFO L280 TraceCheckUtils]: 5: Hoare triple {397#true} ~flag~0 := 1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {397#true} is VALID [2020-07-17 22:28:07,823 INFO L280 TraceCheckUtils]: 6: Hoare triple {397#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {397#true} is VALID [2020-07-17 22:28:07,824 INFO L280 TraceCheckUtils]: 7: Hoare triple {397#true} havoc ~t~0.base, ~t~0.offset;havoc ~l1~0.base, ~l1~0.offset;havoc ~l2~0.base, ~l2~0.offset;havoc ~b~0.base, ~b~0.offset;havoc ~u~0.base, ~u~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {397#true} is VALID [2020-07-17 22:28:07,824 INFO L280 TraceCheckUtils]: 8: Hoare triple {397#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {397#true} is VALID [2020-07-17 22:28:07,828 INFO L280 TraceCheckUtils]: 9: Hoare triple {397#true} assume !(0 != #t~nondet3);havoc #t~nondet3; {397#true} is VALID [2020-07-17 22:28:07,828 INFO L280 TraceCheckUtils]: 10: Hoare triple {397#true} call write~int(3, ~p~0.base, ~p~0.offset, 4);call #t~mem6 := read~int(~a~0.base, ~a~0.offset, 4); {397#true} is VALID [2020-07-17 22:28:07,830 INFO L280 TraceCheckUtils]: 11: Hoare triple {397#true} assume !(3 == #t~mem6);havoc #t~mem6;~flag~0 := 1;~l1~0.base, ~l1~0.offset := 0, 0;~l2~0.base, ~l2~0.offset := 0, 0;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {402#(and (= 0 main_~l2~0.base) (= 0 main_~l2~0.offset))} is VALID [2020-07-17 22:28:07,831 INFO L280 TraceCheckUtils]: 12: Hoare triple {402#(and (= 0 main_~l2~0.base) (= 0 main_~l2~0.offset))} call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {402#(and (= 0 main_~l2~0.base) (= 0 main_~l2~0.offset))} is VALID [2020-07-17 22:28:07,839 INFO L280 TraceCheckUtils]: 13: Hoare triple {402#(and (= 0 main_~l2~0.base) (= 0 main_~l2~0.offset))} assume !(3 != #t~mem7);havoc #t~mem7; {402#(and (= 0 main_~l2~0.base) (= 0 main_~l2~0.offset))} is VALID [2020-07-17 22:28:07,841 INFO L280 TraceCheckUtils]: 14: Hoare triple {402#(and (= 0 main_~l2~0.base) (= 0 main_~l2~0.offset))} ~p~0.base, ~p~0.offset := ~l1~0.base, ~l1~0.offset; {402#(and (= 0 main_~l2~0.base) (= 0 main_~l2~0.offset))} is VALID [2020-07-17 22:28:07,842 INFO L280 TraceCheckUtils]: 15: Hoare triple {402#(and (= 0 main_~l2~0.base) (= 0 main_~l2~0.offset))} assume !(~p~0.base != 0 || ~p~0.offset != 0); {402#(and (= 0 main_~l2~0.base) (= 0 main_~l2~0.offset))} is VALID [2020-07-17 22:28:07,842 INFO L280 TraceCheckUtils]: 16: Hoare triple {402#(and (= 0 main_~l2~0.base) (= 0 main_~l2~0.offset))} ~p~0.base, ~p~0.offset := ~l2~0.base, ~l2~0.offset; {403#(and (= 0 main_~p~0.offset) (= 0 main_~p~0.base))} is VALID [2020-07-17 22:28:07,844 INFO L280 TraceCheckUtils]: 17: Hoare triple {403#(and (= 0 main_~p~0.offset) (= 0 main_~p~0.base))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem11 := read~int(~p~0.base, ~p~0.offset, 4); {398#false} is VALID [2020-07-17 22:28:07,844 INFO L280 TraceCheckUtils]: 18: Hoare triple {398#false} assume 1 != #t~mem11;havoc #t~mem11; {398#false} is VALID [2020-07-17 22:28:07,845 INFO L280 TraceCheckUtils]: 19: Hoare triple {398#false} assume !false; {398#false} is VALID [2020-07-17 22:28:07,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:28:07,847 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140126986] [2020-07-17 22:28:07,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:28:07,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:28:07,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762862700] [2020-07-17 22:28:07,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-17 22:28:07,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:28:07,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:28:07,877 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:28:07,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:28:07,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:28:07,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:28:07,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:28:07,878 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 5 states. [2020-07-17 22:28:08,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:28:08,125 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2020-07-17 22:28:08,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:28:08,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-17 22:28:08,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:28:08,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:28:08,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2020-07-17 22:28:08,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:28:08,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 50 transitions. [2020-07-17 22:28:08,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 50 transitions. [2020-07-17 22:28:08,202 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:28:08,205 INFO L225 Difference]: With dead ends: 51 [2020-07-17 22:28:08,205 INFO L226 Difference]: Without dead ends: 43 [2020-07-17 22:28:08,206 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:28:08,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-17 22:28:08,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2020-07-17 22:28:08,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:28:08,237 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 41 states. [2020-07-17 22:28:08,237 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 41 states. [2020-07-17 22:28:08,238 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 41 states. [2020-07-17 22:28:08,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:28:08,244 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2020-07-17 22:28:08,244 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2020-07-17 22:28:08,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:28:08,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:28:08,246 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 43 states. [2020-07-17 22:28:08,246 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 43 states. [2020-07-17 22:28:08,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:28:08,252 INFO L93 Difference]: Finished difference Result 43 states and 54 transitions. [2020-07-17 22:28:08,254 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2020-07-17 22:28:08,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:28:08,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:28:08,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:28:08,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:28:08,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-17 22:28:08,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2020-07-17 22:28:08,261 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 20 [2020-07-17 22:28:08,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:28:08,261 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2020-07-17 22:28:08,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:28:08,262 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2020-07-17 22:28:08,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-17 22:28:08,263 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:28:08,263 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:28:08,263 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-17 22:28:08,263 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:28:08,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:28:08,264 INFO L82 PathProgramCache]: Analyzing trace with hash -918584693, now seen corresponding path program 1 times [2020-07-17 22:28:08,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:28:08,264 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743249267] [2020-07-17 22:28:08,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:28:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:28:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:28:08,393 INFO L280 TraceCheckUtils]: 0: Hoare triple {629#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {620#true} is VALID [2020-07-17 22:28:08,393 INFO L280 TraceCheckUtils]: 1: Hoare triple {620#true} assume true; {620#true} is VALID [2020-07-17 22:28:08,394 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {620#true} {620#true} #126#return; {620#true} is VALID [2020-07-17 22:28:08,395 INFO L263 TraceCheckUtils]: 0: Hoare triple {620#true} call ULTIMATE.init(); {629#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:28:08,395 INFO L280 TraceCheckUtils]: 1: Hoare triple {629#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {620#true} is VALID [2020-07-17 22:28:08,395 INFO L280 TraceCheckUtils]: 2: Hoare triple {620#true} assume true; {620#true} is VALID [2020-07-17 22:28:08,395 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {620#true} {620#true} #126#return; {620#true} is VALID [2020-07-17 22:28:08,396 INFO L263 TraceCheckUtils]: 4: Hoare triple {620#true} call #t~ret13 := main(); {620#true} is VALID [2020-07-17 22:28:08,396 INFO L280 TraceCheckUtils]: 5: Hoare triple {620#true} ~flag~0 := 1;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8);~a~0.base, ~a~0.offset := #t~malloc2.base, #t~malloc2.offset; {620#true} is VALID [2020-07-17 22:28:08,396 INFO L280 TraceCheckUtils]: 6: Hoare triple {620#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {620#true} is VALID [2020-07-17 22:28:08,397 INFO L280 TraceCheckUtils]: 7: Hoare triple {620#true} havoc ~t~0.base, ~t~0.offset;havoc ~l1~0.base, ~l1~0.offset;havoc ~l2~0.base, ~l2~0.offset;havoc ~b~0.base, ~b~0.offset;havoc ~u~0.base, ~u~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {625#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:28:08,398 INFO L280 TraceCheckUtils]: 8: Hoare triple {625#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {625#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:28:08,399 INFO L280 TraceCheckUtils]: 9: Hoare triple {625#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} assume !(0 != #t~nondet3);havoc #t~nondet3; {625#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} is VALID [2020-07-17 22:28:08,400 INFO L280 TraceCheckUtils]: 10: Hoare triple {625#(and (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset main_~p~0.offset))} call write~int(3, ~p~0.base, ~p~0.offset, 4);call #t~mem6 := read~int(~a~0.base, ~a~0.offset, 4); {626#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} is VALID [2020-07-17 22:28:08,401 INFO L280 TraceCheckUtils]: 11: Hoare triple {626#(= 3 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))} assume !(3 == #t~mem6);havoc #t~mem6;~flag~0 := 1;~l1~0.base, ~l1~0.offset := 0, 0;~l2~0.base, ~l2~0.offset := 0, 0;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {627#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2020-07-17 22:28:08,402 INFO L280 TraceCheckUtils]: 12: Hoare triple {627#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {628#(= 3 |main_#t~mem7|)} is VALID [2020-07-17 22:28:08,403 INFO L280 TraceCheckUtils]: 13: Hoare triple {628#(= 3 |main_#t~mem7|)} assume !!(3 != #t~mem7);havoc #t~mem7;~t~0.base, ~t~0.offset := ~p~0.base, ~p~0.offset;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem8.base, #t~mem8.offset;havoc #t~mem8.base, #t~mem8.offset; {621#false} is VALID [2020-07-17 22:28:08,403 INFO L280 TraceCheckUtils]: 14: Hoare triple {621#false} assume 0 != ~flag~0;call write~$Pointer$(~l1~0.base, ~l1~0.offset, ~t~0.base, 4 + ~t~0.offset, 4);~l1~0.base, ~l1~0.offset := ~t~0.base, ~t~0.offset;~flag~0 := 0; {621#false} is VALID [2020-07-17 22:28:08,403 INFO L280 TraceCheckUtils]: 15: Hoare triple {621#false} call #t~mem7 := read~int(~p~0.base, ~p~0.offset, 4); {621#false} is VALID [2020-07-17 22:28:08,404 INFO L280 TraceCheckUtils]: 16: Hoare triple {621#false} assume !(3 != #t~mem7);havoc #t~mem7; {621#false} is VALID [2020-07-17 22:28:08,404 INFO L280 TraceCheckUtils]: 17: Hoare triple {621#false} ~p~0.base, ~p~0.offset := ~l1~0.base, ~l1~0.offset; {621#false} is VALID [2020-07-17 22:28:08,404 INFO L280 TraceCheckUtils]: 18: Hoare triple {621#false} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem9 := read~int(~p~0.base, ~p~0.offset, 4); {621#false} is VALID [2020-07-17 22:28:08,404 INFO L280 TraceCheckUtils]: 19: Hoare triple {621#false} assume 2 != #t~mem9;havoc #t~mem9; {621#false} is VALID [2020-07-17 22:28:08,405 INFO L280 TraceCheckUtils]: 20: Hoare triple {621#false} assume !false; {621#false} is VALID [2020-07-17 22:28:08,406 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:28:08,406 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743249267] [2020-07-17 22:28:08,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:28:08,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-17 22:28:08,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690915328] [2020-07-17 22:28:08,407 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-07-17 22:28:08,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:28:08,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:28:08,433 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:28:08,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:28:08,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:28:08,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:28:08,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:28:08,435 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand 7 states. [2020-07-17 22:28:08,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:28:08,889 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2020-07-17 22:28:08,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:28:08,891 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-07-17 22:28:08,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:28:08,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:28:08,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2020-07-17 22:28:08,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:28:08,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2020-07-17 22:28:08,900 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2020-07-17 22:28:08,971 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:28:08,973 INFO L225 Difference]: With dead ends: 74 [2020-07-17 22:28:08,973 INFO L226 Difference]: Without dead ends: 47 [2020-07-17 22:28:08,976 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:28:08,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-07-17 22:28:09,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2020-07-17 22:28:09,005 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:28:09,005 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 43 states. [2020-07-17 22:28:09,005 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 43 states. [2020-07-17 22:28:09,005 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 43 states. [2020-07-17 22:28:09,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:28:09,009 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2020-07-17 22:28:09,009 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2020-07-17 22:28:09,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:28:09,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:28:09,010 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 47 states. [2020-07-17 22:28:09,010 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 47 states. [2020-07-17 22:28:09,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:28:09,013 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2020-07-17 22:28:09,013 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 60 transitions. [2020-07-17 22:28:09,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:28:09,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:28:09,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:28:09,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:28:09,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-17 22:28:09,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2020-07-17 22:28:09,017 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 21 [2020-07-17 22:28:09,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:28:09,017 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2020-07-17 22:28:09,017 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:28:09,018 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2020-07-17 22:28:09,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:28:09,018 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:28:09,019 INFO L422 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] [2020-07-17 22:28:09,019 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 22:28:09,019 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:28:09,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:28:09,020 INFO L82 PathProgramCache]: Analyzing trace with hash -743556192, now seen corresponding path program 1 times [2020-07-17 22:28:09,020 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:28:09,020 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075645745] [2020-07-17 22:28:09,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:28:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:28:09,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:28:09,149 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:28:09,149 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:28:09,150 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-17 22:28:09,198 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:28:09,198 WARN L170 areAnnotationChecker]: myexitENTRY has no Hoare annotation [2020-07-17 22:28:09,198 WARN L170 areAnnotationChecker]: __bswap_32ENTRY has no Hoare annotation [2020-07-17 22:28:09,198 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:28:09,198 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:28:09,198 WARN L170 areAnnotationChecker]: __bswap_64ENTRY has no Hoare annotation [2020-07-17 22:28:09,198 WARN L170 areAnnotationChecker]: __uint16_identityENTRY has no Hoare annotation [2020-07-17 22:28:09,198 WARN L170 areAnnotationChecker]: __uint64_identityENTRY has no Hoare annotation [2020-07-17 22:28:09,199 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:28:09,199 WARN L170 areAnnotationChecker]: __uint32_identityENTRY has no Hoare annotation [2020-07-17 22:28:09,199 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:28:09,199 WARN L170 areAnnotationChecker]: L514 has no Hoare annotation [2020-07-17 22:28:09,199 WARN L170 areAnnotationChecker]: __bswap_32FINAL has no Hoare annotation [2020-07-17 22:28:09,199 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:28:09,199 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:28:09,199 WARN L170 areAnnotationChecker]: __bswap_64FINAL has no Hoare annotation [2020-07-17 22:28:09,199 WARN L170 areAnnotationChecker]: __uint16_identityFINAL has no Hoare annotation [2020-07-17 22:28:09,200 WARN L170 areAnnotationChecker]: __uint64_identityFINAL has no Hoare annotation [2020-07-17 22:28:09,200 WARN L170 areAnnotationChecker]: L523 has no Hoare annotation [2020-07-17 22:28:09,200 WARN L170 areAnnotationChecker]: L523 has no Hoare annotation [2020-07-17 22:28:09,200 WARN L170 areAnnotationChecker]: __uint32_identityFINAL has no Hoare annotation [2020-07-17 22:28:09,200 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:28:09,200 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:28:09,200 WARN L170 areAnnotationChecker]: L523-1 has no Hoare annotation [2020-07-17 22:28:09,200 WARN L170 areAnnotationChecker]: L523-1 has no Hoare annotation [2020-07-17 22:28:09,200 WARN L170 areAnnotationChecker]: L523-3 has no Hoare annotation [2020-07-17 22:28:09,200 WARN L170 areAnnotationChecker]: L530-3 has no Hoare annotation [2020-07-17 22:28:09,200 WARN L170 areAnnotationChecker]: L530-3 has no Hoare annotation [2020-07-17 22:28:09,200 WARN L170 areAnnotationChecker]: L530-4 has no Hoare annotation [2020-07-17 22:28:09,200 WARN L170 areAnnotationChecker]: L530-1 has no Hoare annotation [2020-07-17 22:28:09,201 WARN L170 areAnnotationChecker]: L530-1 has no Hoare annotation [2020-07-17 22:28:09,201 WARN L170 areAnnotationChecker]: L544 has no Hoare annotation [2020-07-17 22:28:09,201 WARN L170 areAnnotationChecker]: L544 has no Hoare annotation [2020-07-17 22:28:09,201 WARN L170 areAnnotationChecker]: L531 has no Hoare annotation [2020-07-17 22:28:09,201 WARN L170 areAnnotationChecker]: L531 has no Hoare annotation [2020-07-17 22:28:09,201 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:28:09,201 WARN L170 areAnnotationChecker]: L552-2 has no Hoare annotation [2020-07-17 22:28:09,201 WARN L170 areAnnotationChecker]: L552-2 has no Hoare annotation [2020-07-17 22:28:09,201 WARN L170 areAnnotationChecker]: L531-2 has no Hoare annotation [2020-07-17 22:28:09,201 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:28:09,201 WARN L170 areAnnotationChecker]: L549-3 has no Hoare annotation [2020-07-17 22:28:09,201 WARN L170 areAnnotationChecker]: L549-1 has no Hoare annotation [2020-07-17 22:28:09,201 WARN L170 areAnnotationChecker]: L549-1 has no Hoare annotation [2020-07-17 22:28:09,201 WARN L170 areAnnotationChecker]: L539 has no Hoare annotation [2020-07-17 22:28:09,202 WARN L170 areAnnotationChecker]: L539 has no Hoare annotation [2020-07-17 22:28:09,202 WARN L170 areAnnotationChecker]: L563-2 has no Hoare annotation [2020-07-17 22:28:09,202 WARN L170 areAnnotationChecker]: L563-2 has no Hoare annotation [2020-07-17 22:28:09,202 WARN L170 areAnnotationChecker]: L563-2 has no Hoare annotation [2020-07-17 22:28:09,202 WARN L170 areAnnotationChecker]: L552 has no Hoare annotation [2020-07-17 22:28:09,202 WARN L170 areAnnotationChecker]: L552 has no Hoare annotation [2020-07-17 22:28:09,202 WARN L170 areAnnotationChecker]: L539-1 has no Hoare annotation [2020-07-17 22:28:09,202 WARN L170 areAnnotationChecker]: L539-1 has no Hoare annotation [2020-07-17 22:28:09,202 WARN L170 areAnnotationChecker]: L539-3 has no Hoare annotation [2020-07-17 22:28:09,202 WARN L170 areAnnotationChecker]: L563-3 has no Hoare annotation [2020-07-17 22:28:09,203 WARN L170 areAnnotationChecker]: L564 has no Hoare annotation [2020-07-17 22:28:09,203 WARN L170 areAnnotationChecker]: L564 has no Hoare annotation [2020-07-17 22:28:09,203 WARN L170 areAnnotationChecker]: L568-2 has no Hoare annotation [2020-07-17 22:28:09,203 WARN L170 areAnnotationChecker]: L568-2 has no Hoare annotation [2020-07-17 22:28:09,203 WARN L170 areAnnotationChecker]: L568-2 has no Hoare annotation [2020-07-17 22:28:09,203 WARN L170 areAnnotationChecker]: L569-1 has no Hoare annotation [2020-07-17 22:28:09,203 WARN L170 areAnnotationChecker]: L569-1 has no Hoare annotation [2020-07-17 22:28:09,203 WARN L170 areAnnotationChecker]: L568-3 has no Hoare annotation [2020-07-17 22:28:09,203 WARN L170 areAnnotationChecker]: L569 has no Hoare annotation [2020-07-17 22:28:09,204 WARN L170 areAnnotationChecker]: L569 has no Hoare annotation [2020-07-17 22:28:09,204 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:28:09,206 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:28:09 BoogieIcfgContainer [2020-07-17 22:28:09,206 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:28:09,209 INFO L168 Benchmark]: Toolchain (without parser) took 4426.76 ms. Allocated memory was 137.9 MB in the beginning and 249.0 MB in the end (delta: 111.1 MB). Free memory was 99.8 MB in the beginning and 163.2 MB in the end (delta: -63.4 MB). Peak memory consumption was 47.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:28:09,209 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory is still 119.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 22:28:09,210 INFO L168 Benchmark]: CACSL2BoogieTranslator took 614.47 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 99.4 MB in the beginning and 167.9 MB in the end (delta: -68.6 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:28:09,211 INFO L168 Benchmark]: Boogie Preprocessor took 74.19 ms. Allocated memory is still 202.4 MB. Free memory was 167.9 MB in the beginning and 163.8 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:28:09,212 INFO L168 Benchmark]: RCFGBuilder took 748.62 ms. Allocated memory is still 202.4 MB. Free memory was 163.8 MB in the beginning and 106.0 MB in the end (delta: 57.8 MB). Peak memory consumption was 57.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:28:09,213 INFO L168 Benchmark]: TraceAbstraction took 2983.14 ms. Allocated memory was 202.4 MB in the beginning and 249.0 MB in the end (delta: 46.7 MB). Free memory was 105.1 MB in the beginning and 163.2 MB in the end (delta: -58.2 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 22:28:09,216 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 137.9 MB. Free memory is still 119.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 614.47 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 99.4 MB in the beginning and 167.9 MB in the end (delta: -68.6 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 74.19 ms. Allocated memory is still 202.4 MB. Free memory was 167.9 MB in the beginning and 163.8 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 748.62 ms. Allocated memory is still 202.4 MB. Free memory was 163.8 MB in the beginning and 106.0 MB in the end (delta: 57.8 MB). Peak memory consumption was 57.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2983.14 ms. Allocated memory was 202.4 MB in the beginning and 249.0 MB in the end (delta: 46.7 MB). Free memory was 105.1 MB in the beginning and 163.2 MB in the end (delta: -58.2 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 573]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L521] int flag = 1; [L522] List a = (List) malloc(sizeof(struct node)); VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}] [L523] COND FALSE !(a == 0) VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}] [L524] List t; [L525] List l1; [L526] List l2; [L527] List b; [L528] List u; [L529] List p = a; VAL [a={-1:0}, flag=1, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L530] COND TRUE __VERIFIER_nondet_int() [L531] COND TRUE \read(flag) [L532] p->h = 1 [L533] flag = 0 VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-1:0}, p={-1:0}] [L538] t = (List) malloc(sizeof(struct node)) VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, t={-2:0}] [L539] COND FALSE !(t == 0) VAL [a={-1:0}, flag=0, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, t={-2:0}] [L540] p->n = t [L541] EXPR p->n [L541] p = p->n [L530] COND FALSE !(__VERIFIER_nondet_int()) [L543] p->h = 3 [L544] EXPR a->h VAL [a={-1:0}, a->h=1, flag=0, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-2:0}, t={-2:0}] [L544] COND FALSE !(a->h == 3) [L545] flag = 1 [L546] l1 = 0 [L547] l2 = 0 [L548] p = a VAL [a={-1:0}, flag=1, l1={0:0}, l2={0:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, t={-2:0}] [L549] EXPR p->h VAL [a={-1:0}, flag=1, l1={0:0}, l2={0:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, p->h=1, t={-2:0}] [L549] COND TRUE p->h != 3 [L550] t = p [L551] EXPR p->n [L551] p = p->n [L552] COND TRUE \read(flag) [L553] t->n = l1 [L554] l1 = t [L555] flag = 0 VAL [a={-1:0}, flag=0, l1={-1:0}, l2={0:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-2:0}, t={-1:0}] [L549] EXPR p->h VAL [a={-1:0}, flag=0, l1={-1:0}, l2={0:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-2:0}, p->h=3, t={-1:0}] [L549] COND FALSE !(p->h != 3) [L562] p = l1 VAL [a={-1:0}, flag=0, l1={-1:0}, l2={0:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, t={-1:0}] [L563] COND TRUE p != 0 [L564] EXPR p->h VAL [a={-1:0}, flag=0, l1={-1:0}, l2={0:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, p->h=1, t={-1:0}] [L564] COND TRUE p->h != 2 [L573] __VERIFIER_error() VAL [a={-1:0}, flag=0, l1={-1:0}, l2={0:0}, malloc(sizeof(struct node))={-1:0}, malloc(sizeof(struct node))={-2:0}, p={-1:0}, t={-1:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 2.8s, OverallIterations: 5, TraceHistogramMax: 2, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 124 SDtfs, 28 SDslu, 164 SDs, 0 SdLazy, 245 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=43occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 102 NumberOfCodeBlocks, 102 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 71 ConstructedInterpolants, 0 QuantifiedInterpolants, 3646 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 2/2 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...