/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/heap-data/quick_sort_split.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:25:00,356 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:25:00,358 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:25:00,372 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:25:00,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:25:00,373 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:25:00,375 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:25:00,377 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:25:00,379 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:25:00,380 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:25:00,381 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:25:00,383 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:25:00,383 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:25:00,384 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:25:00,386 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:25:00,387 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:25:00,388 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:25:00,389 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:25:00,391 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:25:00,393 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:25:00,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:25:00,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:25:00,397 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:25:00,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:25:00,401 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:25:00,401 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:25:00,401 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:25:00,402 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:25:00,403 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:25:00,404 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:25:00,404 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:25:00,405 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:25:00,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:25:00,410 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:25:00,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:25:00,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:25:00,412 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:25:00,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:25:00,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:25:00,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:25:00,414 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:25:00,415 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-18 00:25:00,425 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:25:00,426 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:25:00,427 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:25:00,427 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:25:00,428 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:25:00,428 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:25:00,428 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:25:00,428 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:25:00,428 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:25:00,429 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:25:00,429 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:25:00,429 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:25:00,429 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:25:00,429 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:25:00,430 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:25:00,430 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:25:00,430 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:25:00,430 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:25:00,431 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:25:00,431 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:25:00,431 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:25:00,431 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:25:00,431 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:25:00,747 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:25:00,767 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:25:00,770 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:25:00,772 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:25:00,772 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:25:00,773 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/quick_sort_split.i [2020-07-18 00:25:00,852 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b3cf6c43/f096d77371764df19d4e015fb9c064aa/FLAG0f420bcd5 [2020-07-18 00:25:01,445 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:25:01,446 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/quick_sort_split.i [2020-07-18 00:25:01,469 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b3cf6c43/f096d77371764df19d4e015fb9c064aa/FLAG0f420bcd5 [2020-07-18 00:25:01,676 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b3cf6c43/f096d77371764df19d4e015fb9c064aa [2020-07-18 00:25:01,692 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:25:01,695 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:25:01,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:25:01,697 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:25:01,701 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:25:01,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:25:01" (1/1) ... [2020-07-18 00:25:01,706 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@402be1b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:25:01, skipping insertion in model container [2020-07-18 00:25:01,706 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:25:01" (1/1) ... [2020-07-18 00:25:01,715 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:25:01,765 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:25:02,272 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:25:02,287 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:25:02,334 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:25:02,419 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:25:02,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:25:02 WrapperNode [2020-07-18 00:25:02,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:25:02,421 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:25:02,421 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:25:02,422 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:25:02,434 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:25:02" (1/1) ... [2020-07-18 00:25:02,435 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:25:02" (1/1) ... [2020-07-18 00:25:02,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:25:02" (1/1) ... [2020-07-18 00:25:02,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:25:02" (1/1) ... [2020-07-18 00:25:02,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:25:02" (1/1) ... [2020-07-18 00:25:02,483 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:25:02" (1/1) ... [2020-07-18 00:25:02,487 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:25:02" (1/1) ... [2020-07-18 00:25:02,494 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:25:02,495 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:25:02,495 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:25:02,495 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:25:02,499 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:25:02" (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-18 00:25:02,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:25:02,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:25:02,566 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-18 00:25:02,566 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-18 00:25:02,566 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_list [2020-07-18 00:25:02,567 INFO L138 BoogieDeclarations]: Found implementation of procedure create_list [2020-07-18 00:25:02,567 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:25:02,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:25:02,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:25:02,567 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-18 00:25:02,567 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-18 00:25:02,568 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-18 00:25:02,568 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-18 00:25:02,568 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-18 00:25:02,568 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-18 00:25:02,568 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-18 00:25:02,568 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-18 00:25:02,569 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-18 00:25:02,569 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-18 00:25:02,569 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-18 00:25:02,577 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-18 00:25:02,578 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-18 00:25:02,578 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-18 00:25:02,578 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-18 00:25:02,579 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-18 00:25:02,580 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-18 00:25:02,580 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-18 00:25:02,580 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-18 00:25:02,581 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-18 00:25:02,581 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-18 00:25:02,581 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-18 00:25:02,581 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-18 00:25:02,581 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-18 00:25:02,581 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-18 00:25:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-18 00:25:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-18 00:25:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-18 00:25:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-18 00:25:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-18 00:25:02,582 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-18 00:25:02,583 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-18 00:25:02,583 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-18 00:25:02,583 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-18 00:25:02,583 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-18 00:25:02,583 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-18 00:25:02,583 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-18 00:25:02,584 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-18 00:25:02,584 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-18 00:25:02,584 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-18 00:25:02,584 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-18 00:25:02,584 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-18 00:25:02,584 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-18 00:25:02,584 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-18 00:25:02,585 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-18 00:25:02,585 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-18 00:25:02,585 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-18 00:25:02,585 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-18 00:25:02,585 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-18 00:25:02,585 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-18 00:25:02,585 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-18 00:25:02,585 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-18 00:25:02,586 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-18 00:25:02,586 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-18 00:25:02,586 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-18 00:25:02,586 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-18 00:25:02,586 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-18 00:25:02,586 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-18 00:25:02,586 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-18 00:25:02,586 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-18 00:25:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-18 00:25:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 00:25:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-18 00:25:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-18 00:25:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-18 00:25:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-18 00:25:02,587 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-18 00:25:02,588 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-18 00:25:02,588 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-18 00:25:02,588 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-18 00:25:02,588 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-18 00:25:02,588 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-18 00:25:02,588 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-18 00:25:02,588 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-18 00:25:02,589 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-18 00:25:02,589 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-18 00:25:02,589 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-18 00:25:02,589 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-18 00:25:02,589 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-18 00:25:02,589 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-18 00:25:02,590 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-18 00:25:02,590 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-18 00:25:02,590 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-18 00:25:02,590 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-18 00:25:02,590 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-18 00:25:02,590 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-18 00:25:02,590 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-18 00:25:02,590 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-18 00:25:02,591 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-18 00:25:02,591 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-18 00:25:02,591 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-18 00:25:02,591 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-18 00:25:02,591 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-18 00:25:02,591 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-18 00:25:02,591 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-18 00:25:02,592 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-18 00:25:02,592 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-18 00:25:02,592 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-18 00:25:02,592 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-18 00:25:02,592 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-18 00:25:02,592 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-18 00:25:02,592 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-18 00:25:02,592 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-18 00:25:02,593 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-18 00:25:02,593 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-18 00:25:02,593 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_list [2020-07-18 00:25:02,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-18 00:25:02,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-18 00:25:02,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-18 00:25:02,593 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-18 00:25:02,593 INFO L130 BoogieDeclarations]: Found specification of procedure create_list [2020-07-18 00:25:02,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-18 00:25:02,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-07-18 00:25:02,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 00:25:02,594 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:25:02,594 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-18 00:25:02,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:25:02,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:25:03,341 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:25:03,341 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-18 00:25:03,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:25:03 BoogieIcfgContainer [2020-07-18 00:25:03,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:25:03,353 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:25:03,354 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:25:03,357 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:25:03,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:25:01" (1/3) ... [2020-07-18 00:25:03,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ef972a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:25:03, skipping insertion in model container [2020-07-18 00:25:03,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:25:02" (2/3) ... [2020-07-18 00:25:03,360 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23ef972a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:25:03, skipping insertion in model container [2020-07-18 00:25:03,360 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:25:03" (3/3) ... [2020-07-18 00:25:03,363 INFO L109 eAbstractionObserver]: Analyzing ICFG quick_sort_split.i [2020-07-18 00:25:03,374 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:25:03,384 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-07-18 00:25:03,397 INFO L251 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-07-18 00:25:03,419 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:25:03,419 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:25:03,419 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:25:03,420 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:25:03,420 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:25:03,420 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:25:03,420 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:25:03,420 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:25:03,436 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states. [2020-07-18 00:25:03,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-18 00:25:03,449 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:25:03,450 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:25:03,450 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:25:03,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:25:03,457 INFO L82 PathProgramCache]: Analyzing trace with hash 958208796, now seen corresponding path program 1 times [2020-07-18 00:25:03,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:25:03,467 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [776400419] [2020-07-18 00:25:03,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:25:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:25:03,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:25:03,772 INFO L280 TraceCheckUtils]: 0: Hoare triple {103#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {86#true} is VALID [2020-07-18 00:25:03,773 INFO L280 TraceCheckUtils]: 1: Hoare triple {86#true} #valid := #valid[0 := 0]; {86#true} is VALID [2020-07-18 00:25:03,774 INFO L280 TraceCheckUtils]: 2: Hoare triple {86#true} assume 0 < #StackHeapBarrier; {86#true} is VALID [2020-07-18 00:25:03,776 INFO L280 TraceCheckUtils]: 3: Hoare triple {86#true} assume true; {86#true} is VALID [2020-07-18 00:25:03,776 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {86#true} {86#true} #155#return; {86#true} is VALID [2020-07-18 00:25:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:25:03,854 INFO L280 TraceCheckUtils]: 0: Hoare triple {104#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} SUMMARY for call ~#list~0.base, ~#list~0.offset := #Ultimate.allocOnStack(4); srcloc: create_listENTRY {86#true} is VALID [2020-07-18 00:25:03,855 INFO L280 TraceCheckUtils]: 1: Hoare triple {86#true} SUMMARY for call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); srcloc: L570 {86#true} is VALID [2020-07-18 00:25:03,856 INFO L280 TraceCheckUtils]: 2: Hoare triple {86#true} assume !true; {87#false} is VALID [2020-07-18 00:25:03,857 INFO L280 TraceCheckUtils]: 3: Hoare triple {87#false} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset, 4); srcloc: L571-4 {87#false} is VALID [2020-07-18 00:25:03,857 INFO L280 TraceCheckUtils]: 4: Hoare triple {87#false} #res.base, #res.offset := #t~mem6.base, #t~mem6.offset; {87#false} is VALID [2020-07-18 00:25:03,858 INFO L280 TraceCheckUtils]: 5: Hoare triple {87#false} havoc #t~mem6.base, #t~mem6.offset; {87#false} is VALID [2020-07-18 00:25:03,858 INFO L280 TraceCheckUtils]: 6: Hoare triple {87#false} SUMMARY for call ULTIMATE.dealloc(~#list~0.base, ~#list~0.offset); srcloc: L570-2 {87#false} is VALID [2020-07-18 00:25:03,858 INFO L280 TraceCheckUtils]: 7: Hoare triple {87#false} havoc ~#list~0.base, ~#list~0.offset; {87#false} is VALID [2020-07-18 00:25:03,859 INFO L280 TraceCheckUtils]: 8: Hoare triple {87#false} assume true; {87#false} is VALID [2020-07-18 00:25:03,859 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {87#false} {86#true} #149#return; {87#false} is VALID [2020-07-18 00:25:03,861 INFO L263 TraceCheckUtils]: 0: Hoare triple {86#true} call ULTIMATE.init(); {103#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:25:03,862 INFO L280 TraceCheckUtils]: 1: Hoare triple {103#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {86#true} is VALID [2020-07-18 00:25:03,862 INFO L280 TraceCheckUtils]: 2: Hoare triple {86#true} #valid := #valid[0 := 0]; {86#true} is VALID [2020-07-18 00:25:03,863 INFO L280 TraceCheckUtils]: 3: Hoare triple {86#true} assume 0 < #StackHeapBarrier; {86#true} is VALID [2020-07-18 00:25:03,863 INFO L280 TraceCheckUtils]: 4: Hoare triple {86#true} assume true; {86#true} is VALID [2020-07-18 00:25:03,863 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {86#true} {86#true} #155#return; {86#true} is VALID [2020-07-18 00:25:03,864 INFO L263 TraceCheckUtils]: 6: Hoare triple {86#true} call #t~ret15 := main(); {86#true} is VALID [2020-07-18 00:25:03,868 INFO L263 TraceCheckUtils]: 7: Hoare triple {86#true} call #t~ret7.base, #t~ret7.offset := create_list(); {104#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-18 00:25:03,869 INFO L280 TraceCheckUtils]: 8: Hoare triple {104#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} SUMMARY for call ~#list~0.base, ~#list~0.offset := #Ultimate.allocOnStack(4); srcloc: create_listENTRY {86#true} is VALID [2020-07-18 00:25:03,869 INFO L280 TraceCheckUtils]: 9: Hoare triple {86#true} SUMMARY for call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); srcloc: L570 {86#true} is VALID [2020-07-18 00:25:03,871 INFO L280 TraceCheckUtils]: 10: Hoare triple {86#true} assume !true; {87#false} is VALID [2020-07-18 00:25:03,871 INFO L280 TraceCheckUtils]: 11: Hoare triple {87#false} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset, 4); srcloc: L571-4 {87#false} is VALID [2020-07-18 00:25:03,871 INFO L280 TraceCheckUtils]: 12: Hoare triple {87#false} #res.base, #res.offset := #t~mem6.base, #t~mem6.offset; {87#false} is VALID [2020-07-18 00:25:03,872 INFO L280 TraceCheckUtils]: 13: Hoare triple {87#false} havoc #t~mem6.base, #t~mem6.offset; {87#false} is VALID [2020-07-18 00:25:03,872 INFO L280 TraceCheckUtils]: 14: Hoare triple {87#false} SUMMARY for call ULTIMATE.dealloc(~#list~0.base, ~#list~0.offset); srcloc: L570-2 {87#false} is VALID [2020-07-18 00:25:03,872 INFO L280 TraceCheckUtils]: 15: Hoare triple {87#false} havoc ~#list~0.base, ~#list~0.offset; {87#false} is VALID [2020-07-18 00:25:03,873 INFO L280 TraceCheckUtils]: 16: Hoare triple {87#false} assume true; {87#false} is VALID [2020-07-18 00:25:03,873 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {87#false} {86#true} #149#return; {87#false} is VALID [2020-07-18 00:25:03,875 INFO L280 TraceCheckUtils]: 18: Hoare triple {87#false} ~list~1.base, ~list~1.offset := #t~ret7.base, #t~ret7.offset; {87#false} is VALID [2020-07-18 00:25:03,875 INFO L280 TraceCheckUtils]: 19: Hoare triple {87#false} havoc #t~ret7.base, #t~ret7.offset; {87#false} is VALID [2020-07-18 00:25:03,876 INFO L280 TraceCheckUtils]: 20: Hoare triple {87#false} ~low~0.base, ~low~0.offset := 0, 0; {87#false} is VALID [2020-07-18 00:25:03,876 INFO L280 TraceCheckUtils]: 21: Hoare triple {87#false} ~high~0.base, ~high~0.offset := 0, 0; {87#false} is VALID [2020-07-18 00:25:03,876 INFO L280 TraceCheckUtils]: 22: Hoare triple {87#false} ~p~0.base, ~p~0.offset := ~list~1.base, ~list~1.offset; {87#false} is VALID [2020-07-18 00:25:03,877 INFO L280 TraceCheckUtils]: 23: Hoare triple {87#false} assume !(~p~0.base != 0 || ~p~0.offset != 0); {87#false} is VALID [2020-07-18 00:25:03,877 INFO L280 TraceCheckUtils]: 24: Hoare triple {87#false} assume !!(~low~0.base != 0 || ~low~0.offset != 0); {87#false} is VALID [2020-07-18 00:25:03,878 INFO L280 TraceCheckUtils]: 25: Hoare triple {87#false} SUMMARY for call #t~mem11 := read~int(~low~0.base, ~low~0.offset, 4); srcloc: L593 {87#false} is VALID [2020-07-18 00:25:03,878 INFO L280 TraceCheckUtils]: 26: Hoare triple {87#false} assume !(-1 == #t~mem11); {87#false} is VALID [2020-07-18 00:25:03,879 INFO L280 TraceCheckUtils]: 27: Hoare triple {87#false} havoc #t~mem11; {87#false} is VALID [2020-07-18 00:25:03,880 INFO L280 TraceCheckUtils]: 28: Hoare triple {87#false} assume !false; {87#false} is VALID [2020-07-18 00:25:03,888 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-18 00:25:03,892 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:25:03,895 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [776400419] [2020-07-18 00:25:03,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:25:03,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:25:03,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823714864] [2020-07-18 00:25:03,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-07-18 00:25:03,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:25:03,923 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:25:03,978 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:25:03,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:25:03,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:25:03,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:25:03,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:25:03,991 INFO L87 Difference]: Start difference. First operand 83 states. Second operand 4 states. [2020-07-18 00:25:04,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:25:04,635 INFO L93 Difference]: Finished difference Result 133 states and 153 transitions. [2020-07-18 00:25:04,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 00:25:04,636 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2020-07-18 00:25:04,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:25:04,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:25:04,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2020-07-18 00:25:04,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:25:04,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 153 transitions. [2020-07-18 00:25:04,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 153 transitions. [2020-07-18 00:25:04,922 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:25:04,953 INFO L225 Difference]: With dead ends: 133 [2020-07-18 00:25:04,953 INFO L226 Difference]: Without dead ends: 79 [2020-07-18 00:25:04,960 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:25:04,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2020-07-18 00:25:05,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2020-07-18 00:25:05,076 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:25:05,077 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 79 states. [2020-07-18 00:25:05,077 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2020-07-18 00:25:05,078 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2020-07-18 00:25:05,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:25:05,087 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2020-07-18 00:25:05,087 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2020-07-18 00:25:05,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:25:05,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:25:05,089 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 79 states. [2020-07-18 00:25:05,089 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 79 states. [2020-07-18 00:25:05,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:25:05,097 INFO L93 Difference]: Finished difference Result 79 states and 85 transitions. [2020-07-18 00:25:05,097 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2020-07-18 00:25:05,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:25:05,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:25:05,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:25:05,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:25:05,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2020-07-18 00:25:05,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 85 transitions. [2020-07-18 00:25:05,107 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 85 transitions. Word has length 29 [2020-07-18 00:25:05,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:25:05,107 INFO L479 AbstractCegarLoop]: Abstraction has 79 states and 85 transitions. [2020-07-18 00:25:05,107 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:25:05,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 79 states and 85 transitions. [2020-07-18 00:25:05,216 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:25:05,216 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 85 transitions. [2020-07-18 00:25:05,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-18 00:25:05,218 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:25:05,218 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:25:05,219 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:25:05,219 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:25:05,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:25:05,220 INFO L82 PathProgramCache]: Analyzing trace with hash 1823620041, now seen corresponding path program 1 times [2020-07-18 00:25:05,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:25:05,221 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [512638694] [2020-07-18 00:25:05,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:25:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:25:05,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:25:05,354 INFO L280 TraceCheckUtils]: 0: Hoare triple {712#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {692#true} is VALID [2020-07-18 00:25:05,354 INFO L280 TraceCheckUtils]: 1: Hoare triple {692#true} #valid := #valid[0 := 0]; {692#true} is VALID [2020-07-18 00:25:05,354 INFO L280 TraceCheckUtils]: 2: Hoare triple {692#true} assume 0 < #StackHeapBarrier; {692#true} is VALID [2020-07-18 00:25:05,355 INFO L280 TraceCheckUtils]: 3: Hoare triple {692#true} assume true; {692#true} is VALID [2020-07-18 00:25:05,355 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {692#true} {692#true} #155#return; {692#true} is VALID [2020-07-18 00:25:05,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:25:05,392 INFO L280 TraceCheckUtils]: 0: Hoare triple {713#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} SUMMARY for call ~#list~0.base, ~#list~0.offset := #Ultimate.allocOnStack(4); srcloc: create_listENTRY {692#true} is VALID [2020-07-18 00:25:05,392 INFO L280 TraceCheckUtils]: 1: Hoare triple {692#true} SUMMARY for call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); srcloc: L570 {692#true} is VALID [2020-07-18 00:25:05,393 INFO L280 TraceCheckUtils]: 2: Hoare triple {692#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {692#true} is VALID [2020-07-18 00:25:05,393 INFO L280 TraceCheckUtils]: 3: Hoare triple {692#true} assume !(0 != #t~nondet4); {692#true} is VALID [2020-07-18 00:25:05,393 INFO L280 TraceCheckUtils]: 4: Hoare triple {692#true} havoc #t~nondet4; {692#true} is VALID [2020-07-18 00:25:05,394 INFO L280 TraceCheckUtils]: 5: Hoare triple {692#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset, 4); srcloc: L571-4 {692#true} is VALID [2020-07-18 00:25:05,394 INFO L280 TraceCheckUtils]: 6: Hoare triple {692#true} #res.base, #res.offset := #t~mem6.base, #t~mem6.offset; {692#true} is VALID [2020-07-18 00:25:05,394 INFO L280 TraceCheckUtils]: 7: Hoare triple {692#true} havoc #t~mem6.base, #t~mem6.offset; {692#true} is VALID [2020-07-18 00:25:05,395 INFO L280 TraceCheckUtils]: 8: Hoare triple {692#true} SUMMARY for call ULTIMATE.dealloc(~#list~0.base, ~#list~0.offset); srcloc: L570-2 {692#true} is VALID [2020-07-18 00:25:05,395 INFO L280 TraceCheckUtils]: 9: Hoare triple {692#true} havoc ~#list~0.base, ~#list~0.offset; {692#true} is VALID [2020-07-18 00:25:05,395 INFO L280 TraceCheckUtils]: 10: Hoare triple {692#true} assume true; {692#true} is VALID [2020-07-18 00:25:05,396 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {692#true} {692#true} #149#return; {692#true} is VALID [2020-07-18 00:25:05,397 INFO L263 TraceCheckUtils]: 0: Hoare triple {692#true} call ULTIMATE.init(); {712#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:25:05,397 INFO L280 TraceCheckUtils]: 1: Hoare triple {712#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {692#true} is VALID [2020-07-18 00:25:05,398 INFO L280 TraceCheckUtils]: 2: Hoare triple {692#true} #valid := #valid[0 := 0]; {692#true} is VALID [2020-07-18 00:25:05,398 INFO L280 TraceCheckUtils]: 3: Hoare triple {692#true} assume 0 < #StackHeapBarrier; {692#true} is VALID [2020-07-18 00:25:05,398 INFO L280 TraceCheckUtils]: 4: Hoare triple {692#true} assume true; {692#true} is VALID [2020-07-18 00:25:05,399 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {692#true} {692#true} #155#return; {692#true} is VALID [2020-07-18 00:25:05,399 INFO L263 TraceCheckUtils]: 6: Hoare triple {692#true} call #t~ret15 := main(); {692#true} is VALID [2020-07-18 00:25:05,400 INFO L263 TraceCheckUtils]: 7: Hoare triple {692#true} call #t~ret7.base, #t~ret7.offset := create_list(); {713#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-18 00:25:05,401 INFO L280 TraceCheckUtils]: 8: Hoare triple {713#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} SUMMARY for call ~#list~0.base, ~#list~0.offset := #Ultimate.allocOnStack(4); srcloc: create_listENTRY {692#true} is VALID [2020-07-18 00:25:05,401 INFO L280 TraceCheckUtils]: 9: Hoare triple {692#true} SUMMARY for call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); srcloc: L570 {692#true} is VALID [2020-07-18 00:25:05,401 INFO L280 TraceCheckUtils]: 10: Hoare triple {692#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {692#true} is VALID [2020-07-18 00:25:05,402 INFO L280 TraceCheckUtils]: 11: Hoare triple {692#true} assume !(0 != #t~nondet4); {692#true} is VALID [2020-07-18 00:25:05,402 INFO L280 TraceCheckUtils]: 12: Hoare triple {692#true} havoc #t~nondet4; {692#true} is VALID [2020-07-18 00:25:05,402 INFO L280 TraceCheckUtils]: 13: Hoare triple {692#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset, 4); srcloc: L571-4 {692#true} is VALID [2020-07-18 00:25:05,403 INFO L280 TraceCheckUtils]: 14: Hoare triple {692#true} #res.base, #res.offset := #t~mem6.base, #t~mem6.offset; {692#true} is VALID [2020-07-18 00:25:05,403 INFO L280 TraceCheckUtils]: 15: Hoare triple {692#true} havoc #t~mem6.base, #t~mem6.offset; {692#true} is VALID [2020-07-18 00:25:05,403 INFO L280 TraceCheckUtils]: 16: Hoare triple {692#true} SUMMARY for call ULTIMATE.dealloc(~#list~0.base, ~#list~0.offset); srcloc: L570-2 {692#true} is VALID [2020-07-18 00:25:05,404 INFO L280 TraceCheckUtils]: 17: Hoare triple {692#true} havoc ~#list~0.base, ~#list~0.offset; {692#true} is VALID [2020-07-18 00:25:05,404 INFO L280 TraceCheckUtils]: 18: Hoare triple {692#true} assume true; {692#true} is VALID [2020-07-18 00:25:05,404 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {692#true} {692#true} #149#return; {692#true} is VALID [2020-07-18 00:25:05,405 INFO L280 TraceCheckUtils]: 20: Hoare triple {692#true} ~list~1.base, ~list~1.offset := #t~ret7.base, #t~ret7.offset; {692#true} is VALID [2020-07-18 00:25:05,405 INFO L280 TraceCheckUtils]: 21: Hoare triple {692#true} havoc #t~ret7.base, #t~ret7.offset; {692#true} is VALID [2020-07-18 00:25:05,406 INFO L280 TraceCheckUtils]: 22: Hoare triple {692#true} ~low~0.base, ~low~0.offset := 0, 0; {711#(and (= 0 main_~low~0.offset) (= 0 main_~low~0.base))} is VALID [2020-07-18 00:25:05,407 INFO L280 TraceCheckUtils]: 23: Hoare triple {711#(and (= 0 main_~low~0.offset) (= 0 main_~low~0.base))} ~high~0.base, ~high~0.offset := 0, 0; {711#(and (= 0 main_~low~0.offset) (= 0 main_~low~0.base))} is VALID [2020-07-18 00:25:05,408 INFO L280 TraceCheckUtils]: 24: Hoare triple {711#(and (= 0 main_~low~0.offset) (= 0 main_~low~0.base))} ~p~0.base, ~p~0.offset := ~list~1.base, ~list~1.offset; {711#(and (= 0 main_~low~0.offset) (= 0 main_~low~0.base))} is VALID [2020-07-18 00:25:05,409 INFO L280 TraceCheckUtils]: 25: Hoare triple {711#(and (= 0 main_~low~0.offset) (= 0 main_~low~0.base))} assume !(~p~0.base != 0 || ~p~0.offset != 0); {711#(and (= 0 main_~low~0.offset) (= 0 main_~low~0.base))} is VALID [2020-07-18 00:25:05,410 INFO L280 TraceCheckUtils]: 26: Hoare triple {711#(and (= 0 main_~low~0.offset) (= 0 main_~low~0.base))} assume !!(~low~0.base != 0 || ~low~0.offset != 0); {693#false} is VALID [2020-07-18 00:25:05,410 INFO L280 TraceCheckUtils]: 27: Hoare triple {693#false} SUMMARY for call #t~mem11 := read~int(~low~0.base, ~low~0.offset, 4); srcloc: L593 {693#false} is VALID [2020-07-18 00:25:05,411 INFO L280 TraceCheckUtils]: 28: Hoare triple {693#false} assume !(-1 == #t~mem11); {693#false} is VALID [2020-07-18 00:25:05,411 INFO L280 TraceCheckUtils]: 29: Hoare triple {693#false} havoc #t~mem11; {693#false} is VALID [2020-07-18 00:25:05,411 INFO L280 TraceCheckUtils]: 30: Hoare triple {693#false} assume !false; {693#false} is VALID [2020-07-18 00:25:05,413 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-18 00:25:05,417 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:25:05,418 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [512638694] [2020-07-18 00:25:05,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:25:05,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:25:05,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124197622] [2020-07-18 00:25:05,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2020-07-18 00:25:05,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:25:05,420 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:25:05,454 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:25:05,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:25:05,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:25:05,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:25:05,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:25:05,456 INFO L87 Difference]: Start difference. First operand 79 states and 85 transitions. Second operand 5 states. [2020-07-18 00:25:06,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:25:06,045 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2020-07-18 00:25:06,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 00:25:06,046 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2020-07-18 00:25:06,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:25:06,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:25:06,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2020-07-18 00:25:06,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:25:06,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 97 transitions. [2020-07-18 00:25:06,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 97 transitions. [2020-07-18 00:25:06,179 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:25:06,183 INFO L225 Difference]: With dead ends: 90 [2020-07-18 00:25:06,183 INFO L226 Difference]: Without dead ends: 70 [2020-07-18 00:25:06,185 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:25:06,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-07-18 00:25:06,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-07-18 00:25:06,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:25:06,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand 70 states. [2020-07-18 00:25:06,264 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2020-07-18 00:25:06,265 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2020-07-18 00:25:06,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:25:06,271 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2020-07-18 00:25:06,271 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2020-07-18 00:25:06,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:25:06,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:25:06,273 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 70 states. [2020-07-18 00:25:06,273 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 70 states. [2020-07-18 00:25:06,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:25:06,278 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2020-07-18 00:25:06,278 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2020-07-18 00:25:06,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:25:06,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:25:06,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:25:06,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:25:06,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-07-18 00:25:06,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2020-07-18 00:25:06,284 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 31 [2020-07-18 00:25:06,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:25:06,284 INFO L479 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2020-07-18 00:25:06,284 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:25:06,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 70 states and 75 transitions. [2020-07-18 00:25:06,374 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:25:06,375 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2020-07-18 00:25:06,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-18 00:25:06,377 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:25:06,377 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:25:06,377 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:25:06,377 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:25:06,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:25:06,378 INFO L82 PathProgramCache]: Analyzing trace with hash 663231917, now seen corresponding path program 1 times [2020-07-18 00:25:06,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:25:06,378 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1977310304] [2020-07-18 00:25:06,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:25:06,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:25:06,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:25:06,458 INFO L280 TraceCheckUtils]: 0: Hoare triple {1199#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1179#true} is VALID [2020-07-18 00:25:06,459 INFO L280 TraceCheckUtils]: 1: Hoare triple {1179#true} #valid := #valid[0 := 0]; {1179#true} is VALID [2020-07-18 00:25:06,459 INFO L280 TraceCheckUtils]: 2: Hoare triple {1179#true} assume 0 < #StackHeapBarrier; {1179#true} is VALID [2020-07-18 00:25:06,459 INFO L280 TraceCheckUtils]: 3: Hoare triple {1179#true} assume true; {1179#true} is VALID [2020-07-18 00:25:06,460 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1179#true} {1179#true} #155#return; {1179#true} is VALID [2020-07-18 00:25:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:25:06,496 INFO L280 TraceCheckUtils]: 0: Hoare triple {1200#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} SUMMARY for call ~#list~0.base, ~#list~0.offset := #Ultimate.allocOnStack(4); srcloc: create_listENTRY {1179#true} is VALID [2020-07-18 00:25:06,497 INFO L280 TraceCheckUtils]: 1: Hoare triple {1179#true} SUMMARY for call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); srcloc: L570 {1179#true} is VALID [2020-07-18 00:25:06,497 INFO L280 TraceCheckUtils]: 2: Hoare triple {1179#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1179#true} is VALID [2020-07-18 00:25:06,498 INFO L280 TraceCheckUtils]: 3: Hoare triple {1179#true} assume !(0 != #t~nondet4); {1179#true} is VALID [2020-07-18 00:25:06,498 INFO L280 TraceCheckUtils]: 4: Hoare triple {1179#true} havoc #t~nondet4; {1179#true} is VALID [2020-07-18 00:25:06,498 INFO L280 TraceCheckUtils]: 5: Hoare triple {1179#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset, 4); srcloc: L571-4 {1179#true} is VALID [2020-07-18 00:25:06,499 INFO L280 TraceCheckUtils]: 6: Hoare triple {1179#true} #res.base, #res.offset := #t~mem6.base, #t~mem6.offset; {1179#true} is VALID [2020-07-18 00:25:06,499 INFO L280 TraceCheckUtils]: 7: Hoare triple {1179#true} havoc #t~mem6.base, #t~mem6.offset; {1179#true} is VALID [2020-07-18 00:25:06,499 INFO L280 TraceCheckUtils]: 8: Hoare triple {1179#true} SUMMARY for call ULTIMATE.dealloc(~#list~0.base, ~#list~0.offset); srcloc: L570-2 {1179#true} is VALID [2020-07-18 00:25:06,500 INFO L280 TraceCheckUtils]: 9: Hoare triple {1179#true} havoc ~#list~0.base, ~#list~0.offset; {1179#true} is VALID [2020-07-18 00:25:06,500 INFO L280 TraceCheckUtils]: 10: Hoare triple {1179#true} assume true; {1179#true} is VALID [2020-07-18 00:25:06,500 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1179#true} {1179#true} #149#return; {1179#true} is VALID [2020-07-18 00:25:06,501 INFO L263 TraceCheckUtils]: 0: Hoare triple {1179#true} call ULTIMATE.init(); {1199#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:25:06,502 INFO L280 TraceCheckUtils]: 1: Hoare triple {1199#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1179#true} is VALID [2020-07-18 00:25:06,502 INFO L280 TraceCheckUtils]: 2: Hoare triple {1179#true} #valid := #valid[0 := 0]; {1179#true} is VALID [2020-07-18 00:25:06,502 INFO L280 TraceCheckUtils]: 3: Hoare triple {1179#true} assume 0 < #StackHeapBarrier; {1179#true} is VALID [2020-07-18 00:25:06,503 INFO L280 TraceCheckUtils]: 4: Hoare triple {1179#true} assume true; {1179#true} is VALID [2020-07-18 00:25:06,503 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1179#true} {1179#true} #155#return; {1179#true} is VALID [2020-07-18 00:25:06,503 INFO L263 TraceCheckUtils]: 6: Hoare triple {1179#true} call #t~ret15 := main(); {1179#true} is VALID [2020-07-18 00:25:06,504 INFO L263 TraceCheckUtils]: 7: Hoare triple {1179#true} call #t~ret7.base, #t~ret7.offset := create_list(); {1200#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-18 00:25:06,504 INFO L280 TraceCheckUtils]: 8: Hoare triple {1200#(and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} SUMMARY for call ~#list~0.base, ~#list~0.offset := #Ultimate.allocOnStack(4); srcloc: create_listENTRY {1179#true} is VALID [2020-07-18 00:25:06,505 INFO L280 TraceCheckUtils]: 9: Hoare triple {1179#true} SUMMARY for call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4); srcloc: L570 {1179#true} is VALID [2020-07-18 00:25:06,505 INFO L280 TraceCheckUtils]: 10: Hoare triple {1179#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647; {1179#true} is VALID [2020-07-18 00:25:06,505 INFO L280 TraceCheckUtils]: 11: Hoare triple {1179#true} assume !(0 != #t~nondet4); {1179#true} is VALID [2020-07-18 00:25:06,505 INFO L280 TraceCheckUtils]: 12: Hoare triple {1179#true} havoc #t~nondet4; {1179#true} is VALID [2020-07-18 00:25:06,506 INFO L280 TraceCheckUtils]: 13: Hoare triple {1179#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset, 4); srcloc: L571-4 {1179#true} is VALID [2020-07-18 00:25:06,506 INFO L280 TraceCheckUtils]: 14: Hoare triple {1179#true} #res.base, #res.offset := #t~mem6.base, #t~mem6.offset; {1179#true} is VALID [2020-07-18 00:25:06,506 INFO L280 TraceCheckUtils]: 15: Hoare triple {1179#true} havoc #t~mem6.base, #t~mem6.offset; {1179#true} is VALID [2020-07-18 00:25:06,507 INFO L280 TraceCheckUtils]: 16: Hoare triple {1179#true} SUMMARY for call ULTIMATE.dealloc(~#list~0.base, ~#list~0.offset); srcloc: L570-2 {1179#true} is VALID [2020-07-18 00:25:06,507 INFO L280 TraceCheckUtils]: 17: Hoare triple {1179#true} havoc ~#list~0.base, ~#list~0.offset; {1179#true} is VALID [2020-07-18 00:25:06,507 INFO L280 TraceCheckUtils]: 18: Hoare triple {1179#true} assume true; {1179#true} is VALID [2020-07-18 00:25:06,507 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {1179#true} {1179#true} #149#return; {1179#true} is VALID [2020-07-18 00:25:06,508 INFO L280 TraceCheckUtils]: 20: Hoare triple {1179#true} ~list~1.base, ~list~1.offset := #t~ret7.base, #t~ret7.offset; {1179#true} is VALID [2020-07-18 00:25:06,508 INFO L280 TraceCheckUtils]: 21: Hoare triple {1179#true} havoc #t~ret7.base, #t~ret7.offset; {1179#true} is VALID [2020-07-18 00:25:06,508 INFO L280 TraceCheckUtils]: 22: Hoare triple {1179#true} ~low~0.base, ~low~0.offset := 0, 0; {1179#true} is VALID [2020-07-18 00:25:06,509 INFO L280 TraceCheckUtils]: 23: Hoare triple {1179#true} ~high~0.base, ~high~0.offset := 0, 0; {1198#(and (= 0 main_~high~0.offset) (= 0 main_~high~0.base))} is VALID [2020-07-18 00:25:06,510 INFO L280 TraceCheckUtils]: 24: Hoare triple {1198#(and (= 0 main_~high~0.offset) (= 0 main_~high~0.base))} ~p~0.base, ~p~0.offset := ~list~1.base, ~list~1.offset; {1198#(and (= 0 main_~high~0.offset) (= 0 main_~high~0.base))} is VALID [2020-07-18 00:25:06,511 INFO L280 TraceCheckUtils]: 25: Hoare triple {1198#(and (= 0 main_~high~0.offset) (= 0 main_~high~0.base))} assume !(~p~0.base != 0 || ~p~0.offset != 0); {1198#(and (= 0 main_~high~0.offset) (= 0 main_~high~0.base))} is VALID [2020-07-18 00:25:06,512 INFO L280 TraceCheckUtils]: 26: Hoare triple {1198#(and (= 0 main_~high~0.offset) (= 0 main_~high~0.base))} assume !(~low~0.base != 0 || ~low~0.offset != 0); {1198#(and (= 0 main_~high~0.offset) (= 0 main_~high~0.base))} is VALID [2020-07-18 00:25:06,513 INFO L280 TraceCheckUtils]: 27: Hoare triple {1198#(and (= 0 main_~high~0.offset) (= 0 main_~high~0.base))} assume !!(~high~0.base != 0 || ~high~0.offset != 0); {1180#false} is VALID [2020-07-18 00:25:06,514 INFO L280 TraceCheckUtils]: 28: Hoare triple {1180#false} SUMMARY for call #t~mem13 := read~int(~high~0.base, ~high~0.offset, 4); srcloc: L598 {1180#false} is VALID [2020-07-18 00:25:06,514 INFO L280 TraceCheckUtils]: 29: Hoare triple {1180#false} assume !(1 == #t~mem13); {1180#false} is VALID [2020-07-18 00:25:06,514 INFO L280 TraceCheckUtils]: 30: Hoare triple {1180#false} havoc #t~mem13; {1180#false} is VALID [2020-07-18 00:25:06,514 INFO L280 TraceCheckUtils]: 31: Hoare triple {1180#false} assume !false; {1180#false} is VALID [2020-07-18 00:25:06,516 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-18 00:25:06,538 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:25:06,539 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1977310304] [2020-07-18 00:25:06,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:25:06,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:25:06,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47767746] [2020-07-18 00:25:06,540 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2020-07-18 00:25:06,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:25:06,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:25:06,577 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:25:06,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:25:06,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:25:06,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:25:06,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:25:06,580 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand 5 states. [2020-07-18 00:25:07,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:25:07,125 INFO L93 Difference]: Finished difference Result 71 states and 76 transitions. [2020-07-18 00:25:07,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 00:25:07,125 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2020-07-18 00:25:07,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:25:07,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:25:07,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2020-07-18 00:25:07,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:25:07,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2020-07-18 00:25:07,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 76 transitions. [2020-07-18 00:25:07,222 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:25:07,223 INFO L225 Difference]: With dead ends: 71 [2020-07-18 00:25:07,223 INFO L226 Difference]: Without dead ends: 0 [2020-07-18 00:25:07,224 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:25:07,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-18 00:25:07,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-18 00:25:07,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:25:07,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-18 00:25:07,225 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:25:07,225 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:25:07,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:25:07,226 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:25:07,226 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:25:07,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:25:07,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:25:07,226 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-18 00:25:07,226 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-18 00:25:07,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:25:07,226 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-18 00:25:07,226 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:25:07,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:25:07,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:25:07,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:25:07,227 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:25:07,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-18 00:25:07,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-18 00:25:07,227 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 32 [2020-07-18 00:25:07,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:25:07,228 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-18 00:25:07,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:25:07,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-18 00:25:07,228 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:25:07,228 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-18 00:25:07,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:25:07,228 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:25:07,230 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-18 00:25:07,831 INFO L271 CegarLoopResult]: At program point L578-1(line 578) the Hoare annotation is: true [2020-07-18 00:25:07,832 INFO L271 CegarLoopResult]: At program point L576(line 576) the Hoare annotation is: true [2020-07-18 00:25:07,832 INFO L271 CegarLoopResult]: At program point L576-1(lines 570 577) the Hoare annotation is: true [2020-07-18 00:25:07,832 INFO L271 CegarLoopResult]: At program point L574(line 574) the Hoare annotation is: true [2020-07-18 00:25:07,832 INFO L271 CegarLoopResult]: At program point L572(line 572) the Hoare annotation is: true [2020-07-18 00:25:07,832 INFO L271 CegarLoopResult]: At program point L572-1(line 572) the Hoare annotation is: true [2020-07-18 00:25:07,832 INFO L271 CegarLoopResult]: At program point L570(line 570) the Hoare annotation is: true [2020-07-18 00:25:07,833 INFO L271 CegarLoopResult]: At program point L572-2(line 572) the Hoare annotation is: true [2020-07-18 00:25:07,833 INFO L271 CegarLoopResult]: At program point L570-2(line 570) the Hoare annotation is: true [2020-07-18 00:25:07,833 INFO L271 CegarLoopResult]: At program point L570-3(line 570) the Hoare annotation is: true [2020-07-18 00:25:07,833 INFO L271 CegarLoopResult]: At program point create_listEXIT(lines 569 579) the Hoare annotation is: true [2020-07-18 00:25:07,833 INFO L271 CegarLoopResult]: At program point L573(lines 573 576) the Hoare annotation is: true [2020-07-18 00:25:07,834 INFO L271 CegarLoopResult]: At program point L571(lines 571 577) the Hoare annotation is: true [2020-07-18 00:25:07,834 INFO L271 CegarLoopResult]: At program point L571-1(line 571) the Hoare annotation is: true [2020-07-18 00:25:07,834 INFO L271 CegarLoopResult]: At program point L571-3(line 571) the Hoare annotation is: true [2020-07-18 00:25:07,834 INFO L271 CegarLoopResult]: At program point L571-4(lines 571 577) the Hoare annotation is: true [2020-07-18 00:25:07,834 INFO L264 CegarLoopResult]: At program point create_listENTRY(lines 569 579) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-18 00:25:07,834 INFO L271 CegarLoopResult]: At program point create_listFINAL(lines 569 579) the Hoare annotation is: true [2020-07-18 00:25:07,835 INFO L271 CegarLoopResult]: At program point L578(line 578) the Hoare annotation is: true [2020-07-18 00:25:07,835 INFO L264 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: (= |#valid| |old(#valid)|) [2020-07-18 00:25:07,835 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-07-18 00:25:07,835 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:25:07,835 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-18 00:25:07,835 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:25:07,835 INFO L268 CegarLoopResult]: For program point __bswap_32ENTRY(lines 64 68) no Hoare annotation was computed. [2020-07-18 00:25:07,836 INFO L268 CegarLoopResult]: For program point __bswap_32FINAL(lines 64 68) no Hoare annotation was computed. [2020-07-18 00:25:07,836 INFO L268 CegarLoopResult]: For program point __bswap_32EXIT(lines 64 68) no Hoare annotation was computed. [2020-07-18 00:25:07,836 INFO L268 CegarLoopResult]: For program point L67(line 67) no Hoare annotation was computed. [2020-07-18 00:25:07,836 INFO L268 CegarLoopResult]: For program point L67-1(line 67) no Hoare annotation was computed. [2020-07-18 00:25:07,836 INFO L268 CegarLoopResult]: For program point __bswap_64ENTRY(lines 69 73) no Hoare annotation was computed. [2020-07-18 00:25:07,836 INFO L268 CegarLoopResult]: For program point __bswap_64FINAL(lines 69 73) no Hoare annotation was computed. [2020-07-18 00:25:07,836 INFO L268 CegarLoopResult]: For program point L72(line 72) no Hoare annotation was computed. [2020-07-18 00:25:07,837 INFO L268 CegarLoopResult]: For program point L72-1(line 72) no Hoare annotation was computed. [2020-07-18 00:25:07,837 INFO L268 CegarLoopResult]: For program point __bswap_64EXIT(lines 69 73) no Hoare annotation was computed. [2020-07-18 00:25:07,837 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-18 00:25:07,837 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-18 00:25:07,837 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-18 00:25:07,837 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-18 00:25:07,837 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 580 602) the Hoare annotation is: true [2020-07-18 00:25:07,838 INFO L264 CegarLoopResult]: At program point L597-1(lines 580 602) the Hoare annotation is: (and (= 0 main_~high~0.offset) (= 0 main_~low~0.offset) (= 0 main_~high~0.base) (= 0 main_~low~0.base)) [2020-07-18 00:25:07,838 INFO L271 CegarLoopResult]: At program point L597-2(lines 580 602) the Hoare annotation is: true [2020-07-18 00:25:07,838 INFO L264 CegarLoopResult]: At program point L593(line 593) the Hoare annotation is: false [2020-07-18 00:25:07,838 INFO L264 CegarLoopResult]: At program point L593-1(lines 593 594) the Hoare annotation is: false [2020-07-18 00:25:07,838 INFO L264 CegarLoopResult]: At program point L593-2(line 593) the Hoare annotation is: false [2020-07-18 00:25:07,838 INFO L264 CegarLoopResult]: At program point L593-4(line 593) the Hoare annotation is: false [2020-07-18 00:25:07,839 INFO L264 CegarLoopResult]: At program point L593-5(lines 593 594) the Hoare annotation is: false [2020-07-18 00:25:07,839 INFO L264 CegarLoopResult]: At program point L585-2(lines 585 591) the Hoare annotation is: (and (= 0 main_~high~0.offset) (= 0 main_~low~0.offset) (= 0 main_~high~0.base) (= 0 main_~low~0.base)) [2020-07-18 00:25:07,839 INFO L271 CegarLoopResult]: At program point L581(line 581) the Hoare annotation is: true [2020-07-18 00:25:07,839 INFO L271 CegarLoopResult]: At program point L581-1(line 581) the Hoare annotation is: true [2020-07-18 00:25:07,839 INFO L264 CegarLoopResult]: At program point L598(line 598) the Hoare annotation is: false [2020-07-18 00:25:07,839 INFO L264 CegarLoopResult]: At program point L598-1(lines 598 599) the Hoare annotation is: false [2020-07-18 00:25:07,840 INFO L264 CegarLoopResult]: At program point L598-2(line 598) the Hoare annotation is: false [2020-07-18 00:25:07,840 INFO L264 CegarLoopResult]: At program point L594(line 594) the Hoare annotation is: false [2020-07-18 00:25:07,840 INFO L264 CegarLoopResult]: At program point L598-4(line 598) the Hoare annotation is: false [2020-07-18 00:25:07,840 INFO L264 CegarLoopResult]: At program point L598-5(lines 598 599) the Hoare annotation is: false [2020-07-18 00:25:07,840 INFO L264 CegarLoopResult]: At program point L590(line 590) the Hoare annotation is: (and (= 0 main_~high~0.offset) (= 0 main_~low~0.offset) (= 0 main_~high~0.base) (= 0 main_~low~0.base)) [2020-07-18 00:25:07,840 INFO L264 CegarLoopResult]: At program point L586(line 586) the Hoare annotation is: (and (= 0 main_~high~0.offset) (= 0 main_~low~0.offset) (= 0 main_~high~0.base) (= 0 main_~low~0.base)) [2020-07-18 00:25:07,841 INFO L264 CegarLoopResult]: At program point L586-1(line 586) the Hoare annotation is: (and (= 0 main_~high~0.offset) (= 0 main_~low~0.offset) (= 0 main_~high~0.base) (= 0 main_~low~0.base)) [2020-07-18 00:25:07,841 INFO L264 CegarLoopResult]: At program point L586-2(line 586) the Hoare annotation is: (and (= 0 main_~high~0.offset) (= 0 main_~low~0.offset) (= 0 main_~high~0.base) (= 0 main_~low~0.base)) [2020-07-18 00:25:07,841 INFO L271 CegarLoopResult]: At program point L582(line 582) the Hoare annotation is: true [2020-07-18 00:25:07,841 INFO L264 CegarLoopResult]: At program point L586-4(line 586) the Hoare annotation is: (and (= 0 main_~high~0.offset) (= 0 main_~low~0.offset) (= 0 main_~high~0.base) (= 0 main_~low~0.base)) [2020-07-18 00:25:07,841 INFO L264 CegarLoopResult]: At program point L586-5(line 586) the Hoare annotation is: (and (= 0 main_~high~0.offset) (= 0 main_~low~0.offset) (= 0 main_~high~0.base) (= 0 main_~low~0.base)) [2020-07-18 00:25:07,841 INFO L264 CegarLoopResult]: At program point L586-6(line 586) the Hoare annotation is: (and (= 0 main_~high~0.offset) (= 0 main_~low~0.offset) (= 0 main_~high~0.base) (= 0 main_~low~0.base)) [2020-07-18 00:25:07,842 INFO L264 CegarLoopResult]: At program point L586-7(line 586) the Hoare annotation is: (and (= 0 main_~high~0.offset) (= 0 main_~low~0.offset) (= 0 main_~high~0.base) (= 0 main_~low~0.base)) [2020-07-18 00:25:07,842 INFO L264 CegarLoopResult]: At program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 599) the Hoare annotation is: false [2020-07-18 00:25:07,842 INFO L264 CegarLoopResult]: At program point L599(line 599) the Hoare annotation is: false [2020-07-18 00:25:07,842 INFO L264 CegarLoopResult]: At program point L595(line 595) the Hoare annotation is: false [2020-07-18 00:25:07,842 INFO L264 CegarLoopResult]: At program point L595-1(line 595) the Hoare annotation is: false [2020-07-18 00:25:07,842 INFO L264 CegarLoopResult]: At program point L587(line 587) the Hoare annotation is: (and (= 0 main_~high~0.offset) (= 0 main_~low~0.offset) (= 0 main_~high~0.base) (= 0 main_~low~0.base)) [2020-07-18 00:25:07,843 INFO L264 CegarLoopResult]: At program point L587-1(line 587) the Hoare annotation is: (and (= 0 main_~high~0.offset) (= 0 main_~low~0.offset) (= 0 main_~high~0.base) (= 0 main_~low~0.base)) [2020-07-18 00:25:07,843 INFO L264 CegarLoopResult]: At program point L587-2(line 587) the Hoare annotation is: (and (= 0 main_~high~0.offset) (= 0 main_~low~0.offset) (= 0 main_~high~0.base) (= 0 main_~low~0.base)) [2020-07-18 00:25:07,843 INFO L264 CegarLoopResult]: At program point L583(line 583) the Hoare annotation is: (and (= 0 main_~low~0.offset) (= 0 main_~low~0.base)) [2020-07-18 00:25:07,843 INFO L264 CegarLoopResult]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 594) the Hoare annotation is: false [2020-07-18 00:25:07,843 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 580 602) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-18 00:25:07,844 INFO L264 CegarLoopResult]: At program point L600(line 600) the Hoare annotation is: false [2020-07-18 00:25:07,844 INFO L264 CegarLoopResult]: At program point L600-1(line 600) the Hoare annotation is: false [2020-07-18 00:25:07,844 INFO L264 CegarLoopResult]: At program point L592-1(lines 580 602) the Hoare annotation is: (and (= 0 main_~high~0.offset) (= 0 main_~low~0.offset) (= 0 main_~high~0.base) (= 0 main_~low~0.base)) [2020-07-18 00:25:07,844 INFO L264 CegarLoopResult]: At program point L588(line 588) the Hoare annotation is: (and (= 0 main_~high~0.offset) (= 0 main_~low~0.offset) (= 0 main_~high~0.base) (= 0 main_~low~0.base)) [2020-07-18 00:25:07,844 INFO L264 CegarLoopResult]: At program point L588-1(line 588) the Hoare annotation is: (and (= 0 main_~high~0.offset) (= 0 main_~low~0.offset) (= 0 main_~high~0.base) (= 0 main_~low~0.base)) [2020-07-18 00:25:07,844 INFO L264 CegarLoopResult]: At program point L584(line 584) the Hoare annotation is: (and (= 0 main_~high~0.offset) (= 0 main_~low~0.offset) (= 0 main_~high~0.base) (= 0 main_~low~0.base)) [2020-07-18 00:25:07,845 INFO L271 CegarLoopResult]: At program point append_to_listEXIT(lines 562 568) the Hoare annotation is: true [2020-07-18 00:25:07,845 INFO L271 CegarLoopResult]: At program point L566(line 566) the Hoare annotation is: true [2020-07-18 00:25:07,845 INFO L271 CegarLoopResult]: At program point L565(line 565) the Hoare annotation is: true [2020-07-18 00:25:07,845 INFO L264 CegarLoopResult]: At program point append_to_listENTRY(lines 562 568) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-18 00:25:07,845 INFO L271 CegarLoopResult]: At program point L564(line 564) the Hoare annotation is: true [2020-07-18 00:25:07,845 INFO L271 CegarLoopResult]: At program point L565-1(line 565) the Hoare annotation is: true [2020-07-18 00:25:07,846 INFO L264 CegarLoopResult]: At program point L563(line 563) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-18 00:25:07,846 INFO L271 CegarLoopResult]: At program point L564-1(line 564) the Hoare annotation is: true [2020-07-18 00:25:07,846 INFO L264 CegarLoopResult]: At program point L562(lines 562 568) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-18 00:25:07,846 INFO L271 CegarLoopResult]: At program point L563-1(line 563) the Hoare annotation is: true [2020-07-18 00:25:07,846 INFO L271 CegarLoopResult]: At program point L564-2(line 564) the Hoare annotation is: true [2020-07-18 00:25:07,846 INFO L264 CegarLoopResult]: At program point L562-1(lines 562 568) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-18 00:25:07,846 INFO L271 CegarLoopResult]: At program point append_to_listFINAL(lines 562 568) the Hoare annotation is: true [2020-07-18 00:25:07,852 WARN L170 areAnnotationChecker]: __bswap_32ENTRY has no Hoare annotation [2020-07-18 00:25:07,853 WARN L170 areAnnotationChecker]: __bswap_64ENTRY has no Hoare annotation [2020-07-18 00:25:07,855 WARN L170 areAnnotationChecker]: L67 has no Hoare annotation [2020-07-18 00:25:07,856 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2020-07-18 00:25:07,857 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2020-07-18 00:25:07,857 WARN L170 areAnnotationChecker]: L72-1 has no Hoare annotation [2020-07-18 00:25:07,858 WARN L170 areAnnotationChecker]: __bswap_32FINAL has no Hoare annotation [2020-07-18 00:25:07,858 WARN L170 areAnnotationChecker]: __bswap_64FINAL has no Hoare annotation [2020-07-18 00:25:07,876 INFO L163 areAnnotationChecker]: CFG has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-18 00:25:07,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.07 12:25:07 BoogieIcfgContainer [2020-07-18 00:25:07,892 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-18 00:25:07,896 INFO L168 Benchmark]: Toolchain (without parser) took 6201.46 ms. Allocated memory was 143.1 MB in the beginning and 293.6 MB in the end (delta: 150.5 MB). Free memory was 100.4 MB in the beginning and 117.3 MB in the end (delta: -16.9 MB). Peak memory consumption was 133.6 MB. Max. memory is 7.1 GB. [2020-07-18 00:25:07,897 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 143.1 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-18 00:25:07,898 INFO L168 Benchmark]: CACSL2BoogieTranslator took 723.93 ms. Allocated memory was 143.1 MB in the beginning and 200.8 MB in the end (delta: 57.7 MB). Free memory was 100.0 MB in the beginning and 166.1 MB in the end (delta: -66.2 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2020-07-18 00:25:07,899 INFO L168 Benchmark]: Boogie Preprocessor took 73.84 ms. Allocated memory is still 200.8 MB. Free memory was 166.1 MB in the beginning and 162.5 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. [2020-07-18 00:25:07,899 INFO L168 Benchmark]: RCFGBuilder took 854.36 ms. Allocated memory is still 200.8 MB. Free memory was 162.5 MB in the beginning and 98.8 MB in the end (delta: 63.7 MB). Peak memory consumption was 63.7 MB. Max. memory is 7.1 GB. [2020-07-18 00:25:07,901 INFO L168 Benchmark]: TraceAbstraction took 4538.69 ms. Allocated memory was 200.8 MB in the beginning and 293.6 MB in the end (delta: 92.8 MB). Free memory was 98.1 MB in the beginning and 117.3 MB in the end (delta: -19.2 MB). Peak memory consumption was 73.6 MB. Max. memory is 7.1 GB. [2020-07-18 00:25:07,904 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.25 ms. Allocated memory is still 143.1 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 723.93 ms. Allocated memory was 143.1 MB in the beginning and 200.8 MB in the end (delta: 57.7 MB). Free memory was 100.0 MB in the beginning and 166.1 MB in the end (delta: -66.2 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 73.84 ms. Allocated memory is still 200.8 MB. Free memory was 166.1 MB in the beginning and 162.5 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 854.36 ms. Allocated memory is still 200.8 MB. Free memory was 162.5 MB in the beginning and 98.8 MB in the end (delta: 63.7 MB). Peak memory consumption was 63.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4538.69 ms. Allocated memory was 200.8 MB in the beginning and 293.6 MB in the end (delta: 92.8 MB). Free memory was 98.1 MB in the beginning and 117.3 MB in the end (delta: -19.2 MB). Peak memory consumption was 73.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 594]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 599]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 585]: Loop Invariant Derived loop invariant: ((0 == high && 0 == low) && 0 == high) && 0 == low - InvariantResult [Line: 570]: Loop Invariant Derived loop invariant: 1 - ProcedureContractResult [Line: 569]: Procedure Contract for create_list Derived contract for procedure create_list: 1 - ProcedureContractResult [Line: 580]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 562]: Procedure Contract for append_to_list Derived contract for procedure append_to_list: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 93 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.8s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 217 SDtfs, 62 SDslu, 236 SDs, 0 SdLazy, 274 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 83 LocationsWithAnnotation, 96 PreInvPairs, 128 NumberOfFragments, 394 HoareAnnotationTreeSize, 96 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 83 FomulaSimplificationsInter, 61 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 correct! Received shutdown request...