/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/forester-heap/sll-01-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-18 00:23:46,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-18 00:23:46,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-18 00:23:46,477 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-18 00:23:46,477 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-18 00:23:46,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-18 00:23:46,480 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-18 00:23:46,482 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-18 00:23:46,483 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-18 00:23:46,484 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-18 00:23:46,485 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-18 00:23:46,486 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-18 00:23:46,487 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-18 00:23:46,487 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-18 00:23:46,489 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-18 00:23:46,490 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-18 00:23:46,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-18 00:23:46,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-18 00:23:46,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-18 00:23:46,498 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-18 00:23:46,499 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-18 00:23:46,500 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-18 00:23:46,501 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-18 00:23:46,502 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-18 00:23:46,504 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-18 00:23:46,505 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-18 00:23:46,505 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-18 00:23:46,506 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-18 00:23:46,506 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-18 00:23:46,507 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-18 00:23:46,507 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-18 00:23:46,508 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-18 00:23:46,509 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-18 00:23:46,510 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-18 00:23:46,511 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-18 00:23:46,511 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-18 00:23:46,512 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-18 00:23:46,512 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-18 00:23:46,512 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-18 00:23:46,513 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-18 00:23:46,513 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-18 00:23:46,514 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:23:46,524 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-18 00:23:46,524 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-18 00:23:46,526 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-18 00:23:46,526 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-18 00:23:46,526 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-18 00:23:46,526 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-18 00:23:46,526 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-18 00:23:46,527 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-18 00:23:46,527 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-18 00:23:46,527 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-18 00:23:46,527 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-18 00:23:46,527 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-18 00:23:46,528 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-18 00:23:46,528 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-18 00:23:46,528 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-18 00:23:46,528 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-18 00:23:46,528 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-18 00:23:46,529 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-18 00:23:46,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-18 00:23:46,529 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-18 00:23:46,529 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-18 00:23:46,529 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-18 00:23:46,530 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-18 00:23:46,808 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-18 00:23:46,824 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-18 00:23:46,828 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-18 00:23:46,830 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-18 00:23:46,830 INFO L275 PluginConnector]: CDTParser initialized [2020-07-18 00:23:46,831 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-01-2.i [2020-07-18 00:23:46,899 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e720d194/27f8510617844bef897e3c42e8046bf5/FLAG449eb977d [2020-07-18 00:23:47,469 INFO L306 CDTParser]: Found 1 translation units. [2020-07-18 00:23:47,470 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-01-2.i [2020-07-18 00:23:47,486 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e720d194/27f8510617844bef897e3c42e8046bf5/FLAG449eb977d [2020-07-18 00:23:47,722 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8e720d194/27f8510617844bef897e3c42e8046bf5 [2020-07-18 00:23:47,732 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-18 00:23:47,735 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-18 00:23:47,737 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-18 00:23:47,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-18 00:23:47,740 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-18 00:23:47,742 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:23:47" (1/1) ... [2020-07-18 00:23:47,745 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6902f5b4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:23:47, skipping insertion in model container [2020-07-18 00:23:47,746 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.07 12:23:47" (1/1) ... [2020-07-18 00:23:47,754 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-18 00:23:47,820 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-18 00:23:48,342 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:23:48,361 INFO L203 MainTranslator]: Completed pre-run [2020-07-18 00:23:48,455 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-18 00:23:48,513 INFO L208 MainTranslator]: Completed translation [2020-07-18 00:23:48,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:23:48 WrapperNode [2020-07-18 00:23:48,514 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-18 00:23:48,515 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-18 00:23:48,515 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-18 00:23:48,515 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-18 00:23:48,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:23:48" (1/1) ... [2020-07-18 00:23:48,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:23:48" (1/1) ... [2020-07-18 00:23:48,545 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:23:48" (1/1) ... [2020-07-18 00:23:48,546 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:23:48" (1/1) ... [2020-07-18 00:23:48,577 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:23:48" (1/1) ... [2020-07-18 00:23:48,594 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:23:48" (1/1) ... [2020-07-18 00:23:48,598 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:23:48" (1/1) ... [2020-07-18 00:23:48,606 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-18 00:23:48,607 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-18 00:23:48,607 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-18 00:23:48,607 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-18 00:23:48,608 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:23:48" (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:23:48,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-18 00:23:48,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-18 00:23:48,669 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-18 00:23:48,669 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-18 00:23:48,669 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-18 00:23:48,670 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-18 00:23:48,670 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-18 00:23:48,670 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-18 00:23:48,670 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-18 00:23:48,670 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-18 00:23:48,671 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-18 00:23:48,671 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-18 00:23:48,671 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-18 00:23:48,671 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-18 00:23:48,671 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-18 00:23:48,671 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-18 00:23:48,672 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-18 00:23:48,672 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-18 00:23:48,672 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-18 00:23:48,672 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-18 00:23:48,672 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-18 00:23:48,673 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-18 00:23:48,673 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-18 00:23:48,673 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-18 00:23:48,673 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-18 00:23:48,673 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-18 00:23:48,673 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-18 00:23:48,674 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-18 00:23:48,674 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-18 00:23:48,674 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-18 00:23:48,674 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-18 00:23:48,674 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-18 00:23:48,675 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-18 00:23:48,675 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-18 00:23:48,675 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-18 00:23:48,675 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-18 00:23:48,675 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-18 00:23:48,675 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-18 00:23:48,675 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-18 00:23:48,676 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-18 00:23:48,676 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-18 00:23:48,676 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-18 00:23:48,676 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-18 00:23:48,676 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-18 00:23:48,676 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-18 00:23:48,676 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-18 00:23:48,677 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-18 00:23:48,677 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-18 00:23:48,677 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-18 00:23:48,677 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-18 00:23:48,677 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-18 00:23:48,677 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-18 00:23:48,677 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-18 00:23:48,678 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-18 00:23:48,678 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-18 00:23:48,678 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-18 00:23:48,678 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-18 00:23:48,678 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-18 00:23:48,678 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-18 00:23:48,679 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-18 00:23:48,679 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-18 00:23:48,679 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-18 00:23:48,679 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-18 00:23:48,679 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-18 00:23:48,679 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-18 00:23:48,679 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-18 00:23:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-18 00:23:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-18 00:23:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-18 00:23:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-18 00:23:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-18 00:23:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-18 00:23:48,680 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-18 00:23:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-18 00:23:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-18 00:23:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-18 00:23:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-18 00:23:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-18 00:23:48,681 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-18 00:23:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-18 00:23:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-18 00:23:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-18 00:23:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-18 00:23:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-18 00:23:48,682 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-18 00:23:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-18 00:23:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-18 00:23:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-18 00:23:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-18 00:23:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-18 00:23:48,683 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-18 00:23:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-18 00:23:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-18 00:23:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-18 00:23:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-18 00:23:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-18 00:23:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-18 00:23:48,684 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-18 00:23:48,685 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-18 00:23:48,685 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-18 00:23:48,685 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-18 00:23:48,685 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-18 00:23:48,685 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-18 00:23:48,685 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-18 00:23:48,686 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-18 00:23:48,686 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-18 00:23:48,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-18 00:23:48,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-18 00:23:48,686 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-18 00:23:48,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-18 00:23:48,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-18 00:23:48,687 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-18 00:23:48,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-18 00:23:48,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-18 00:23:48,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-18 00:23:49,681 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-18 00:23:49,682 INFO L295 CfgBuilder]: Removed 30 assume(true) statements. [2020-07-18 00:23:49,687 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:23:49 BoogieIcfgContainer [2020-07-18 00:23:49,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-18 00:23:49,689 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-18 00:23:49,689 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-18 00:23:49,693 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-18 00:23:49,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.07 12:23:47" (1/3) ... [2020-07-18 00:23:49,694 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9bbe82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:23:49, skipping insertion in model container [2020-07-18 00:23:49,694 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.07 12:23:48" (2/3) ... [2020-07-18 00:23:49,695 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9bbe82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.07 12:23:49, skipping insertion in model container [2020-07-18 00:23:49,695 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.07 12:23:49" (3/3) ... [2020-07-18 00:23:49,697 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2020-07-18 00:23:49,708 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-18 00:23:49,717 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2020-07-18 00:23:49,732 INFO L251 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2020-07-18 00:23:49,752 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-18 00:23:49,753 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-18 00:23:49,753 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-18 00:23:49,753 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-18 00:23:49,753 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-18 00:23:49,754 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-18 00:23:49,754 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-18 00:23:49,754 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-18 00:23:49,776 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states. [2020-07-18 00:23:49,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-07-18 00:23:49,786 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:23:49,787 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:23:49,788 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:23:49,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:23:49,795 INFO L82 PathProgramCache]: Analyzing trace with hash 885652866, now seen corresponding path program 1 times [2020-07-18 00:23:49,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:23:49,804 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1369709396] [2020-07-18 00:23:49,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:23:49,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:23:50,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:23:50,096 INFO L280 TraceCheckUtils]: 0: Hoare triple {183#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {174#true} is VALID [2020-07-18 00:23:50,097 INFO L280 TraceCheckUtils]: 1: Hoare triple {174#true} #valid := #valid[0 := 0]; {174#true} is VALID [2020-07-18 00:23:50,098 INFO L280 TraceCheckUtils]: 2: Hoare triple {174#true} assume 0 < #StackHeapBarrier; {174#true} is VALID [2020-07-18 00:23:50,098 INFO L280 TraceCheckUtils]: 3: Hoare triple {174#true} assume true; {174#true} is VALID [2020-07-18 00:23:50,099 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {174#true} {174#true} #419#return; {174#true} is VALID [2020-07-18 00:23:50,105 INFO L263 TraceCheckUtils]: 0: Hoare triple {174#true} call ULTIMATE.init(); {183#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:23:50,105 INFO L280 TraceCheckUtils]: 1: Hoare triple {183#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {174#true} is VALID [2020-07-18 00:23:50,106 INFO L280 TraceCheckUtils]: 2: Hoare triple {174#true} #valid := #valid[0 := 0]; {174#true} is VALID [2020-07-18 00:23:50,106 INFO L280 TraceCheckUtils]: 3: Hoare triple {174#true} assume 0 < #StackHeapBarrier; {174#true} is VALID [2020-07-18 00:23:50,107 INFO L280 TraceCheckUtils]: 4: Hoare triple {174#true} assume true; {174#true} is VALID [2020-07-18 00:23:50,107 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {174#true} {174#true} #419#return; {174#true} is VALID [2020-07-18 00:23:50,107 INFO L263 TraceCheckUtils]: 6: Hoare triple {174#true} call #t~ret28 := main(); {174#true} is VALID [2020-07-18 00:23:50,110 INFO L280 TraceCheckUtils]: 7: Hoare triple {174#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {181#(not (= 0 |main_#t~malloc0.base|))} is VALID [2020-07-18 00:23:50,112 INFO L280 TraceCheckUtils]: 8: Hoare triple {181#(not (= 0 |main_#t~malloc0.base|))} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {182#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 00:23:50,114 INFO L280 TraceCheckUtils]: 9: Hoare triple {182#(not (= 0 main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {182#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 00:23:50,115 INFO L280 TraceCheckUtils]: 10: Hoare triple {182#(not (= 0 main_~list~0.base))} assume !(~list~0.base != 0 || ~list~0.offset != 0); {175#false} is VALID [2020-07-18 00:23:50,115 INFO L280 TraceCheckUtils]: 11: Hoare triple {175#false} assume !false; {175#false} is VALID [2020-07-18 00:23:50,117 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:23:50,120 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:23:50,122 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1369709396] [2020-07-18 00:23:50,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:23:50,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-18 00:23:50,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695108050] [2020-07-18 00:23:50,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-18 00:23:50,137 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:23:50,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-18 00:23:50,168 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:50,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-18 00:23:50,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:23:50,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-18 00:23:50,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-18 00:23:50,184 INFO L87 Difference]: Start difference. First operand 171 states. Second operand 5 states. [2020-07-18 00:23:51,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:51,570 INFO L93 Difference]: Finished difference Result 360 states and 478 transitions. [2020-07-18 00:23:51,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-18 00:23:51,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-07-18 00:23:51,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:23:51,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:23:51,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2020-07-18 00:23:51,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-18 00:23:51,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2020-07-18 00:23:51,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 478 transitions. [2020-07-18 00:23:52,189 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 478 edges. 478 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:52,214 INFO L225 Difference]: With dead ends: 360 [2020-07-18 00:23:52,215 INFO L226 Difference]: Without dead ends: 194 [2020-07-18 00:23:52,222 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:23:52,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2020-07-18 00:23:52,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 164. [2020-07-18 00:23:52,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:23:52,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand 164 states. [2020-07-18 00:23:52,493 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 164 states. [2020-07-18 00:23:52,494 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 164 states. [2020-07-18 00:23:52,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:52,508 INFO L93 Difference]: Finished difference Result 194 states and 205 transitions. [2020-07-18 00:23:52,508 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 205 transitions. [2020-07-18 00:23:52,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:23:52,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:23:52,511 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 194 states. [2020-07-18 00:23:52,511 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 194 states. [2020-07-18 00:23:52,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:52,524 INFO L93 Difference]: Finished difference Result 194 states and 205 transitions. [2020-07-18 00:23:52,524 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 205 transitions. [2020-07-18 00:23:52,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:23:52,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:23:52,526 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:23:52,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:23:52,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2020-07-18 00:23:52,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 174 transitions. [2020-07-18 00:23:52,537 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 174 transitions. Word has length 12 [2020-07-18 00:23:52,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:23:52,537 INFO L479 AbstractCegarLoop]: Abstraction has 164 states and 174 transitions. [2020-07-18 00:23:52,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-18 00:23:52,538 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 164 states and 174 transitions. [2020-07-18 00:23:52,764 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:52,764 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 174 transitions. [2020-07-18 00:23:52,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-18 00:23:52,766 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:23:52,766 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] [2020-07-18 00:23:52,766 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-18 00:23:52,767 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:23:52,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:23:52,767 INFO L82 PathProgramCache]: Analyzing trace with hash 684663316, now seen corresponding path program 1 times [2020-07-18 00:23:52,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:23:52,768 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [129647953] [2020-07-18 00:23:52,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:23:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:23:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:23:52,837 INFO L280 TraceCheckUtils]: 0: Hoare triple {1632#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1624#true} is VALID [2020-07-18 00:23:52,837 INFO L280 TraceCheckUtils]: 1: Hoare triple {1624#true} #valid := #valid[0 := 0]; {1624#true} is VALID [2020-07-18 00:23:52,838 INFO L280 TraceCheckUtils]: 2: Hoare triple {1624#true} assume 0 < #StackHeapBarrier; {1624#true} is VALID [2020-07-18 00:23:52,838 INFO L280 TraceCheckUtils]: 3: Hoare triple {1624#true} assume true; {1624#true} is VALID [2020-07-18 00:23:52,838 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1624#true} {1624#true} #419#return; {1624#true} is VALID [2020-07-18 00:23:52,840 INFO L263 TraceCheckUtils]: 0: Hoare triple {1624#true} call ULTIMATE.init(); {1632#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:23:52,840 INFO L280 TraceCheckUtils]: 1: Hoare triple {1632#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1624#true} is VALID [2020-07-18 00:23:52,840 INFO L280 TraceCheckUtils]: 2: Hoare triple {1624#true} #valid := #valid[0 := 0]; {1624#true} is VALID [2020-07-18 00:23:52,841 INFO L280 TraceCheckUtils]: 3: Hoare triple {1624#true} assume 0 < #StackHeapBarrier; {1624#true} is VALID [2020-07-18 00:23:52,841 INFO L280 TraceCheckUtils]: 4: Hoare triple {1624#true} assume true; {1624#true} is VALID [2020-07-18 00:23:52,841 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1624#true} {1624#true} #419#return; {1624#true} is VALID [2020-07-18 00:23:52,842 INFO L263 TraceCheckUtils]: 6: Hoare triple {1624#true} call #t~ret28 := main(); {1624#true} is VALID [2020-07-18 00:23:52,842 INFO L280 TraceCheckUtils]: 7: Hoare triple {1624#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {1624#true} is VALID [2020-07-18 00:23:52,842 INFO L280 TraceCheckUtils]: 8: Hoare triple {1624#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {1624#true} is VALID [2020-07-18 00:23:52,842 INFO L280 TraceCheckUtils]: 9: Hoare triple {1624#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {1624#true} is VALID [2020-07-18 00:23:52,843 INFO L280 TraceCheckUtils]: 10: Hoare triple {1624#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {1624#true} is VALID [2020-07-18 00:23:52,843 INFO L280 TraceCheckUtils]: 11: Hoare triple {1624#true} goto; {1624#true} is VALID [2020-07-18 00:23:52,843 INFO L280 TraceCheckUtils]: 12: Hoare triple {1624#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1624#true} is VALID [2020-07-18 00:23:52,844 INFO L280 TraceCheckUtils]: 13: Hoare triple {1624#true} assume 0 != #t~nondet1; {1624#true} is VALID [2020-07-18 00:23:52,844 INFO L280 TraceCheckUtils]: 14: Hoare triple {1624#true} havoc #t~nondet1; {1624#true} is VALID [2020-07-18 00:23:52,844 INFO L280 TraceCheckUtils]: 15: Hoare triple {1624#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {1624#true} is VALID [2020-07-18 00:23:52,845 INFO L280 TraceCheckUtils]: 16: Hoare triple {1624#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {1624#true} is VALID [2020-07-18 00:23:52,845 INFO L280 TraceCheckUtils]: 17: Hoare triple {1624#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {1624#true} is VALID [2020-07-18 00:23:52,847 INFO L280 TraceCheckUtils]: 18: Hoare triple {1624#true} assume #t~short7; {1631#|main_#t~short7|} is VALID [2020-07-18 00:23:52,847 INFO L280 TraceCheckUtils]: 19: Hoare triple {1631#|main_#t~short7|} assume !#t~short7; {1625#false} is VALID [2020-07-18 00:23:52,847 INFO L280 TraceCheckUtils]: 20: Hoare triple {1625#false} havoc #t~mem5.base, #t~mem5.offset; {1625#false} is VALID [2020-07-18 00:23:52,848 INFO L280 TraceCheckUtils]: 21: Hoare triple {1625#false} havoc #t~short7; {1625#false} is VALID [2020-07-18 00:23:52,848 INFO L280 TraceCheckUtils]: 22: Hoare triple {1625#false} havoc #t~mem6.base, #t~mem6.offset; {1625#false} is VALID [2020-07-18 00:23:52,848 INFO L280 TraceCheckUtils]: 23: Hoare triple {1625#false} assume !false; {1625#false} is VALID [2020-07-18 00:23:52,850 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:23:52,851 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:23:52,851 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [129647953] [2020-07-18 00:23:52,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:23:52,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:23:52,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581076670] [2020-07-18 00:23:52,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-18 00:23:52,853 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:23:52,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:23:52,875 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:52,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:23:52,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:23:52,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:23:52,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:23:52,876 INFO L87 Difference]: Start difference. First operand 164 states and 174 transitions. Second operand 4 states. [2020-07-18 00:23:53,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:53,627 INFO L93 Difference]: Finished difference Result 170 states and 180 transitions. [2020-07-18 00:23:53,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 00:23:53,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2020-07-18 00:23:53,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:23:53,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:23:53,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2020-07-18 00:23:53,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:23:53,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2020-07-18 00:23:53,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 180 transitions. [2020-07-18 00:23:53,835 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:53,842 INFO L225 Difference]: With dead ends: 170 [2020-07-18 00:23:53,842 INFO L226 Difference]: Without dead ends: 165 [2020-07-18 00:23:53,844 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:23:53,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2020-07-18 00:23:54,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2020-07-18 00:23:54,075 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:23:54,075 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand 165 states. [2020-07-18 00:23:54,075 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 165 states. [2020-07-18 00:23:54,075 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 165 states. [2020-07-18 00:23:54,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:54,082 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2020-07-18 00:23:54,082 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 175 transitions. [2020-07-18 00:23:54,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:23:54,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:23:54,084 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 165 states. [2020-07-18 00:23:54,084 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 165 states. [2020-07-18 00:23:54,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:54,090 INFO L93 Difference]: Finished difference Result 165 states and 175 transitions. [2020-07-18 00:23:54,090 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 175 transitions. [2020-07-18 00:23:54,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:23:54,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:23:54,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:23:54,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:23:54,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-07-18 00:23:54,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 175 transitions. [2020-07-18 00:23:54,097 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 175 transitions. Word has length 24 [2020-07-18 00:23:54,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:23:54,098 INFO L479 AbstractCegarLoop]: Abstraction has 165 states and 175 transitions. [2020-07-18 00:23:54,098 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:23:54,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 165 states and 175 transitions. [2020-07-18 00:23:54,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:54,297 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 175 transitions. [2020-07-18 00:23:54,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-18 00:23:54,298 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:23:54,298 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] [2020-07-18 00:23:54,299 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-18 00:23:54,299 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:23:54,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:23:54,300 INFO L82 PathProgramCache]: Analyzing trace with hash -265499727, now seen corresponding path program 1 times [2020-07-18 00:23:54,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:23:54,300 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1069186037] [2020-07-18 00:23:54,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:23:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:23:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:23:54,460 INFO L280 TraceCheckUtils]: 0: Hoare triple {2647#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2635#true} is VALID [2020-07-18 00:23:54,461 INFO L280 TraceCheckUtils]: 1: Hoare triple {2635#true} #valid := #valid[0 := 0]; {2635#true} is VALID [2020-07-18 00:23:54,461 INFO L280 TraceCheckUtils]: 2: Hoare triple {2635#true} assume 0 < #StackHeapBarrier; {2635#true} is VALID [2020-07-18 00:23:54,461 INFO L280 TraceCheckUtils]: 3: Hoare triple {2635#true} assume true; {2635#true} is VALID [2020-07-18 00:23:54,462 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2635#true} {2635#true} #419#return; {2635#true} is VALID [2020-07-18 00:23:54,463 INFO L263 TraceCheckUtils]: 0: Hoare triple {2635#true} call ULTIMATE.init(); {2647#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:23:54,463 INFO L280 TraceCheckUtils]: 1: Hoare triple {2647#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2635#true} is VALID [2020-07-18 00:23:54,464 INFO L280 TraceCheckUtils]: 2: Hoare triple {2635#true} #valid := #valid[0 := 0]; {2635#true} is VALID [2020-07-18 00:23:54,464 INFO L280 TraceCheckUtils]: 3: Hoare triple {2635#true} assume 0 < #StackHeapBarrier; {2635#true} is VALID [2020-07-18 00:23:54,464 INFO L280 TraceCheckUtils]: 4: Hoare triple {2635#true} assume true; {2635#true} is VALID [2020-07-18 00:23:54,465 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2635#true} {2635#true} #419#return; {2635#true} is VALID [2020-07-18 00:23:54,465 INFO L263 TraceCheckUtils]: 6: Hoare triple {2635#true} call #t~ret28 := main(); {2635#true} is VALID [2020-07-18 00:23:54,465 INFO L280 TraceCheckUtils]: 7: Hoare triple {2635#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {2635#true} is VALID [2020-07-18 00:23:54,465 INFO L280 TraceCheckUtils]: 8: Hoare triple {2635#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {2635#true} is VALID [2020-07-18 00:23:54,466 INFO L280 TraceCheckUtils]: 9: Hoare triple {2635#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {2635#true} is VALID [2020-07-18 00:23:54,466 INFO L280 TraceCheckUtils]: 10: Hoare triple {2635#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {2635#true} is VALID [2020-07-18 00:23:54,466 INFO L280 TraceCheckUtils]: 11: Hoare triple {2635#true} goto; {2635#true} is VALID [2020-07-18 00:23:54,467 INFO L280 TraceCheckUtils]: 12: Hoare triple {2635#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2635#true} is VALID [2020-07-18 00:23:54,467 INFO L280 TraceCheckUtils]: 13: Hoare triple {2635#true} assume 0 != #t~nondet1; {2635#true} is VALID [2020-07-18 00:23:54,467 INFO L280 TraceCheckUtils]: 14: Hoare triple {2635#true} havoc #t~nondet1; {2635#true} is VALID [2020-07-18 00:23:54,468 INFO L280 TraceCheckUtils]: 15: Hoare triple {2635#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {2635#true} is VALID [2020-07-18 00:23:54,469 INFO L280 TraceCheckUtils]: 16: Hoare triple {2635#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {2642#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|))} is VALID [2020-07-18 00:23:54,470 INFO L280 TraceCheckUtils]: 17: Hoare triple {2642#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {2643#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))))} is VALID [2020-07-18 00:23:54,471 INFO L280 TraceCheckUtils]: 18: Hoare triple {2643#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))))} assume !#t~short7; {2644#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:23:54,472 INFO L280 TraceCheckUtils]: 19: Hoare triple {2644#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {2645#(and (= 0 |main_#t~mem6.offset|) (= 0 |main_#t~mem6.base|))} is VALID [2020-07-18 00:23:54,472 INFO L280 TraceCheckUtils]: 20: Hoare triple {2645#(and (= 0 |main_#t~mem6.offset|) (= 0 |main_#t~mem6.base|))} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {2646#|main_#t~short7|} is VALID [2020-07-18 00:23:54,473 INFO L280 TraceCheckUtils]: 21: Hoare triple {2646#|main_#t~short7|} assume !#t~short7; {2636#false} is VALID [2020-07-18 00:23:54,473 INFO L280 TraceCheckUtils]: 22: Hoare triple {2636#false} havoc #t~mem5.base, #t~mem5.offset; {2636#false} is VALID [2020-07-18 00:23:54,474 INFO L280 TraceCheckUtils]: 23: Hoare triple {2636#false} havoc #t~short7; {2636#false} is VALID [2020-07-18 00:23:54,474 INFO L280 TraceCheckUtils]: 24: Hoare triple {2636#false} havoc #t~mem6.base, #t~mem6.offset; {2636#false} is VALID [2020-07-18 00:23:54,474 INFO L280 TraceCheckUtils]: 25: Hoare triple {2636#false} assume !false; {2636#false} is VALID [2020-07-18 00:23:54,476 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:23:54,476 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:23:54,477 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1069186037] [2020-07-18 00:23:54,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:23:54,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-18 00:23:54,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853007170] [2020-07-18 00:23:54,478 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-07-18 00:23:54,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:23:54,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 00:23:54,503 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:54,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 00:23:54,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:23:54,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 00:23:54,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:23:54,505 INFO L87 Difference]: Start difference. First operand 165 states and 175 transitions. Second operand 8 states. [2020-07-18 00:23:56,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:56,553 INFO L93 Difference]: Finished difference Result 260 states and 277 transitions. [2020-07-18 00:23:56,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-18 00:23:56,553 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2020-07-18 00:23:56,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:23:56,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:23:56,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 277 transitions. [2020-07-18 00:23:56,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:23:56,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 277 transitions. [2020-07-18 00:23:56,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 277 transitions. [2020-07-18 00:23:56,861 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:56,868 INFO L225 Difference]: With dead ends: 260 [2020-07-18 00:23:56,868 INFO L226 Difference]: Without dead ends: 255 [2020-07-18 00:23:56,869 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2020-07-18 00:23:56,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2020-07-18 00:23:57,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 159. [2020-07-18 00:23:57,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:23:57,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 255 states. Second operand 159 states. [2020-07-18 00:23:57,212 INFO L74 IsIncluded]: Start isIncluded. First operand 255 states. Second operand 159 states. [2020-07-18 00:23:57,212 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 159 states. [2020-07-18 00:23:57,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:57,222 INFO L93 Difference]: Finished difference Result 255 states and 272 transitions. [2020-07-18 00:23:57,222 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 272 transitions. [2020-07-18 00:23:57,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:23:57,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:23:57,223 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 255 states. [2020-07-18 00:23:57,223 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 255 states. [2020-07-18 00:23:57,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:57,234 INFO L93 Difference]: Finished difference Result 255 states and 272 transitions. [2020-07-18 00:23:57,234 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 272 transitions. [2020-07-18 00:23:57,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:23:57,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:23:57,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:23:57,235 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:23:57,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-07-18 00:23:57,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2020-07-18 00:23:57,240 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 26 [2020-07-18 00:23:57,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:23:57,241 INFO L479 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2020-07-18 00:23:57,241 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 00:23:57,241 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 159 states and 169 transitions. [2020-07-18 00:23:57,501 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:57,502 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2020-07-18 00:23:57,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-07-18 00:23:57,503 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:23:57,503 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:23:57,503 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-18 00:23:57,503 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:23:57,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:23:57,504 INFO L82 PathProgramCache]: Analyzing trace with hash 72562886, now seen corresponding path program 1 times [2020-07-18 00:23:57,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:23:57,505 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1170674257] [2020-07-18 00:23:57,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:23:57,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:23:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:23:57,620 INFO L280 TraceCheckUtils]: 0: Hoare triple {4026#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4016#true} is VALID [2020-07-18 00:23:57,621 INFO L280 TraceCheckUtils]: 1: Hoare triple {4016#true} #valid := #valid[0 := 0]; {4016#true} is VALID [2020-07-18 00:23:57,621 INFO L280 TraceCheckUtils]: 2: Hoare triple {4016#true} assume 0 < #StackHeapBarrier; {4016#true} is VALID [2020-07-18 00:23:57,621 INFO L280 TraceCheckUtils]: 3: Hoare triple {4016#true} assume true; {4016#true} is VALID [2020-07-18 00:23:57,621 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4016#true} {4016#true} #419#return; {4016#true} is VALID [2020-07-18 00:23:57,622 INFO L263 TraceCheckUtils]: 0: Hoare triple {4016#true} call ULTIMATE.init(); {4026#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:23:57,623 INFO L280 TraceCheckUtils]: 1: Hoare triple {4026#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4016#true} is VALID [2020-07-18 00:23:57,623 INFO L280 TraceCheckUtils]: 2: Hoare triple {4016#true} #valid := #valid[0 := 0]; {4016#true} is VALID [2020-07-18 00:23:57,623 INFO L280 TraceCheckUtils]: 3: Hoare triple {4016#true} assume 0 < #StackHeapBarrier; {4016#true} is VALID [2020-07-18 00:23:57,623 INFO L280 TraceCheckUtils]: 4: Hoare triple {4016#true} assume true; {4016#true} is VALID [2020-07-18 00:23:57,624 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4016#true} {4016#true} #419#return; {4016#true} is VALID [2020-07-18 00:23:57,624 INFO L263 TraceCheckUtils]: 6: Hoare triple {4016#true} call #t~ret28 := main(); {4016#true} is VALID [2020-07-18 00:23:57,624 INFO L280 TraceCheckUtils]: 7: Hoare triple {4016#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {4016#true} is VALID [2020-07-18 00:23:57,624 INFO L280 TraceCheckUtils]: 8: Hoare triple {4016#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {4016#true} is VALID [2020-07-18 00:23:57,624 INFO L280 TraceCheckUtils]: 9: Hoare triple {4016#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {4016#true} is VALID [2020-07-18 00:23:57,625 INFO L280 TraceCheckUtils]: 10: Hoare triple {4016#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {4016#true} is VALID [2020-07-18 00:23:57,625 INFO L280 TraceCheckUtils]: 11: Hoare triple {4016#true} goto; {4016#true} is VALID [2020-07-18 00:23:57,625 INFO L280 TraceCheckUtils]: 12: Hoare triple {4016#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4016#true} is VALID [2020-07-18 00:23:57,625 INFO L280 TraceCheckUtils]: 13: Hoare triple {4016#true} assume 0 != #t~nondet1; {4016#true} is VALID [2020-07-18 00:23:57,626 INFO L280 TraceCheckUtils]: 14: Hoare triple {4016#true} havoc #t~nondet1; {4016#true} is VALID [2020-07-18 00:23:57,626 INFO L280 TraceCheckUtils]: 15: Hoare triple {4016#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {4023#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:23:57,627 INFO L280 TraceCheckUtils]: 16: Hoare triple {4023#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {4024#(and (= 0 |main_#t~mem5.offset|) (= 0 |main_#t~mem5.base|))} is VALID [2020-07-18 00:23:57,628 INFO L280 TraceCheckUtils]: 17: Hoare triple {4024#(and (= 0 |main_#t~mem5.offset|) (= 0 |main_#t~mem5.base|))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {4025#(not |main_#t~short7|)} is VALID [2020-07-18 00:23:57,629 INFO L280 TraceCheckUtils]: 18: Hoare triple {4025#(not |main_#t~short7|)} assume #t~short7; {4017#false} is VALID [2020-07-18 00:23:57,629 INFO L280 TraceCheckUtils]: 19: Hoare triple {4017#false} assume !!#t~short7; {4017#false} is VALID [2020-07-18 00:23:57,629 INFO L280 TraceCheckUtils]: 20: Hoare triple {4017#false} havoc #t~mem5.base, #t~mem5.offset; {4017#false} is VALID [2020-07-18 00:23:57,630 INFO L280 TraceCheckUtils]: 21: Hoare triple {4017#false} havoc #t~short7; {4017#false} is VALID [2020-07-18 00:23:57,630 INFO L280 TraceCheckUtils]: 22: Hoare triple {4017#false} havoc #t~mem6.base, #t~mem6.offset; {4017#false} is VALID [2020-07-18 00:23:57,630 INFO L280 TraceCheckUtils]: 23: Hoare triple {4017#false} goto; {4017#false} is VALID [2020-07-18 00:23:57,631 INFO L280 TraceCheckUtils]: 24: Hoare triple {4017#false} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4017#false} is VALID [2020-07-18 00:23:57,631 INFO L280 TraceCheckUtils]: 25: Hoare triple {4017#false} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {4017#false} is VALID [2020-07-18 00:23:57,632 INFO L280 TraceCheckUtils]: 26: Hoare triple {4017#false} assume !(0 != #t~nondet8); {4017#false} is VALID [2020-07-18 00:23:57,632 INFO L280 TraceCheckUtils]: 27: Hoare triple {4017#false} havoc #t~nondet8; {4017#false} is VALID [2020-07-18 00:23:57,633 INFO L280 TraceCheckUtils]: 28: Hoare triple {4017#false} ~end~0.base, ~end~0.offset := 0, 0; {4017#false} is VALID [2020-07-18 00:23:57,633 INFO L280 TraceCheckUtils]: 29: Hoare triple {4017#false} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {4017#false} is VALID [2020-07-18 00:23:57,633 INFO L280 TraceCheckUtils]: 30: Hoare triple {4017#false} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {4017#false} is VALID [2020-07-18 00:23:57,633 INFO L280 TraceCheckUtils]: 31: Hoare triple {4017#false} assume !false; {4017#false} is VALID [2020-07-18 00:23:57,635 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:23:57,635 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:23:57,636 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1170674257] [2020-07-18 00:23:57,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:23:57,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 00:23:57,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316356926] [2020-07-18 00:23:57,637 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2020-07-18 00:23:57,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:23:57,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 00:23:57,674 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:23:57,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 00:23:57,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:23:57,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 00:23:57,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:23:57,675 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 6 states. [2020-07-18 00:23:59,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:23:59,326 INFO L93 Difference]: Finished difference Result 382 states and 407 transitions. [2020-07-18 00:23:59,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-18 00:23:59,327 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2020-07-18 00:23:59,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:23:59,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:23:59,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 407 transitions. [2020-07-18 00:23:59,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:23:59,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 407 transitions. [2020-07-18 00:23:59,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 407 transitions. [2020-07-18 00:23:59,755 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 407 edges. 407 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:23:59,761 INFO L225 Difference]: With dead ends: 382 [2020-07-18 00:23:59,761 INFO L226 Difference]: Without dead ends: 253 [2020-07-18 00:23:59,763 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:23:59,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2020-07-18 00:24:00,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 162. [2020-07-18 00:24:00,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:24:00,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand 162 states. [2020-07-18 00:24:00,130 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand 162 states. [2020-07-18 00:24:00,131 INFO L87 Difference]: Start difference. First operand 253 states. Second operand 162 states. [2020-07-18 00:24:00,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:00,142 INFO L93 Difference]: Finished difference Result 253 states and 269 transitions. [2020-07-18 00:24:00,142 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 269 transitions. [2020-07-18 00:24:00,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:00,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:00,143 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 253 states. [2020-07-18 00:24:00,143 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 253 states. [2020-07-18 00:24:00,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:00,154 INFO L93 Difference]: Finished difference Result 253 states and 269 transitions. [2020-07-18 00:24:00,155 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 269 transitions. [2020-07-18 00:24:00,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:00,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:00,156 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:24:00,156 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:24:00,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2020-07-18 00:24:00,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 172 transitions. [2020-07-18 00:24:00,161 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 172 transitions. Word has length 32 [2020-07-18 00:24:00,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:24:00,164 INFO L479 AbstractCegarLoop]: Abstraction has 162 states and 172 transitions. [2020-07-18 00:24:00,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 00:24:00,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 162 states and 172 transitions. [2020-07-18 00:24:00,451 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:00,452 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 172 transitions. [2020-07-18 00:24:00,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-18 00:24:00,453 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:24:00,453 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:24:00,453 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-18 00:24:00,454 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:24:00,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:24:00,454 INFO L82 PathProgramCache]: Analyzing trace with hash 972027235, now seen corresponding path program 1 times [2020-07-18 00:24:00,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:24:00,455 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1230816224] [2020-07-18 00:24:00,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:24:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:00,618 INFO L280 TraceCheckUtils]: 0: Hoare triple {5637#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5627#true} is VALID [2020-07-18 00:24:00,618 INFO L280 TraceCheckUtils]: 1: Hoare triple {5627#true} #valid := #valid[0 := 0]; {5627#true} is VALID [2020-07-18 00:24:00,619 INFO L280 TraceCheckUtils]: 2: Hoare triple {5627#true} assume 0 < #StackHeapBarrier; {5627#true} is VALID [2020-07-18 00:24:00,619 INFO L280 TraceCheckUtils]: 3: Hoare triple {5627#true} assume true; {5627#true} is VALID [2020-07-18 00:24:00,619 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5627#true} {5627#true} #419#return; {5627#true} is VALID [2020-07-18 00:24:00,620 INFO L263 TraceCheckUtils]: 0: Hoare triple {5627#true} call ULTIMATE.init(); {5637#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:24:00,621 INFO L280 TraceCheckUtils]: 1: Hoare triple {5637#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5627#true} is VALID [2020-07-18 00:24:00,621 INFO L280 TraceCheckUtils]: 2: Hoare triple {5627#true} #valid := #valid[0 := 0]; {5627#true} is VALID [2020-07-18 00:24:00,621 INFO L280 TraceCheckUtils]: 3: Hoare triple {5627#true} assume 0 < #StackHeapBarrier; {5627#true} is VALID [2020-07-18 00:24:00,621 INFO L280 TraceCheckUtils]: 4: Hoare triple {5627#true} assume true; {5627#true} is VALID [2020-07-18 00:24:00,622 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {5627#true} {5627#true} #419#return; {5627#true} is VALID [2020-07-18 00:24:00,622 INFO L263 TraceCheckUtils]: 6: Hoare triple {5627#true} call #t~ret28 := main(); {5627#true} is VALID [2020-07-18 00:24:00,622 INFO L280 TraceCheckUtils]: 7: Hoare triple {5627#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {5634#(not (= 0 |main_#t~malloc0.base|))} is VALID [2020-07-18 00:24:00,623 INFO L280 TraceCheckUtils]: 8: Hoare triple {5634#(not (= 0 |main_#t~malloc0.base|))} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 00:24:00,624 INFO L280 TraceCheckUtils]: 9: Hoare triple {5635#(not (= 0 main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 00:24:00,624 INFO L280 TraceCheckUtils]: 10: Hoare triple {5635#(not (= 0 main_~list~0.base))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 00:24:00,625 INFO L280 TraceCheckUtils]: 11: Hoare triple {5635#(not (= 0 main_~list~0.base))} goto; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 00:24:00,625 INFO L280 TraceCheckUtils]: 12: Hoare triple {5635#(not (= 0 main_~list~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 00:24:00,626 INFO L280 TraceCheckUtils]: 13: Hoare triple {5635#(not (= 0 main_~list~0.base))} assume 0 != #t~nondet1; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 00:24:00,627 INFO L280 TraceCheckUtils]: 14: Hoare triple {5635#(not (= 0 main_~list~0.base))} havoc #t~nondet1; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 00:24:00,627 INFO L280 TraceCheckUtils]: 15: Hoare triple {5635#(not (= 0 main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 00:24:00,628 INFO L280 TraceCheckUtils]: 16: Hoare triple {5635#(not (= 0 main_~list~0.base))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 00:24:00,629 INFO L280 TraceCheckUtils]: 17: Hoare triple {5635#(not (= 0 main_~list~0.base))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 00:24:00,629 INFO L280 TraceCheckUtils]: 18: Hoare triple {5635#(not (= 0 main_~list~0.base))} assume !#t~short7; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 00:24:00,630 INFO L280 TraceCheckUtils]: 19: Hoare triple {5635#(not (= 0 main_~list~0.base))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 00:24:00,630 INFO L280 TraceCheckUtils]: 20: Hoare triple {5635#(not (= 0 main_~list~0.base))} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 00:24:00,631 INFO L280 TraceCheckUtils]: 21: Hoare triple {5635#(not (= 0 main_~list~0.base))} assume !!#t~short7; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 00:24:00,631 INFO L280 TraceCheckUtils]: 22: Hoare triple {5635#(not (= 0 main_~list~0.base))} havoc #t~mem5.base, #t~mem5.offset; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 00:24:00,632 INFO L280 TraceCheckUtils]: 23: Hoare triple {5635#(not (= 0 main_~list~0.base))} havoc #t~short7; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 00:24:00,632 INFO L280 TraceCheckUtils]: 24: Hoare triple {5635#(not (= 0 main_~list~0.base))} havoc #t~mem6.base, #t~mem6.offset; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 00:24:00,633 INFO L280 TraceCheckUtils]: 25: Hoare triple {5635#(not (= 0 main_~list~0.base))} goto; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 00:24:00,634 INFO L280 TraceCheckUtils]: 26: Hoare triple {5635#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 00:24:00,634 INFO L280 TraceCheckUtils]: 27: Hoare triple {5635#(not (= 0 main_~list~0.base))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 00:24:00,635 INFO L280 TraceCheckUtils]: 28: Hoare triple {5635#(not (= 0 main_~list~0.base))} assume !(0 != #t~nondet8); {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 00:24:00,635 INFO L280 TraceCheckUtils]: 29: Hoare triple {5635#(not (= 0 main_~list~0.base))} havoc #t~nondet8; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 00:24:00,636 INFO L280 TraceCheckUtils]: 30: Hoare triple {5635#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := 0, 0; {5635#(not (= 0 main_~list~0.base))} is VALID [2020-07-18 00:24:00,637 INFO L280 TraceCheckUtils]: 31: Hoare triple {5635#(not (= 0 main_~list~0.base))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {5636#(not (= 0 main_~end~0.base))} is VALID [2020-07-18 00:24:00,637 INFO L280 TraceCheckUtils]: 32: Hoare triple {5636#(not (= 0 main_~end~0.base))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {5628#false} is VALID [2020-07-18 00:24:00,637 INFO L280 TraceCheckUtils]: 33: Hoare triple {5628#false} assume !false; {5628#false} is VALID [2020-07-18 00:24:00,640 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:24:00,640 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:24:00,640 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1230816224] [2020-07-18 00:24:00,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:24:00,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-18 00:24:00,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071379900] [2020-07-18 00:24:00,642 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-07-18 00:24:00,642 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:24:00,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-18 00:24:00,674 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:00,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-18 00:24:00,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:24:00,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-18 00:24:00,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-18 00:24:00,675 INFO L87 Difference]: Start difference. First operand 162 states and 172 transitions. Second operand 6 states. [2020-07-18 00:24:02,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:02,115 INFO L93 Difference]: Finished difference Result 271 states and 288 transitions. [2020-07-18 00:24:02,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-18 00:24:02,115 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2020-07-18 00:24:02,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:24:02,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:24:02,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 285 transitions. [2020-07-18 00:24:02,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-18 00:24:02,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 285 transitions. [2020-07-18 00:24:02,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 285 transitions. [2020-07-18 00:24:02,441 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 285 edges. 285 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:02,448 INFO L225 Difference]: With dead ends: 271 [2020-07-18 00:24:02,448 INFO L226 Difference]: Without dead ends: 239 [2020-07-18 00:24:02,449 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:24:02,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2020-07-18 00:24:02,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 161. [2020-07-18 00:24:02,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:24:02,798 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand 161 states. [2020-07-18 00:24:02,798 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand 161 states. [2020-07-18 00:24:02,798 INFO L87 Difference]: Start difference. First operand 239 states. Second operand 161 states. [2020-07-18 00:24:02,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:02,805 INFO L93 Difference]: Finished difference Result 239 states and 254 transitions. [2020-07-18 00:24:02,805 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 254 transitions. [2020-07-18 00:24:02,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:02,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:02,806 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 239 states. [2020-07-18 00:24:02,806 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 239 states. [2020-07-18 00:24:02,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:02,812 INFO L93 Difference]: Finished difference Result 239 states and 254 transitions. [2020-07-18 00:24:02,812 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 254 transitions. [2020-07-18 00:24:02,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:02,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:02,813 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:24:02,813 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:24:02,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2020-07-18 00:24:02,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 171 transitions. [2020-07-18 00:24:02,817 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 171 transitions. Word has length 34 [2020-07-18 00:24:02,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:24:02,818 INFO L479 AbstractCegarLoop]: Abstraction has 161 states and 171 transitions. [2020-07-18 00:24:02,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-18 00:24:02,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 161 states and 171 transitions. [2020-07-18 00:24:03,085 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:03,085 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 171 transitions. [2020-07-18 00:24:03,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-07-18 00:24:03,086 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:24:03,087 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:24:03,087 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-18 00:24:03,087 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:24:03,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:24:03,088 INFO L82 PathProgramCache]: Analyzing trace with hash -401575995, now seen corresponding path program 1 times [2020-07-18 00:24:03,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:24:03,088 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1469428335] [2020-07-18 00:24:03,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:24:03,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:03,183 INFO L280 TraceCheckUtils]: 0: Hoare triple {6997#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6986#true} is VALID [2020-07-18 00:24:03,184 INFO L280 TraceCheckUtils]: 1: Hoare triple {6986#true} #valid := #valid[0 := 0]; {6986#true} is VALID [2020-07-18 00:24:03,184 INFO L280 TraceCheckUtils]: 2: Hoare triple {6986#true} assume 0 < #StackHeapBarrier; {6986#true} is VALID [2020-07-18 00:24:03,184 INFO L280 TraceCheckUtils]: 3: Hoare triple {6986#true} assume true; {6986#true} is VALID [2020-07-18 00:24:03,185 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {6986#true} {6986#true} #419#return; {6986#true} is VALID [2020-07-18 00:24:03,186 INFO L263 TraceCheckUtils]: 0: Hoare triple {6986#true} call ULTIMATE.init(); {6997#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:24:03,186 INFO L280 TraceCheckUtils]: 1: Hoare triple {6997#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6986#true} is VALID [2020-07-18 00:24:03,186 INFO L280 TraceCheckUtils]: 2: Hoare triple {6986#true} #valid := #valid[0 := 0]; {6986#true} is VALID [2020-07-18 00:24:03,187 INFO L280 TraceCheckUtils]: 3: Hoare triple {6986#true} assume 0 < #StackHeapBarrier; {6986#true} is VALID [2020-07-18 00:24:03,187 INFO L280 TraceCheckUtils]: 4: Hoare triple {6986#true} assume true; {6986#true} is VALID [2020-07-18 00:24:03,187 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {6986#true} {6986#true} #419#return; {6986#true} is VALID [2020-07-18 00:24:03,187 INFO L263 TraceCheckUtils]: 6: Hoare triple {6986#true} call #t~ret28 := main(); {6986#true} is VALID [2020-07-18 00:24:03,188 INFO L280 TraceCheckUtils]: 7: Hoare triple {6986#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {6986#true} is VALID [2020-07-18 00:24:03,188 INFO L280 TraceCheckUtils]: 8: Hoare triple {6986#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {6986#true} is VALID [2020-07-18 00:24:03,188 INFO L280 TraceCheckUtils]: 9: Hoare triple {6986#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {6986#true} is VALID [2020-07-18 00:24:03,188 INFO L280 TraceCheckUtils]: 10: Hoare triple {6986#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {6986#true} is VALID [2020-07-18 00:24:03,189 INFO L280 TraceCheckUtils]: 11: Hoare triple {6986#true} goto; {6986#true} is VALID [2020-07-18 00:24:03,189 INFO L280 TraceCheckUtils]: 12: Hoare triple {6986#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {6986#true} is VALID [2020-07-18 00:24:03,189 INFO L280 TraceCheckUtils]: 13: Hoare triple {6986#true} assume 0 != #t~nondet1; {6986#true} is VALID [2020-07-18 00:24:03,189 INFO L280 TraceCheckUtils]: 14: Hoare triple {6986#true} havoc #t~nondet1; {6986#true} is VALID [2020-07-18 00:24:03,190 INFO L280 TraceCheckUtils]: 15: Hoare triple {6986#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {6986#true} is VALID [2020-07-18 00:24:03,190 INFO L280 TraceCheckUtils]: 16: Hoare triple {6986#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {6986#true} is VALID [2020-07-18 00:24:03,190 INFO L280 TraceCheckUtils]: 17: Hoare triple {6986#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {6986#true} is VALID [2020-07-18 00:24:03,191 INFO L280 TraceCheckUtils]: 18: Hoare triple {6986#true} assume !#t~short7; {6986#true} is VALID [2020-07-18 00:24:03,191 INFO L280 TraceCheckUtils]: 19: Hoare triple {6986#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {6986#true} is VALID [2020-07-18 00:24:03,191 INFO L280 TraceCheckUtils]: 20: Hoare triple {6986#true} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {6986#true} is VALID [2020-07-18 00:24:03,191 INFO L280 TraceCheckUtils]: 21: Hoare triple {6986#true} assume !!#t~short7; {6986#true} is VALID [2020-07-18 00:24:03,191 INFO L280 TraceCheckUtils]: 22: Hoare triple {6986#true} havoc #t~mem5.base, #t~mem5.offset; {6986#true} is VALID [2020-07-18 00:24:03,192 INFO L280 TraceCheckUtils]: 23: Hoare triple {6986#true} havoc #t~short7; {6986#true} is VALID [2020-07-18 00:24:03,192 INFO L280 TraceCheckUtils]: 24: Hoare triple {6986#true} havoc #t~mem6.base, #t~mem6.offset; {6986#true} is VALID [2020-07-18 00:24:03,192 INFO L280 TraceCheckUtils]: 25: Hoare triple {6986#true} goto; {6986#true} is VALID [2020-07-18 00:24:03,193 INFO L280 TraceCheckUtils]: 26: Hoare triple {6986#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {6986#true} is VALID [2020-07-18 00:24:03,193 INFO L280 TraceCheckUtils]: 27: Hoare triple {6986#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {6986#true} is VALID [2020-07-18 00:24:03,193 INFO L280 TraceCheckUtils]: 28: Hoare triple {6986#true} assume !!(0 != #t~nondet8); {6986#true} is VALID [2020-07-18 00:24:03,193 INFO L280 TraceCheckUtils]: 29: Hoare triple {6986#true} havoc #t~nondet8; {6986#true} is VALID [2020-07-18 00:24:03,194 INFO L280 TraceCheckUtils]: 30: Hoare triple {6986#true} SUMMARY for call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(8); srcloc: L1001 {6993#(not (= 0 |main_#t~malloc9.base|))} is VALID [2020-07-18 00:24:03,195 INFO L280 TraceCheckUtils]: 31: Hoare triple {6993#(not (= 0 |main_#t~malloc9.base|))} SUMMARY for call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1001-1 {6994#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-18 00:24:03,196 INFO L280 TraceCheckUtils]: 32: Hoare triple {6994#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1001-2 {6995#(not (= 0 |main_#t~mem10.base|))} is VALID [2020-07-18 00:24:03,197 INFO L280 TraceCheckUtils]: 33: Hoare triple {6995#(not (= 0 |main_#t~mem10.base|))} ~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset; {6996#(not (= 0 main_~end~0.base))} is VALID [2020-07-18 00:24:03,197 INFO L280 TraceCheckUtils]: 34: Hoare triple {6996#(not (= 0 main_~end~0.base))} havoc #t~mem10.base, #t~mem10.offset; {6996#(not (= 0 main_~end~0.base))} is VALID [2020-07-18 00:24:03,198 INFO L280 TraceCheckUtils]: 35: Hoare triple {6996#(not (= 0 main_~end~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); srcloc: L1003 {6996#(not (= 0 main_~end~0.base))} is VALID [2020-07-18 00:24:03,199 INFO L280 TraceCheckUtils]: 36: Hoare triple {6996#(not (= 0 main_~end~0.base))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {6987#false} is VALID [2020-07-18 00:24:03,199 INFO L280 TraceCheckUtils]: 37: Hoare triple {6987#false} assume !false; {6987#false} is VALID [2020-07-18 00:24:03,201 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:24:03,201 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:24:03,202 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1469428335] [2020-07-18 00:24:03,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:24:03,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-18 00:24:03,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70436947] [2020-07-18 00:24:03,203 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-07-18 00:24:03,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:24:03,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 00:24:03,237 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:03,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 00:24:03,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:24:03,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 00:24:03,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-18 00:24:03,238 INFO L87 Difference]: Start difference. First operand 161 states and 171 transitions. Second operand 7 states. [2020-07-18 00:24:05,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:05,370 INFO L93 Difference]: Finished difference Result 245 states and 261 transitions. [2020-07-18 00:24:05,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-18 00:24:05,370 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2020-07-18 00:24:05,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:24:05,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:24:05,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 256 transitions. [2020-07-18 00:24:05,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:24:05,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 256 transitions. [2020-07-18 00:24:05,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 256 transitions. [2020-07-18 00:24:05,619 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:05,626 INFO L225 Difference]: With dead ends: 245 [2020-07-18 00:24:05,626 INFO L226 Difference]: Without dead ends: 241 [2020-07-18 00:24:05,627 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2020-07-18 00:24:05,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2020-07-18 00:24:06,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 157. [2020-07-18 00:24:06,062 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:24:06,062 INFO L82 GeneralOperation]: Start isEquivalent. First operand 241 states. Second operand 157 states. [2020-07-18 00:24:06,062 INFO L74 IsIncluded]: Start isIncluded. First operand 241 states. Second operand 157 states. [2020-07-18 00:24:06,062 INFO L87 Difference]: Start difference. First operand 241 states. Second operand 157 states. [2020-07-18 00:24:06,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:06,069 INFO L93 Difference]: Finished difference Result 241 states and 257 transitions. [2020-07-18 00:24:06,069 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 257 transitions. [2020-07-18 00:24:06,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:06,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:06,070 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 241 states. [2020-07-18 00:24:06,070 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 241 states. [2020-07-18 00:24:06,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:06,076 INFO L93 Difference]: Finished difference Result 241 states and 257 transitions. [2020-07-18 00:24:06,076 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 257 transitions. [2020-07-18 00:24:06,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:06,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:06,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:24:06,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:24:06,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2020-07-18 00:24:06,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 167 transitions. [2020-07-18 00:24:06,081 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 167 transitions. Word has length 38 [2020-07-18 00:24:06,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:24:06,082 INFO L479 AbstractCegarLoop]: Abstraction has 157 states and 167 transitions. [2020-07-18 00:24:06,082 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 00:24:06,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 157 states and 167 transitions. [2020-07-18 00:24:06,371 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:06,371 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 167 transitions. [2020-07-18 00:24:06,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-18 00:24:06,373 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:24:06,373 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:24:06,373 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-18 00:24:06,374 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:24:06,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:24:06,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1938604912, now seen corresponding path program 1 times [2020-07-18 00:24:06,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:24:06,375 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1596606926] [2020-07-18 00:24:06,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:24:06,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:06,453 INFO L280 TraceCheckUtils]: 0: Hoare triple {8307#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {8299#true} is VALID [2020-07-18 00:24:06,454 INFO L280 TraceCheckUtils]: 1: Hoare triple {8299#true} #valid := #valid[0 := 0]; {8299#true} is VALID [2020-07-18 00:24:06,454 INFO L280 TraceCheckUtils]: 2: Hoare triple {8299#true} assume 0 < #StackHeapBarrier; {8299#true} is VALID [2020-07-18 00:24:06,454 INFO L280 TraceCheckUtils]: 3: Hoare triple {8299#true} assume true; {8299#true} is VALID [2020-07-18 00:24:06,455 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {8299#true} {8299#true} #419#return; {8299#true} is VALID [2020-07-18 00:24:06,456 INFO L263 TraceCheckUtils]: 0: Hoare triple {8299#true} call ULTIMATE.init(); {8307#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:24:06,456 INFO L280 TraceCheckUtils]: 1: Hoare triple {8307#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {8299#true} is VALID [2020-07-18 00:24:06,456 INFO L280 TraceCheckUtils]: 2: Hoare triple {8299#true} #valid := #valid[0 := 0]; {8299#true} is VALID [2020-07-18 00:24:06,456 INFO L280 TraceCheckUtils]: 3: Hoare triple {8299#true} assume 0 < #StackHeapBarrier; {8299#true} is VALID [2020-07-18 00:24:06,457 INFO L280 TraceCheckUtils]: 4: Hoare triple {8299#true} assume true; {8299#true} is VALID [2020-07-18 00:24:06,457 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {8299#true} {8299#true} #419#return; {8299#true} is VALID [2020-07-18 00:24:06,457 INFO L263 TraceCheckUtils]: 6: Hoare triple {8299#true} call #t~ret28 := main(); {8299#true} is VALID [2020-07-18 00:24:06,460 INFO L280 TraceCheckUtils]: 7: Hoare triple {8299#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {8299#true} is VALID [2020-07-18 00:24:06,461 INFO L280 TraceCheckUtils]: 8: Hoare triple {8299#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {8299#true} is VALID [2020-07-18 00:24:06,461 INFO L280 TraceCheckUtils]: 9: Hoare triple {8299#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {8299#true} is VALID [2020-07-18 00:24:06,461 INFO L280 TraceCheckUtils]: 10: Hoare triple {8299#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {8299#true} is VALID [2020-07-18 00:24:06,461 INFO L280 TraceCheckUtils]: 11: Hoare triple {8299#true} goto; {8299#true} is VALID [2020-07-18 00:24:06,462 INFO L280 TraceCheckUtils]: 12: Hoare triple {8299#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {8299#true} is VALID [2020-07-18 00:24:06,462 INFO L280 TraceCheckUtils]: 13: Hoare triple {8299#true} assume 0 != #t~nondet1; {8299#true} is VALID [2020-07-18 00:24:06,462 INFO L280 TraceCheckUtils]: 14: Hoare triple {8299#true} havoc #t~nondet1; {8299#true} is VALID [2020-07-18 00:24:06,462 INFO L280 TraceCheckUtils]: 15: Hoare triple {8299#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {8299#true} is VALID [2020-07-18 00:24:06,463 INFO L280 TraceCheckUtils]: 16: Hoare triple {8299#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {8299#true} is VALID [2020-07-18 00:24:06,463 INFO L280 TraceCheckUtils]: 17: Hoare triple {8299#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {8299#true} is VALID [2020-07-18 00:24:06,463 INFO L280 TraceCheckUtils]: 18: Hoare triple {8299#true} assume !#t~short7; {8299#true} is VALID [2020-07-18 00:24:06,466 INFO L280 TraceCheckUtils]: 19: Hoare triple {8299#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {8299#true} is VALID [2020-07-18 00:24:06,467 INFO L280 TraceCheckUtils]: 20: Hoare triple {8299#true} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {8299#true} is VALID [2020-07-18 00:24:06,467 INFO L280 TraceCheckUtils]: 21: Hoare triple {8299#true} assume !!#t~short7; {8299#true} is VALID [2020-07-18 00:24:06,467 INFO L280 TraceCheckUtils]: 22: Hoare triple {8299#true} havoc #t~mem5.base, #t~mem5.offset; {8299#true} is VALID [2020-07-18 00:24:06,467 INFO L280 TraceCheckUtils]: 23: Hoare triple {8299#true} havoc #t~short7; {8299#true} is VALID [2020-07-18 00:24:06,468 INFO L280 TraceCheckUtils]: 24: Hoare triple {8299#true} havoc #t~mem6.base, #t~mem6.offset; {8299#true} is VALID [2020-07-18 00:24:06,468 INFO L280 TraceCheckUtils]: 25: Hoare triple {8299#true} goto; {8299#true} is VALID [2020-07-18 00:24:06,468 INFO L280 TraceCheckUtils]: 26: Hoare triple {8299#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {8299#true} is VALID [2020-07-18 00:24:06,468 INFO L280 TraceCheckUtils]: 27: Hoare triple {8299#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {8299#true} is VALID [2020-07-18 00:24:06,469 INFO L280 TraceCheckUtils]: 28: Hoare triple {8299#true} assume !(0 != #t~nondet8); {8299#true} is VALID [2020-07-18 00:24:06,469 INFO L280 TraceCheckUtils]: 29: Hoare triple {8299#true} havoc #t~nondet8; {8299#true} is VALID [2020-07-18 00:24:06,469 INFO L280 TraceCheckUtils]: 30: Hoare triple {8299#true} ~end~0.base, ~end~0.offset := 0, 0; {8299#true} is VALID [2020-07-18 00:24:06,469 INFO L280 TraceCheckUtils]: 31: Hoare triple {8299#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {8299#true} is VALID [2020-07-18 00:24:06,470 INFO L280 TraceCheckUtils]: 32: Hoare triple {8299#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {8299#true} is VALID [2020-07-18 00:24:06,470 INFO L280 TraceCheckUtils]: 33: Hoare triple {8299#true} goto; {8299#true} is VALID [2020-07-18 00:24:06,470 INFO L280 TraceCheckUtils]: 34: Hoare triple {8299#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {8299#true} is VALID [2020-07-18 00:24:06,473 INFO L280 TraceCheckUtils]: 35: Hoare triple {8299#true} ~len~0 := 0; {8306#(= 0 main_~len~0)} is VALID [2020-07-18 00:24:06,474 INFO L280 TraceCheckUtils]: 36: Hoare triple {8306#(= 0 main_~len~0)} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {8306#(= 0 main_~len~0)} is VALID [2020-07-18 00:24:06,475 INFO L280 TraceCheckUtils]: 37: Hoare triple {8306#(= 0 main_~len~0)} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {8306#(= 0 main_~len~0)} is VALID [2020-07-18 00:24:06,475 INFO L280 TraceCheckUtils]: 38: Hoare triple {8306#(= 0 main_~len~0)} havoc #t~mem18.base, #t~mem18.offset; {8306#(= 0 main_~len~0)} is VALID [2020-07-18 00:24:06,476 INFO L280 TraceCheckUtils]: 39: Hoare triple {8306#(= 0 main_~len~0)} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {8306#(= 0 main_~len~0)} is VALID [2020-07-18 00:24:06,476 INFO L280 TraceCheckUtils]: 40: Hoare triple {8306#(= 0 main_~len~0)} assume !(~len~0 <= 1); {8300#false} is VALID [2020-07-18 00:24:06,477 INFO L280 TraceCheckUtils]: 41: Hoare triple {8300#false} assume !false; {8300#false} is VALID [2020-07-18 00:24:06,478 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:24:06,482 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:24:06,483 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1596606926] [2020-07-18 00:24:06,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:24:06,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:24:06,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653650622] [2020-07-18 00:24:06,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2020-07-18 00:24:06,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:24:06,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:24:06,526 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:06,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:24:06,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:24:06,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:24:06,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:24:06,527 INFO L87 Difference]: Start difference. First operand 157 states and 167 transitions. Second operand 4 states. [2020-07-18 00:24:07,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:07,623 INFO L93 Difference]: Finished difference Result 267 states and 287 transitions. [2020-07-18 00:24:07,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 00:24:07,624 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2020-07-18 00:24:07,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:24:07,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:24:07,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 283 transitions. [2020-07-18 00:24:07,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:24:07,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 283 transitions. [2020-07-18 00:24:07,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 283 transitions. [2020-07-18 00:24:07,883 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 283 edges. 283 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:07,889 INFO L225 Difference]: With dead ends: 267 [2020-07-18 00:24:07,889 INFO L226 Difference]: Without dead ends: 196 [2020-07-18 00:24:07,893 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:24:07,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2020-07-18 00:24:08,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 160. [2020-07-18 00:24:08,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:24:08,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 196 states. Second operand 160 states. [2020-07-18 00:24:08,347 INFO L74 IsIncluded]: Start isIncluded. First operand 196 states. Second operand 160 states. [2020-07-18 00:24:08,347 INFO L87 Difference]: Start difference. First operand 196 states. Second operand 160 states. [2020-07-18 00:24:08,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:08,352 INFO L93 Difference]: Finished difference Result 196 states and 209 transitions. [2020-07-18 00:24:08,352 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 209 transitions. [2020-07-18 00:24:08,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:08,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:08,353 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 196 states. [2020-07-18 00:24:08,353 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 196 states. [2020-07-18 00:24:08,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:08,358 INFO L93 Difference]: Finished difference Result 196 states and 209 transitions. [2020-07-18 00:24:08,358 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 209 transitions. [2020-07-18 00:24:08,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:08,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:08,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:24:08,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:24:08,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2020-07-18 00:24:08,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 171 transitions. [2020-07-18 00:24:08,363 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 171 transitions. Word has length 42 [2020-07-18 00:24:08,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:24:08,363 INFO L479 AbstractCegarLoop]: Abstraction has 160 states and 171 transitions. [2020-07-18 00:24:08,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:24:08,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 160 states and 171 transitions. [2020-07-18 00:24:08,701 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:08,702 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 171 transitions. [2020-07-18 00:24:08,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-18 00:24:08,703 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:24:08,703 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:24:08,703 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-18 00:24:08,704 INFO L427 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:24:08,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:24:08,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1017153069, now seen corresponding path program 1 times [2020-07-18 00:24:08,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:24:08,705 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [910321729] [2020-07-18 00:24:08,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:24:08,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:08,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:08,840 INFO L280 TraceCheckUtils]: 0: Hoare triple {9564#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {9556#true} is VALID [2020-07-18 00:24:08,840 INFO L280 TraceCheckUtils]: 1: Hoare triple {9556#true} #valid := #valid[0 := 0]; {9556#true} is VALID [2020-07-18 00:24:08,841 INFO L280 TraceCheckUtils]: 2: Hoare triple {9556#true} assume 0 < #StackHeapBarrier; {9556#true} is VALID [2020-07-18 00:24:08,841 INFO L280 TraceCheckUtils]: 3: Hoare triple {9556#true} assume true; {9556#true} is VALID [2020-07-18 00:24:08,841 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {9556#true} {9556#true} #419#return; {9556#true} is VALID [2020-07-18 00:24:08,842 INFO L263 TraceCheckUtils]: 0: Hoare triple {9556#true} call ULTIMATE.init(); {9564#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:24:08,842 INFO L280 TraceCheckUtils]: 1: Hoare triple {9564#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {9556#true} is VALID [2020-07-18 00:24:08,842 INFO L280 TraceCheckUtils]: 2: Hoare triple {9556#true} #valid := #valid[0 := 0]; {9556#true} is VALID [2020-07-18 00:24:08,843 INFO L280 TraceCheckUtils]: 3: Hoare triple {9556#true} assume 0 < #StackHeapBarrier; {9556#true} is VALID [2020-07-18 00:24:08,843 INFO L280 TraceCheckUtils]: 4: Hoare triple {9556#true} assume true; {9556#true} is VALID [2020-07-18 00:24:08,843 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {9556#true} {9556#true} #419#return; {9556#true} is VALID [2020-07-18 00:24:08,843 INFO L263 TraceCheckUtils]: 6: Hoare triple {9556#true} call #t~ret28 := main(); {9556#true} is VALID [2020-07-18 00:24:08,844 INFO L280 TraceCheckUtils]: 7: Hoare triple {9556#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {9556#true} is VALID [2020-07-18 00:24:08,844 INFO L280 TraceCheckUtils]: 8: Hoare triple {9556#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {9556#true} is VALID [2020-07-18 00:24:08,848 INFO L280 TraceCheckUtils]: 9: Hoare triple {9556#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {9556#true} is VALID [2020-07-18 00:24:08,849 INFO L280 TraceCheckUtils]: 10: Hoare triple {9556#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {9556#true} is VALID [2020-07-18 00:24:08,849 INFO L280 TraceCheckUtils]: 11: Hoare triple {9556#true} goto; {9556#true} is VALID [2020-07-18 00:24:08,849 INFO L280 TraceCheckUtils]: 12: Hoare triple {9556#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {9556#true} is VALID [2020-07-18 00:24:08,849 INFO L280 TraceCheckUtils]: 13: Hoare triple {9556#true} assume 0 != #t~nondet1; {9556#true} is VALID [2020-07-18 00:24:08,850 INFO L280 TraceCheckUtils]: 14: Hoare triple {9556#true} havoc #t~nondet1; {9556#true} is VALID [2020-07-18 00:24:08,850 INFO L280 TraceCheckUtils]: 15: Hoare triple {9556#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {9556#true} is VALID [2020-07-18 00:24:08,850 INFO L280 TraceCheckUtils]: 16: Hoare triple {9556#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {9556#true} is VALID [2020-07-18 00:24:08,850 INFO L280 TraceCheckUtils]: 17: Hoare triple {9556#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {9556#true} is VALID [2020-07-18 00:24:08,850 INFO L280 TraceCheckUtils]: 18: Hoare triple {9556#true} assume !#t~short7; {9556#true} is VALID [2020-07-18 00:24:08,851 INFO L280 TraceCheckUtils]: 19: Hoare triple {9556#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {9556#true} is VALID [2020-07-18 00:24:08,851 INFO L280 TraceCheckUtils]: 20: Hoare triple {9556#true} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {9556#true} is VALID [2020-07-18 00:24:08,851 INFO L280 TraceCheckUtils]: 21: Hoare triple {9556#true} assume !!#t~short7; {9556#true} is VALID [2020-07-18 00:24:08,851 INFO L280 TraceCheckUtils]: 22: Hoare triple {9556#true} havoc #t~mem5.base, #t~mem5.offset; {9556#true} is VALID [2020-07-18 00:24:08,852 INFO L280 TraceCheckUtils]: 23: Hoare triple {9556#true} havoc #t~short7; {9556#true} is VALID [2020-07-18 00:24:08,852 INFO L280 TraceCheckUtils]: 24: Hoare triple {9556#true} havoc #t~mem6.base, #t~mem6.offset; {9556#true} is VALID [2020-07-18 00:24:08,852 INFO L280 TraceCheckUtils]: 25: Hoare triple {9556#true} goto; {9556#true} is VALID [2020-07-18 00:24:08,853 INFO L280 TraceCheckUtils]: 26: Hoare triple {9556#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {9556#true} is VALID [2020-07-18 00:24:08,853 INFO L280 TraceCheckUtils]: 27: Hoare triple {9556#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {9556#true} is VALID [2020-07-18 00:24:08,853 INFO L280 TraceCheckUtils]: 28: Hoare triple {9556#true} assume !(0 != #t~nondet8); {9556#true} is VALID [2020-07-18 00:24:08,853 INFO L280 TraceCheckUtils]: 29: Hoare triple {9556#true} havoc #t~nondet8; {9556#true} is VALID [2020-07-18 00:24:08,854 INFO L280 TraceCheckUtils]: 30: Hoare triple {9556#true} ~end~0.base, ~end~0.offset := 0, 0; {9556#true} is VALID [2020-07-18 00:24:08,854 INFO L280 TraceCheckUtils]: 31: Hoare triple {9556#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {9556#true} is VALID [2020-07-18 00:24:08,854 INFO L280 TraceCheckUtils]: 32: Hoare triple {9556#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {9556#true} is VALID [2020-07-18 00:24:08,854 INFO L280 TraceCheckUtils]: 33: Hoare triple {9556#true} goto; {9556#true} is VALID [2020-07-18 00:24:08,855 INFO L280 TraceCheckUtils]: 34: Hoare triple {9556#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {9556#true} is VALID [2020-07-18 00:24:08,855 INFO L280 TraceCheckUtils]: 35: Hoare triple {9556#true} ~len~0 := 0; {9556#true} is VALID [2020-07-18 00:24:08,855 INFO L280 TraceCheckUtils]: 36: Hoare triple {9556#true} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {9556#true} is VALID [2020-07-18 00:24:08,855 INFO L280 TraceCheckUtils]: 37: Hoare triple {9556#true} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {9556#true} is VALID [2020-07-18 00:24:08,855 INFO L280 TraceCheckUtils]: 38: Hoare triple {9556#true} havoc #t~mem18.base, #t~mem18.offset; {9556#true} is VALID [2020-07-18 00:24:08,858 INFO L280 TraceCheckUtils]: 39: Hoare triple {9556#true} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {9563#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} is VALID [2020-07-18 00:24:08,859 INFO L280 TraceCheckUtils]: 40: Hoare triple {9563#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} assume 0 == ~len~0; {9563#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} is VALID [2020-07-18 00:24:08,860 INFO L280 TraceCheckUtils]: 41: Hoare triple {9563#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} ~len~0 := 1; {9563#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} is VALID [2020-07-18 00:24:08,860 INFO L280 TraceCheckUtils]: 42: Hoare triple {9563#(or (not (= 0 main_~inner~0.base)) (not (= 0 main_~inner~0.offset)))} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {9557#false} is VALID [2020-07-18 00:24:08,861 INFO L280 TraceCheckUtils]: 43: Hoare triple {9557#false} assume !false; {9557#false} is VALID [2020-07-18 00:24:08,863 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:24:08,866 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:24:08,867 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [910321729] [2020-07-18 00:24:08,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:24:08,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:24:08,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207341273] [2020-07-18 00:24:08,868 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2020-07-18 00:24:08,871 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:24:08,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:24:08,919 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:08,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:24:08,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:24:08,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:24:08,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:24:08,920 INFO L87 Difference]: Start difference. First operand 160 states and 171 transitions. Second operand 4 states. [2020-07-18 00:24:10,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:10,003 INFO L93 Difference]: Finished difference Result 160 states and 171 transitions. [2020-07-18 00:24:10,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 00:24:10,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2020-07-18 00:24:10,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:24:10,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:24:10,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2020-07-18 00:24:10,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:24:10,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2020-07-18 00:24:10,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 163 transitions. [2020-07-18 00:24:10,219 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:10,222 INFO L225 Difference]: With dead ends: 160 [2020-07-18 00:24:10,223 INFO L226 Difference]: Without dead ends: 158 [2020-07-18 00:24:10,224 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:24:10,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-07-18 00:24:10,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2020-07-18 00:24:10,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:24:10,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 158 states. [2020-07-18 00:24:10,782 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 158 states. [2020-07-18 00:24:10,782 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 158 states. [2020-07-18 00:24:10,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:10,789 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2020-07-18 00:24:10,789 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2020-07-18 00:24:10,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:10,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:10,790 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 158 states. [2020-07-18 00:24:10,791 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 158 states. [2020-07-18 00:24:10,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:10,796 INFO L93 Difference]: Finished difference Result 158 states and 169 transitions. [2020-07-18 00:24:10,796 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2020-07-18 00:24:10,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:10,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:10,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:24:10,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:24:10,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-07-18 00:24:10,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 169 transitions. [2020-07-18 00:24:10,803 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 169 transitions. Word has length 44 [2020-07-18 00:24:10,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:24:10,803 INFO L479 AbstractCegarLoop]: Abstraction has 158 states and 169 transitions. [2020-07-18 00:24:10,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:24:10,805 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 158 states and 169 transitions. [2020-07-18 00:24:11,118 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:11,119 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 169 transitions. [2020-07-18 00:24:11,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-18 00:24:11,120 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:24:11,120 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:24:11,120 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-18 00:24:11,120 INFO L427 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:24:11,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:24:11,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1203451366, now seen corresponding path program 1 times [2020-07-18 00:24:11,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:24:11,124 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [386661429] [2020-07-18 00:24:11,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:24:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:11,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:11,454 INFO L280 TraceCheckUtils]: 0: Hoare triple {10534#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {10519#true} is VALID [2020-07-18 00:24:11,454 INFO L280 TraceCheckUtils]: 1: Hoare triple {10519#true} #valid := #valid[0 := 0]; {10519#true} is VALID [2020-07-18 00:24:11,455 INFO L280 TraceCheckUtils]: 2: Hoare triple {10519#true} assume 0 < #StackHeapBarrier; {10519#true} is VALID [2020-07-18 00:24:11,455 INFO L280 TraceCheckUtils]: 3: Hoare triple {10519#true} assume true; {10519#true} is VALID [2020-07-18 00:24:11,455 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {10519#true} {10519#true} #419#return; {10519#true} is VALID [2020-07-18 00:24:11,457 INFO L263 TraceCheckUtils]: 0: Hoare triple {10519#true} call ULTIMATE.init(); {10534#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:24:11,457 INFO L280 TraceCheckUtils]: 1: Hoare triple {10534#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {10519#true} is VALID [2020-07-18 00:24:11,458 INFO L280 TraceCheckUtils]: 2: Hoare triple {10519#true} #valid := #valid[0 := 0]; {10519#true} is VALID [2020-07-18 00:24:11,458 INFO L280 TraceCheckUtils]: 3: Hoare triple {10519#true} assume 0 < #StackHeapBarrier; {10519#true} is VALID [2020-07-18 00:24:11,458 INFO L280 TraceCheckUtils]: 4: Hoare triple {10519#true} assume true; {10519#true} is VALID [2020-07-18 00:24:11,459 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {10519#true} {10519#true} #419#return; {10519#true} is VALID [2020-07-18 00:24:11,459 INFO L263 TraceCheckUtils]: 6: Hoare triple {10519#true} call #t~ret28 := main(); {10519#true} is VALID [2020-07-18 00:24:11,462 INFO L280 TraceCheckUtils]: 7: Hoare triple {10519#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {10526#(= 0 |main_#t~malloc0.offset|)} is VALID [2020-07-18 00:24:11,463 INFO L280 TraceCheckUtils]: 8: Hoare triple {10526#(= 0 |main_#t~malloc0.offset|)} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {10527#(= 0 main_~list~0.offset)} is VALID [2020-07-18 00:24:11,464 INFO L280 TraceCheckUtils]: 9: Hoare triple {10527#(= 0 main_~list~0.offset)} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {10527#(= 0 main_~list~0.offset)} is VALID [2020-07-18 00:24:11,467 INFO L280 TraceCheckUtils]: 10: Hoare triple {10527#(= 0 main_~list~0.offset)} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {10527#(= 0 main_~list~0.offset)} is VALID [2020-07-18 00:24:11,468 INFO L280 TraceCheckUtils]: 11: Hoare triple {10527#(= 0 main_~list~0.offset)} goto; {10527#(= 0 main_~list~0.offset)} is VALID [2020-07-18 00:24:11,468 INFO L280 TraceCheckUtils]: 12: Hoare triple {10527#(= 0 main_~list~0.offset)} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {10527#(= 0 main_~list~0.offset)} is VALID [2020-07-18 00:24:11,469 INFO L280 TraceCheckUtils]: 13: Hoare triple {10527#(= 0 main_~list~0.offset)} assume 0 != #t~nondet1; {10527#(= 0 main_~list~0.offset)} is VALID [2020-07-18 00:24:11,470 INFO L280 TraceCheckUtils]: 14: Hoare triple {10527#(= 0 main_~list~0.offset)} havoc #t~nondet1; {10527#(= 0 main_~list~0.offset)} is VALID [2020-07-18 00:24:11,471 INFO L280 TraceCheckUtils]: 15: Hoare triple {10527#(= 0 main_~list~0.offset)} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {10527#(= 0 main_~list~0.offset)} is VALID [2020-07-18 00:24:11,472 INFO L280 TraceCheckUtils]: 16: Hoare triple {10527#(= 0 main_~list~0.offset)} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {10528#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|))} is VALID [2020-07-18 00:24:11,474 INFO L280 TraceCheckUtils]: 17: Hoare triple {10528#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {10529#(and (or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))) (= 0 main_~list~0.offset))} is VALID [2020-07-18 00:24:11,475 INFO L280 TraceCheckUtils]: 18: Hoare triple {10529#(and (or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))) (= 0 main_~list~0.offset))} assume !#t~short7; {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:11,477 INFO L280 TraceCheckUtils]: 19: Hoare triple {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:11,478 INFO L280 TraceCheckUtils]: 20: Hoare triple {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:11,479 INFO L280 TraceCheckUtils]: 21: Hoare triple {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!#t~short7; {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:11,480 INFO L280 TraceCheckUtils]: 22: Hoare triple {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem5.base, #t~mem5.offset; {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:11,482 INFO L280 TraceCheckUtils]: 23: Hoare triple {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~short7; {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:11,483 INFO L280 TraceCheckUtils]: 24: Hoare triple {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem6.base, #t~mem6.offset; {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:11,484 INFO L280 TraceCheckUtils]: 25: Hoare triple {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} goto; {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:11,485 INFO L280 TraceCheckUtils]: 26: Hoare triple {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:11,486 INFO L280 TraceCheckUtils]: 27: Hoare triple {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:11,487 INFO L280 TraceCheckUtils]: 28: Hoare triple {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != #t~nondet8); {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:11,487 INFO L280 TraceCheckUtils]: 29: Hoare triple {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~nondet8; {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:11,488 INFO L280 TraceCheckUtils]: 30: Hoare triple {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := 0, 0; {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:11,489 INFO L280 TraceCheckUtils]: 31: Hoare triple {10530#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {10531#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-18 00:24:11,490 INFO L280 TraceCheckUtils]: 32: Hoare triple {10531#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {10531#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-18 00:24:11,491 INFO L280 TraceCheckUtils]: 33: Hoare triple {10531#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} goto; {10531#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-18 00:24:11,493 INFO L280 TraceCheckUtils]: 34: Hoare triple {10531#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {10531#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-18 00:24:11,494 INFO L280 TraceCheckUtils]: 35: Hoare triple {10531#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} ~len~0 := 0; {10531#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-18 00:24:11,495 INFO L280 TraceCheckUtils]: 36: Hoare triple {10531#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 main_~end~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {10532#(and (= 0 |main_#t~mem18.offset|) (= 0 |main_#t~mem18.base|))} is VALID [2020-07-18 00:24:11,496 INFO L280 TraceCheckUtils]: 37: Hoare triple {10532#(and (= 0 |main_#t~mem18.offset|) (= 0 |main_#t~mem18.base|))} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {10533#(and (= 0 main_~inner~0.base) (= 0 main_~inner~0.offset))} is VALID [2020-07-18 00:24:11,497 INFO L280 TraceCheckUtils]: 38: Hoare triple {10533#(and (= 0 main_~inner~0.base) (= 0 main_~inner~0.offset))} havoc #t~mem18.base, #t~mem18.offset; {10533#(and (= 0 main_~inner~0.base) (= 0 main_~inner~0.offset))} is VALID [2020-07-18 00:24:11,498 INFO L280 TraceCheckUtils]: 39: Hoare triple {10533#(and (= 0 main_~inner~0.base) (= 0 main_~inner~0.offset))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {10520#false} is VALID [2020-07-18 00:24:11,499 INFO L280 TraceCheckUtils]: 40: Hoare triple {10520#false} assume 0 == ~len~0; {10520#false} is VALID [2020-07-18 00:24:11,499 INFO L280 TraceCheckUtils]: 41: Hoare triple {10520#false} ~len~0 := 1; {10520#false} is VALID [2020-07-18 00:24:11,499 INFO L280 TraceCheckUtils]: 42: Hoare triple {10520#false} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {10520#false} is VALID [2020-07-18 00:24:11,500 INFO L280 TraceCheckUtils]: 43: Hoare triple {10520#false} goto; {10520#false} is VALID [2020-07-18 00:24:11,500 INFO L280 TraceCheckUtils]: 44: Hoare triple {10520#false} SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); srcloc: L1025-6 {10520#false} is VALID [2020-07-18 00:24:11,500 INFO L280 TraceCheckUtils]: 45: Hoare triple {10520#false} assume !(0 == #t~mem19.base && 0 == #t~mem19.offset); {10520#false} is VALID [2020-07-18 00:24:11,501 INFO L280 TraceCheckUtils]: 46: Hoare triple {10520#false} havoc #t~mem19.base, #t~mem19.offset; {10520#false} is VALID [2020-07-18 00:24:11,501 INFO L280 TraceCheckUtils]: 47: Hoare triple {10520#false} assume !false; {10520#false} is VALID [2020-07-18 00:24:11,515 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:24:11,519 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:24:11,519 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [386661429] [2020-07-18 00:24:11,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:24:11,520 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-18 00:24:11,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678283064] [2020-07-18 00:24:11,521 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2020-07-18 00:24:11,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:24:11,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-18 00:24:11,591 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:11,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-18 00:24:11,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:24:11,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-18 00:24:11,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2020-07-18 00:24:11,593 INFO L87 Difference]: Start difference. First operand 158 states and 169 transitions. Second operand 11 states. [2020-07-18 00:24:15,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:15,650 INFO L93 Difference]: Finished difference Result 398 states and 427 transitions. [2020-07-18 00:24:15,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-18 00:24:15,651 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 48 [2020-07-18 00:24:15,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:24:15,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 00:24:15,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 415 transitions. [2020-07-18 00:24:15,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-18 00:24:15,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 415 transitions. [2020-07-18 00:24:15,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 415 transitions. [2020-07-18 00:24:16,210 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 415 edges. 415 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:16,221 INFO L225 Difference]: With dead ends: 398 [2020-07-18 00:24:16,221 INFO L226 Difference]: Without dead ends: 326 [2020-07-18 00:24:16,224 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2020-07-18 00:24:16,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2020-07-18 00:24:17,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 204. [2020-07-18 00:24:17,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:24:17,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 326 states. Second operand 204 states. [2020-07-18 00:24:17,116 INFO L74 IsIncluded]: Start isIncluded. First operand 326 states. Second operand 204 states. [2020-07-18 00:24:17,116 INFO L87 Difference]: Start difference. First operand 326 states. Second operand 204 states. [2020-07-18 00:24:17,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:17,128 INFO L93 Difference]: Finished difference Result 326 states and 348 transitions. [2020-07-18 00:24:17,128 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 348 transitions. [2020-07-18 00:24:17,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:17,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:17,129 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand 326 states. [2020-07-18 00:24:17,129 INFO L87 Difference]: Start difference. First operand 204 states. Second operand 326 states. [2020-07-18 00:24:17,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:17,138 INFO L93 Difference]: Finished difference Result 326 states and 348 transitions. [2020-07-18 00:24:17,139 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 348 transitions. [2020-07-18 00:24:17,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:17,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:17,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:24:17,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:24:17,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2020-07-18 00:24:17,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 220 transitions. [2020-07-18 00:24:17,147 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 220 transitions. Word has length 48 [2020-07-18 00:24:17,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:24:17,147 INFO L479 AbstractCegarLoop]: Abstraction has 204 states and 220 transitions. [2020-07-18 00:24:17,148 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-18 00:24:17,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 204 states and 220 transitions. [2020-07-18 00:24:17,615 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 220 edges. 220 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:17,615 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 220 transitions. [2020-07-18 00:24:17,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-18 00:24:17,616 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:24:17,617 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:24:17,617 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-18 00:24:17,617 INFO L427 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:24:17,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:24:17,618 INFO L82 PathProgramCache]: Analyzing trace with hash 2069783995, now seen corresponding path program 1 times [2020-07-18 00:24:17,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:24:17,618 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1841603956] [2020-07-18 00:24:17,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:24:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:17,679 INFO L280 TraceCheckUtils]: 0: Hoare triple {12427#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {12419#true} is VALID [2020-07-18 00:24:17,680 INFO L280 TraceCheckUtils]: 1: Hoare triple {12419#true} #valid := #valid[0 := 0]; {12419#true} is VALID [2020-07-18 00:24:17,680 INFO L280 TraceCheckUtils]: 2: Hoare triple {12419#true} assume 0 < #StackHeapBarrier; {12419#true} is VALID [2020-07-18 00:24:17,680 INFO L280 TraceCheckUtils]: 3: Hoare triple {12419#true} assume true; {12419#true} is VALID [2020-07-18 00:24:17,680 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {12419#true} {12419#true} #419#return; {12419#true} is VALID [2020-07-18 00:24:17,681 INFO L263 TraceCheckUtils]: 0: Hoare triple {12419#true} call ULTIMATE.init(); {12427#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:24:17,681 INFO L280 TraceCheckUtils]: 1: Hoare triple {12427#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {12419#true} is VALID [2020-07-18 00:24:17,681 INFO L280 TraceCheckUtils]: 2: Hoare triple {12419#true} #valid := #valid[0 := 0]; {12419#true} is VALID [2020-07-18 00:24:17,681 INFO L280 TraceCheckUtils]: 3: Hoare triple {12419#true} assume 0 < #StackHeapBarrier; {12419#true} is VALID [2020-07-18 00:24:17,681 INFO L280 TraceCheckUtils]: 4: Hoare triple {12419#true} assume true; {12419#true} is VALID [2020-07-18 00:24:17,682 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {12419#true} {12419#true} #419#return; {12419#true} is VALID [2020-07-18 00:24:17,682 INFO L263 TraceCheckUtils]: 6: Hoare triple {12419#true} call #t~ret28 := main(); {12419#true} is VALID [2020-07-18 00:24:17,682 INFO L280 TraceCheckUtils]: 7: Hoare triple {12419#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {12419#true} is VALID [2020-07-18 00:24:17,682 INFO L280 TraceCheckUtils]: 8: Hoare triple {12419#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {12419#true} is VALID [2020-07-18 00:24:17,682 INFO L280 TraceCheckUtils]: 9: Hoare triple {12419#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {12419#true} is VALID [2020-07-18 00:24:17,682 INFO L280 TraceCheckUtils]: 10: Hoare triple {12419#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {12419#true} is VALID [2020-07-18 00:24:17,683 INFO L280 TraceCheckUtils]: 11: Hoare triple {12419#true} goto; {12419#true} is VALID [2020-07-18 00:24:17,683 INFO L280 TraceCheckUtils]: 12: Hoare triple {12419#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {12419#true} is VALID [2020-07-18 00:24:17,683 INFO L280 TraceCheckUtils]: 13: Hoare triple {12419#true} assume 0 != #t~nondet1; {12419#true} is VALID [2020-07-18 00:24:17,683 INFO L280 TraceCheckUtils]: 14: Hoare triple {12419#true} havoc #t~nondet1; {12419#true} is VALID [2020-07-18 00:24:17,683 INFO L280 TraceCheckUtils]: 15: Hoare triple {12419#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {12419#true} is VALID [2020-07-18 00:24:17,684 INFO L280 TraceCheckUtils]: 16: Hoare triple {12419#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {12419#true} is VALID [2020-07-18 00:24:17,684 INFO L280 TraceCheckUtils]: 17: Hoare triple {12419#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {12419#true} is VALID [2020-07-18 00:24:17,684 INFO L280 TraceCheckUtils]: 18: Hoare triple {12419#true} assume !#t~short7; {12419#true} is VALID [2020-07-18 00:24:17,684 INFO L280 TraceCheckUtils]: 19: Hoare triple {12419#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {12419#true} is VALID [2020-07-18 00:24:17,684 INFO L280 TraceCheckUtils]: 20: Hoare triple {12419#true} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {12419#true} is VALID [2020-07-18 00:24:17,685 INFO L280 TraceCheckUtils]: 21: Hoare triple {12419#true} assume !!#t~short7; {12419#true} is VALID [2020-07-18 00:24:17,685 INFO L280 TraceCheckUtils]: 22: Hoare triple {12419#true} havoc #t~mem5.base, #t~mem5.offset; {12419#true} is VALID [2020-07-18 00:24:17,685 INFO L280 TraceCheckUtils]: 23: Hoare triple {12419#true} havoc #t~short7; {12419#true} is VALID [2020-07-18 00:24:17,685 INFO L280 TraceCheckUtils]: 24: Hoare triple {12419#true} havoc #t~mem6.base, #t~mem6.offset; {12419#true} is VALID [2020-07-18 00:24:17,685 INFO L280 TraceCheckUtils]: 25: Hoare triple {12419#true} goto; {12419#true} is VALID [2020-07-18 00:24:17,686 INFO L280 TraceCheckUtils]: 26: Hoare triple {12419#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {12419#true} is VALID [2020-07-18 00:24:17,686 INFO L280 TraceCheckUtils]: 27: Hoare triple {12419#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {12419#true} is VALID [2020-07-18 00:24:17,686 INFO L280 TraceCheckUtils]: 28: Hoare triple {12419#true} assume !!(0 != #t~nondet8); {12419#true} is VALID [2020-07-18 00:24:17,686 INFO L280 TraceCheckUtils]: 29: Hoare triple {12419#true} havoc #t~nondet8; {12419#true} is VALID [2020-07-18 00:24:17,687 INFO L280 TraceCheckUtils]: 30: Hoare triple {12419#true} SUMMARY for call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(8); srcloc: L1001 {12419#true} is VALID [2020-07-18 00:24:17,688 INFO L280 TraceCheckUtils]: 31: Hoare triple {12419#true} SUMMARY for call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1001-1 {12419#true} is VALID [2020-07-18 00:24:17,688 INFO L280 TraceCheckUtils]: 32: Hoare triple {12419#true} SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1001-2 {12419#true} is VALID [2020-07-18 00:24:17,691 INFO L280 TraceCheckUtils]: 33: Hoare triple {12419#true} ~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset; {12419#true} is VALID [2020-07-18 00:24:17,692 INFO L280 TraceCheckUtils]: 34: Hoare triple {12419#true} havoc #t~mem10.base, #t~mem10.offset; {12419#true} is VALID [2020-07-18 00:24:17,692 INFO L280 TraceCheckUtils]: 35: Hoare triple {12419#true} SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); srcloc: L1003 {12419#true} is VALID [2020-07-18 00:24:17,692 INFO L280 TraceCheckUtils]: 36: Hoare triple {12419#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {12419#true} is VALID [2020-07-18 00:24:17,692 INFO L280 TraceCheckUtils]: 37: Hoare triple {12419#true} goto; {12419#true} is VALID [2020-07-18 00:24:17,693 INFO L280 TraceCheckUtils]: 38: Hoare triple {12419#true} assume !!(~end~0.base != 0 || ~end~0.offset != 0); {12419#true} is VALID [2020-07-18 00:24:17,693 INFO L280 TraceCheckUtils]: 39: Hoare triple {12419#true} goto; {12419#true} is VALID [2020-07-18 00:24:17,695 INFO L280 TraceCheckUtils]: 40: Hoare triple {12419#true} assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; {12419#true} is VALID [2020-07-18 00:24:17,695 INFO L280 TraceCheckUtils]: 41: Hoare triple {12419#true} assume 0 != #t~nondet11; {12419#true} is VALID [2020-07-18 00:24:17,696 INFO L280 TraceCheckUtils]: 42: Hoare triple {12419#true} havoc #t~nondet11; {12419#true} is VALID [2020-07-18 00:24:17,696 INFO L280 TraceCheckUtils]: 43: Hoare triple {12419#true} SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1005-7 {12419#true} is VALID [2020-07-18 00:24:17,698 INFO L280 TraceCheckUtils]: 44: Hoare triple {12419#true} SUMMARY for call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1005-34 {12419#true} is VALID [2020-07-18 00:24:17,699 INFO L280 TraceCheckUtils]: 45: Hoare triple {12419#true} #t~short17 := #t~mem15.base != 0 || #t~mem15.offset != 0; {12419#true} is VALID [2020-07-18 00:24:17,706 INFO L280 TraceCheckUtils]: 46: Hoare triple {12419#true} assume #t~short17; {12426#|main_#t~short17|} is VALID [2020-07-18 00:24:17,707 INFO L280 TraceCheckUtils]: 47: Hoare triple {12426#|main_#t~short17|} assume !#t~short17; {12420#false} is VALID [2020-07-18 00:24:17,707 INFO L280 TraceCheckUtils]: 48: Hoare triple {12420#false} havoc #t~mem16.base, #t~mem16.offset; {12420#false} is VALID [2020-07-18 00:24:17,707 INFO L280 TraceCheckUtils]: 49: Hoare triple {12420#false} havoc #t~short17; {12420#false} is VALID [2020-07-18 00:24:17,708 INFO L280 TraceCheckUtils]: 50: Hoare triple {12420#false} havoc #t~mem15.base, #t~mem15.offset; {12420#false} is VALID [2020-07-18 00:24:17,708 INFO L280 TraceCheckUtils]: 51: Hoare triple {12420#false} assume !false; {12420#false} is VALID [2020-07-18 00:24:17,713 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:24:17,713 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:24:17,714 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1841603956] [2020-07-18 00:24:17,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:24:17,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:24:17,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516755444] [2020-07-18 00:24:17,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-07-18 00:24:17,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:24:17,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:24:17,759 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:17,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:24:17,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:24:17,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:24:17,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:24:17,760 INFO L87 Difference]: Start difference. First operand 204 states and 220 transitions. Second operand 4 states. [2020-07-18 00:24:19,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:19,014 INFO L93 Difference]: Finished difference Result 211 states and 228 transitions. [2020-07-18 00:24:19,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 00:24:19,014 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2020-07-18 00:24:19,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:24:19,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:24:19,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2020-07-18 00:24:19,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:24:19,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2020-07-18 00:24:19,019 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 167 transitions. [2020-07-18 00:24:19,188 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:19,192 INFO L225 Difference]: With dead ends: 211 [2020-07-18 00:24:19,192 INFO L226 Difference]: Without dead ends: 206 [2020-07-18 00:24:19,192 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:24:19,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-07-18 00:24:19,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2020-07-18 00:24:19,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:24:19,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand 206 states. [2020-07-18 00:24:19,974 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 206 states. [2020-07-18 00:24:19,974 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 206 states. [2020-07-18 00:24:19,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:19,979 INFO L93 Difference]: Finished difference Result 206 states and 222 transitions. [2020-07-18 00:24:19,979 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 222 transitions. [2020-07-18 00:24:19,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:19,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:19,980 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 206 states. [2020-07-18 00:24:19,980 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 206 states. [2020-07-18 00:24:19,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:19,984 INFO L93 Difference]: Finished difference Result 206 states and 222 transitions. [2020-07-18 00:24:19,985 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 222 transitions. [2020-07-18 00:24:19,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:19,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:19,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:24:19,986 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:24:19,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2020-07-18 00:24:19,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 222 transitions. [2020-07-18 00:24:19,990 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 222 transitions. Word has length 52 [2020-07-18 00:24:19,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:24:19,990 INFO L479 AbstractCegarLoop]: Abstraction has 206 states and 222 transitions. [2020-07-18 00:24:19,990 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:24:19,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 206 states and 222 transitions. [2020-07-18 00:24:20,464 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 222 edges. 222 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:20,464 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 222 transitions. [2020-07-18 00:24:20,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-18 00:24:20,465 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:24:20,465 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:24:20,465 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-18 00:24:20,465 INFO L427 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:24:20,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:24:20,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1565892499, now seen corresponding path program 1 times [2020-07-18 00:24:20,466 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:24:20,466 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1669451955] [2020-07-18 00:24:20,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:24:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:21,048 INFO L280 TraceCheckUtils]: 0: Hoare triple {13694#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {13676#true} is VALID [2020-07-18 00:24:21,049 INFO L280 TraceCheckUtils]: 1: Hoare triple {13676#true} #valid := #valid[0 := 0]; {13676#true} is VALID [2020-07-18 00:24:21,049 INFO L280 TraceCheckUtils]: 2: Hoare triple {13676#true} assume 0 < #StackHeapBarrier; {13676#true} is VALID [2020-07-18 00:24:21,049 INFO L280 TraceCheckUtils]: 3: Hoare triple {13676#true} assume true; {13676#true} is VALID [2020-07-18 00:24:21,049 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {13676#true} {13676#true} #419#return; {13676#true} is VALID [2020-07-18 00:24:21,050 INFO L263 TraceCheckUtils]: 0: Hoare triple {13676#true} call ULTIMATE.init(); {13694#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:24:21,051 INFO L280 TraceCheckUtils]: 1: Hoare triple {13694#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {13676#true} is VALID [2020-07-18 00:24:21,051 INFO L280 TraceCheckUtils]: 2: Hoare triple {13676#true} #valid := #valid[0 := 0]; {13676#true} is VALID [2020-07-18 00:24:21,051 INFO L280 TraceCheckUtils]: 3: Hoare triple {13676#true} assume 0 < #StackHeapBarrier; {13676#true} is VALID [2020-07-18 00:24:21,051 INFO L280 TraceCheckUtils]: 4: Hoare triple {13676#true} assume true; {13676#true} is VALID [2020-07-18 00:24:21,051 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {13676#true} {13676#true} #419#return; {13676#true} is VALID [2020-07-18 00:24:21,052 INFO L263 TraceCheckUtils]: 6: Hoare triple {13676#true} call #t~ret28 := main(); {13676#true} is VALID [2020-07-18 00:24:21,053 INFO L280 TraceCheckUtils]: 7: Hoare triple {13676#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {13683#(and (= 1 (select |#valid| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|))} is VALID [2020-07-18 00:24:21,054 INFO L280 TraceCheckUtils]: 8: Hoare triple {13683#(and (= 1 (select |#valid| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|))} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {13684#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-18 00:24:21,055 INFO L280 TraceCheckUtils]: 9: Hoare triple {13684#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {13684#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-18 00:24:21,055 INFO L280 TraceCheckUtils]: 10: Hoare triple {13684#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {13684#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-18 00:24:21,056 INFO L280 TraceCheckUtils]: 11: Hoare triple {13684#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} goto; {13684#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-18 00:24:21,057 INFO L280 TraceCheckUtils]: 12: Hoare triple {13684#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {13684#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-18 00:24:21,057 INFO L280 TraceCheckUtils]: 13: Hoare triple {13684#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} assume !(0 != #t~nondet1); {13684#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-18 00:24:21,058 INFO L280 TraceCheckUtils]: 14: Hoare triple {13684#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} havoc #t~nondet1; {13684#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} is VALID [2020-07-18 00:24:21,059 INFO L280 TraceCheckUtils]: 15: Hoare triple {13684#(and (= 0 main_~list~0.offset) (= 1 (select |#valid| main_~list~0.base)))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: L993-10 {13685#(and (= 0 |main_#t~malloc2.offset|) (= 0 main_~list~0.offset) (not (= |main_#t~malloc2.base| main_~list~0.base)))} is VALID [2020-07-18 00:24:21,060 INFO L280 TraceCheckUtils]: 16: Hoare triple {13685#(and (= 0 |main_#t~malloc2.offset|) (= 0 main_~list~0.offset) (not (= |main_#t~malloc2.base| main_~list~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-11 {13686#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} is VALID [2020-07-18 00:24:21,061 INFO L280 TraceCheckUtils]: 17: Hoare triple {13686#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-12 {13687#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem3.base|) (not (= |main_#t~mem3.base| main_~list~0.base)))} is VALID [2020-07-18 00:24:21,062 INFO L280 TraceCheckUtils]: 18: Hoare triple {13687#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem3.base|) (not (= |main_#t~mem3.base| main_~list~0.base)))} SUMMARY for call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); srcloc: L993-13 {13686#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} is VALID [2020-07-18 00:24:21,063 INFO L280 TraceCheckUtils]: 19: Hoare triple {13686#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} havoc #t~mem3.base, #t~mem3.offset; {13686#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} is VALID [2020-07-18 00:24:21,064 INFO L280 TraceCheckUtils]: 20: Hoare triple {13686#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-15 {13688#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (not (= |main_#t~mem4.base| main_~list~0.base)) (= 0 |main_#t~mem4.offset|) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem4.base|))} is VALID [2020-07-18 00:24:21,066 INFO L280 TraceCheckUtils]: 21: Hoare triple {13688#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (not (= |main_#t~mem4.base| main_~list~0.base)) (= 0 |main_#t~mem4.offset|) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem4.base|))} SUMMARY for call write~$Pointer$(0, 0, #t~mem4.base, 4 + #t~mem4.offset, 4); srcloc: L993-16 {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:21,068 INFO L280 TraceCheckUtils]: 22: Hoare triple {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} havoc #t~mem4.base, #t~mem4.offset; {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:21,070 INFO L280 TraceCheckUtils]: 23: Hoare triple {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:21,071 INFO L280 TraceCheckUtils]: 24: Hoare triple {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:21,072 INFO L280 TraceCheckUtils]: 25: Hoare triple {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} assume #t~short7; {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:21,073 INFO L280 TraceCheckUtils]: 26: Hoare triple {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} assume !!#t~short7; {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:21,073 INFO L280 TraceCheckUtils]: 27: Hoare triple {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} havoc #t~mem5.base, #t~mem5.offset; {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:21,075 INFO L280 TraceCheckUtils]: 28: Hoare triple {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} havoc #t~short7; {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:21,075 INFO L280 TraceCheckUtils]: 29: Hoare triple {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} havoc #t~mem6.base, #t~mem6.offset; {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:21,076 INFO L280 TraceCheckUtils]: 30: Hoare triple {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} goto; {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:21,077 INFO L280 TraceCheckUtils]: 31: Hoare triple {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:21,078 INFO L280 TraceCheckUtils]: 32: Hoare triple {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:21,079 INFO L280 TraceCheckUtils]: 33: Hoare triple {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} assume !(0 != #t~nondet8); {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:21,080 INFO L280 TraceCheckUtils]: 34: Hoare triple {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} havoc #t~nondet8; {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:21,081 INFO L280 TraceCheckUtils]: 35: Hoare triple {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := 0, 0; {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:21,082 INFO L280 TraceCheckUtils]: 36: Hoare triple {13689#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 main_~list~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {13690#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} is VALID [2020-07-18 00:24:21,083 INFO L280 TraceCheckUtils]: 37: Hoare triple {13690#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {13690#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} is VALID [2020-07-18 00:24:21,084 INFO L280 TraceCheckUtils]: 38: Hoare triple {13690#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} goto; {13690#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} is VALID [2020-07-18 00:24:21,084 INFO L280 TraceCheckUtils]: 39: Hoare triple {13690#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {13690#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} is VALID [2020-07-18 00:24:21,085 INFO L280 TraceCheckUtils]: 40: Hoare triple {13690#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} ~len~0 := 0; {13690#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} is VALID [2020-07-18 00:24:21,086 INFO L280 TraceCheckUtils]: 41: Hoare triple {13690#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 4) 0))} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {13691#(and (= 0 |main_#t~mem18.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) 4)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) 4)))} is VALID [2020-07-18 00:24:21,087 INFO L280 TraceCheckUtils]: 42: Hoare triple {13691#(and (= 0 |main_#t~mem18.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) 4)) (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) 4)))} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {13692#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} is VALID [2020-07-18 00:24:21,088 INFO L280 TraceCheckUtils]: 43: Hoare triple {13692#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} havoc #t~mem18.base, #t~mem18.offset; {13692#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} is VALID [2020-07-18 00:24:21,088 INFO L280 TraceCheckUtils]: 44: Hoare triple {13692#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {13692#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} is VALID [2020-07-18 00:24:21,089 INFO L280 TraceCheckUtils]: 45: Hoare triple {13692#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} assume 0 == ~len~0; {13692#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} is VALID [2020-07-18 00:24:21,090 INFO L280 TraceCheckUtils]: 46: Hoare triple {13692#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} ~len~0 := 1; {13692#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} is VALID [2020-07-18 00:24:21,090 INFO L280 TraceCheckUtils]: 47: Hoare triple {13692#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {13692#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} is VALID [2020-07-18 00:24:21,091 INFO L280 TraceCheckUtils]: 48: Hoare triple {13692#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} goto; {13692#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} is VALID [2020-07-18 00:24:21,092 INFO L280 TraceCheckUtils]: 49: Hoare triple {13692#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) (+ main_~inner~0.offset 4))) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) (+ main_~inner~0.offset 4))))} SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); srcloc: L1025-6 {13693#(and (= 0 |main_#t~mem19.offset|) (= 0 |main_#t~mem19.base|))} is VALID [2020-07-18 00:24:21,093 INFO L280 TraceCheckUtils]: 50: Hoare triple {13693#(and (= 0 |main_#t~mem19.offset|) (= 0 |main_#t~mem19.base|))} assume !(0 == #t~mem19.base && 0 == #t~mem19.offset); {13677#false} is VALID [2020-07-18 00:24:21,093 INFO L280 TraceCheckUtils]: 51: Hoare triple {13677#false} havoc #t~mem19.base, #t~mem19.offset; {13677#false} is VALID [2020-07-18 00:24:21,093 INFO L280 TraceCheckUtils]: 52: Hoare triple {13677#false} assume !false; {13677#false} is VALID [2020-07-18 00:24:21,103 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:24:21,107 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:24:21,107 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1669451955] [2020-07-18 00:24:21,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:24:21,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-18 00:24:21,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797653267] [2020-07-18 00:24:21,108 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2020-07-18 00:24:21,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:24:21,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-18 00:24:21,186 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:21,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-18 00:24:21,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:24:21,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-18 00:24:21,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2020-07-18 00:24:21,188 INFO L87 Difference]: Start difference. First operand 206 states and 222 transitions. Second operand 14 states. [2020-07-18 00:24:31,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:31,408 INFO L93 Difference]: Finished difference Result 636 states and 681 transitions. [2020-07-18 00:24:31,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-07-18 00:24:31,409 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 53 [2020-07-18 00:24:31,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:24:31,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-18 00:24:31,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 556 transitions. [2020-07-18 00:24:31,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-18 00:24:31,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 556 transitions. [2020-07-18 00:24:31,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 556 transitions. [2020-07-18 00:24:32,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 556 edges. 556 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:32,380 INFO L225 Difference]: With dead ends: 636 [2020-07-18 00:24:32,381 INFO L226 Difference]: Without dead ends: 633 [2020-07-18 00:24:32,381 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=252, Invalid=804, Unknown=0, NotChecked=0, Total=1056 [2020-07-18 00:24:32,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2020-07-18 00:24:33,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 225. [2020-07-18 00:24:33,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:24:33,845 INFO L82 GeneralOperation]: Start isEquivalent. First operand 633 states. Second operand 225 states. [2020-07-18 00:24:33,846 INFO L74 IsIncluded]: Start isIncluded. First operand 633 states. Second operand 225 states. [2020-07-18 00:24:33,846 INFO L87 Difference]: Start difference. First operand 633 states. Second operand 225 states. [2020-07-18 00:24:33,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:33,868 INFO L93 Difference]: Finished difference Result 633 states and 678 transitions. [2020-07-18 00:24:33,868 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 678 transitions. [2020-07-18 00:24:33,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:33,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:33,870 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand 633 states. [2020-07-18 00:24:33,870 INFO L87 Difference]: Start difference. First operand 225 states. Second operand 633 states. [2020-07-18 00:24:33,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:33,890 INFO L93 Difference]: Finished difference Result 633 states and 678 transitions. [2020-07-18 00:24:33,890 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 678 transitions. [2020-07-18 00:24:33,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:33,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:33,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:24:33,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:24:33,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2020-07-18 00:24:33,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 243 transitions. [2020-07-18 00:24:33,895 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 243 transitions. Word has length 53 [2020-07-18 00:24:33,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:24:33,896 INFO L479 AbstractCegarLoop]: Abstraction has 225 states and 243 transitions. [2020-07-18 00:24:33,896 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-18 00:24:33,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 225 states and 243 transitions. [2020-07-18 00:24:34,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:34,629 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 243 transitions. [2020-07-18 00:24:34,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2020-07-18 00:24:34,631 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:24:34,631 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:24:34,631 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-18 00:24:34,631 INFO L427 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:24:34,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:24:34,632 INFO L82 PathProgramCache]: Analyzing trace with hash 991929043, now seen corresponding path program 1 times [2020-07-18 00:24:34,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:24:34,632 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [479752487] [2020-07-18 00:24:34,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:24:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:34,839 INFO L280 TraceCheckUtils]: 0: Hoare triple {16735#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {16723#true} is VALID [2020-07-18 00:24:34,840 INFO L280 TraceCheckUtils]: 1: Hoare triple {16723#true} #valid := #valid[0 := 0]; {16723#true} is VALID [2020-07-18 00:24:34,840 INFO L280 TraceCheckUtils]: 2: Hoare triple {16723#true} assume 0 < #StackHeapBarrier; {16723#true} is VALID [2020-07-18 00:24:34,840 INFO L280 TraceCheckUtils]: 3: Hoare triple {16723#true} assume true; {16723#true} is VALID [2020-07-18 00:24:34,840 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {16723#true} {16723#true} #419#return; {16723#true} is VALID [2020-07-18 00:24:34,841 INFO L263 TraceCheckUtils]: 0: Hoare triple {16723#true} call ULTIMATE.init(); {16735#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:24:34,842 INFO L280 TraceCheckUtils]: 1: Hoare triple {16735#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {16723#true} is VALID [2020-07-18 00:24:34,842 INFO L280 TraceCheckUtils]: 2: Hoare triple {16723#true} #valid := #valid[0 := 0]; {16723#true} is VALID [2020-07-18 00:24:34,842 INFO L280 TraceCheckUtils]: 3: Hoare triple {16723#true} assume 0 < #StackHeapBarrier; {16723#true} is VALID [2020-07-18 00:24:34,842 INFO L280 TraceCheckUtils]: 4: Hoare triple {16723#true} assume true; {16723#true} is VALID [2020-07-18 00:24:34,842 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {16723#true} {16723#true} #419#return; {16723#true} is VALID [2020-07-18 00:24:34,843 INFO L263 TraceCheckUtils]: 6: Hoare triple {16723#true} call #t~ret28 := main(); {16723#true} is VALID [2020-07-18 00:24:34,843 INFO L280 TraceCheckUtils]: 7: Hoare triple {16723#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {16723#true} is VALID [2020-07-18 00:24:34,843 INFO L280 TraceCheckUtils]: 8: Hoare triple {16723#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {16723#true} is VALID [2020-07-18 00:24:34,843 INFO L280 TraceCheckUtils]: 9: Hoare triple {16723#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {16723#true} is VALID [2020-07-18 00:24:34,844 INFO L280 TraceCheckUtils]: 10: Hoare triple {16723#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {16723#true} is VALID [2020-07-18 00:24:34,844 INFO L280 TraceCheckUtils]: 11: Hoare triple {16723#true} goto; {16723#true} is VALID [2020-07-18 00:24:34,844 INFO L280 TraceCheckUtils]: 12: Hoare triple {16723#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {16723#true} is VALID [2020-07-18 00:24:34,844 INFO L280 TraceCheckUtils]: 13: Hoare triple {16723#true} assume 0 != #t~nondet1; {16723#true} is VALID [2020-07-18 00:24:34,845 INFO L280 TraceCheckUtils]: 14: Hoare triple {16723#true} havoc #t~nondet1; {16723#true} is VALID [2020-07-18 00:24:34,845 INFO L280 TraceCheckUtils]: 15: Hoare triple {16723#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {16723#true} is VALID [2020-07-18 00:24:34,846 INFO L280 TraceCheckUtils]: 16: Hoare triple {16723#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {16730#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|))} is VALID [2020-07-18 00:24:34,847 INFO L280 TraceCheckUtils]: 17: Hoare triple {16730#(and (= |main_#t~mem5.offset| (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {16731#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))))} is VALID [2020-07-18 00:24:34,848 INFO L280 TraceCheckUtils]: 18: Hoare triple {16731#(or |main_#t~short7| (and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))))} assume !#t~short7; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:34,849 INFO L280 TraceCheckUtils]: 19: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:34,850 INFO L280 TraceCheckUtils]: 20: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:34,851 INFO L280 TraceCheckUtils]: 21: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!#t~short7; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:34,852 INFO L280 TraceCheckUtils]: 22: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem5.base, #t~mem5.offset; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:34,853 INFO L280 TraceCheckUtils]: 23: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~short7; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:34,853 INFO L280 TraceCheckUtils]: 24: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem6.base, #t~mem6.offset; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:34,854 INFO L280 TraceCheckUtils]: 25: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} goto; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:34,855 INFO L280 TraceCheckUtils]: 26: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:34,856 INFO L280 TraceCheckUtils]: 27: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:34,856 INFO L280 TraceCheckUtils]: 28: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != #t~nondet8); {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:34,857 INFO L280 TraceCheckUtils]: 29: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~nondet8; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:34,858 INFO L280 TraceCheckUtils]: 30: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := 0, 0; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:34,859 INFO L280 TraceCheckUtils]: 31: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:34,860 INFO L280 TraceCheckUtils]: 32: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:34,860 INFO L280 TraceCheckUtils]: 33: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} goto; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:34,861 INFO L280 TraceCheckUtils]: 34: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:34,862 INFO L280 TraceCheckUtils]: 35: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~len~0 := 0; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:34,863 INFO L280 TraceCheckUtils]: 36: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:34,864 INFO L280 TraceCheckUtils]: 37: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:34,865 INFO L280 TraceCheckUtils]: 38: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem18.base, #t~mem18.offset; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:34,866 INFO L280 TraceCheckUtils]: 39: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:34,866 INFO L280 TraceCheckUtils]: 40: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!(~len~0 <= 1); {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:34,867 INFO L280 TraceCheckUtils]: 41: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} goto; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:34,868 INFO L280 TraceCheckUtils]: 42: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1031-4 {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:34,869 INFO L280 TraceCheckUtils]: 43: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := #t~mem23.base, #t~mem23.offset; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:34,869 INFO L280 TraceCheckUtils]: 44: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem23.base, #t~mem23.offset; {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:34,870 INFO L280 TraceCheckUtils]: 45: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:34,871 INFO L280 TraceCheckUtils]: 46: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!(0 != ~list~0.base || 0 != ~list~0.offset); {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:34,872 INFO L280 TraceCheckUtils]: 47: Hoare triple {16732#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L1039 {16733#(and (= 0 |main_#t~mem24.offset|) (= 0 |main_#t~mem24.base|))} is VALID [2020-07-18 00:24:34,873 INFO L280 TraceCheckUtils]: 48: Hoare triple {16733#(and (= 0 |main_#t~mem24.offset|) (= 0 |main_#t~mem24.base|))} ~end~0.base, ~end~0.offset := #t~mem24.base, #t~mem24.offset; {16734#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} is VALID [2020-07-18 00:24:34,874 INFO L280 TraceCheckUtils]: 49: Hoare triple {16734#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} havoc #t~mem24.base, #t~mem24.offset; {16734#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} is VALID [2020-07-18 00:24:34,875 INFO L280 TraceCheckUtils]: 50: Hoare triple {16734#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} assume 0 != ~end~0.base || 0 != ~end~0.offset; {16724#false} is VALID [2020-07-18 00:24:34,875 INFO L280 TraceCheckUtils]: 51: Hoare triple {16724#false} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {16724#false} is VALID [2020-07-18 00:24:34,875 INFO L280 TraceCheckUtils]: 52: Hoare triple {16724#false} assume !false; {16724#false} is VALID [2020-07-18 00:24:34,884 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:24:34,889 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:24:34,889 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [479752487] [2020-07-18 00:24:34,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:24:34,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-18 00:24:34,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184202759] [2020-07-18 00:24:34,891 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2020-07-18 00:24:34,891 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:24:34,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 00:24:34,966 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:34,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 00:24:34,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:24:34,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 00:24:34,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:24:34,968 INFO L87 Difference]: Start difference. First operand 225 states and 243 transitions. Second operand 8 states. [2020-07-18 00:24:38,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:38,600 INFO L93 Difference]: Finished difference Result 321 states and 346 transitions. [2020-07-18 00:24:38,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-18 00:24:38,600 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2020-07-18 00:24:38,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:24:38,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:24:38,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 269 transitions. [2020-07-18 00:24:38,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:24:38,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 269 transitions. [2020-07-18 00:24:38,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 269 transitions. [2020-07-18 00:24:38,896 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 269 edges. 269 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:38,903 INFO L225 Difference]: With dead ends: 321 [2020-07-18 00:24:38,903 INFO L226 Difference]: Without dead ends: 291 [2020-07-18 00:24:38,904 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-07-18 00:24:38,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2020-07-18 00:24:40,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 275. [2020-07-18 00:24:40,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:24:40,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 291 states. Second operand 275 states. [2020-07-18 00:24:40,848 INFO L74 IsIncluded]: Start isIncluded. First operand 291 states. Second operand 275 states. [2020-07-18 00:24:40,848 INFO L87 Difference]: Start difference. First operand 291 states. Second operand 275 states. [2020-07-18 00:24:40,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:40,855 INFO L93 Difference]: Finished difference Result 291 states and 314 transitions. [2020-07-18 00:24:40,855 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 314 transitions. [2020-07-18 00:24:40,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:40,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:40,856 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand 291 states. [2020-07-18 00:24:40,856 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 291 states. [2020-07-18 00:24:40,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:40,863 INFO L93 Difference]: Finished difference Result 291 states and 314 transitions. [2020-07-18 00:24:40,863 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 314 transitions. [2020-07-18 00:24:40,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:40,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:40,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:24:40,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:24:40,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2020-07-18 00:24:40,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 301 transitions. [2020-07-18 00:24:40,870 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 301 transitions. Word has length 53 [2020-07-18 00:24:40,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:24:40,870 INFO L479 AbstractCegarLoop]: Abstraction has 275 states and 301 transitions. [2020-07-18 00:24:40,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 00:24:40,871 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 275 states and 301 transitions. [2020-07-18 00:24:41,827 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 301 edges. 301 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:41,827 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 301 transitions. [2020-07-18 00:24:41,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2020-07-18 00:24:41,828 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:24:41,828 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:24:41,829 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-18 00:24:41,829 INFO L427 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:24:41,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:24:41,829 INFO L82 PathProgramCache]: Analyzing trace with hash -604385608, now seen corresponding path program 1 times [2020-07-18 00:24:41,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:24:41,830 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [440471514] [2020-07-18 00:24:41,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:24:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:41,961 INFO L280 TraceCheckUtils]: 0: Hoare triple {18532#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {18520#true} is VALID [2020-07-18 00:24:41,962 INFO L280 TraceCheckUtils]: 1: Hoare triple {18520#true} #valid := #valid[0 := 0]; {18520#true} is VALID [2020-07-18 00:24:41,962 INFO L280 TraceCheckUtils]: 2: Hoare triple {18520#true} assume 0 < #StackHeapBarrier; {18520#true} is VALID [2020-07-18 00:24:41,962 INFO L280 TraceCheckUtils]: 3: Hoare triple {18520#true} assume true; {18520#true} is VALID [2020-07-18 00:24:41,962 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {18520#true} {18520#true} #419#return; {18520#true} is VALID [2020-07-18 00:24:41,965 INFO L263 TraceCheckUtils]: 0: Hoare triple {18520#true} call ULTIMATE.init(); {18532#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:24:41,965 INFO L280 TraceCheckUtils]: 1: Hoare triple {18532#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {18520#true} is VALID [2020-07-18 00:24:41,965 INFO L280 TraceCheckUtils]: 2: Hoare triple {18520#true} #valid := #valid[0 := 0]; {18520#true} is VALID [2020-07-18 00:24:41,965 INFO L280 TraceCheckUtils]: 3: Hoare triple {18520#true} assume 0 < #StackHeapBarrier; {18520#true} is VALID [2020-07-18 00:24:41,966 INFO L280 TraceCheckUtils]: 4: Hoare triple {18520#true} assume true; {18520#true} is VALID [2020-07-18 00:24:41,966 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {18520#true} {18520#true} #419#return; {18520#true} is VALID [2020-07-18 00:24:41,966 INFO L263 TraceCheckUtils]: 6: Hoare triple {18520#true} call #t~ret28 := main(); {18520#true} is VALID [2020-07-18 00:24:41,966 INFO L280 TraceCheckUtils]: 7: Hoare triple {18520#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {18520#true} is VALID [2020-07-18 00:24:41,966 INFO L280 TraceCheckUtils]: 8: Hoare triple {18520#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {18520#true} is VALID [2020-07-18 00:24:41,967 INFO L280 TraceCheckUtils]: 9: Hoare triple {18520#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {18520#true} is VALID [2020-07-18 00:24:41,967 INFO L280 TraceCheckUtils]: 10: Hoare triple {18520#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {18520#true} is VALID [2020-07-18 00:24:41,967 INFO L280 TraceCheckUtils]: 11: Hoare triple {18520#true} goto; {18520#true} is VALID [2020-07-18 00:24:41,967 INFO L280 TraceCheckUtils]: 12: Hoare triple {18520#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {18520#true} is VALID [2020-07-18 00:24:41,967 INFO L280 TraceCheckUtils]: 13: Hoare triple {18520#true} assume 0 != #t~nondet1; {18520#true} is VALID [2020-07-18 00:24:41,968 INFO L280 TraceCheckUtils]: 14: Hoare triple {18520#true} havoc #t~nondet1; {18520#true} is VALID [2020-07-18 00:24:41,968 INFO L280 TraceCheckUtils]: 15: Hoare triple {18520#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {18520#true} is VALID [2020-07-18 00:24:41,968 INFO L280 TraceCheckUtils]: 16: Hoare triple {18520#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {18520#true} is VALID [2020-07-18 00:24:41,968 INFO L280 TraceCheckUtils]: 17: Hoare triple {18520#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {18520#true} is VALID [2020-07-18 00:24:41,968 INFO L280 TraceCheckUtils]: 18: Hoare triple {18520#true} assume !#t~short7; {18520#true} is VALID [2020-07-18 00:24:41,969 INFO L280 TraceCheckUtils]: 19: Hoare triple {18520#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {18520#true} is VALID [2020-07-18 00:24:41,969 INFO L280 TraceCheckUtils]: 20: Hoare triple {18520#true} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {18520#true} is VALID [2020-07-18 00:24:41,969 INFO L280 TraceCheckUtils]: 21: Hoare triple {18520#true} assume !!#t~short7; {18520#true} is VALID [2020-07-18 00:24:41,969 INFO L280 TraceCheckUtils]: 22: Hoare triple {18520#true} havoc #t~mem5.base, #t~mem5.offset; {18520#true} is VALID [2020-07-18 00:24:41,969 INFO L280 TraceCheckUtils]: 23: Hoare triple {18520#true} havoc #t~short7; {18520#true} is VALID [2020-07-18 00:24:41,969 INFO L280 TraceCheckUtils]: 24: Hoare triple {18520#true} havoc #t~mem6.base, #t~mem6.offset; {18520#true} is VALID [2020-07-18 00:24:41,970 INFO L280 TraceCheckUtils]: 25: Hoare triple {18520#true} goto; {18520#true} is VALID [2020-07-18 00:24:41,970 INFO L280 TraceCheckUtils]: 26: Hoare triple {18520#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {18520#true} is VALID [2020-07-18 00:24:41,970 INFO L280 TraceCheckUtils]: 27: Hoare triple {18520#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {18520#true} is VALID [2020-07-18 00:24:41,970 INFO L280 TraceCheckUtils]: 28: Hoare triple {18520#true} assume !!(0 != #t~nondet8); {18520#true} is VALID [2020-07-18 00:24:41,970 INFO L280 TraceCheckUtils]: 29: Hoare triple {18520#true} havoc #t~nondet8; {18520#true} is VALID [2020-07-18 00:24:41,971 INFO L280 TraceCheckUtils]: 30: Hoare triple {18520#true} SUMMARY for call #t~malloc9.base, #t~malloc9.offset := #Ultimate.allocOnHeap(8); srcloc: L1001 {18520#true} is VALID [2020-07-18 00:24:41,971 INFO L280 TraceCheckUtils]: 31: Hoare triple {18520#true} SUMMARY for call write~$Pointer$(#t~malloc9.base, #t~malloc9.offset, ~end~0.base, ~end~0.offset, 4); srcloc: L1001-1 {18520#true} is VALID [2020-07-18 00:24:41,971 INFO L280 TraceCheckUtils]: 32: Hoare triple {18520#true} SUMMARY for call #t~mem10.base, #t~mem10.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1001-2 {18520#true} is VALID [2020-07-18 00:24:41,971 INFO L280 TraceCheckUtils]: 33: Hoare triple {18520#true} ~end~0.base, ~end~0.offset := #t~mem10.base, #t~mem10.offset; {18520#true} is VALID [2020-07-18 00:24:41,971 INFO L280 TraceCheckUtils]: 34: Hoare triple {18520#true} havoc #t~mem10.base, #t~mem10.offset; {18520#true} is VALID [2020-07-18 00:24:41,972 INFO L280 TraceCheckUtils]: 35: Hoare triple {18520#true} SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, ~end~0.offset, 4); srcloc: L1003 {18520#true} is VALID [2020-07-18 00:24:41,972 INFO L280 TraceCheckUtils]: 36: Hoare triple {18520#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {18520#true} is VALID [2020-07-18 00:24:41,972 INFO L280 TraceCheckUtils]: 37: Hoare triple {18520#true} goto; {18520#true} is VALID [2020-07-18 00:24:41,972 INFO L280 TraceCheckUtils]: 38: Hoare triple {18520#true} assume !!(~end~0.base != 0 || ~end~0.offset != 0); {18520#true} is VALID [2020-07-18 00:24:41,972 INFO L280 TraceCheckUtils]: 39: Hoare triple {18520#true} goto; {18520#true} is VALID [2020-07-18 00:24:41,973 INFO L280 TraceCheckUtils]: 40: Hoare triple {18520#true} assume -2147483648 <= #t~nondet11 && #t~nondet11 <= 2147483647; {18520#true} is VALID [2020-07-18 00:24:41,973 INFO L280 TraceCheckUtils]: 41: Hoare triple {18520#true} assume 0 != #t~nondet11; {18520#true} is VALID [2020-07-18 00:24:41,973 INFO L280 TraceCheckUtils]: 42: Hoare triple {18520#true} havoc #t~nondet11; {18520#true} is VALID [2020-07-18 00:24:41,973 INFO L280 TraceCheckUtils]: 43: Hoare triple {18520#true} SUMMARY for call write~$Pointer$(0, 0, ~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1005-7 {18520#true} is VALID [2020-07-18 00:24:41,975 INFO L280 TraceCheckUtils]: 44: Hoare triple {18520#true} SUMMARY for call #t~mem15.base, #t~mem15.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1005-34 {18527#(and (= |main_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem15.base|))} is VALID [2020-07-18 00:24:41,976 INFO L280 TraceCheckUtils]: 45: Hoare triple {18527#(and (= |main_#t~mem15.offset| (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)) |main_#t~mem15.base|))} #t~short17 := #t~mem15.base != 0 || #t~mem15.offset != 0; {18528#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) |main_#t~short17|)} is VALID [2020-07-18 00:24:41,976 INFO L280 TraceCheckUtils]: 46: Hoare triple {18528#(or (and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4)))) |main_#t~short17|)} assume !#t~short17; {18529#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-18 00:24:41,977 INFO L280 TraceCheckUtils]: 47: Hoare triple {18529#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} SUMMARY for call #t~mem16.base, #t~mem16.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1005-22 {18530#(and (= 0 |main_#t~mem16.offset|) (= 0 |main_#t~mem16.base|))} is VALID [2020-07-18 00:24:41,978 INFO L280 TraceCheckUtils]: 48: Hoare triple {18530#(and (= 0 |main_#t~mem16.offset|) (= 0 |main_#t~mem16.base|))} #t~short17 := #t~mem16.base == 0 && #t~mem16.offset == 0; {18531#|main_#t~short17|} is VALID [2020-07-18 00:24:41,978 INFO L280 TraceCheckUtils]: 49: Hoare triple {18531#|main_#t~short17|} assume !#t~short17; {18521#false} is VALID [2020-07-18 00:24:41,979 INFO L280 TraceCheckUtils]: 50: Hoare triple {18521#false} havoc #t~mem16.base, #t~mem16.offset; {18521#false} is VALID [2020-07-18 00:24:41,979 INFO L280 TraceCheckUtils]: 51: Hoare triple {18521#false} havoc #t~short17; {18521#false} is VALID [2020-07-18 00:24:41,979 INFO L280 TraceCheckUtils]: 52: Hoare triple {18521#false} havoc #t~mem15.base, #t~mem15.offset; {18521#false} is VALID [2020-07-18 00:24:41,979 INFO L280 TraceCheckUtils]: 53: Hoare triple {18521#false} assume !false; {18521#false} is VALID [2020-07-18 00:24:41,982 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:24:41,982 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:24:41,983 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [440471514] [2020-07-18 00:24:41,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:24:41,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-18 00:24:41,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331763756] [2020-07-18 00:24:41,984 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2020-07-18 00:24:41,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:24:41,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-18 00:24:42,038 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:42,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-18 00:24:42,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:24:42,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-18 00:24:42,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-18 00:24:42,040 INFO L87 Difference]: Start difference. First operand 275 states and 301 transitions. Second operand 8 states. [2020-07-18 00:24:45,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:45,241 INFO L93 Difference]: Finished difference Result 294 states and 322 transitions. [2020-07-18 00:24:45,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-18 00:24:45,242 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2020-07-18 00:24:45,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:24:45,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:24:45,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2020-07-18 00:24:45,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-18 00:24:45,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 182 transitions. [2020-07-18 00:24:45,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 182 transitions. [2020-07-18 00:24:45,437 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:45,443 INFO L225 Difference]: With dead ends: 294 [2020-07-18 00:24:45,443 INFO L226 Difference]: Without dead ends: 289 [2020-07-18 00:24:45,443 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2020-07-18 00:24:45,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2020-07-18 00:24:47,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 268. [2020-07-18 00:24:47,393 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:24:47,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 289 states. Second operand 268 states. [2020-07-18 00:24:47,394 INFO L74 IsIncluded]: Start isIncluded. First operand 289 states. Second operand 268 states. [2020-07-18 00:24:47,394 INFO L87 Difference]: Start difference. First operand 289 states. Second operand 268 states. [2020-07-18 00:24:47,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:47,401 INFO L93 Difference]: Finished difference Result 289 states and 316 transitions. [2020-07-18 00:24:47,401 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 316 transitions. [2020-07-18 00:24:47,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:47,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:47,402 INFO L74 IsIncluded]: Start isIncluded. First operand 268 states. Second operand 289 states. [2020-07-18 00:24:47,403 INFO L87 Difference]: Start difference. First operand 268 states. Second operand 289 states. [2020-07-18 00:24:47,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:24:47,409 INFO L93 Difference]: Finished difference Result 289 states and 316 transitions. [2020-07-18 00:24:47,409 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 316 transitions. [2020-07-18 00:24:47,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:24:47,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:24:47,410 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:24:47,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:24:47,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2020-07-18 00:24:47,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 293 transitions. [2020-07-18 00:24:47,415 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 293 transitions. Word has length 54 [2020-07-18 00:24:47,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:24:47,415 INFO L479 AbstractCegarLoop]: Abstraction has 268 states and 293 transitions. [2020-07-18 00:24:47,415 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-18 00:24:47,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 268 states and 293 transitions. [2020-07-18 00:24:48,355 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 293 edges. 293 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:48,356 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 293 transitions. [2020-07-18 00:24:48,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2020-07-18 00:24:48,357 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:24:48,357 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:24:48,357 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-07-18 00:24:48,358 INFO L427 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:24:48,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:24:48,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1636675303, now seen corresponding path program 1 times [2020-07-18 00:24:48,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:24:48,359 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2083689115] [2020-07-18 00:24:48,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:24:48,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:24:48,802 INFO L280 TraceCheckUtils]: 0: Hoare triple {20268#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {20249#true} is VALID [2020-07-18 00:24:48,802 INFO L280 TraceCheckUtils]: 1: Hoare triple {20249#true} #valid := #valid[0 := 0]; {20249#true} is VALID [2020-07-18 00:24:48,802 INFO L280 TraceCheckUtils]: 2: Hoare triple {20249#true} assume 0 < #StackHeapBarrier; {20249#true} is VALID [2020-07-18 00:24:48,803 INFO L280 TraceCheckUtils]: 3: Hoare triple {20249#true} assume true; {20249#true} is VALID [2020-07-18 00:24:48,803 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {20249#true} {20249#true} #419#return; {20249#true} is VALID [2020-07-18 00:24:48,804 INFO L263 TraceCheckUtils]: 0: Hoare triple {20249#true} call ULTIMATE.init(); {20268#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:24:48,804 INFO L280 TraceCheckUtils]: 1: Hoare triple {20268#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {20249#true} is VALID [2020-07-18 00:24:48,804 INFO L280 TraceCheckUtils]: 2: Hoare triple {20249#true} #valid := #valid[0 := 0]; {20249#true} is VALID [2020-07-18 00:24:48,804 INFO L280 TraceCheckUtils]: 3: Hoare triple {20249#true} assume 0 < #StackHeapBarrier; {20249#true} is VALID [2020-07-18 00:24:48,804 INFO L280 TraceCheckUtils]: 4: Hoare triple {20249#true} assume true; {20249#true} is VALID [2020-07-18 00:24:48,805 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {20249#true} {20249#true} #419#return; {20249#true} is VALID [2020-07-18 00:24:48,805 INFO L263 TraceCheckUtils]: 6: Hoare triple {20249#true} call #t~ret28 := main(); {20249#true} is VALID [2020-07-18 00:24:48,806 INFO L280 TraceCheckUtils]: 7: Hoare triple {20249#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {20256#(= 1 (select |#valid| |main_#t~malloc0.base|))} is VALID [2020-07-18 00:24:48,806 INFO L280 TraceCheckUtils]: 8: Hoare triple {20256#(= 1 (select |#valid| |main_#t~malloc0.base|))} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {20257#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 00:24:48,807 INFO L280 TraceCheckUtils]: 9: Hoare triple {20257#(= 1 (select |#valid| main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {20257#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 00:24:48,807 INFO L280 TraceCheckUtils]: 10: Hoare triple {20257#(= 1 (select |#valid| main_~list~0.base))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {20257#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 00:24:48,808 INFO L280 TraceCheckUtils]: 11: Hoare triple {20257#(= 1 (select |#valid| main_~list~0.base))} goto; {20257#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 00:24:48,809 INFO L280 TraceCheckUtils]: 12: Hoare triple {20257#(= 1 (select |#valid| main_~list~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {20257#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 00:24:48,809 INFO L280 TraceCheckUtils]: 13: Hoare triple {20257#(= 1 (select |#valid| main_~list~0.base))} assume !(0 != #t~nondet1); {20257#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 00:24:48,810 INFO L280 TraceCheckUtils]: 14: Hoare triple {20257#(= 1 (select |#valid| main_~list~0.base))} havoc #t~nondet1; {20257#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 00:24:48,810 INFO L280 TraceCheckUtils]: 15: Hoare triple {20257#(= 1 (select |#valid| main_~list~0.base))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: L993-10 {20258#(and (= 0 |main_#t~malloc2.offset|) (not (= |main_#t~malloc2.base| main_~list~0.base)))} is VALID [2020-07-18 00:24:48,811 INFO L280 TraceCheckUtils]: 16: Hoare triple {20258#(and (= 0 |main_#t~malloc2.offset|) (not (= |main_#t~malloc2.base| main_~list~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-11 {20259#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:24:48,812 INFO L280 TraceCheckUtils]: 17: Hoare triple {20259#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-12 {20260#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem3.base|) (= 0 |main_#t~mem3.offset|) (not (= |main_#t~mem3.base| main_~list~0.base)))} is VALID [2020-07-18 00:24:48,814 INFO L280 TraceCheckUtils]: 18: Hoare triple {20260#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem3.base|) (= 0 |main_#t~mem3.offset|) (not (= |main_#t~mem3.base| main_~list~0.base)))} SUMMARY for call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); srcloc: L993-13 {20261#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-18 00:24:48,815 INFO L280 TraceCheckUtils]: 19: Hoare triple {20261#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} havoc #t~mem3.base, #t~mem3.offset; {20261#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-18 00:24:48,816 INFO L280 TraceCheckUtils]: 20: Hoare triple {20261#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-15 {20262#(and (= 0 (select (store (select |#memory_$Pointer$.base| |main_#t~mem4.base|) (+ |main_#t~mem4.offset| 4) 0) 0)) (= 0 (select (store (select |#memory_$Pointer$.offset| |main_#t~mem4.base|) (+ |main_#t~mem4.offset| 4) 0) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= |main_#t~mem4.base| main_~list~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem4.base|))} is VALID [2020-07-18 00:24:48,817 INFO L280 TraceCheckUtils]: 21: Hoare triple {20262#(and (= 0 (select (store (select |#memory_$Pointer$.base| |main_#t~mem4.base|) (+ |main_#t~mem4.offset| 4) 0) 0)) (= 0 (select (store (select |#memory_$Pointer$.offset| |main_#t~mem4.base|) (+ |main_#t~mem4.offset| 4) 0) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= |main_#t~mem4.base| main_~list~0.base)) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem4.base|))} SUMMARY for call write~$Pointer$(0, 0, #t~mem4.base, 4 + #t~mem4.offset, 4); srcloc: L993-16 {20263#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-18 00:24:48,818 INFO L280 TraceCheckUtils]: 22: Hoare triple {20263#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} havoc #t~mem4.base, #t~mem4.offset; {20263#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-18 00:24:48,819 INFO L280 TraceCheckUtils]: 23: Hoare triple {20263#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {20263#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-18 00:24:48,820 INFO L280 TraceCheckUtils]: 24: Hoare triple {20263#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {20263#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-18 00:24:48,820 INFO L280 TraceCheckUtils]: 25: Hoare triple {20263#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} assume #t~short7; {20263#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-18 00:24:48,821 INFO L280 TraceCheckUtils]: 26: Hoare triple {20263#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} assume !!#t~short7; {20263#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-18 00:24:48,822 INFO L280 TraceCheckUtils]: 27: Hoare triple {20263#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} havoc #t~mem5.base, #t~mem5.offset; {20263#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-18 00:24:48,823 INFO L280 TraceCheckUtils]: 28: Hoare triple {20263#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} havoc #t~short7; {20263#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-18 00:24:48,823 INFO L280 TraceCheckUtils]: 29: Hoare triple {20263#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} havoc #t~mem6.base, #t~mem6.offset; {20263#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-18 00:24:48,824 INFO L280 TraceCheckUtils]: 30: Hoare triple {20263#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} goto; {20263#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-18 00:24:48,825 INFO L280 TraceCheckUtils]: 31: Hoare triple {20263#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {20263#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-18 00:24:48,826 INFO L280 TraceCheckUtils]: 32: Hoare triple {20263#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {20263#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-18 00:24:48,827 INFO L280 TraceCheckUtils]: 33: Hoare triple {20263#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} assume !(0 != #t~nondet8); {20263#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-18 00:24:48,827 INFO L280 TraceCheckUtils]: 34: Hoare triple {20263#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} havoc #t~nondet8; {20263#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-18 00:24:48,828 INFO L280 TraceCheckUtils]: 35: Hoare triple {20263#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} ~end~0.base, ~end~0.offset := 0, 0; {20263#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} is VALID [2020-07-18 00:24:48,829 INFO L280 TraceCheckUtils]: 36: Hoare triple {20263#(and (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))) 0)))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {20264#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} is VALID [2020-07-18 00:24:48,830 INFO L280 TraceCheckUtils]: 37: Hoare triple {20264#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {20264#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} is VALID [2020-07-18 00:24:48,831 INFO L280 TraceCheckUtils]: 38: Hoare triple {20264#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} goto; {20264#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} is VALID [2020-07-18 00:24:48,831 INFO L280 TraceCheckUtils]: 39: Hoare triple {20264#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {20264#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} is VALID [2020-07-18 00:24:48,832 INFO L280 TraceCheckUtils]: 40: Hoare triple {20264#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} ~len~0 := 0; {20264#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} is VALID [2020-07-18 00:24:48,833 INFO L280 TraceCheckUtils]: 41: Hoare triple {20264#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) (+ main_~end~0.offset 4))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0) 0) (= 0 (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))) 0)))} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {20265#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) 0)) (= 0 |main_#t~mem18.offset|))} is VALID [2020-07-18 00:24:48,834 INFO L280 TraceCheckUtils]: 42: Hoare triple {20265#(and (= 0 (select (select |#memory_$Pointer$.base| |main_#t~mem18.base|) 0)) (= 0 (select (select |#memory_$Pointer$.offset| |main_#t~mem18.base|) 0)) (= 0 |main_#t~mem18.offset|))} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {20266#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-18 00:24:48,835 INFO L280 TraceCheckUtils]: 43: Hoare triple {20266#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} havoc #t~mem18.base, #t~mem18.offset; {20266#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-18 00:24:48,836 INFO L280 TraceCheckUtils]: 44: Hoare triple {20266#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {20266#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-18 00:24:48,836 INFO L280 TraceCheckUtils]: 45: Hoare triple {20266#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} assume 0 == ~len~0; {20266#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-18 00:24:48,837 INFO L280 TraceCheckUtils]: 46: Hoare triple {20266#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} ~len~0 := 1; {20266#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-18 00:24:48,838 INFO L280 TraceCheckUtils]: 47: Hoare triple {20266#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {20266#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-18 00:24:48,839 INFO L280 TraceCheckUtils]: 48: Hoare triple {20266#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} goto; {20266#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-18 00:24:48,840 INFO L280 TraceCheckUtils]: 49: Hoare triple {20266#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); srcloc: L1025-6 {20266#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-18 00:24:48,840 INFO L280 TraceCheckUtils]: 50: Hoare triple {20266#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} assume !!(0 == #t~mem19.base && 0 == #t~mem19.offset); {20266#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-18 00:24:48,842 INFO L280 TraceCheckUtils]: 51: Hoare triple {20266#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} havoc #t~mem19.base, #t~mem19.offset; {20266#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-18 00:24:48,842 INFO L280 TraceCheckUtils]: 52: Hoare triple {20266#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} goto; {20266#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} is VALID [2020-07-18 00:24:48,843 INFO L280 TraceCheckUtils]: 53: Hoare triple {20266#(and (= 0 (select (select |#memory_$Pointer$.base| main_~inner~0.base) main_~inner~0.offset)) (= 0 main_~inner~0.offset) (= 0 (select (select |#memory_$Pointer$.offset| main_~inner~0.base) main_~inner~0.offset)))} SUMMARY for call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, ~inner~0.offset, 4); srcloc: L1026-6 {20267#(and (= 0 |main_#t~mem20.base|) (= 0 |main_#t~mem20.offset|))} is VALID [2020-07-18 00:24:48,844 INFO L280 TraceCheckUtils]: 54: Hoare triple {20267#(and (= 0 |main_#t~mem20.base|) (= 0 |main_#t~mem20.offset|))} assume !(0 == #t~mem20.base && 0 == #t~mem20.offset); {20250#false} is VALID [2020-07-18 00:24:48,844 INFO L280 TraceCheckUtils]: 55: Hoare triple {20250#false} havoc #t~mem20.base, #t~mem20.offset; {20250#false} is VALID [2020-07-18 00:24:48,844 INFO L280 TraceCheckUtils]: 56: Hoare triple {20250#false} assume !false; {20250#false} is VALID [2020-07-18 00:24:48,860 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:24:48,866 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:24:48,867 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2083689115] [2020-07-18 00:24:48,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:24:48,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-18 00:24:48,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664758161] [2020-07-18 00:24:48,868 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2020-07-18 00:24:48,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:24:48,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-18 00:24:48,949 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:24:48,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-18 00:24:48,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:24:48,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-18 00:24:48,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-07-18 00:24:48,951 INFO L87 Difference]: Start difference. First operand 268 states and 293 transitions. Second operand 15 states. [2020-07-18 00:25:00,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:25:00,554 INFO L93 Difference]: Finished difference Result 722 states and 782 transitions. [2020-07-18 00:25:00,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-07-18 00:25:00,554 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2020-07-18 00:25:00,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:25:00,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 00:25:00,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 543 transitions. [2020-07-18 00:25:00,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-18 00:25:00,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 543 transitions. [2020-07-18 00:25:00,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 543 transitions. [2020-07-18 00:25:01,374 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 543 edges. 543 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:25:01,397 INFO L225 Difference]: With dead ends: 722 [2020-07-18 00:25:01,397 INFO L226 Difference]: Without dead ends: 719 [2020-07-18 00:25:01,398 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=272, Invalid=850, Unknown=0, NotChecked=0, Total=1122 [2020-07-18 00:25:01,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2020-07-18 00:25:03,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 272. [2020-07-18 00:25:03,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:25:03,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 719 states. Second operand 272 states. [2020-07-18 00:25:03,725 INFO L74 IsIncluded]: Start isIncluded. First operand 719 states. Second operand 272 states. [2020-07-18 00:25:03,725 INFO L87 Difference]: Start difference. First operand 719 states. Second operand 272 states. [2020-07-18 00:25:03,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:25:03,747 INFO L93 Difference]: Finished difference Result 719 states and 779 transitions. [2020-07-18 00:25:03,747 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 779 transitions. [2020-07-18 00:25:03,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:25:03,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:25:03,748 INFO L74 IsIncluded]: Start isIncluded. First operand 272 states. Second operand 719 states. [2020-07-18 00:25:03,749 INFO L87 Difference]: Start difference. First operand 272 states. Second operand 719 states. [2020-07-18 00:25:03,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:25:03,778 INFO L93 Difference]: Finished difference Result 719 states and 779 transitions. [2020-07-18 00:25:03,779 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 779 transitions. [2020-07-18 00:25:03,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:25:03,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:25:03,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:25:03,780 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:25:03,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2020-07-18 00:25:03,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 297 transitions. [2020-07-18 00:25:03,788 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 297 transitions. Word has length 57 [2020-07-18 00:25:03,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:25:03,788 INFO L479 AbstractCegarLoop]: Abstraction has 272 states and 297 transitions. [2020-07-18 00:25:03,788 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-18 00:25:03,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 272 states and 297 transitions. [2020-07-18 00:25:04,913 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 297 edges. 297 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:25:04,914 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 297 transitions. [2020-07-18 00:25:04,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2020-07-18 00:25:04,915 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:25:04,915 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:25:04,915 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-07-18 00:25:04,916 INFO L427 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:25:04,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:25:04,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1939208096, now seen corresponding path program 1 times [2020-07-18 00:25:04,916 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:25:04,917 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [801848642] [2020-07-18 00:25:04,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:25:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:25:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:25:04,987 INFO L280 TraceCheckUtils]: 0: Hoare triple {23743#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {23735#true} is VALID [2020-07-18 00:25:04,988 INFO L280 TraceCheckUtils]: 1: Hoare triple {23735#true} #valid := #valid[0 := 0]; {23735#true} is VALID [2020-07-18 00:25:04,988 INFO L280 TraceCheckUtils]: 2: Hoare triple {23735#true} assume 0 < #StackHeapBarrier; {23735#true} is VALID [2020-07-18 00:25:04,988 INFO L280 TraceCheckUtils]: 3: Hoare triple {23735#true} assume true; {23735#true} is VALID [2020-07-18 00:25:04,988 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {23735#true} {23735#true} #419#return; {23735#true} is VALID [2020-07-18 00:25:04,989 INFO L263 TraceCheckUtils]: 0: Hoare triple {23735#true} call ULTIMATE.init(); {23743#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:25:04,989 INFO L280 TraceCheckUtils]: 1: Hoare triple {23743#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {23735#true} is VALID [2020-07-18 00:25:04,990 INFO L280 TraceCheckUtils]: 2: Hoare triple {23735#true} #valid := #valid[0 := 0]; {23735#true} is VALID [2020-07-18 00:25:04,990 INFO L280 TraceCheckUtils]: 3: Hoare triple {23735#true} assume 0 < #StackHeapBarrier; {23735#true} is VALID [2020-07-18 00:25:04,990 INFO L280 TraceCheckUtils]: 4: Hoare triple {23735#true} assume true; {23735#true} is VALID [2020-07-18 00:25:04,990 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {23735#true} {23735#true} #419#return; {23735#true} is VALID [2020-07-18 00:25:04,990 INFO L263 TraceCheckUtils]: 6: Hoare triple {23735#true} call #t~ret28 := main(); {23735#true} is VALID [2020-07-18 00:25:04,991 INFO L280 TraceCheckUtils]: 7: Hoare triple {23735#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {23735#true} is VALID [2020-07-18 00:25:04,991 INFO L280 TraceCheckUtils]: 8: Hoare triple {23735#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {23735#true} is VALID [2020-07-18 00:25:04,991 INFO L280 TraceCheckUtils]: 9: Hoare triple {23735#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {23735#true} is VALID [2020-07-18 00:25:04,991 INFO L280 TraceCheckUtils]: 10: Hoare triple {23735#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {23735#true} is VALID [2020-07-18 00:25:04,992 INFO L280 TraceCheckUtils]: 11: Hoare triple {23735#true} goto; {23735#true} is VALID [2020-07-18 00:25:04,992 INFO L280 TraceCheckUtils]: 12: Hoare triple {23735#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {23735#true} is VALID [2020-07-18 00:25:04,992 INFO L280 TraceCheckUtils]: 13: Hoare triple {23735#true} assume !(0 != #t~nondet1); {23735#true} is VALID [2020-07-18 00:25:04,992 INFO L280 TraceCheckUtils]: 14: Hoare triple {23735#true} havoc #t~nondet1; {23735#true} is VALID [2020-07-18 00:25:04,992 INFO L280 TraceCheckUtils]: 15: Hoare triple {23735#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: L993-10 {23735#true} is VALID [2020-07-18 00:25:04,993 INFO L280 TraceCheckUtils]: 16: Hoare triple {23735#true} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-11 {23735#true} is VALID [2020-07-18 00:25:04,993 INFO L280 TraceCheckUtils]: 17: Hoare triple {23735#true} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-12 {23735#true} is VALID [2020-07-18 00:25:04,993 INFO L280 TraceCheckUtils]: 18: Hoare triple {23735#true} SUMMARY for call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); srcloc: L993-13 {23735#true} is VALID [2020-07-18 00:25:04,993 INFO L280 TraceCheckUtils]: 19: Hoare triple {23735#true} havoc #t~mem3.base, #t~mem3.offset; {23735#true} is VALID [2020-07-18 00:25:04,993 INFO L280 TraceCheckUtils]: 20: Hoare triple {23735#true} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-15 {23735#true} is VALID [2020-07-18 00:25:04,994 INFO L280 TraceCheckUtils]: 21: Hoare triple {23735#true} SUMMARY for call write~$Pointer$(0, 0, #t~mem4.base, 4 + #t~mem4.offset, 4); srcloc: L993-16 {23735#true} is VALID [2020-07-18 00:25:04,994 INFO L280 TraceCheckUtils]: 22: Hoare triple {23735#true} havoc #t~mem4.base, #t~mem4.offset; {23735#true} is VALID [2020-07-18 00:25:04,994 INFO L280 TraceCheckUtils]: 23: Hoare triple {23735#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {23735#true} is VALID [2020-07-18 00:25:04,994 INFO L280 TraceCheckUtils]: 24: Hoare triple {23735#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {23735#true} is VALID [2020-07-18 00:25:04,994 INFO L280 TraceCheckUtils]: 25: Hoare triple {23735#true} assume #t~short7; {23735#true} is VALID [2020-07-18 00:25:04,995 INFO L280 TraceCheckUtils]: 26: Hoare triple {23735#true} assume !!#t~short7; {23735#true} is VALID [2020-07-18 00:25:04,995 INFO L280 TraceCheckUtils]: 27: Hoare triple {23735#true} havoc #t~mem5.base, #t~mem5.offset; {23735#true} is VALID [2020-07-18 00:25:04,995 INFO L280 TraceCheckUtils]: 28: Hoare triple {23735#true} havoc #t~short7; {23735#true} is VALID [2020-07-18 00:25:04,995 INFO L280 TraceCheckUtils]: 29: Hoare triple {23735#true} havoc #t~mem6.base, #t~mem6.offset; {23735#true} is VALID [2020-07-18 00:25:04,995 INFO L280 TraceCheckUtils]: 30: Hoare triple {23735#true} goto; {23735#true} is VALID [2020-07-18 00:25:04,995 INFO L280 TraceCheckUtils]: 31: Hoare triple {23735#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {23735#true} is VALID [2020-07-18 00:25:04,996 INFO L280 TraceCheckUtils]: 32: Hoare triple {23735#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {23735#true} is VALID [2020-07-18 00:25:04,996 INFO L280 TraceCheckUtils]: 33: Hoare triple {23735#true} assume !(0 != #t~nondet8); {23735#true} is VALID [2020-07-18 00:25:04,996 INFO L280 TraceCheckUtils]: 34: Hoare triple {23735#true} havoc #t~nondet8; {23735#true} is VALID [2020-07-18 00:25:04,996 INFO L280 TraceCheckUtils]: 35: Hoare triple {23735#true} ~end~0.base, ~end~0.offset := 0, 0; {23735#true} is VALID [2020-07-18 00:25:04,996 INFO L280 TraceCheckUtils]: 36: Hoare triple {23735#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {23735#true} is VALID [2020-07-18 00:25:04,997 INFO L280 TraceCheckUtils]: 37: Hoare triple {23735#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {23735#true} is VALID [2020-07-18 00:25:04,997 INFO L280 TraceCheckUtils]: 38: Hoare triple {23735#true} goto; {23735#true} is VALID [2020-07-18 00:25:04,997 INFO L280 TraceCheckUtils]: 39: Hoare triple {23735#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {23735#true} is VALID [2020-07-18 00:25:04,997 INFO L280 TraceCheckUtils]: 40: Hoare triple {23735#true} ~len~0 := 0; {23735#true} is VALID [2020-07-18 00:25:04,997 INFO L280 TraceCheckUtils]: 41: Hoare triple {23735#true} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {23735#true} is VALID [2020-07-18 00:25:04,998 INFO L280 TraceCheckUtils]: 42: Hoare triple {23735#true} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {23735#true} is VALID [2020-07-18 00:25:04,998 INFO L280 TraceCheckUtils]: 43: Hoare triple {23735#true} havoc #t~mem18.base, #t~mem18.offset; {23735#true} is VALID [2020-07-18 00:25:04,998 INFO L280 TraceCheckUtils]: 44: Hoare triple {23735#true} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {23735#true} is VALID [2020-07-18 00:25:04,998 INFO L280 TraceCheckUtils]: 45: Hoare triple {23735#true} assume !!(~len~0 <= 1); {23735#true} is VALID [2020-07-18 00:25:04,998 INFO L280 TraceCheckUtils]: 46: Hoare triple {23735#true} goto; {23735#true} is VALID [2020-07-18 00:25:04,999 INFO L280 TraceCheckUtils]: 47: Hoare triple {23735#true} SUMMARY for call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1031-4 {23735#true} is VALID [2020-07-18 00:25:04,999 INFO L280 TraceCheckUtils]: 48: Hoare triple {23735#true} ~end~0.base, ~end~0.offset := #t~mem23.base, #t~mem23.offset; {23735#true} is VALID [2020-07-18 00:25:04,999 INFO L280 TraceCheckUtils]: 49: Hoare triple {23735#true} havoc #t~mem23.base, #t~mem23.offset; {23735#true} is VALID [2020-07-18 00:25:04,999 INFO L280 TraceCheckUtils]: 50: Hoare triple {23735#true} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {23735#true} is VALID [2020-07-18 00:25:04,999 INFO L280 TraceCheckUtils]: 51: Hoare triple {23735#true} assume !!(0 != ~list~0.base || 0 != ~list~0.offset); {23735#true} is VALID [2020-07-18 00:25:05,000 INFO L280 TraceCheckUtils]: 52: Hoare triple {23735#true} SUMMARY for call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L1039 {23735#true} is VALID [2020-07-18 00:25:05,000 INFO L280 TraceCheckUtils]: 53: Hoare triple {23735#true} ~end~0.base, ~end~0.offset := #t~mem24.base, #t~mem24.offset; {23735#true} is VALID [2020-07-18 00:25:05,000 INFO L280 TraceCheckUtils]: 54: Hoare triple {23735#true} havoc #t~mem24.base, #t~mem24.offset; {23735#true} is VALID [2020-07-18 00:25:05,005 INFO L280 TraceCheckUtils]: 55: Hoare triple {23735#true} assume 0 != ~end~0.base || 0 != ~end~0.offset; {23742#(or (not (= 0 main_~end~0.base)) (not (= 0 main_~end~0.offset)))} is VALID [2020-07-18 00:25:05,005 INFO L280 TraceCheckUtils]: 56: Hoare triple {23742#(or (not (= 0 main_~end~0.base)) (not (= 0 main_~end~0.offset)))} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {23736#false} is VALID [2020-07-18 00:25:05,005 INFO L280 TraceCheckUtils]: 57: Hoare triple {23736#false} assume !false; {23736#false} is VALID [2020-07-18 00:25:05,007 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,010 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:25:05,010 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [801848642] [2020-07-18 00:25:05,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:25:05,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:25:05,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981664135] [2020-07-18 00:25:05,012 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2020-07-18 00:25:05,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:25:05,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:25:05,068 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:25:05,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:25:05,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:25:05,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:25:05,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:25:05,069 INFO L87 Difference]: Start difference. First operand 272 states and 297 transitions. Second operand 4 states. [2020-07-18 00:25:07,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:25:07,869 INFO L93 Difference]: Finished difference Result 277 states and 302 transitions. [2020-07-18 00:25:07,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 00:25:07,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2020-07-18 00:25:07,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:25:07,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:25:07,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2020-07-18 00:25:07,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:25:07,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 167 transitions. [2020-07-18 00:25:07,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 167 transitions. [2020-07-18 00:25:08,075 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:25:08,080 INFO L225 Difference]: With dead ends: 277 [2020-07-18 00:25:08,080 INFO L226 Difference]: Without dead ends: 275 [2020-07-18 00:25:08,081 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:25:08,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2020-07-18 00:25:10,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 270. [2020-07-18 00:25:10,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:25:10,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 275 states. Second operand 270 states. [2020-07-18 00:25:10,240 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand 270 states. [2020-07-18 00:25:10,240 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 270 states. [2020-07-18 00:25:10,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:25:10,246 INFO L93 Difference]: Finished difference Result 275 states and 300 transitions. [2020-07-18 00:25:10,247 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 300 transitions. [2020-07-18 00:25:10,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:25:10,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:25:10,247 INFO L74 IsIncluded]: Start isIncluded. First operand 270 states. Second operand 275 states. [2020-07-18 00:25:10,247 INFO L87 Difference]: Start difference. First operand 270 states. Second operand 275 states. [2020-07-18 00:25:10,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:25:10,252 INFO L93 Difference]: Finished difference Result 275 states and 300 transitions. [2020-07-18 00:25:10,252 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 300 transitions. [2020-07-18 00:25:10,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:25:10,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:25:10,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:25:10,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:25:10,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2020-07-18 00:25:10,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 295 transitions. [2020-07-18 00:25:10,258 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 295 transitions. Word has length 58 [2020-07-18 00:25:10,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:25:10,258 INFO L479 AbstractCegarLoop]: Abstraction has 270 states and 295 transitions. [2020-07-18 00:25:10,258 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:25:10,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 270 states and 295 transitions. [2020-07-18 00:25:11,376 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 295 edges. 295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:25:11,376 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 295 transitions. [2020-07-18 00:25:11,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-07-18 00:25:11,378 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:25:11,378 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:25:11,378 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-07-18 00:25:11,378 INFO L427 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:25:11,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:25:11,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1792411396, now seen corresponding path program 1 times [2020-07-18 00:25:11,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:25:11,379 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2075076175] [2020-07-18 00:25:11,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:25:11,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:25:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:25:11,517 INFO L280 TraceCheckUtils]: 0: Hoare triple {25401#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {25390#true} is VALID [2020-07-18 00:25:11,518 INFO L280 TraceCheckUtils]: 1: Hoare triple {25390#true} #valid := #valid[0 := 0]; {25390#true} is VALID [2020-07-18 00:25:11,518 INFO L280 TraceCheckUtils]: 2: Hoare triple {25390#true} assume 0 < #StackHeapBarrier; {25390#true} is VALID [2020-07-18 00:25:11,518 INFO L280 TraceCheckUtils]: 3: Hoare triple {25390#true} assume true; {25390#true} is VALID [2020-07-18 00:25:11,518 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {25390#true} {25390#true} #419#return; {25390#true} is VALID [2020-07-18 00:25:11,519 INFO L263 TraceCheckUtils]: 0: Hoare triple {25390#true} call ULTIMATE.init(); {25401#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:25:11,519 INFO L280 TraceCheckUtils]: 1: Hoare triple {25401#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {25390#true} is VALID [2020-07-18 00:25:11,520 INFO L280 TraceCheckUtils]: 2: Hoare triple {25390#true} #valid := #valid[0 := 0]; {25390#true} is VALID [2020-07-18 00:25:11,520 INFO L280 TraceCheckUtils]: 3: Hoare triple {25390#true} assume 0 < #StackHeapBarrier; {25390#true} is VALID [2020-07-18 00:25:11,520 INFO L280 TraceCheckUtils]: 4: Hoare triple {25390#true} assume true; {25390#true} is VALID [2020-07-18 00:25:11,520 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {25390#true} {25390#true} #419#return; {25390#true} is VALID [2020-07-18 00:25:11,520 INFO L263 TraceCheckUtils]: 6: Hoare triple {25390#true} call #t~ret28 := main(); {25390#true} is VALID [2020-07-18 00:25:11,521 INFO L280 TraceCheckUtils]: 7: Hoare triple {25390#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {25390#true} is VALID [2020-07-18 00:25:11,521 INFO L280 TraceCheckUtils]: 8: Hoare triple {25390#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {25390#true} is VALID [2020-07-18 00:25:11,522 INFO L280 TraceCheckUtils]: 9: Hoare triple {25390#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-18 00:25:11,523 INFO L280 TraceCheckUtils]: 10: Hoare triple {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-18 00:25:11,524 INFO L280 TraceCheckUtils]: 11: Hoare triple {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} goto; {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-18 00:25:11,525 INFO L280 TraceCheckUtils]: 12: Hoare triple {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-18 00:25:11,525 INFO L280 TraceCheckUtils]: 13: Hoare triple {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} assume 0 != #t~nondet1; {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-18 00:25:11,526 INFO L280 TraceCheckUtils]: 14: Hoare triple {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} havoc #t~nondet1; {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-18 00:25:11,528 INFO L280 TraceCheckUtils]: 15: Hoare triple {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-7 {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-18 00:25:11,529 INFO L280 TraceCheckUtils]: 16: Hoare triple {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-18 00:25:11,530 INFO L280 TraceCheckUtils]: 17: Hoare triple {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-18 00:25:11,531 INFO L280 TraceCheckUtils]: 18: Hoare triple {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} assume !#t~short7; {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-18 00:25:11,531 INFO L280 TraceCheckUtils]: 19: Hoare triple {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-22 {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-18 00:25:11,532 INFO L280 TraceCheckUtils]: 20: Hoare triple {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} #t~short7 := #t~mem6.base == 0 && #t~mem6.offset == 0; {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-18 00:25:11,533 INFO L280 TraceCheckUtils]: 21: Hoare triple {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} assume !!#t~short7; {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-18 00:25:11,534 INFO L280 TraceCheckUtils]: 22: Hoare triple {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} havoc #t~mem5.base, #t~mem5.offset; {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-18 00:25:11,535 INFO L280 TraceCheckUtils]: 23: Hoare triple {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} havoc #t~short7; {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-18 00:25:11,535 INFO L280 TraceCheckUtils]: 24: Hoare triple {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} havoc #t~mem6.base, #t~mem6.offset; {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-18 00:25:11,536 INFO L280 TraceCheckUtils]: 25: Hoare triple {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} goto; {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-18 00:25:11,537 INFO L280 TraceCheckUtils]: 26: Hoare triple {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-18 00:25:11,538 INFO L280 TraceCheckUtils]: 27: Hoare triple {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-18 00:25:11,539 INFO L280 TraceCheckUtils]: 28: Hoare triple {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} assume !(0 != #t~nondet8); {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-18 00:25:11,539 INFO L280 TraceCheckUtils]: 29: Hoare triple {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} havoc #t~nondet8; {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-18 00:25:11,540 INFO L280 TraceCheckUtils]: 30: Hoare triple {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} ~end~0.base, ~end~0.offset := 0, 0; {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} is VALID [2020-07-18 00:25:11,541 INFO L280 TraceCheckUtils]: 31: Hoare triple {25397#(and (= 0 (select (store (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)) (= 0 (select (store (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4) 0) main_~list~0.offset)))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {25398#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-18 00:25:11,542 INFO L280 TraceCheckUtils]: 32: Hoare triple {25398#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {25398#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-18 00:25:11,543 INFO L280 TraceCheckUtils]: 33: Hoare triple {25398#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} goto; {25398#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-18 00:25:11,544 INFO L280 TraceCheckUtils]: 34: Hoare triple {25398#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {25398#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-18 00:25:11,545 INFO L280 TraceCheckUtils]: 35: Hoare triple {25398#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} ~len~0 := 0; {25398#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-18 00:25:11,546 INFO L280 TraceCheckUtils]: 36: Hoare triple {25398#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {25398#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-18 00:25:11,547 INFO L280 TraceCheckUtils]: 37: Hoare triple {25398#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {25398#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-18 00:25:11,547 INFO L280 TraceCheckUtils]: 38: Hoare triple {25398#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} havoc #t~mem18.base, #t~mem18.offset; {25398#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-18 00:25:11,548 INFO L280 TraceCheckUtils]: 39: Hoare triple {25398#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {25398#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-18 00:25:11,549 INFO L280 TraceCheckUtils]: 40: Hoare triple {25398#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} assume !!(~len~0 <= 1); {25398#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-18 00:25:11,549 INFO L280 TraceCheckUtils]: 41: Hoare triple {25398#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} goto; {25398#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} is VALID [2020-07-18 00:25:11,550 INFO L280 TraceCheckUtils]: 42: Hoare triple {25398#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~end~0.base) main_~end~0.offset)) (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) main_~end~0.offset)))} SUMMARY for call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1031-4 {25399#(and (= 0 |main_#t~mem23.base|) (= |main_#t~mem23.offset| 0))} is VALID [2020-07-18 00:25:11,551 INFO L280 TraceCheckUtils]: 43: Hoare triple {25399#(and (= 0 |main_#t~mem23.base|) (= |main_#t~mem23.offset| 0))} ~end~0.base, ~end~0.offset := #t~mem23.base, #t~mem23.offset; {25400#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} is VALID [2020-07-18 00:25:11,552 INFO L280 TraceCheckUtils]: 44: Hoare triple {25400#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} havoc #t~mem23.base, #t~mem23.offset; {25400#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} is VALID [2020-07-18 00:25:11,552 INFO L280 TraceCheckUtils]: 45: Hoare triple {25400#(and (= 0 main_~end~0.base) (= 0 main_~end~0.offset))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {25391#false} is VALID [2020-07-18 00:25:11,553 INFO L280 TraceCheckUtils]: 46: Hoare triple {25391#false} ~len~0 := 0; {25391#false} is VALID [2020-07-18 00:25:11,553 INFO L280 TraceCheckUtils]: 47: Hoare triple {25391#false} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {25391#false} is VALID [2020-07-18 00:25:11,553 INFO L280 TraceCheckUtils]: 48: Hoare triple {25391#false} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {25391#false} is VALID [2020-07-18 00:25:11,553 INFO L280 TraceCheckUtils]: 49: Hoare triple {25391#false} havoc #t~mem18.base, #t~mem18.offset; {25391#false} is VALID [2020-07-18 00:25:11,553 INFO L280 TraceCheckUtils]: 50: Hoare triple {25391#false} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {25391#false} is VALID [2020-07-18 00:25:11,553 INFO L280 TraceCheckUtils]: 51: Hoare triple {25391#false} assume 0 == ~len~0; {25391#false} is VALID [2020-07-18 00:25:11,554 INFO L280 TraceCheckUtils]: 52: Hoare triple {25391#false} ~len~0 := 1; {25391#false} is VALID [2020-07-18 00:25:11,554 INFO L280 TraceCheckUtils]: 53: Hoare triple {25391#false} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {25391#false} is VALID [2020-07-18 00:25:11,554 INFO L280 TraceCheckUtils]: 54: Hoare triple {25391#false} goto; {25391#false} is VALID [2020-07-18 00:25:11,554 INFO L280 TraceCheckUtils]: 55: Hoare triple {25391#false} SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); srcloc: L1025-6 {25391#false} is VALID [2020-07-18 00:25:11,554 INFO L280 TraceCheckUtils]: 56: Hoare triple {25391#false} assume !(0 == #t~mem19.base && 0 == #t~mem19.offset); {25391#false} is VALID [2020-07-18 00:25:11,555 INFO L280 TraceCheckUtils]: 57: Hoare triple {25391#false} havoc #t~mem19.base, #t~mem19.offset; {25391#false} is VALID [2020-07-18 00:25:11,555 INFO L280 TraceCheckUtils]: 58: Hoare triple {25391#false} assume !false; {25391#false} is VALID [2020-07-18 00:25:11,564 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:11,567 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:25:11,567 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2075076175] [2020-07-18 00:25:11,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:25:11,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-18 00:25:11,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646810480] [2020-07-18 00:25:11,568 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2020-07-18 00:25:11,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:25:11,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-18 00:25:11,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:25:11,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-18 00:25:11,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:25:11,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-18 00:25:11,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-18 00:25:11,641 INFO L87 Difference]: Start difference. First operand 270 states and 295 transitions. Second operand 7 states. [2020-07-18 00:25:15,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:25:15,892 INFO L93 Difference]: Finished difference Result 421 states and 458 transitions. [2020-07-18 00:25:15,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-18 00:25:15,893 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2020-07-18 00:25:15,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:25:15,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:25:15,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 313 transitions. [2020-07-18 00:25:15,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-18 00:25:15,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 313 transitions. [2020-07-18 00:25:15,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 313 transitions. [2020-07-18 00:25:16,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 313 edges. 313 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:25:16,303 INFO L225 Difference]: With dead ends: 421 [2020-07-18 00:25:16,303 INFO L226 Difference]: Without dead ends: 312 [2020-07-18 00:25:16,304 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-07-18 00:25:16,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2020-07-18 00:25:18,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 270. [2020-07-18 00:25:18,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:25:18,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 312 states. Second operand 270 states. [2020-07-18 00:25:18,675 INFO L74 IsIncluded]: Start isIncluded. First operand 312 states. Second operand 270 states. [2020-07-18 00:25:18,676 INFO L87 Difference]: Start difference. First operand 312 states. Second operand 270 states. [2020-07-18 00:25:18,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:25:18,683 INFO L93 Difference]: Finished difference Result 312 states and 333 transitions. [2020-07-18 00:25:18,683 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 333 transitions. [2020-07-18 00:25:18,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:25:18,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:25:18,683 INFO L74 IsIncluded]: Start isIncluded. First operand 270 states. Second operand 312 states. [2020-07-18 00:25:18,683 INFO L87 Difference]: Start difference. First operand 270 states. Second operand 312 states. [2020-07-18 00:25:18,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:25:18,690 INFO L93 Difference]: Finished difference Result 312 states and 333 transitions. [2020-07-18 00:25:18,690 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 333 transitions. [2020-07-18 00:25:18,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:25:18,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:25:18,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:25:18,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:25:18,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2020-07-18 00:25:18,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 293 transitions. [2020-07-18 00:25:18,696 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 293 transitions. Word has length 59 [2020-07-18 00:25:18,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:25:18,696 INFO L479 AbstractCegarLoop]: Abstraction has 270 states and 293 transitions. [2020-07-18 00:25:18,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-18 00:25:18,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 270 states and 293 transitions. [2020-07-18 00:25:19,881 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 293 edges. 293 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:25:19,881 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 293 transitions. [2020-07-18 00:25:19,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-07-18 00:25:19,882 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:25:19,883 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:25:19,883 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-07-18 00:25:19,883 INFO L427 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:25:19,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:25:19,883 INFO L82 PathProgramCache]: Analyzing trace with hash -984681049, now seen corresponding path program 1 times [2020-07-18 00:25:19,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:25:19,884 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1097311791] [2020-07-18 00:25:19,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:25:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:25:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:25:20,202 INFO L280 TraceCheckUtils]: 0: Hoare triple {27438#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {27418#true} is VALID [2020-07-18 00:25:20,203 INFO L280 TraceCheckUtils]: 1: Hoare triple {27418#true} #valid := #valid[0 := 0]; {27418#true} is VALID [2020-07-18 00:25:20,203 INFO L280 TraceCheckUtils]: 2: Hoare triple {27418#true} assume 0 < #StackHeapBarrier; {27418#true} is VALID [2020-07-18 00:25:20,203 INFO L280 TraceCheckUtils]: 3: Hoare triple {27418#true} assume true; {27418#true} is VALID [2020-07-18 00:25:20,203 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {27418#true} {27418#true} #419#return; {27418#true} is VALID [2020-07-18 00:25:20,204 INFO L263 TraceCheckUtils]: 0: Hoare triple {27418#true} call ULTIMATE.init(); {27438#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:25:20,205 INFO L280 TraceCheckUtils]: 1: Hoare triple {27438#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {27418#true} is VALID [2020-07-18 00:25:20,205 INFO L280 TraceCheckUtils]: 2: Hoare triple {27418#true} #valid := #valid[0 := 0]; {27418#true} is VALID [2020-07-18 00:25:20,205 INFO L280 TraceCheckUtils]: 3: Hoare triple {27418#true} assume 0 < #StackHeapBarrier; {27418#true} is VALID [2020-07-18 00:25:20,205 INFO L280 TraceCheckUtils]: 4: Hoare triple {27418#true} assume true; {27418#true} is VALID [2020-07-18 00:25:20,205 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {27418#true} {27418#true} #419#return; {27418#true} is VALID [2020-07-18 00:25:20,205 INFO L263 TraceCheckUtils]: 6: Hoare triple {27418#true} call #t~ret28 := main(); {27418#true} is VALID [2020-07-18 00:25:20,207 INFO L280 TraceCheckUtils]: 7: Hoare triple {27418#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {27425#(= 1 (select |#valid| |main_#t~malloc0.base|))} is VALID [2020-07-18 00:25:20,207 INFO L280 TraceCheckUtils]: 8: Hoare triple {27425#(= 1 (select |#valid| |main_#t~malloc0.base|))} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {27426#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 00:25:20,208 INFO L280 TraceCheckUtils]: 9: Hoare triple {27426#(= 1 (select |#valid| main_~list~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {27426#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 00:25:20,211 INFO L280 TraceCheckUtils]: 10: Hoare triple {27426#(= 1 (select |#valid| main_~list~0.base))} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {27426#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 00:25:20,217 INFO L280 TraceCheckUtils]: 11: Hoare triple {27426#(= 1 (select |#valid| main_~list~0.base))} goto; {27426#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 00:25:20,218 INFO L280 TraceCheckUtils]: 12: Hoare triple {27426#(= 1 (select |#valid| main_~list~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {27426#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 00:25:20,219 INFO L280 TraceCheckUtils]: 13: Hoare triple {27426#(= 1 (select |#valid| main_~list~0.base))} assume !(0 != #t~nondet1); {27426#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 00:25:20,219 INFO L280 TraceCheckUtils]: 14: Hoare triple {27426#(= 1 (select |#valid| main_~list~0.base))} havoc #t~nondet1; {27426#(= 1 (select |#valid| main_~list~0.base))} is VALID [2020-07-18 00:25:20,220 INFO L280 TraceCheckUtils]: 15: Hoare triple {27426#(= 1 (select |#valid| main_~list~0.base))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: L993-10 {27427#(and (= 0 |main_#t~malloc2.offset|) (not (= |main_#t~malloc2.base| main_~list~0.base)))} is VALID [2020-07-18 00:25:20,221 INFO L280 TraceCheckUtils]: 16: Hoare triple {27427#(and (= 0 |main_#t~malloc2.offset|) (not (= |main_#t~malloc2.base| main_~list~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-11 {27428#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:25:20,222 INFO L280 TraceCheckUtils]: 17: Hoare triple {27428#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-12 {27429#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem3.base|) (not (= |main_#t~mem3.base| main_~list~0.base)))} is VALID [2020-07-18 00:25:20,223 INFO L280 TraceCheckUtils]: 18: Hoare triple {27429#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem3.base|) (not (= |main_#t~mem3.base| main_~list~0.base)))} SUMMARY for call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); srcloc: L993-13 {27428#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:25:20,224 INFO L280 TraceCheckUtils]: 19: Hoare triple {27428#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem3.base, #t~mem3.offset; {27428#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:25:20,225 INFO L280 TraceCheckUtils]: 20: Hoare triple {27428#(and (not (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) main_~list~0.base)) (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-15 {27430#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= |main_#t~mem4.base| main_~list~0.base)))} is VALID [2020-07-18 00:25:20,226 INFO L280 TraceCheckUtils]: 21: Hoare triple {27430#(and (= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4))) (not (= |main_#t~mem4.base| main_~list~0.base)))} SUMMARY for call write~$Pointer$(0, 0, #t~mem4.base, 4 + #t~mem4.offset, 4); srcloc: L993-16 {27431#(= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))} is VALID [2020-07-18 00:25:20,227 INFO L280 TraceCheckUtils]: 22: Hoare triple {27431#(= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))} havoc #t~mem4.base, #t~mem4.offset; {27431#(= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))} is VALID [2020-07-18 00:25:20,227 INFO L280 TraceCheckUtils]: 23: Hoare triple {27431#(= 0 (select (select |#memory_$Pointer$.offset| main_~list~0.base) (+ main_~list~0.offset 4)))} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {27432#(and (= 0 |main_#t~mem5.offset|) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|))} is VALID [2020-07-18 00:25:20,228 INFO L280 TraceCheckUtils]: 24: Hoare triple {27432#(and (= 0 |main_#t~mem5.offset|) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)) |main_#t~mem5.base|))} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {27433#(or (not |main_#t~short7|) (not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))))} is VALID [2020-07-18 00:25:20,229 INFO L280 TraceCheckUtils]: 25: Hoare triple {27433#(or (not |main_#t~short7|) (not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4)))))} assume #t~short7; {27434#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:25:20,229 INFO L280 TraceCheckUtils]: 26: Hoare triple {27434#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !!#t~short7; {27434#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:25:20,230 INFO L280 TraceCheckUtils]: 27: Hoare triple {27434#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem5.base, #t~mem5.offset; {27434#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:25:20,231 INFO L280 TraceCheckUtils]: 28: Hoare triple {27434#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~short7; {27434#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:25:20,231 INFO L280 TraceCheckUtils]: 29: Hoare triple {27434#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~mem6.base, #t~mem6.offset; {27434#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:25:20,232 INFO L280 TraceCheckUtils]: 30: Hoare triple {27434#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} goto; {27434#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:25:20,232 INFO L280 TraceCheckUtils]: 31: Hoare triple {27434#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {27434#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:25:20,233 INFO L280 TraceCheckUtils]: 32: Hoare triple {27434#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {27434#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:25:20,233 INFO L280 TraceCheckUtils]: 33: Hoare triple {27434#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} assume !(0 != #t~nondet8); {27434#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:25:20,234 INFO L280 TraceCheckUtils]: 34: Hoare triple {27434#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} havoc #t~nondet8; {27434#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:25:20,235 INFO L280 TraceCheckUtils]: 35: Hoare triple {27434#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := 0, 0; {27434#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} is VALID [2020-07-18 00:25:20,235 INFO L280 TraceCheckUtils]: 36: Hoare triple {27434#(not (= 0 (select (select |#memory_$Pointer$.base| main_~list~0.base) (+ main_~list~0.offset 4))))} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {27435#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-18 00:25:20,236 INFO L280 TraceCheckUtils]: 37: Hoare triple {27435#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {27435#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-18 00:25:20,236 INFO L280 TraceCheckUtils]: 38: Hoare triple {27435#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} goto; {27435#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-18 00:25:20,237 INFO L280 TraceCheckUtils]: 39: Hoare triple {27435#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {27435#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-18 00:25:20,237 INFO L280 TraceCheckUtils]: 40: Hoare triple {27435#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} ~len~0 := 0; {27435#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} is VALID [2020-07-18 00:25:20,238 INFO L280 TraceCheckUtils]: 41: Hoare triple {27435#(not (= 0 (select (select |#memory_$Pointer$.base| main_~end~0.base) (+ main_~end~0.offset 4))))} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {27436#(not (= 0 |main_#t~mem18.base|))} is VALID [2020-07-18 00:25:20,239 INFO L280 TraceCheckUtils]: 42: Hoare triple {27436#(not (= 0 |main_#t~mem18.base|))} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {27437#(not (= 0 main_~inner~0.base))} is VALID [2020-07-18 00:25:20,239 INFO L280 TraceCheckUtils]: 43: Hoare triple {27437#(not (= 0 main_~inner~0.base))} havoc #t~mem18.base, #t~mem18.offset; {27437#(not (= 0 main_~inner~0.base))} is VALID [2020-07-18 00:25:20,240 INFO L280 TraceCheckUtils]: 44: Hoare triple {27437#(not (= 0 main_~inner~0.base))} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {27419#false} is VALID [2020-07-18 00:25:20,240 INFO L280 TraceCheckUtils]: 45: Hoare triple {27419#false} assume !!(~len~0 <= 1); {27419#false} is VALID [2020-07-18 00:25:20,240 INFO L280 TraceCheckUtils]: 46: Hoare triple {27419#false} goto; {27419#false} is VALID [2020-07-18 00:25:20,241 INFO L280 TraceCheckUtils]: 47: Hoare triple {27419#false} SUMMARY for call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~end~0.base, ~end~0.offset, 4); srcloc: L1031-4 {27419#false} is VALID [2020-07-18 00:25:20,241 INFO L280 TraceCheckUtils]: 48: Hoare triple {27419#false} ~end~0.base, ~end~0.offset := #t~mem23.base, #t~mem23.offset; {27419#false} is VALID [2020-07-18 00:25:20,241 INFO L280 TraceCheckUtils]: 49: Hoare triple {27419#false} havoc #t~mem23.base, #t~mem23.offset; {27419#false} is VALID [2020-07-18 00:25:20,241 INFO L280 TraceCheckUtils]: 50: Hoare triple {27419#false} assume !(0 != ~end~0.base || 0 != ~end~0.offset); {27419#false} is VALID [2020-07-18 00:25:20,242 INFO L280 TraceCheckUtils]: 51: Hoare triple {27419#false} assume !!(0 != ~list~0.base || 0 != ~list~0.offset); {27419#false} is VALID [2020-07-18 00:25:20,242 INFO L280 TraceCheckUtils]: 52: Hoare triple {27419#false} SUMMARY for call #t~mem24.base, #t~mem24.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L1039 {27419#false} is VALID [2020-07-18 00:25:20,242 INFO L280 TraceCheckUtils]: 53: Hoare triple {27419#false} ~end~0.base, ~end~0.offset := #t~mem24.base, #t~mem24.offset; {27419#false} is VALID [2020-07-18 00:25:20,242 INFO L280 TraceCheckUtils]: 54: Hoare triple {27419#false} havoc #t~mem24.base, #t~mem24.offset; {27419#false} is VALID [2020-07-18 00:25:20,242 INFO L280 TraceCheckUtils]: 55: Hoare triple {27419#false} assume 0 != ~end~0.base || 0 != ~end~0.offset; {27419#false} is VALID [2020-07-18 00:25:20,242 INFO L280 TraceCheckUtils]: 56: Hoare triple {27419#false} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {27419#false} is VALID [2020-07-18 00:25:20,243 INFO L280 TraceCheckUtils]: 57: Hoare triple {27419#false} goto; {27419#false} is VALID [2020-07-18 00:25:20,243 INFO L280 TraceCheckUtils]: 58: Hoare triple {27419#false} SUMMARY for call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1044-6 {27419#false} is VALID [2020-07-18 00:25:20,243 INFO L280 TraceCheckUtils]: 59: Hoare triple {27419#false} assume !(0 == #t~mem25.base && 0 == #t~mem25.offset); {27419#false} is VALID [2020-07-18 00:25:20,243 INFO L280 TraceCheckUtils]: 60: Hoare triple {27419#false} havoc #t~mem25.base, #t~mem25.offset; {27419#false} is VALID [2020-07-18 00:25:20,244 INFO L280 TraceCheckUtils]: 61: Hoare triple {27419#false} assume !false; {27419#false} is VALID [2020-07-18 00:25:20,251 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:20,251 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:25:20,252 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1097311791] [2020-07-18 00:25:20,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:25:20,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2020-07-18 00:25:20,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693934239] [2020-07-18 00:25:20,253 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 62 [2020-07-18 00:25:20,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:25:20,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-18 00:25:20,328 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:25:20,328 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-18 00:25:20,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:25:20,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-18 00:25:20,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2020-07-18 00:25:20,329 INFO L87 Difference]: Start difference. First operand 270 states and 293 transitions. Second operand 16 states. [2020-07-18 00:25:30,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:25:30,473 INFO L93 Difference]: Finished difference Result 574 states and 610 transitions. [2020-07-18 00:25:30,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-07-18 00:25:30,474 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 62 [2020-07-18 00:25:30,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:25:30,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-18 00:25:30,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 524 transitions. [2020-07-18 00:25:30,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-18 00:25:30,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 524 transitions. [2020-07-18 00:25:30,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 524 transitions. [2020-07-18 00:25:31,241 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 524 edges. 524 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:25:31,257 INFO L225 Difference]: With dead ends: 574 [2020-07-18 00:25:31,258 INFO L226 Difference]: Without dead ends: 540 [2020-07-18 00:25:31,258 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=274, Invalid=916, Unknown=0, NotChecked=0, Total=1190 [2020-07-18 00:25:31,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2020-07-18 00:25:33,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 269. [2020-07-18 00:25:33,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:25:33,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 540 states. Second operand 269 states. [2020-07-18 00:25:33,681 INFO L74 IsIncluded]: Start isIncluded. First operand 540 states. Second operand 269 states. [2020-07-18 00:25:33,681 INFO L87 Difference]: Start difference. First operand 540 states. Second operand 269 states. [2020-07-18 00:25:33,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:25:33,696 INFO L93 Difference]: Finished difference Result 540 states and 574 transitions. [2020-07-18 00:25:33,696 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 574 transitions. [2020-07-18 00:25:33,697 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:25:33,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:25:33,697 INFO L74 IsIncluded]: Start isIncluded. First operand 269 states. Second operand 540 states. [2020-07-18 00:25:33,697 INFO L87 Difference]: Start difference. First operand 269 states. Second operand 540 states. [2020-07-18 00:25:33,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:25:33,714 INFO L93 Difference]: Finished difference Result 540 states and 574 transitions. [2020-07-18 00:25:33,714 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 574 transitions. [2020-07-18 00:25:33,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:25:33,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:25:33,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:25:33,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:25:33,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2020-07-18 00:25:33,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 291 transitions. [2020-07-18 00:25:33,721 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 291 transitions. Word has length 62 [2020-07-18 00:25:33,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:25:33,722 INFO L479 AbstractCegarLoop]: Abstraction has 269 states and 291 transitions. [2020-07-18 00:25:33,722 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-18 00:25:33,722 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 269 states and 291 transitions. [2020-07-18 00:25:34,943 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 291 edges. 291 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:25:34,944 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 291 transitions. [2020-07-18 00:25:34,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-07-18 00:25:34,945 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:25:34,945 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-18 00:25:34,946 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-07-18 00:25:34,946 INFO L427 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:25:34,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:25:34,946 INFO L82 PathProgramCache]: Analyzing trace with hash -649286859, now seen corresponding path program 1 times [2020-07-18 00:25:34,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:25:34,947 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1052572570] [2020-07-18 00:25:34,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:25:34,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:25:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-18 00:25:35,003 INFO L280 TraceCheckUtils]: 0: Hoare triple {30253#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {30245#true} is VALID [2020-07-18 00:25:35,004 INFO L280 TraceCheckUtils]: 1: Hoare triple {30245#true} #valid := #valid[0 := 0]; {30245#true} is VALID [2020-07-18 00:25:35,004 INFO L280 TraceCheckUtils]: 2: Hoare triple {30245#true} assume 0 < #StackHeapBarrier; {30245#true} is VALID [2020-07-18 00:25:35,004 INFO L280 TraceCheckUtils]: 3: Hoare triple {30245#true} assume true; {30245#true} is VALID [2020-07-18 00:25:35,004 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {30245#true} {30245#true} #419#return; {30245#true} is VALID [2020-07-18 00:25:35,005 INFO L263 TraceCheckUtils]: 0: Hoare triple {30245#true} call ULTIMATE.init(); {30253#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-18 00:25:35,006 INFO L280 TraceCheckUtils]: 1: Hoare triple {30253#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {30245#true} is VALID [2020-07-18 00:25:35,006 INFO L280 TraceCheckUtils]: 2: Hoare triple {30245#true} #valid := #valid[0 := 0]; {30245#true} is VALID [2020-07-18 00:25:35,006 INFO L280 TraceCheckUtils]: 3: Hoare triple {30245#true} assume 0 < #StackHeapBarrier; {30245#true} is VALID [2020-07-18 00:25:35,006 INFO L280 TraceCheckUtils]: 4: Hoare triple {30245#true} assume true; {30245#true} is VALID [2020-07-18 00:25:35,007 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {30245#true} {30245#true} #419#return; {30245#true} is VALID [2020-07-18 00:25:35,007 INFO L263 TraceCheckUtils]: 6: Hoare triple {30245#true} call #t~ret28 := main(); {30245#true} is VALID [2020-07-18 00:25:35,007 INFO L280 TraceCheckUtils]: 7: Hoare triple {30245#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(8); srcloc: mainENTRY {30245#true} is VALID [2020-07-18 00:25:35,007 INFO L280 TraceCheckUtils]: 8: Hoare triple {30245#true} ~list~0.base, ~list~0.offset := #t~malloc0.base, #t~malloc0.offset; {30245#true} is VALID [2020-07-18 00:25:35,007 INFO L280 TraceCheckUtils]: 9: Hoare triple {30245#true} SUMMARY for call write~$Pointer$(0, 0, ~list~0.base, ~list~0.offset, 4); srcloc: L992 {30245#true} is VALID [2020-07-18 00:25:35,008 INFO L280 TraceCheckUtils]: 10: Hoare triple {30245#true} assume !!(~list~0.base != 0 || ~list~0.offset != 0); {30245#true} is VALID [2020-07-18 00:25:35,008 INFO L280 TraceCheckUtils]: 11: Hoare triple {30245#true} goto; {30245#true} is VALID [2020-07-18 00:25:35,008 INFO L280 TraceCheckUtils]: 12: Hoare triple {30245#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {30245#true} is VALID [2020-07-18 00:25:35,008 INFO L280 TraceCheckUtils]: 13: Hoare triple {30245#true} assume !(0 != #t~nondet1); {30245#true} is VALID [2020-07-18 00:25:35,008 INFO L280 TraceCheckUtils]: 14: Hoare triple {30245#true} havoc #t~nondet1; {30245#true} is VALID [2020-07-18 00:25:35,009 INFO L280 TraceCheckUtils]: 15: Hoare triple {30245#true} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8); srcloc: L993-10 {30245#true} is VALID [2020-07-18 00:25:35,009 INFO L280 TraceCheckUtils]: 16: Hoare triple {30245#true} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-11 {30245#true} is VALID [2020-07-18 00:25:35,009 INFO L280 TraceCheckUtils]: 17: Hoare triple {30245#true} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-12 {30245#true} is VALID [2020-07-18 00:25:35,009 INFO L280 TraceCheckUtils]: 18: Hoare triple {30245#true} SUMMARY for call write~$Pointer$(0, 0, #t~mem3.base, #t~mem3.offset, 4); srcloc: L993-13 {30245#true} is VALID [2020-07-18 00:25:35,009 INFO L280 TraceCheckUtils]: 19: Hoare triple {30245#true} havoc #t~mem3.base, #t~mem3.offset; {30245#true} is VALID [2020-07-18 00:25:35,009 INFO L280 TraceCheckUtils]: 20: Hoare triple {30245#true} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-15 {30245#true} is VALID [2020-07-18 00:25:35,010 INFO L280 TraceCheckUtils]: 21: Hoare triple {30245#true} SUMMARY for call write~$Pointer$(0, 0, #t~mem4.base, 4 + #t~mem4.offset, 4); srcloc: L993-16 {30245#true} is VALID [2020-07-18 00:25:35,010 INFO L280 TraceCheckUtils]: 22: Hoare triple {30245#true} havoc #t~mem4.base, #t~mem4.offset; {30245#true} is VALID [2020-07-18 00:25:35,010 INFO L280 TraceCheckUtils]: 23: Hoare triple {30245#true} SUMMARY for call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~list~0.base, 4 + ~list~0.offset, 4); srcloc: L993-34 {30245#true} is VALID [2020-07-18 00:25:35,010 INFO L280 TraceCheckUtils]: 24: Hoare triple {30245#true} #t~short7 := #t~mem5.base != 0 || #t~mem5.offset != 0; {30245#true} is VALID [2020-07-18 00:25:35,010 INFO L280 TraceCheckUtils]: 25: Hoare triple {30245#true} assume #t~short7; {30245#true} is VALID [2020-07-18 00:25:35,011 INFO L280 TraceCheckUtils]: 26: Hoare triple {30245#true} assume !!#t~short7; {30245#true} is VALID [2020-07-18 00:25:35,011 INFO L280 TraceCheckUtils]: 27: Hoare triple {30245#true} havoc #t~mem5.base, #t~mem5.offset; {30245#true} is VALID [2020-07-18 00:25:35,011 INFO L280 TraceCheckUtils]: 28: Hoare triple {30245#true} havoc #t~short7; {30245#true} is VALID [2020-07-18 00:25:35,011 INFO L280 TraceCheckUtils]: 29: Hoare triple {30245#true} havoc #t~mem6.base, #t~mem6.offset; {30245#true} is VALID [2020-07-18 00:25:35,011 INFO L280 TraceCheckUtils]: 30: Hoare triple {30245#true} goto; {30245#true} is VALID [2020-07-18 00:25:35,012 INFO L280 TraceCheckUtils]: 31: Hoare triple {30245#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {30245#true} is VALID [2020-07-18 00:25:35,012 INFO L280 TraceCheckUtils]: 32: Hoare triple {30245#true} assume -2147483648 <= #t~nondet8 && #t~nondet8 <= 2147483647; {30245#true} is VALID [2020-07-18 00:25:35,012 INFO L280 TraceCheckUtils]: 33: Hoare triple {30245#true} assume !(0 != #t~nondet8); {30245#true} is VALID [2020-07-18 00:25:35,012 INFO L280 TraceCheckUtils]: 34: Hoare triple {30245#true} havoc #t~nondet8; {30245#true} is VALID [2020-07-18 00:25:35,012 INFO L280 TraceCheckUtils]: 35: Hoare triple {30245#true} ~end~0.base, ~end~0.offset := 0, 0; {30245#true} is VALID [2020-07-18 00:25:35,013 INFO L280 TraceCheckUtils]: 36: Hoare triple {30245#true} ~end~0.base, ~end~0.offset := ~list~0.base, ~list~0.offset; {30245#true} is VALID [2020-07-18 00:25:35,013 INFO L280 TraceCheckUtils]: 37: Hoare triple {30245#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {30245#true} is VALID [2020-07-18 00:25:35,013 INFO L280 TraceCheckUtils]: 38: Hoare triple {30245#true} goto; {30245#true} is VALID [2020-07-18 00:25:35,013 INFO L280 TraceCheckUtils]: 39: Hoare triple {30245#true} assume !!(0 != ~end~0.base || 0 != ~end~0.offset); {30245#true} is VALID [2020-07-18 00:25:35,013 INFO L280 TraceCheckUtils]: 40: Hoare triple {30245#true} ~len~0 := 0; {30245#true} is VALID [2020-07-18 00:25:35,014 INFO L280 TraceCheckUtils]: 41: Hoare triple {30245#true} SUMMARY for call #t~mem18.base, #t~mem18.offset := read~$Pointer$(~end~0.base, 4 + ~end~0.offset, 4); srcloc: L1017 {30245#true} is VALID [2020-07-18 00:25:35,014 INFO L280 TraceCheckUtils]: 42: Hoare triple {30245#true} ~inner~0.base, ~inner~0.offset := #t~mem18.base, #t~mem18.offset; {30245#true} is VALID [2020-07-18 00:25:35,014 INFO L280 TraceCheckUtils]: 43: Hoare triple {30245#true} havoc #t~mem18.base, #t~mem18.offset; {30245#true} is VALID [2020-07-18 00:25:35,014 INFO L280 TraceCheckUtils]: 44: Hoare triple {30245#true} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {30245#true} is VALID [2020-07-18 00:25:35,014 INFO L280 TraceCheckUtils]: 45: Hoare triple {30245#true} assume 0 == ~len~0; {30245#true} is VALID [2020-07-18 00:25:35,015 INFO L280 TraceCheckUtils]: 46: Hoare triple {30245#true} ~len~0 := 1; {30252#(= 1 main_~len~0)} is VALID [2020-07-18 00:25:35,016 INFO L280 TraceCheckUtils]: 47: Hoare triple {30252#(= 1 main_~len~0)} assume !!(0 != ~inner~0.base || 0 != ~inner~0.offset); {30252#(= 1 main_~len~0)} is VALID [2020-07-18 00:25:35,016 INFO L280 TraceCheckUtils]: 48: Hoare triple {30252#(= 1 main_~len~0)} goto; {30252#(= 1 main_~len~0)} is VALID [2020-07-18 00:25:35,017 INFO L280 TraceCheckUtils]: 49: Hoare triple {30252#(= 1 main_~len~0)} SUMMARY for call #t~mem19.base, #t~mem19.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); srcloc: L1025-6 {30252#(= 1 main_~len~0)} is VALID [2020-07-18 00:25:35,018 INFO L280 TraceCheckUtils]: 50: Hoare triple {30252#(= 1 main_~len~0)} assume !!(0 == #t~mem19.base && 0 == #t~mem19.offset); {30252#(= 1 main_~len~0)} is VALID [2020-07-18 00:25:35,018 INFO L280 TraceCheckUtils]: 51: Hoare triple {30252#(= 1 main_~len~0)} havoc #t~mem19.base, #t~mem19.offset; {30252#(= 1 main_~len~0)} is VALID [2020-07-18 00:25:35,019 INFO L280 TraceCheckUtils]: 52: Hoare triple {30252#(= 1 main_~len~0)} goto; {30252#(= 1 main_~len~0)} is VALID [2020-07-18 00:25:35,019 INFO L280 TraceCheckUtils]: 53: Hoare triple {30252#(= 1 main_~len~0)} SUMMARY for call #t~mem20.base, #t~mem20.offset := read~$Pointer$(~inner~0.base, ~inner~0.offset, 4); srcloc: L1026-6 {30252#(= 1 main_~len~0)} is VALID [2020-07-18 00:25:35,020 INFO L280 TraceCheckUtils]: 54: Hoare triple {30252#(= 1 main_~len~0)} assume !!(0 == #t~mem20.base && 0 == #t~mem20.offset); {30252#(= 1 main_~len~0)} is VALID [2020-07-18 00:25:35,020 INFO L280 TraceCheckUtils]: 55: Hoare triple {30252#(= 1 main_~len~0)} havoc #t~mem20.base, #t~mem20.offset; {30252#(= 1 main_~len~0)} is VALID [2020-07-18 00:25:35,021 INFO L280 TraceCheckUtils]: 56: Hoare triple {30252#(= 1 main_~len~0)} goto; {30252#(= 1 main_~len~0)} is VALID [2020-07-18 00:25:35,021 INFO L280 TraceCheckUtils]: 57: Hoare triple {30252#(= 1 main_~len~0)} SUMMARY for call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~inner~0.base, 4 + ~inner~0.offset, 4); srcloc: L1026-7 {30252#(= 1 main_~len~0)} is VALID [2020-07-18 00:25:35,022 INFO L280 TraceCheckUtils]: 58: Hoare triple {30252#(= 1 main_~len~0)} ~inner~0.base, ~inner~0.offset := #t~mem21.base, #t~mem21.offset; {30252#(= 1 main_~len~0)} is VALID [2020-07-18 00:25:35,023 INFO L280 TraceCheckUtils]: 59: Hoare triple {30252#(= 1 main_~len~0)} havoc #t~mem21.base, #t~mem21.offset; {30252#(= 1 main_~len~0)} is VALID [2020-07-18 00:25:35,023 INFO L280 TraceCheckUtils]: 60: Hoare triple {30252#(= 1 main_~len~0)} assume !(1 == ~len~0); {30246#false} is VALID [2020-07-18 00:25:35,023 INFO L280 TraceCheckUtils]: 61: Hoare triple {30246#false} assume !(0 != ~inner~0.base || 0 != ~inner~0.offset); {30246#false} is VALID [2020-07-18 00:25:35,024 INFO L280 TraceCheckUtils]: 62: Hoare triple {30246#false} assume !(~len~0 <= 1); {30246#false} is VALID [2020-07-18 00:25:35,024 INFO L280 TraceCheckUtils]: 63: Hoare triple {30246#false} assume !false; {30246#false} is VALID [2020-07-18 00:25:35,026 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:35,027 INFO L192 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-18 00:25:35,027 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1052572570] [2020-07-18 00:25:35,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-18 00:25:35,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-18 00:25:35,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530273503] [2020-07-18 00:25:35,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2020-07-18 00:25:35,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-18 00:25:35,029 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-18 00:25:35,096 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:25:35,096 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-18 00:25:35,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-18 00:25:35,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-18 00:25:35,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:25:35,097 INFO L87 Difference]: Start difference. First operand 269 states and 291 transitions. Second operand 4 states. [2020-07-18 00:25:39,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:25:39,320 INFO L93 Difference]: Finished difference Result 447 states and 493 transitions. [2020-07-18 00:25:39,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-18 00:25:39,320 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2020-07-18 00:25:39,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-18 00:25:39,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:25:39,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 290 transitions. [2020-07-18 00:25:39,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-18 00:25:39,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 290 transitions. [2020-07-18 00:25:39,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 290 transitions. [2020-07-18 00:25:39,620 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 290 edges. 290 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:25:39,629 INFO L225 Difference]: With dead ends: 447 [2020-07-18 00:25:39,630 INFO L226 Difference]: Without dead ends: 350 [2020-07-18 00:25:39,630 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-18 00:25:39,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2020-07-18 00:25:42,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 302. [2020-07-18 00:25:42,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-18 00:25:42,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 350 states. Second operand 302 states. [2020-07-18 00:25:42,338 INFO L74 IsIncluded]: Start isIncluded. First operand 350 states. Second operand 302 states. [2020-07-18 00:25:42,339 INFO L87 Difference]: Start difference. First operand 350 states. Second operand 302 states. [2020-07-18 00:25:42,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:25:42,348 INFO L93 Difference]: Finished difference Result 350 states and 378 transitions. [2020-07-18 00:25:42,348 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 378 transitions. [2020-07-18 00:25:42,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:25:42,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:25:42,349 INFO L74 IsIncluded]: Start isIncluded. First operand 302 states. Second operand 350 states. [2020-07-18 00:25:42,349 INFO L87 Difference]: Start difference. First operand 302 states. Second operand 350 states. [2020-07-18 00:25:42,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-18 00:25:42,356 INFO L93 Difference]: Finished difference Result 350 states and 378 transitions. [2020-07-18 00:25:42,357 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 378 transitions. [2020-07-18 00:25:42,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-18 00:25:42,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-18 00:25:42,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-18 00:25:42,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-18 00:25:42,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2020-07-18 00:25:42,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 330 transitions. [2020-07-18 00:25:42,361 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 330 transitions. Word has length 64 [2020-07-18 00:25:42,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-18 00:25:42,361 INFO L479 AbstractCegarLoop]: Abstraction has 302 states and 330 transitions. [2020-07-18 00:25:42,362 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-18 00:25:42,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 302 states and 330 transitions. [2020-07-18 00:25:43,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 330 edges. 330 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-18 00:25:43,788 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 330 transitions. [2020-07-18 00:25:43,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-07-18 00:25:43,790 INFO L414 BasicCegarLoop]: Found error trace [2020-07-18 00:25:43,790 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,790 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-07-18 00:25:43,790 INFO L427 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-18 00:25:43,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-18 00:25:43,791 INFO L82 PathProgramCache]: Analyzing trace with hash -201437452, now seen corresponding path program 1 times [2020-07-18 00:25:43,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-18 00:25:43,791 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1100416124] [2020-07-18 00:25:43,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-18 00:25:43,806 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-07-18 00:25:43,807 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:458) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:290) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:191) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-18 00:25:43,813 INFO L168 Benchmark]: Toolchain (without parser) took 116079.04 ms. Allocated memory was 143.7 MB in the beginning and 710.9 MB in the end (delta: 567.3 MB). Free memory was 100.8 MB in the beginning and 248.2 MB in the end (delta: -147.4 MB). Peak memory consumption was 419.9 MB. Max. memory is 7.1 GB. [2020-07-18 00:25:43,814 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 143.7 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-18 00:25:43,814 INFO L168 Benchmark]: CACSL2BoogieTranslator took 777.72 ms. Allocated memory was 143.7 MB in the beginning and 202.4 MB in the end (delta: 58.7 MB). Free memory was 100.4 MB in the beginning and 168.5 MB in the end (delta: -68.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. [2020-07-18 00:25:43,814 INFO L168 Benchmark]: Boogie Preprocessor took 91.67 ms. Allocated memory is still 202.4 MB. Free memory was 168.5 MB in the beginning and 164.2 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 7.1 GB. [2020-07-18 00:25:43,815 INFO L168 Benchmark]: RCFGBuilder took 1080.90 ms. Allocated memory was 202.4 MB in the beginning and 232.3 MB in the end (delta: 29.9 MB). Free memory was 164.2 MB in the beginning and 193.6 MB in the end (delta: -29.4 MB). Peak memory consumption was 84.1 MB. Max. memory is 7.1 GB. [2020-07-18 00:25:43,816 INFO L168 Benchmark]: TraceAbstraction took 114121.18 ms. Allocated memory was 232.3 MB in the beginning and 710.9 MB in the end (delta: 478.7 MB). Free memory was 192.1 MB in the beginning and 248.2 MB in the end (delta: -56.1 MB). Peak memory consumption was 422.6 MB. Max. memory is 7.1 GB. [2020-07-18 00:25:43,818 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.27 ms. Allocated memory is still 143.7 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 777.72 ms. Allocated memory was 143.7 MB in the beginning and 202.4 MB in the end (delta: 58.7 MB). Free memory was 100.4 MB in the beginning and 168.5 MB in the end (delta: -68.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 91.67 ms. Allocated memory is still 202.4 MB. Free memory was 168.5 MB in the beginning and 164.2 MB in the end (delta: 4.3 MB). Peak memory consumption was 4.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1080.90 ms. Allocated memory was 202.4 MB in the beginning and 232.3 MB in the end (delta: 29.9 MB). Free memory was 164.2 MB in the beginning and 193.6 MB in the end (delta: -29.4 MB). Peak memory consumption was 84.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 114121.18 ms. Allocated memory was 232.3 MB in the beginning and 710.9 MB in the end (delta: 478.7 MB). Free memory was 192.1 MB in the beginning and 248.2 MB in the end (delta: -56.1 MB). Peak memory consumption was 422.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:458) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...