/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 --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/heap-manipulation/merge_sort-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-11 01:02:11,667 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-11 01:02:11,671 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-11 01:02:11,691 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-11 01:02:11,692 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-11 01:02:11,694 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-11 01:02:11,696 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-11 01:02:11,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-11 01:02:11,711 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-11 01:02:11,714 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-11 01:02:11,716 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-11 01:02:11,719 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-11 01:02:11,719 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-11 01:02:11,721 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-11 01:02:11,723 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-11 01:02:11,724 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-11 01:02:11,726 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-11 01:02:11,727 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-11 01:02:11,729 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-11 01:02:11,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-11 01:02:11,739 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-11 01:02:11,742 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-11 01:02:11,744 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-11 01:02:11,744 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-11 01:02:11,747 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-11 01:02:11,747 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-11 01:02:11,747 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-11 01:02:11,749 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-11 01:02:11,750 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-11 01:02:11,751 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-11 01:02:11,751 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-11 01:02:11,752 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-11 01:02:11,753 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-11 01:02:11,754 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-11 01:02:11,755 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-11 01:02:11,755 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-11 01:02:11,756 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-11 01:02:11,756 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-11 01:02:11,756 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-11 01:02:11,759 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-11 01:02:11,760 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-11 01:02:11,761 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-11 01:02:11,781 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-11 01:02:11,783 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-11 01:02:11,785 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-11 01:02:11,785 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-11 01:02:11,785 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-11 01:02:11,785 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-11 01:02:11,786 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-11 01:02:11,786 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-11 01:02:11,786 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-11 01:02:11,790 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-11 01:02:11,790 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-11 01:02:11,791 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-11 01:02:11,791 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-11 01:02:11,791 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-11 01:02:11,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-11 01:02:11,792 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-11 01:02:11,792 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-11 01:02:11,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-11 01:02:11,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-11 01:02:11,792 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-11 01:02:11,792 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-11 01:02:11,793 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-11 01:02:11,793 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-07-11 01:02:12,112 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-11 01:02:12,137 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-11 01:02:12,140 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-11 01:02:12,142 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-11 01:02:12,142 INFO L275 PluginConnector]: CDTParser initialized [2020-07-11 01:02:12,143 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/merge_sort-1.i [2020-07-11 01:02:12,220 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/226278de3/ac6bc4b048934aa8ab81326b126b38c5/FLAGf6363b438 [2020-07-11 01:02:12,738 INFO L306 CDTParser]: Found 1 translation units. [2020-07-11 01:02:12,738 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/merge_sort-1.i [2020-07-11 01:02:12,753 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/226278de3/ac6bc4b048934aa8ab81326b126b38c5/FLAGf6363b438 [2020-07-11 01:02:13,048 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/226278de3/ac6bc4b048934aa8ab81326b126b38c5 [2020-07-11 01:02:13,057 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-11 01:02:13,059 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-11 01:02:13,060 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-11 01:02:13,060 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-11 01:02:13,065 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-11 01:02:13,067 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 01:02:13" (1/1) ... [2020-07-11 01:02:13,070 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37af86f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:02:13, skipping insertion in model container [2020-07-11 01:02:13,070 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 01:02:13" (1/1) ... [2020-07-11 01:02:13,079 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-11 01:02:13,145 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-11 01:02:13,636 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 01:02:13,647 INFO L203 MainTranslator]: Completed pre-run [2020-07-11 01:02:13,711 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-11 01:02:13,778 INFO L208 MainTranslator]: Completed translation [2020-07-11 01:02:13,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:02:13 WrapperNode [2020-07-11 01:02:13,779 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-11 01:02:13,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-11 01:02:13,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-11 01:02:13,780 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-11 01:02:13,794 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:02:13" (1/1) ... [2020-07-11 01:02:13,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:02:13" (1/1) ... [2020-07-11 01:02:13,814 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:02:13" (1/1) ... [2020-07-11 01:02:13,815 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:02:13" (1/1) ... [2020-07-11 01:02:13,855 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:02:13" (1/1) ... [2020-07-11 01:02:13,870 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:02:13" (1/1) ... [2020-07-11 01:02:13,875 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:02:13" (1/1) ... [2020-07-11 01:02:13,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-11 01:02:13,888 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-11 01:02:13,888 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-11 01:02:13,888 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-11 01:02:13,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:02:13" (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-11 01:02:13,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-11 01:02:13,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-11 01:02:13,958 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-11 01:02:13,958 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-11 01:02:13,958 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2020-07-11 01:02:13,959 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2020-07-11 01:02:13,959 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2020-07-11 01:02:13,959 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2020-07-11 01:02:13,959 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2020-07-11 01:02:13,959 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2020-07-11 01:02:13,959 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-11 01:02:13,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-11 01:02:13,960 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-11 01:02:13,960 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-11 01:02:13,960 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-11 01:02:13,960 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-11 01:02:13,961 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-11 01:02:13,961 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-11 01:02:13,961 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-11 01:02:13,961 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-11 01:02:13,961 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-11 01:02:13,961 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-11 01:02:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-11 01:02:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-11 01:02:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-11 01:02:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-11 01:02:13,962 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-11 01:02:13,963 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-11 01:02:13,963 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-11 01:02:13,963 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-11 01:02:13,963 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-11 01:02:13,963 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-11 01:02:13,964 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-11 01:02:13,964 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-11 01:02:13,964 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-11 01:02:13,964 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-11 01:02:13,964 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-11 01:02:13,965 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-11 01:02:13,965 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-11 01:02:13,965 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-11 01:02:13,965 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-11 01:02:13,965 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-11 01:02:13,965 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-11 01:02:13,965 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-11 01:02:13,966 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-11 01:02:13,966 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-11 01:02:13,966 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-11 01:02:13,966 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-11 01:02:13,966 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-11 01:02:13,966 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-11 01:02:13,967 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-11 01:02:13,967 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-11 01:02:13,967 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-11 01:02:13,967 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-11 01:02:13,967 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-11 01:02:13,967 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-11 01:02:13,967 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-11 01:02:13,968 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-11 01:02:13,968 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-11 01:02:13,968 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-11 01:02:13,968 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-11 01:02:13,969 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-11 01:02:13,969 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-11 01:02:13,969 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-11 01:02:13,969 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-11 01:02:13,969 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-11 01:02:13,969 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-11 01:02:13,969 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-11 01:02:13,970 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-11 01:02:13,970 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-11 01:02:13,970 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-11 01:02:13,970 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-11 01:02:13,970 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-11 01:02:13,970 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-11 01:02:13,971 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-11 01:02:13,972 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-11 01:02:13,972 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-11 01:02:13,972 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-11 01:02:13,972 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-11 01:02:13,972 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-11 01:02:13,973 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-11 01:02:13,973 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-11 01:02:13,973 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-11 01:02:13,973 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-11 01:02:13,973 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-11 01:02:13,973 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-11 01:02:13,974 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-11 01:02:13,975 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-11 01:02:13,975 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-11 01:02:13,975 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-11 01:02:13,975 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-11 01:02:13,975 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-11 01:02:13,975 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-11 01:02:13,975 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-11 01:02:13,976 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-11 01:02:13,976 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-11 01:02:13,976 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-11 01:02:13,977 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-11 01:02:13,977 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-11 01:02:13,977 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-11 01:02:13,977 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-11 01:02:13,977 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-11 01:02:13,977 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-11 01:02:13,977 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-11 01:02:13,977 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-11 01:02:13,978 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-11 01:02:13,978 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-11 01:02:13,978 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-11 01:02:13,978 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-11 01:02:13,978 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-11 01:02:13,978 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-11 01:02:13,978 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-11 01:02:13,979 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-11 01:02:13,979 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-11 01:02:13,979 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-11 01:02:13,979 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2020-07-11 01:02:13,979 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2020-07-11 01:02:13,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-11 01:02:13,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-11 01:02:13,980 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2020-07-11 01:02:13,980 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-11 01:02:13,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-11 01:02:13,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-11 01:02:13,980 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2020-07-11 01:02:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2020-07-11 01:02:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2020-07-11 01:02:13,981 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-11 01:02:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-11 01:02:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-11 01:02:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-11 01:02:13,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-11 01:02:15,111 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-11 01:02:15,112 INFO L295 CfgBuilder]: Removed 33 assume(true) statements. [2020-07-11 01:02:15,122 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 01:02:15 BoogieIcfgContainer [2020-07-11 01:02:15,123 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-11 01:02:15,124 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-11 01:02:15,124 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-11 01:02:15,129 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-11 01:02:15,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 01:02:13" (1/3) ... [2020-07-11 01:02:15,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584a8d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 01:02:15, skipping insertion in model container [2020-07-11 01:02:15,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 01:02:13" (2/3) ... [2020-07-11 01:02:15,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@584a8d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 01:02:15, skipping insertion in model container [2020-07-11 01:02:15,132 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 01:02:15" (3/3) ... [2020-07-11 01:02:15,134 INFO L109 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2020-07-11 01:02:15,149 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-11 01:02:15,161 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-11 01:02:15,176 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-11 01:02:15,204 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-11 01:02:15,205 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-11 01:02:15,205 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-11 01:02:15,214 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-11 01:02:15,214 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-11 01:02:15,215 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-11 01:02:15,215 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-11 01:02:15,215 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-11 01:02:15,239 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states. [2020-07-11 01:02:15,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-11 01:02:15,250 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:02:15,251 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:02:15,251 INFO L427 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:02:15,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:02:15,258 INFO L82 PathProgramCache]: Analyzing trace with hash -2091922853, now seen corresponding path program 1 times [2020-07-11 01:02:15,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:02:15,268 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1194217480] [2020-07-11 01:02:15,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:02:15,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:02:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:02:15,464 INFO L280 TraceCheckUtils]: 0: Hoare triple {258#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {251#true} is VALID [2020-07-11 01:02:15,465 INFO L280 TraceCheckUtils]: 1: Hoare triple {251#true} #valid := #valid[0 := 0]; {251#true} is VALID [2020-07-11 01:02:15,465 INFO L280 TraceCheckUtils]: 2: Hoare triple {251#true} assume 0 < #StackHeapBarrier; {251#true} is VALID [2020-07-11 01:02:15,465 INFO L280 TraceCheckUtils]: 3: Hoare triple {251#true} assume true; {251#true} is VALID [2020-07-11 01:02:15,466 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {251#true} {251#true} #570#return; {251#true} is VALID [2020-07-11 01:02:15,469 INFO L263 TraceCheckUtils]: 0: Hoare triple {251#true} call ULTIMATE.init(); {258#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:02:15,470 INFO L280 TraceCheckUtils]: 1: Hoare triple {258#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {251#true} is VALID [2020-07-11 01:02:15,470 INFO L280 TraceCheckUtils]: 2: Hoare triple {251#true} #valid := #valid[0 := 0]; {251#true} is VALID [2020-07-11 01:02:15,470 INFO L280 TraceCheckUtils]: 3: Hoare triple {251#true} assume 0 < #StackHeapBarrier; {251#true} is VALID [2020-07-11 01:02:15,471 INFO L280 TraceCheckUtils]: 4: Hoare triple {251#true} assume true; {251#true} is VALID [2020-07-11 01:02:15,471 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {251#true} {251#true} #570#return; {251#true} is VALID [2020-07-11 01:02:15,471 INFO L263 TraceCheckUtils]: 6: Hoare triple {251#true} call #t~ret44 := main(); {251#true} is VALID [2020-07-11 01:02:15,472 INFO L280 TraceCheckUtils]: 7: Hoare triple {251#true} ~data~0.base, ~data~0.offset := 0, 0; {251#true} is VALID [2020-07-11 01:02:15,473 INFO L280 TraceCheckUtils]: 8: Hoare triple {251#true} assume !true; {252#false} is VALID [2020-07-11 01:02:15,473 INFO L280 TraceCheckUtils]: 9: Hoare triple {252#false} assume !(~data~0.base == 0 && ~data~0.offset == 0); {252#false} is VALID [2020-07-11 01:02:15,473 INFO L263 TraceCheckUtils]: 10: Hoare triple {252#false} call inspect_before(~data~0.base, ~data~0.offset); {252#false} is VALID [2020-07-11 01:02:15,474 INFO L280 TraceCheckUtils]: 11: Hoare triple {252#false} ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; {252#false} is VALID [2020-07-11 01:02:15,474 INFO L280 TraceCheckUtils]: 12: Hoare triple {252#false} assume ~shape.base == 0 && ~shape.offset == 0; {252#false} is VALID [2020-07-11 01:02:15,474 INFO L263 TraceCheckUtils]: 13: Hoare triple {252#false} call fail(); {252#false} is VALID [2020-07-11 01:02:15,475 INFO L280 TraceCheckUtils]: 14: Hoare triple {252#false} assume !false; {252#false} is VALID [2020-07-11 01:02:15,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-11 01:02:15,477 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1194217480] [2020-07-11 01:02:15,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:02:15,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-11 01:02:15,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797338901] [2020-07-11 01:02:15,487 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-11 01:02:15,490 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:02:15,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-11 01:02:15,519 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:02:15,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-11 01:02:15,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:02:15,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-11 01:02:15,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:02:15,532 INFO L87 Difference]: Start difference. First operand 248 states. Second operand 3 states. [2020-07-11 01:02:16,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:16,904 INFO L93 Difference]: Finished difference Result 521 states and 689 transitions. [2020-07-11 01:02:16,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-11 01:02:16,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2020-07-11 01:02:16,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:02:16,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:02:16,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 689 transitions. [2020-07-11 01:02:16,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-11 01:02:16,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 689 transitions. [2020-07-11 01:02:16,947 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 689 transitions. [2020-07-11 01:02:17,824 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 689 edges. 689 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:02:17,865 INFO L225 Difference]: With dead ends: 521 [2020-07-11 01:02:17,865 INFO L226 Difference]: Without dead ends: 252 [2020-07-11 01:02:17,873 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-11 01:02:17,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2020-07-11 01:02:18,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 224. [2020-07-11 01:02:18,167 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:02:18,168 INFO L82 GeneralOperation]: Start isEquivalent. First operand 252 states. Second operand 224 states. [2020-07-11 01:02:18,169 INFO L74 IsIncluded]: Start isIncluded. First operand 252 states. Second operand 224 states. [2020-07-11 01:02:18,169 INFO L87 Difference]: Start difference. First operand 252 states. Second operand 224 states. [2020-07-11 01:02:18,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:18,197 INFO L93 Difference]: Finished difference Result 252 states and 283 transitions. [2020-07-11 01:02:18,197 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 283 transitions. [2020-07-11 01:02:18,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:02:18,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:02:18,202 INFO L74 IsIncluded]: Start isIncluded. First operand 224 states. Second operand 252 states. [2020-07-11 01:02:18,203 INFO L87 Difference]: Start difference. First operand 224 states. Second operand 252 states. [2020-07-11 01:02:18,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:18,228 INFO L93 Difference]: Finished difference Result 252 states and 283 transitions. [2020-07-11 01:02:18,228 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 283 transitions. [2020-07-11 01:02:18,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:02:18,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:02:18,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:02:18,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:02:18,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2020-07-11 01:02:18,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 247 transitions. [2020-07-11 01:02:18,253 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 247 transitions. Word has length 15 [2020-07-11 01:02:18,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:02:18,253 INFO L479 AbstractCegarLoop]: Abstraction has 224 states and 247 transitions. [2020-07-11 01:02:18,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-11 01:02:18,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 224 states and 247 transitions. [2020-07-11 01:02:18,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:02:18,548 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 247 transitions. [2020-07-11 01:02:18,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-11 01:02:18,550 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:02:18,550 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:02:18,550 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-11 01:02:18,551 INFO L427 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:02:18,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:02:18,551 INFO L82 PathProgramCache]: Analyzing trace with hash 2028933562, now seen corresponding path program 1 times [2020-07-11 01:02:18,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:02:18,552 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [972521408] [2020-07-11 01:02:18,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:02:18,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:02:18,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:02:18,660 INFO L280 TraceCheckUtils]: 0: Hoare triple {2263#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2255#true} is VALID [2020-07-11 01:02:18,660 INFO L280 TraceCheckUtils]: 1: Hoare triple {2255#true} #valid := #valid[0 := 0]; {2255#true} is VALID [2020-07-11 01:02:18,661 INFO L280 TraceCheckUtils]: 2: Hoare triple {2255#true} assume 0 < #StackHeapBarrier; {2255#true} is VALID [2020-07-11 01:02:18,661 INFO L280 TraceCheckUtils]: 3: Hoare triple {2255#true} assume true; {2255#true} is VALID [2020-07-11 01:02:18,661 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2255#true} {2255#true} #570#return; {2255#true} is VALID [2020-07-11 01:02:18,669 INFO L263 TraceCheckUtils]: 0: Hoare triple {2255#true} call ULTIMATE.init(); {2263#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:02:18,670 INFO L280 TraceCheckUtils]: 1: Hoare triple {2263#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2255#true} is VALID [2020-07-11 01:02:18,670 INFO L280 TraceCheckUtils]: 2: Hoare triple {2255#true} #valid := #valid[0 := 0]; {2255#true} is VALID [2020-07-11 01:02:18,670 INFO L280 TraceCheckUtils]: 3: Hoare triple {2255#true} assume 0 < #StackHeapBarrier; {2255#true} is VALID [2020-07-11 01:02:18,670 INFO L280 TraceCheckUtils]: 4: Hoare triple {2255#true} assume true; {2255#true} is VALID [2020-07-11 01:02:18,671 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2255#true} {2255#true} #570#return; {2255#true} is VALID [2020-07-11 01:02:18,671 INFO L263 TraceCheckUtils]: 6: Hoare triple {2255#true} call #t~ret44 := main(); {2255#true} is VALID [2020-07-11 01:02:18,672 INFO L280 TraceCheckUtils]: 7: Hoare triple {2255#true} ~data~0.base, ~data~0.offset := 0, 0; {2262#(and (= 0 main_~data~0.offset) (= 0 main_~data~0.base))} is VALID [2020-07-11 01:02:18,672 INFO L280 TraceCheckUtils]: 8: Hoare triple {2262#(and (= 0 main_~data~0.offset) (= 0 main_~data~0.base))} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {2262#(and (= 0 main_~data~0.offset) (= 0 main_~data~0.base))} is VALID [2020-07-11 01:02:18,673 INFO L280 TraceCheckUtils]: 9: Hoare triple {2262#(and (= 0 main_~data~0.offset) (= 0 main_~data~0.base))} assume !(0 != #t~nondet36); {2262#(and (= 0 main_~data~0.offset) (= 0 main_~data~0.base))} is VALID [2020-07-11 01:02:18,675 INFO L280 TraceCheckUtils]: 10: Hoare triple {2262#(and (= 0 main_~data~0.offset) (= 0 main_~data~0.base))} havoc #t~nondet36; {2262#(and (= 0 main_~data~0.offset) (= 0 main_~data~0.base))} is VALID [2020-07-11 01:02:18,676 INFO L280 TraceCheckUtils]: 11: Hoare triple {2262#(and (= 0 main_~data~0.offset) (= 0 main_~data~0.base))} assume !(~data~0.base == 0 && ~data~0.offset == 0); {2256#false} is VALID [2020-07-11 01:02:18,676 INFO L263 TraceCheckUtils]: 12: Hoare triple {2256#false} call inspect_before(~data~0.base, ~data~0.offset); {2256#false} is VALID [2020-07-11 01:02:18,676 INFO L280 TraceCheckUtils]: 13: Hoare triple {2256#false} ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; {2256#false} is VALID [2020-07-11 01:02:18,677 INFO L280 TraceCheckUtils]: 14: Hoare triple {2256#false} assume ~shape.base == 0 && ~shape.offset == 0; {2256#false} is VALID [2020-07-11 01:02:18,677 INFO L263 TraceCheckUtils]: 15: Hoare triple {2256#false} call fail(); {2256#false} is VALID [2020-07-11 01:02:18,678 INFO L280 TraceCheckUtils]: 16: Hoare triple {2256#false} assume !false; {2256#false} is VALID [2020-07-11 01:02:18,680 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-11 01:02:18,680 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [972521408] [2020-07-11 01:02:18,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:02:18,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-11 01:02:18,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085877160] [2020-07-11 01:02:18,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-07-11 01:02:18,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:02:18,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-11 01:02:18,708 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:02:18,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-11 01:02:18,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:02:18,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-11 01:02:18,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-11 01:02:18,710 INFO L87 Difference]: Start difference. First operand 224 states and 247 transitions. Second operand 4 states. [2020-07-11 01:02:20,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:20,092 INFO L93 Difference]: Finished difference Result 453 states and 502 transitions. [2020-07-11 01:02:20,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-11 01:02:20,092 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2020-07-11 01:02:20,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:02:20,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 01:02:20,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 502 transitions. [2020-07-11 01:02:20,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-11 01:02:20,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 502 transitions. [2020-07-11 01:02:20,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 502 transitions. [2020-07-11 01:02:20,645 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 502 edges. 502 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:02:20,654 INFO L225 Difference]: With dead ends: 453 [2020-07-11 01:02:20,655 INFO L226 Difference]: Without dead ends: 253 [2020-07-11 01:02:20,658 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-11 01:02:20,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2020-07-11 01:02:20,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 226. [2020-07-11 01:02:20,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:02:20,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand 226 states. [2020-07-11 01:02:20,953 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand 226 states. [2020-07-11 01:02:20,953 INFO L87 Difference]: Start difference. First operand 253 states. Second operand 226 states. [2020-07-11 01:02:20,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:20,964 INFO L93 Difference]: Finished difference Result 253 states and 279 transitions. [2020-07-11 01:02:20,964 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 279 transitions. [2020-07-11 01:02:20,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:02:20,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:02:20,966 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand 253 states. [2020-07-11 01:02:20,966 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 253 states. [2020-07-11 01:02:20,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:20,977 INFO L93 Difference]: Finished difference Result 253 states and 279 transitions. [2020-07-11 01:02:20,977 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 279 transitions. [2020-07-11 01:02:20,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:02:20,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:02:20,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:02:20,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:02:20,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2020-07-11 01:02:20,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 249 transitions. [2020-07-11 01:02:20,987 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 249 transitions. Word has length 17 [2020-07-11 01:02:20,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:02:20,988 INFO L479 AbstractCegarLoop]: Abstraction has 226 states and 249 transitions. [2020-07-11 01:02:20,988 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-11 01:02:20,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 226 states and 249 transitions. [2020-07-11 01:02:21,293 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 249 edges. 249 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:02:21,293 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 249 transitions. [2020-07-11 01:02:21,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-07-11 01:02:21,295 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:02:21,295 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:02:21,296 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-11 01:02:21,296 INFO L427 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:02:21,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:02:21,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1052511289, now seen corresponding path program 1 times [2020-07-11 01:02:21,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:02:21,297 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [734123788] [2020-07-11 01:02:21,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:02:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:02:21,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:02:21,500 INFO L280 TraceCheckUtils]: 0: Hoare triple {4144#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4132#true} is VALID [2020-07-11 01:02:21,501 INFO L280 TraceCheckUtils]: 1: Hoare triple {4132#true} #valid := #valid[0 := 0]; {4132#true} is VALID [2020-07-11 01:02:21,501 INFO L280 TraceCheckUtils]: 2: Hoare triple {4132#true} assume 0 < #StackHeapBarrier; {4132#true} is VALID [2020-07-11 01:02:21,501 INFO L280 TraceCheckUtils]: 3: Hoare triple {4132#true} assume true; {4132#true} is VALID [2020-07-11 01:02:21,501 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4132#true} {4132#true} #570#return; {4132#true} is VALID [2020-07-11 01:02:21,502 INFO L263 TraceCheckUtils]: 0: Hoare triple {4132#true} call ULTIMATE.init(); {4144#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:02:21,502 INFO L280 TraceCheckUtils]: 1: Hoare triple {4144#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4132#true} is VALID [2020-07-11 01:02:21,503 INFO L280 TraceCheckUtils]: 2: Hoare triple {4132#true} #valid := #valid[0 := 0]; {4132#true} is VALID [2020-07-11 01:02:21,503 INFO L280 TraceCheckUtils]: 3: Hoare triple {4132#true} assume 0 < #StackHeapBarrier; {4132#true} is VALID [2020-07-11 01:02:21,503 INFO L280 TraceCheckUtils]: 4: Hoare triple {4132#true} assume true; {4132#true} is VALID [2020-07-11 01:02:21,503 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4132#true} {4132#true} #570#return; {4132#true} is VALID [2020-07-11 01:02:21,504 INFO L263 TraceCheckUtils]: 6: Hoare triple {4132#true} call #t~ret44 := main(); {4132#true} is VALID [2020-07-11 01:02:21,504 INFO L280 TraceCheckUtils]: 7: Hoare triple {4132#true} ~data~0.base, ~data~0.offset := 0, 0; {4132#true} is VALID [2020-07-11 01:02:21,504 INFO L280 TraceCheckUtils]: 8: Hoare triple {4132#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {4132#true} is VALID [2020-07-11 01:02:21,505 INFO L280 TraceCheckUtils]: 9: Hoare triple {4132#true} assume !!(0 != #t~nondet36); {4132#true} is VALID [2020-07-11 01:02:21,505 INFO L280 TraceCheckUtils]: 10: Hoare triple {4132#true} havoc #t~nondet36; {4132#true} is VALID [2020-07-11 01:02:21,505 INFO L280 TraceCheckUtils]: 11: Hoare triple {4132#true} SUMMARY for call #t~malloc37.base, #t~malloc37.offset := #Ultimate.allocOnHeap(8); srcloc: L629 {4132#true} is VALID [2020-07-11 01:02:21,505 INFO L280 TraceCheckUtils]: 12: Hoare triple {4132#true} ~node~1.base, ~node~1.offset := #t~malloc37.base, #t~malloc37.offset; {4132#true} is VALID [2020-07-11 01:02:21,506 INFO L280 TraceCheckUtils]: 13: Hoare triple {4132#true} assume !(~node~1.base == 0 && ~node~1.offset == 0); {4132#true} is VALID [2020-07-11 01:02:21,506 INFO L280 TraceCheckUtils]: 14: Hoare triple {4132#true} SUMMARY for call write~$Pointer$(~node~1.base, ~node~1.offset, ~node~1.base, ~node~1.offset, 4); srcloc: L630-2 {4132#true} is VALID [2020-07-11 01:02:21,506 INFO L280 TraceCheckUtils]: 15: Hoare triple {4132#true} assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647; {4132#true} is VALID [2020-07-11 01:02:21,507 INFO L280 TraceCheckUtils]: 16: Hoare triple {4132#true} SUMMARY for call write~int(#t~nondet38, ~node~1.base, 4 + ~node~1.offset, 4); srcloc: L633 {4132#true} is VALID [2020-07-11 01:02:21,507 INFO L280 TraceCheckUtils]: 17: Hoare triple {4132#true} havoc #t~nondet38; {4132#true} is VALID [2020-07-11 01:02:21,508 INFO L280 TraceCheckUtils]: 18: Hoare triple {4132#true} SUMMARY for call #t~malloc39.base, #t~malloc39.offset := #Ultimate.allocOnHeap(8); srcloc: L634 {4139#(not (= 0 |main_#t~malloc39.base|))} is VALID [2020-07-11 01:02:21,509 INFO L280 TraceCheckUtils]: 19: Hoare triple {4139#(not (= 0 |main_#t~malloc39.base|))} ~item~0.base, ~item~0.offset := #t~malloc39.base, #t~malloc39.offset; {4140#(not (= 0 main_~item~0.base))} is VALID [2020-07-11 01:02:21,509 INFO L280 TraceCheckUtils]: 20: Hoare triple {4140#(not (= 0 main_~item~0.base))} assume !(~item~0.base == 0 && ~item~0.offset == 0); {4140#(not (= 0 main_~item~0.base))} is VALID [2020-07-11 01:02:21,510 INFO L280 TraceCheckUtils]: 21: Hoare triple {4140#(not (= 0 main_~item~0.base))} SUMMARY for call write~$Pointer$(~node~1.base, ~node~1.offset, ~item~0.base, ~item~0.offset, 4); srcloc: L635-2 {4140#(not (= 0 main_~item~0.base))} is VALID [2020-07-11 01:02:21,511 INFO L280 TraceCheckUtils]: 22: Hoare triple {4140#(not (= 0 main_~item~0.base))} SUMMARY for call write~$Pointer$(~data~0.base, ~data~0.offset, ~item~0.base, 4 + ~item~0.offset, 4); srcloc: L637 {4140#(not (= 0 main_~item~0.base))} is VALID [2020-07-11 01:02:21,511 INFO L280 TraceCheckUtils]: 23: Hoare triple {4140#(not (= 0 main_~item~0.base))} ~data~0.base, ~data~0.offset := ~item~0.base, ~item~0.offset; {4141#(not (= 0 main_~data~0.base))} is VALID [2020-07-11 01:02:21,512 INFO L280 TraceCheckUtils]: 24: Hoare triple {4141#(not (= 0 main_~data~0.base))} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {4141#(not (= 0 main_~data~0.base))} is VALID [2020-07-11 01:02:21,513 INFO L280 TraceCheckUtils]: 25: Hoare triple {4141#(not (= 0 main_~data~0.base))} assume !(0 != #t~nondet36); {4141#(not (= 0 main_~data~0.base))} is VALID [2020-07-11 01:02:21,513 INFO L280 TraceCheckUtils]: 26: Hoare triple {4141#(not (= 0 main_~data~0.base))} havoc #t~nondet36; {4141#(not (= 0 main_~data~0.base))} is VALID [2020-07-11 01:02:21,514 INFO L280 TraceCheckUtils]: 27: Hoare triple {4141#(not (= 0 main_~data~0.base))} assume !(~data~0.base == 0 && ~data~0.offset == 0); {4141#(not (= 0 main_~data~0.base))} is VALID [2020-07-11 01:02:21,515 INFO L263 TraceCheckUtils]: 28: Hoare triple {4141#(not (= 0 main_~data~0.base))} call inspect_before(~data~0.base, ~data~0.offset); {4142#(not (= 0 |inspect_before_#in~shape.base|))} is VALID [2020-07-11 01:02:21,516 INFO L280 TraceCheckUtils]: 29: Hoare triple {4142#(not (= 0 |inspect_before_#in~shape.base|))} ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; {4143#(not (= 0 inspect_before_~shape.base))} is VALID [2020-07-11 01:02:21,517 INFO L280 TraceCheckUtils]: 30: Hoare triple {4143#(not (= 0 inspect_before_~shape.base))} assume ~shape.base == 0 && ~shape.offset == 0; {4133#false} is VALID [2020-07-11 01:02:21,517 INFO L263 TraceCheckUtils]: 31: Hoare triple {4133#false} call fail(); {4133#false} is VALID [2020-07-11 01:02:21,517 INFO L280 TraceCheckUtils]: 32: Hoare triple {4133#false} assume !false; {4133#false} is VALID [2020-07-11 01:02:21,521 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:02:21,521 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [734123788] [2020-07-11 01:02:21,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:02:21,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-11 01:02:21,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128631171] [2020-07-11 01:02:21,523 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2020-07-11 01:02:21,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:02:21,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-11 01:02:21,566 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:02:21,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-11 01:02:21,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:02:21,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-11 01:02:21,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2020-07-11 01:02:21,567 INFO L87 Difference]: Start difference. First operand 226 states and 249 transitions. Second operand 8 states. [2020-07-11 01:02:24,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:24,764 INFO L93 Difference]: Finished difference Result 318 states and 355 transitions. [2020-07-11 01:02:24,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-11 01:02:24,764 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2020-07-11 01:02:24,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:02:24,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 01:02:24,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 355 transitions. [2020-07-11 01:02:24,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-11 01:02:24,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 355 transitions. [2020-07-11 01:02:24,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 355 transitions. [2020-07-11 01:02:25,243 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 355 edges. 355 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:02:25,257 INFO L225 Difference]: With dead ends: 318 [2020-07-11 01:02:25,257 INFO L226 Difference]: Without dead ends: 313 [2020-07-11 01:02:25,259 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-07-11 01:02:25,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2020-07-11 01:02:25,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 231. [2020-07-11 01:02:25,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:02:25,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 313 states. Second operand 231 states. [2020-07-11 01:02:25,578 INFO L74 IsIncluded]: Start isIncluded. First operand 313 states. Second operand 231 states. [2020-07-11 01:02:25,578 INFO L87 Difference]: Start difference. First operand 313 states. Second operand 231 states. [2020-07-11 01:02:25,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:25,591 INFO L93 Difference]: Finished difference Result 313 states and 348 transitions. [2020-07-11 01:02:25,591 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 348 transitions. [2020-07-11 01:02:25,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:02:25,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:02:25,592 INFO L74 IsIncluded]: Start isIncluded. First operand 231 states. Second operand 313 states. [2020-07-11 01:02:25,592 INFO L87 Difference]: Start difference. First operand 231 states. Second operand 313 states. [2020-07-11 01:02:25,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:25,606 INFO L93 Difference]: Finished difference Result 313 states and 348 transitions. [2020-07-11 01:02:25,606 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 348 transitions. [2020-07-11 01:02:25,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:02:25,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:02:25,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:02:25,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:02:25,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2020-07-11 01:02:25,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 254 transitions. [2020-07-11 01:02:25,616 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 254 transitions. Word has length 33 [2020-07-11 01:02:25,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:02:25,617 INFO L479 AbstractCegarLoop]: Abstraction has 231 states and 254 transitions. [2020-07-11 01:02:25,617 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-11 01:02:25,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 231 states and 254 transitions. [2020-07-11 01:02:25,920 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:02:25,920 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 254 transitions. [2020-07-11 01:02:25,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-11 01:02:25,921 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:02:25,922 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:02:25,922 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-11 01:02:25,922 INFO L427 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:02:25,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:02:25,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1386814406, now seen corresponding path program 1 times [2020-07-11 01:02:25,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:02:25,923 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1849764989] [2020-07-11 01:02:25,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:02:25,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:02:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:02:26,063 INFO L280 TraceCheckUtils]: 0: Hoare triple {5890#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5880#true} is VALID [2020-07-11 01:02:26,063 INFO L280 TraceCheckUtils]: 1: Hoare triple {5880#true} #valid := #valid[0 := 0]; {5880#true} is VALID [2020-07-11 01:02:26,063 INFO L280 TraceCheckUtils]: 2: Hoare triple {5880#true} assume 0 < #StackHeapBarrier; {5880#true} is VALID [2020-07-11 01:02:26,064 INFO L280 TraceCheckUtils]: 3: Hoare triple {5880#true} assume true; {5880#true} is VALID [2020-07-11 01:02:26,064 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5880#true} {5880#true} #570#return; {5880#true} is VALID [2020-07-11 01:02:26,065 INFO L263 TraceCheckUtils]: 0: Hoare triple {5880#true} call ULTIMATE.init(); {5890#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:02:26,066 INFO L280 TraceCheckUtils]: 1: Hoare triple {5890#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5880#true} is VALID [2020-07-11 01:02:26,066 INFO L280 TraceCheckUtils]: 2: Hoare triple {5880#true} #valid := #valid[0 := 0]; {5880#true} is VALID [2020-07-11 01:02:26,066 INFO L280 TraceCheckUtils]: 3: Hoare triple {5880#true} assume 0 < #StackHeapBarrier; {5880#true} is VALID [2020-07-11 01:02:26,066 INFO L280 TraceCheckUtils]: 4: Hoare triple {5880#true} assume true; {5880#true} is VALID [2020-07-11 01:02:26,067 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {5880#true} {5880#true} #570#return; {5880#true} is VALID [2020-07-11 01:02:26,067 INFO L263 TraceCheckUtils]: 6: Hoare triple {5880#true} call #t~ret44 := main(); {5880#true} is VALID [2020-07-11 01:02:26,067 INFO L280 TraceCheckUtils]: 7: Hoare triple {5880#true} ~data~0.base, ~data~0.offset := 0, 0; {5880#true} is VALID [2020-07-11 01:02:26,067 INFO L280 TraceCheckUtils]: 8: Hoare triple {5880#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {5880#true} is VALID [2020-07-11 01:02:26,068 INFO L280 TraceCheckUtils]: 9: Hoare triple {5880#true} assume !!(0 != #t~nondet36); {5880#true} is VALID [2020-07-11 01:02:26,068 INFO L280 TraceCheckUtils]: 10: Hoare triple {5880#true} havoc #t~nondet36; {5880#true} is VALID [2020-07-11 01:02:26,068 INFO L280 TraceCheckUtils]: 11: Hoare triple {5880#true} SUMMARY for call #t~malloc37.base, #t~malloc37.offset := #Ultimate.allocOnHeap(8); srcloc: L629 {5880#true} is VALID [2020-07-11 01:02:26,068 INFO L280 TraceCheckUtils]: 12: Hoare triple {5880#true} ~node~1.base, ~node~1.offset := #t~malloc37.base, #t~malloc37.offset; {5880#true} is VALID [2020-07-11 01:02:26,069 INFO L280 TraceCheckUtils]: 13: Hoare triple {5880#true} assume !(~node~1.base == 0 && ~node~1.offset == 0); {5880#true} is VALID [2020-07-11 01:02:26,069 INFO L280 TraceCheckUtils]: 14: Hoare triple {5880#true} SUMMARY for call write~$Pointer$(~node~1.base, ~node~1.offset, ~node~1.base, ~node~1.offset, 4); srcloc: L630-2 {5880#true} is VALID [2020-07-11 01:02:26,069 INFO L280 TraceCheckUtils]: 15: Hoare triple {5880#true} assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647; {5880#true} is VALID [2020-07-11 01:02:26,069 INFO L280 TraceCheckUtils]: 16: Hoare triple {5880#true} SUMMARY for call write~int(#t~nondet38, ~node~1.base, 4 + ~node~1.offset, 4); srcloc: L633 {5880#true} is VALID [2020-07-11 01:02:26,070 INFO L280 TraceCheckUtils]: 17: Hoare triple {5880#true} havoc #t~nondet38; {5880#true} is VALID [2020-07-11 01:02:26,070 INFO L280 TraceCheckUtils]: 18: Hoare triple {5880#true} SUMMARY for call #t~malloc39.base, #t~malloc39.offset := #Ultimate.allocOnHeap(8); srcloc: L634 {5880#true} is VALID [2020-07-11 01:02:26,070 INFO L280 TraceCheckUtils]: 19: Hoare triple {5880#true} ~item~0.base, ~item~0.offset := #t~malloc39.base, #t~malloc39.offset; {5880#true} is VALID [2020-07-11 01:02:26,070 INFO L280 TraceCheckUtils]: 20: Hoare triple {5880#true} assume !(~item~0.base == 0 && ~item~0.offset == 0); {5880#true} is VALID [2020-07-11 01:02:26,071 INFO L280 TraceCheckUtils]: 21: Hoare triple {5880#true} SUMMARY for call write~$Pointer$(~node~1.base, ~node~1.offset, ~item~0.base, ~item~0.offset, 4); srcloc: L635-2 {5880#true} is VALID [2020-07-11 01:02:26,071 INFO L280 TraceCheckUtils]: 22: Hoare triple {5880#true} SUMMARY for call write~$Pointer$(~data~0.base, ~data~0.offset, ~item~0.base, 4 + ~item~0.offset, 4); srcloc: L637 {5880#true} is VALID [2020-07-11 01:02:26,071 INFO L280 TraceCheckUtils]: 23: Hoare triple {5880#true} ~data~0.base, ~data~0.offset := ~item~0.base, ~item~0.offset; {5880#true} is VALID [2020-07-11 01:02:26,071 INFO L280 TraceCheckUtils]: 24: Hoare triple {5880#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {5880#true} is VALID [2020-07-11 01:02:26,072 INFO L280 TraceCheckUtils]: 25: Hoare triple {5880#true} assume !(0 != #t~nondet36); {5880#true} is VALID [2020-07-11 01:02:26,072 INFO L280 TraceCheckUtils]: 26: Hoare triple {5880#true} havoc #t~nondet36; {5880#true} is VALID [2020-07-11 01:02:26,072 INFO L280 TraceCheckUtils]: 27: Hoare triple {5880#true} assume !(~data~0.base == 0 && ~data~0.offset == 0); {5880#true} is VALID [2020-07-11 01:02:26,072 INFO L263 TraceCheckUtils]: 28: Hoare triple {5880#true} call inspect_before(~data~0.base, ~data~0.offset); {5880#true} is VALID [2020-07-11 01:02:26,073 INFO L280 TraceCheckUtils]: 29: Hoare triple {5880#true} ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; {5880#true} is VALID [2020-07-11 01:02:26,073 INFO L280 TraceCheckUtils]: 30: Hoare triple {5880#true} assume !(~shape.base == 0 && ~shape.offset == 0); {5880#true} is VALID [2020-07-11 01:02:26,073 INFO L280 TraceCheckUtils]: 31: Hoare triple {5880#true} goto; {5880#true} is VALID [2020-07-11 01:02:26,074 INFO L280 TraceCheckUtils]: 32: Hoare triple {5880#true} SUMMARY for call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); srcloc: L605-7 {5887#(and (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem25.base|) (= |inspect_before_#t~mem25.offset| (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} is VALID [2020-07-11 01:02:26,077 INFO L280 TraceCheckUtils]: 33: Hoare triple {5887#(and (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem25.base|) (= |inspect_before_#t~mem25.offset| (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} assume !(#t~mem25.base != 0 || #t~mem25.offset != 0); {5888#(and (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} is VALID [2020-07-11 01:02:26,079 INFO L280 TraceCheckUtils]: 34: Hoare triple {5888#(and (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} havoc #t~mem25.base, #t~mem25.offset; {5888#(and (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} is VALID [2020-07-11 01:02:26,080 INFO L280 TraceCheckUtils]: 35: Hoare triple {5888#(and (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} assume !(~shape.base == 0 && ~shape.offset == 0); {5888#(and (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} is VALID [2020-07-11 01:02:26,081 INFO L280 TraceCheckUtils]: 36: Hoare triple {5888#(and (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} goto; {5888#(and (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} is VALID [2020-07-11 01:02:26,082 INFO L280 TraceCheckUtils]: 37: Hoare triple {5888#(and (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} SUMMARY for call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); srcloc: L612-6 {5889#(and (= 0 |inspect_before_#t~mem26.base|) (= 0 |inspect_before_#t~mem26.offset|))} is VALID [2020-07-11 01:02:26,082 INFO L280 TraceCheckUtils]: 38: Hoare triple {5889#(and (= 0 |inspect_before_#t~mem26.base|) (= 0 |inspect_before_#t~mem26.offset|))} assume !(#t~mem26.base == 0 && #t~mem26.offset == 0); {5881#false} is VALID [2020-07-11 01:02:26,083 INFO L280 TraceCheckUtils]: 39: Hoare triple {5881#false} havoc #t~mem26.base, #t~mem26.offset; {5881#false} is VALID [2020-07-11 01:02:26,083 INFO L263 TraceCheckUtils]: 40: Hoare triple {5881#false} call fail(); {5881#false} is VALID [2020-07-11 01:02:26,083 INFO L280 TraceCheckUtils]: 41: Hoare triple {5881#false} assume !false; {5881#false} is VALID [2020-07-11 01:02:26,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-11 01:02:26,087 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1849764989] [2020-07-11 01:02:26,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:02:26,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 01:02:26,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589265083] [2020-07-11 01:02:26,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2020-07-11 01:02:26,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:02:26,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 01:02:26,128 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:02:26,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 01:02:26,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:02:26,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 01:02:26,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-11 01:02:26,129 INFO L87 Difference]: Start difference. First operand 231 states and 254 transitions. Second operand 6 states. [2020-07-11 01:02:28,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:28,346 INFO L93 Difference]: Finished difference Result 248 states and 273 transitions. [2020-07-11 01:02:28,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-11 01:02:28,346 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2020-07-11 01:02:28,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:02:28,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 01:02:28,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 266 transitions. [2020-07-11 01:02:28,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 01:02:28,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 266 transitions. [2020-07-11 01:02:28,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 266 transitions. [2020-07-11 01:02:28,690 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 266 edges. 266 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:02:28,696 INFO L225 Difference]: With dead ends: 248 [2020-07-11 01:02:28,696 INFO L226 Difference]: Without dead ends: 244 [2020-07-11 01:02:28,698 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-07-11 01:02:28,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2020-07-11 01:02:29,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 229. [2020-07-11 01:02:29,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:02:29,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 244 states. Second operand 229 states. [2020-07-11 01:02:29,026 INFO L74 IsIncluded]: Start isIncluded. First operand 244 states. Second operand 229 states. [2020-07-11 01:02:29,026 INFO L87 Difference]: Start difference. First operand 244 states. Second operand 229 states. [2020-07-11 01:02:29,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:29,041 INFO L93 Difference]: Finished difference Result 244 states and 269 transitions. [2020-07-11 01:02:29,041 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 269 transitions. [2020-07-11 01:02:29,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:02:29,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:02:29,043 INFO L74 IsIncluded]: Start isIncluded. First operand 229 states. Second operand 244 states. [2020-07-11 01:02:29,043 INFO L87 Difference]: Start difference. First operand 229 states. Second operand 244 states. [2020-07-11 01:02:29,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:29,053 INFO L93 Difference]: Finished difference Result 244 states and 269 transitions. [2020-07-11 01:02:29,053 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 269 transitions. [2020-07-11 01:02:29,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:02:29,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:02:29,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:02:29,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:02:29,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2020-07-11 01:02:29,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 251 transitions. [2020-07-11 01:02:29,062 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 251 transitions. Word has length 42 [2020-07-11 01:02:29,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:02:29,065 INFO L479 AbstractCegarLoop]: Abstraction has 229 states and 251 transitions. [2020-07-11 01:02:29,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 01:02:29,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 229 states and 251 transitions. [2020-07-11 01:02:29,388 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 251 edges. 251 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:02:29,389 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 251 transitions. [2020-07-11 01:02:29,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-11 01:02:29,390 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:02:29,390 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-11 01:02:29,390 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-11 01:02:29,391 INFO L427 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:02:29,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:02:29,391 INFO L82 PathProgramCache]: Analyzing trace with hash 527521680, now seen corresponding path program 1 times [2020-07-11 01:02:29,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:02:29,392 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1294806630] [2020-07-11 01:02:29,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:02:29,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:02:29,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:02:29,508 INFO L280 TraceCheckUtils]: 0: Hoare triple {7353#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {7343#true} is VALID [2020-07-11 01:02:29,508 INFO L280 TraceCheckUtils]: 1: Hoare triple {7343#true} #valid := #valid[0 := 0]; {7343#true} is VALID [2020-07-11 01:02:29,509 INFO L280 TraceCheckUtils]: 2: Hoare triple {7343#true} assume 0 < #StackHeapBarrier; {7343#true} is VALID [2020-07-11 01:02:29,509 INFO L280 TraceCheckUtils]: 3: Hoare triple {7343#true} assume true; {7343#true} is VALID [2020-07-11 01:02:29,509 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {7343#true} {7343#true} #570#return; {7343#true} is VALID [2020-07-11 01:02:29,514 INFO L263 TraceCheckUtils]: 0: Hoare triple {7343#true} call ULTIMATE.init(); {7353#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:02:29,514 INFO L280 TraceCheckUtils]: 1: Hoare triple {7353#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {7343#true} is VALID [2020-07-11 01:02:29,514 INFO L280 TraceCheckUtils]: 2: Hoare triple {7343#true} #valid := #valid[0 := 0]; {7343#true} is VALID [2020-07-11 01:02:29,515 INFO L280 TraceCheckUtils]: 3: Hoare triple {7343#true} assume 0 < #StackHeapBarrier; {7343#true} is VALID [2020-07-11 01:02:29,515 INFO L280 TraceCheckUtils]: 4: Hoare triple {7343#true} assume true; {7343#true} is VALID [2020-07-11 01:02:29,515 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {7343#true} {7343#true} #570#return; {7343#true} is VALID [2020-07-11 01:02:29,515 INFO L263 TraceCheckUtils]: 6: Hoare triple {7343#true} call #t~ret44 := main(); {7343#true} is VALID [2020-07-11 01:02:29,516 INFO L280 TraceCheckUtils]: 7: Hoare triple {7343#true} ~data~0.base, ~data~0.offset := 0, 0; {7343#true} is VALID [2020-07-11 01:02:29,516 INFO L280 TraceCheckUtils]: 8: Hoare triple {7343#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {7343#true} is VALID [2020-07-11 01:02:29,516 INFO L280 TraceCheckUtils]: 9: Hoare triple {7343#true} assume !!(0 != #t~nondet36); {7343#true} is VALID [2020-07-11 01:02:29,516 INFO L280 TraceCheckUtils]: 10: Hoare triple {7343#true} havoc #t~nondet36; {7343#true} is VALID [2020-07-11 01:02:29,516 INFO L280 TraceCheckUtils]: 11: Hoare triple {7343#true} SUMMARY for call #t~malloc37.base, #t~malloc37.offset := #Ultimate.allocOnHeap(8); srcloc: L629 {7343#true} is VALID [2020-07-11 01:02:29,517 INFO L280 TraceCheckUtils]: 12: Hoare triple {7343#true} ~node~1.base, ~node~1.offset := #t~malloc37.base, #t~malloc37.offset; {7343#true} is VALID [2020-07-11 01:02:29,517 INFO L280 TraceCheckUtils]: 13: Hoare triple {7343#true} assume !(~node~1.base == 0 && ~node~1.offset == 0); {7343#true} is VALID [2020-07-11 01:02:29,517 INFO L280 TraceCheckUtils]: 14: Hoare triple {7343#true} SUMMARY for call write~$Pointer$(~node~1.base, ~node~1.offset, ~node~1.base, ~node~1.offset, 4); srcloc: L630-2 {7343#true} is VALID [2020-07-11 01:02:29,518 INFO L280 TraceCheckUtils]: 15: Hoare triple {7343#true} assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647; {7343#true} is VALID [2020-07-11 01:02:29,518 INFO L280 TraceCheckUtils]: 16: Hoare triple {7343#true} SUMMARY for call write~int(#t~nondet38, ~node~1.base, 4 + ~node~1.offset, 4); srcloc: L633 {7343#true} is VALID [2020-07-11 01:02:29,518 INFO L280 TraceCheckUtils]: 17: Hoare triple {7343#true} havoc #t~nondet38; {7343#true} is VALID [2020-07-11 01:02:29,518 INFO L280 TraceCheckUtils]: 18: Hoare triple {7343#true} SUMMARY for call #t~malloc39.base, #t~malloc39.offset := #Ultimate.allocOnHeap(8); srcloc: L634 {7343#true} is VALID [2020-07-11 01:02:29,518 INFO L280 TraceCheckUtils]: 19: Hoare triple {7343#true} ~item~0.base, ~item~0.offset := #t~malloc39.base, #t~malloc39.offset; {7343#true} is VALID [2020-07-11 01:02:29,519 INFO L280 TraceCheckUtils]: 20: Hoare triple {7343#true} assume !(~item~0.base == 0 && ~item~0.offset == 0); {7343#true} is VALID [2020-07-11 01:02:29,519 INFO L280 TraceCheckUtils]: 21: Hoare triple {7343#true} SUMMARY for call write~$Pointer$(~node~1.base, ~node~1.offset, ~item~0.base, ~item~0.offset, 4); srcloc: L635-2 {7343#true} is VALID [2020-07-11 01:02:29,519 INFO L280 TraceCheckUtils]: 22: Hoare triple {7343#true} SUMMARY for call write~$Pointer$(~data~0.base, ~data~0.offset, ~item~0.base, 4 + ~item~0.offset, 4); srcloc: L637 {7343#true} is VALID [2020-07-11 01:02:29,519 INFO L280 TraceCheckUtils]: 23: Hoare triple {7343#true} ~data~0.base, ~data~0.offset := ~item~0.base, ~item~0.offset; {7343#true} is VALID [2020-07-11 01:02:29,520 INFO L280 TraceCheckUtils]: 24: Hoare triple {7343#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {7343#true} is VALID [2020-07-11 01:02:29,520 INFO L280 TraceCheckUtils]: 25: Hoare triple {7343#true} assume !(0 != #t~nondet36); {7343#true} is VALID [2020-07-11 01:02:29,520 INFO L280 TraceCheckUtils]: 26: Hoare triple {7343#true} havoc #t~nondet36; {7343#true} is VALID [2020-07-11 01:02:29,520 INFO L280 TraceCheckUtils]: 27: Hoare triple {7343#true} assume !(~data~0.base == 0 && ~data~0.offset == 0); {7343#true} is VALID [2020-07-11 01:02:29,521 INFO L263 TraceCheckUtils]: 28: Hoare triple {7343#true} call inspect_before(~data~0.base, ~data~0.offset); {7343#true} is VALID [2020-07-11 01:02:29,521 INFO L280 TraceCheckUtils]: 29: Hoare triple {7343#true} ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; {7343#true} is VALID [2020-07-11 01:02:29,521 INFO L280 TraceCheckUtils]: 30: Hoare triple {7343#true} assume !(~shape.base == 0 && ~shape.offset == 0); {7343#true} is VALID [2020-07-11 01:02:29,521 INFO L280 TraceCheckUtils]: 31: Hoare triple {7343#true} goto; {7343#true} is VALID [2020-07-11 01:02:29,528 INFO L280 TraceCheckUtils]: 32: Hoare triple {7343#true} SUMMARY for call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); srcloc: L605-7 {7350#(and (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem25.base|) (= |inspect_before_#t~mem25.offset| (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} is VALID [2020-07-11 01:02:29,529 INFO L280 TraceCheckUtils]: 33: Hoare triple {7350#(and (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)) |inspect_before_#t~mem25.base|) (= |inspect_before_#t~mem25.offset| (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4))))} assume !!(#t~mem25.base != 0 || #t~mem25.offset != 0); {7351#(or (not (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))} is VALID [2020-07-11 01:02:29,530 INFO L280 TraceCheckUtils]: 34: Hoare triple {7351#(or (not (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))} havoc #t~mem25.base, #t~mem25.offset; {7351#(or (not (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))} is VALID [2020-07-11 01:02:29,530 INFO L280 TraceCheckUtils]: 35: Hoare triple {7351#(or (not (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))} assume !(~shape.base == 0 && ~shape.offset == 0); {7351#(or (not (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))} is VALID [2020-07-11 01:02:29,531 INFO L280 TraceCheckUtils]: 36: Hoare triple {7351#(or (not (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))} goto; {7351#(or (not (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))} is VALID [2020-07-11 01:02:29,532 INFO L280 TraceCheckUtils]: 37: Hoare triple {7351#(or (not (= 0 (select (select |#memory_$Pointer$.offset| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) (+ inspect_before_~shape.offset 4)))))} SUMMARY for call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); srcloc: L607-6 {7352#(or (not (= 0 |inspect_before_#t~mem21.base|)) (not (= 0 |inspect_before_#t~mem21.offset|)))} is VALID [2020-07-11 01:02:29,532 INFO L280 TraceCheckUtils]: 38: Hoare triple {7352#(or (not (= 0 |inspect_before_#t~mem21.base|)) (not (= 0 |inspect_before_#t~mem21.offset|)))} assume #t~mem21.base == 0 && #t~mem21.offset == 0; {7344#false} is VALID [2020-07-11 01:02:29,533 INFO L280 TraceCheckUtils]: 39: Hoare triple {7344#false} havoc #t~mem21.base, #t~mem21.offset; {7344#false} is VALID [2020-07-11 01:02:29,533 INFO L263 TraceCheckUtils]: 40: Hoare triple {7344#false} call fail(); {7344#false} is VALID [2020-07-11 01:02:29,533 INFO L280 TraceCheckUtils]: 41: Hoare triple {7344#false} assume !false; {7344#false} is VALID [2020-07-11 01:02:29,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-11 01:02:29,537 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1294806630] [2020-07-11 01:02:29,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:02:29,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-11 01:02:29,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893427047] [2020-07-11 01:02:29,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2020-07-11 01:02:29,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:02:29,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-11 01:02:29,577 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:02:29,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-11 01:02:29,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:02:29,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-11 01:02:29,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-11 01:02:29,579 INFO L87 Difference]: Start difference. First operand 229 states and 251 transitions. Second operand 6 states. [2020-07-11 01:02:31,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:31,890 INFO L93 Difference]: Finished difference Result 246 states and 270 transitions. [2020-07-11 01:02:31,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-11 01:02:31,890 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2020-07-11 01:02:31,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:02:31,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 01:02:31,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 263 transitions. [2020-07-11 01:02:31,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-11 01:02:31,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 263 transitions. [2020-07-11 01:02:31,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 263 transitions. [2020-07-11 01:02:32,237 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 263 edges. 263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:02:32,245 INFO L225 Difference]: With dead ends: 246 [2020-07-11 01:02:32,245 INFO L226 Difference]: Without dead ends: 242 [2020-07-11 01:02:32,246 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-07-11 01:02:32,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-07-11 01:02:32,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 227. [2020-07-11 01:02:32,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:02:32,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 242 states. Second operand 227 states. [2020-07-11 01:02:32,663 INFO L74 IsIncluded]: Start isIncluded. First operand 242 states. Second operand 227 states. [2020-07-11 01:02:32,664 INFO L87 Difference]: Start difference. First operand 242 states. Second operand 227 states. [2020-07-11 01:02:32,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:32,671 INFO L93 Difference]: Finished difference Result 242 states and 266 transitions. [2020-07-11 01:02:32,671 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 266 transitions. [2020-07-11 01:02:32,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:02:32,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:02:32,673 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand 242 states. [2020-07-11 01:02:32,673 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 242 states. [2020-07-11 01:02:32,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:32,681 INFO L93 Difference]: Finished difference Result 242 states and 266 transitions. [2020-07-11 01:02:32,681 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 266 transitions. [2020-07-11 01:02:32,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:02:32,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:02:32,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:02:32,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:02:32,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2020-07-11 01:02:32,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 248 transitions. [2020-07-11 01:02:32,689 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 248 transitions. Word has length 42 [2020-07-11 01:02:32,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:02:32,691 INFO L479 AbstractCegarLoop]: Abstraction has 227 states and 248 transitions. [2020-07-11 01:02:32,691 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-11 01:02:32,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 227 states and 248 transitions. [2020-07-11 01:02:33,032 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 248 edges. 248 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:02:33,033 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 248 transitions. [2020-07-11 01:02:33,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-11 01:02:33,033 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:02:33,034 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:02:33,034 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-11 01:02:33,034 INFO L427 AbstractCegarLoop]: === Iteration 6 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:02:33,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:02:33,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1598586176, now seen corresponding path program 1 times [2020-07-11 01:02:33,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:02:33,035 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [396610750] [2020-07-11 01:02:33,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:02:33,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:02:33,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:02:33,255 INFO L280 TraceCheckUtils]: 0: Hoare triple {8808#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {8794#true} is VALID [2020-07-11 01:02:33,255 INFO L280 TraceCheckUtils]: 1: Hoare triple {8794#true} #valid := #valid[0 := 0]; {8794#true} is VALID [2020-07-11 01:02:33,256 INFO L280 TraceCheckUtils]: 2: Hoare triple {8794#true} assume 0 < #StackHeapBarrier; {8794#true} is VALID [2020-07-11 01:02:33,256 INFO L280 TraceCheckUtils]: 3: Hoare triple {8794#true} assume true; {8794#true} is VALID [2020-07-11 01:02:33,256 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {8794#true} {8794#true} #570#return; {8794#true} is VALID [2020-07-11 01:02:33,257 INFO L263 TraceCheckUtils]: 0: Hoare triple {8794#true} call ULTIMATE.init(); {8808#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:02:33,257 INFO L280 TraceCheckUtils]: 1: Hoare triple {8808#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {8794#true} is VALID [2020-07-11 01:02:33,258 INFO L280 TraceCheckUtils]: 2: Hoare triple {8794#true} #valid := #valid[0 := 0]; {8794#true} is VALID [2020-07-11 01:02:33,258 INFO L280 TraceCheckUtils]: 3: Hoare triple {8794#true} assume 0 < #StackHeapBarrier; {8794#true} is VALID [2020-07-11 01:02:33,258 INFO L280 TraceCheckUtils]: 4: Hoare triple {8794#true} assume true; {8794#true} is VALID [2020-07-11 01:02:33,258 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {8794#true} {8794#true} #570#return; {8794#true} is VALID [2020-07-11 01:02:33,259 INFO L263 TraceCheckUtils]: 6: Hoare triple {8794#true} call #t~ret44 := main(); {8794#true} is VALID [2020-07-11 01:02:33,259 INFO L280 TraceCheckUtils]: 7: Hoare triple {8794#true} ~data~0.base, ~data~0.offset := 0, 0; {8794#true} is VALID [2020-07-11 01:02:33,259 INFO L280 TraceCheckUtils]: 8: Hoare triple {8794#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {8794#true} is VALID [2020-07-11 01:02:33,259 INFO L280 TraceCheckUtils]: 9: Hoare triple {8794#true} assume !!(0 != #t~nondet36); {8794#true} is VALID [2020-07-11 01:02:33,260 INFO L280 TraceCheckUtils]: 10: Hoare triple {8794#true} havoc #t~nondet36; {8794#true} is VALID [2020-07-11 01:02:33,260 INFO L280 TraceCheckUtils]: 11: Hoare triple {8794#true} SUMMARY for call #t~malloc37.base, #t~malloc37.offset := #Ultimate.allocOnHeap(8); srcloc: L629 {8801#(not (= 0 |main_#t~malloc37.base|))} is VALID [2020-07-11 01:02:33,261 INFO L280 TraceCheckUtils]: 12: Hoare triple {8801#(not (= 0 |main_#t~malloc37.base|))} ~node~1.base, ~node~1.offset := #t~malloc37.base, #t~malloc37.offset; {8802#(not (= 0 main_~node~1.base))} is VALID [2020-07-11 01:02:33,262 INFO L280 TraceCheckUtils]: 13: Hoare triple {8802#(not (= 0 main_~node~1.base))} assume !(~node~1.base == 0 && ~node~1.offset == 0); {8802#(not (= 0 main_~node~1.base))} is VALID [2020-07-11 01:02:33,262 INFO L280 TraceCheckUtils]: 14: Hoare triple {8802#(not (= 0 main_~node~1.base))} SUMMARY for call write~$Pointer$(~node~1.base, ~node~1.offset, ~node~1.base, ~node~1.offset, 4); srcloc: L630-2 {8802#(not (= 0 main_~node~1.base))} is VALID [2020-07-11 01:02:33,263 INFO L280 TraceCheckUtils]: 15: Hoare triple {8802#(not (= 0 main_~node~1.base))} assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647; {8802#(not (= 0 main_~node~1.base))} is VALID [2020-07-11 01:02:33,263 INFO L280 TraceCheckUtils]: 16: Hoare triple {8802#(not (= 0 main_~node~1.base))} SUMMARY for call write~int(#t~nondet38, ~node~1.base, 4 + ~node~1.offset, 4); srcloc: L633 {8802#(not (= 0 main_~node~1.base))} is VALID [2020-07-11 01:02:33,264 INFO L280 TraceCheckUtils]: 17: Hoare triple {8802#(not (= 0 main_~node~1.base))} havoc #t~nondet38; {8802#(not (= 0 main_~node~1.base))} is VALID [2020-07-11 01:02:33,265 INFO L280 TraceCheckUtils]: 18: Hoare triple {8802#(not (= 0 main_~node~1.base))} SUMMARY for call #t~malloc39.base, #t~malloc39.offset := #Ultimate.allocOnHeap(8); srcloc: L634 {8802#(not (= 0 main_~node~1.base))} is VALID [2020-07-11 01:02:33,265 INFO L280 TraceCheckUtils]: 19: Hoare triple {8802#(not (= 0 main_~node~1.base))} ~item~0.base, ~item~0.offset := #t~malloc39.base, #t~malloc39.offset; {8802#(not (= 0 main_~node~1.base))} is VALID [2020-07-11 01:02:33,266 INFO L280 TraceCheckUtils]: 20: Hoare triple {8802#(not (= 0 main_~node~1.base))} assume !(~item~0.base == 0 && ~item~0.offset == 0); {8802#(not (= 0 main_~node~1.base))} is VALID [2020-07-11 01:02:33,267 INFO L280 TraceCheckUtils]: 21: Hoare triple {8802#(not (= 0 main_~node~1.base))} SUMMARY for call write~$Pointer$(~node~1.base, ~node~1.offset, ~item~0.base, ~item~0.offset, 4); srcloc: L635-2 {8803#(not (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))} is VALID [2020-07-11 01:02:33,269 INFO L280 TraceCheckUtils]: 22: Hoare triple {8803#(not (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))} SUMMARY for call write~$Pointer$(~data~0.base, ~data~0.offset, ~item~0.base, 4 + ~item~0.offset, 4); srcloc: L637 {8803#(not (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))} is VALID [2020-07-11 01:02:33,270 INFO L280 TraceCheckUtils]: 23: Hoare triple {8803#(not (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))} ~data~0.base, ~data~0.offset := ~item~0.base, ~item~0.offset; {8804#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2020-07-11 01:02:33,270 INFO L280 TraceCheckUtils]: 24: Hoare triple {8804#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {8804#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2020-07-11 01:02:33,271 INFO L280 TraceCheckUtils]: 25: Hoare triple {8804#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} assume !(0 != #t~nondet36); {8804#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2020-07-11 01:02:33,272 INFO L280 TraceCheckUtils]: 26: Hoare triple {8804#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} havoc #t~nondet36; {8804#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2020-07-11 01:02:33,272 INFO L280 TraceCheckUtils]: 27: Hoare triple {8804#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} assume !(~data~0.base == 0 && ~data~0.offset == 0); {8804#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2020-07-11 01:02:33,273 INFO L263 TraceCheckUtils]: 28: Hoare triple {8804#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} call inspect_before(~data~0.base, ~data~0.offset); {8805#(not (= 0 (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)))} is VALID [2020-07-11 01:02:33,274 INFO L280 TraceCheckUtils]: 29: Hoare triple {8805#(not (= 0 (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)))} ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; {8806#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-11 01:02:33,275 INFO L280 TraceCheckUtils]: 30: Hoare triple {8806#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} assume !(~shape.base == 0 && ~shape.offset == 0); {8806#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-11 01:02:33,275 INFO L280 TraceCheckUtils]: 31: Hoare triple {8806#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} goto; {8806#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-11 01:02:33,276 INFO L280 TraceCheckUtils]: 32: Hoare triple {8806#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} SUMMARY for call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); srcloc: L605-7 {8806#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-11 01:02:33,277 INFO L280 TraceCheckUtils]: 33: Hoare triple {8806#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} assume !(#t~mem25.base != 0 || #t~mem25.offset != 0); {8806#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-11 01:02:33,277 INFO L280 TraceCheckUtils]: 34: Hoare triple {8806#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} havoc #t~mem25.base, #t~mem25.offset; {8806#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-11 01:02:33,278 INFO L280 TraceCheckUtils]: 35: Hoare triple {8806#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} assume !(~shape.base == 0 && ~shape.offset == 0); {8806#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-11 01:02:33,279 INFO L280 TraceCheckUtils]: 36: Hoare triple {8806#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} goto; {8806#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-11 01:02:33,279 INFO L280 TraceCheckUtils]: 37: Hoare triple {8806#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} SUMMARY for call #t~mem26.base, #t~mem26.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); srcloc: L612-6 {8806#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-11 01:02:33,280 INFO L280 TraceCheckUtils]: 38: Hoare triple {8806#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} assume !!(#t~mem26.base == 0 && #t~mem26.offset == 0); {8806#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-11 01:02:33,281 INFO L280 TraceCheckUtils]: 39: Hoare triple {8806#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} havoc #t~mem26.base, #t~mem26.offset; {8806#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-11 01:02:33,281 INFO L280 TraceCheckUtils]: 40: Hoare triple {8806#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} goto; {8806#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-11 01:02:33,282 INFO L280 TraceCheckUtils]: 41: Hoare triple {8806#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} SUMMARY for call #t~mem27.base, #t~mem27.offset := read~$Pointer$(~shape.base, ~shape.offset, 4); srcloc: L613-6 {8807#(not (= 0 |inspect_before_#t~mem27.base|))} is VALID [2020-07-11 01:02:33,283 INFO L280 TraceCheckUtils]: 42: Hoare triple {8807#(not (= 0 |inspect_before_#t~mem27.base|))} assume #t~mem27.base == 0 && #t~mem27.offset == 0; {8795#false} is VALID [2020-07-11 01:02:33,284 INFO L280 TraceCheckUtils]: 43: Hoare triple {8795#false} havoc #t~mem27.base, #t~mem27.offset; {8795#false} is VALID [2020-07-11 01:02:33,284 INFO L263 TraceCheckUtils]: 44: Hoare triple {8795#false} call fail(); {8795#false} is VALID [2020-07-11 01:02:33,284 INFO L280 TraceCheckUtils]: 45: Hoare triple {8795#false} assume !false; {8795#false} is VALID [2020-07-11 01:02:33,289 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:02:33,289 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [396610750] [2020-07-11 01:02:33,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:02:33,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-11 01:02:33,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879239846] [2020-07-11 01:02:33,290 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2020-07-11 01:02:33,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:02:33,291 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-11 01:02:33,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:02:33,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-11 01:02:33,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:02:33,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-11 01:02:33,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-07-11 01:02:33,347 INFO L87 Difference]: Start difference. First operand 227 states and 248 transitions. Second operand 10 states. [2020-07-11 01:02:37,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:37,505 INFO L93 Difference]: Finished difference Result 299 states and 329 transitions. [2020-07-11 01:02:37,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-11 01:02:37,506 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2020-07-11 01:02:37,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:02:37,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 01:02:37,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 329 transitions. [2020-07-11 01:02:37,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 01:02:37,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 329 transitions. [2020-07-11 01:02:37,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 329 transitions. [2020-07-11 01:02:37,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 329 edges. 329 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:02:38,005 INFO L225 Difference]: With dead ends: 299 [2020-07-11 01:02:38,005 INFO L226 Difference]: Without dead ends: 295 [2020-07-11 01:02:38,006 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2020-07-11 01:02:38,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2020-07-11 01:02:38,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 234. [2020-07-11 01:02:38,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:02:38,584 INFO L82 GeneralOperation]: Start isEquivalent. First operand 295 states. Second operand 234 states. [2020-07-11 01:02:38,585 INFO L74 IsIncluded]: Start isIncluded. First operand 295 states. Second operand 234 states. [2020-07-11 01:02:38,585 INFO L87 Difference]: Start difference. First operand 295 states. Second operand 234 states. [2020-07-11 01:02:38,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:38,602 INFO L93 Difference]: Finished difference Result 295 states and 325 transitions. [2020-07-11 01:02:38,602 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 325 transitions. [2020-07-11 01:02:38,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:02:38,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:02:38,607 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand 295 states. [2020-07-11 01:02:38,607 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 295 states. [2020-07-11 01:02:38,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:38,624 INFO L93 Difference]: Finished difference Result 295 states and 325 transitions. [2020-07-11 01:02:38,624 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 325 transitions. [2020-07-11 01:02:38,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:02:38,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:02:38,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:02:38,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:02:38,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2020-07-11 01:02:38,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 255 transitions. [2020-07-11 01:02:38,638 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 255 transitions. Word has length 46 [2020-07-11 01:02:38,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:02:38,638 INFO L479 AbstractCegarLoop]: Abstraction has 234 states and 255 transitions. [2020-07-11 01:02:38,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-11 01:02:38,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 234 states and 255 transitions. [2020-07-11 01:02:38,982 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:02:38,983 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 255 transitions. [2020-07-11 01:02:38,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-11 01:02:38,983 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:02:38,984 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:02:38,984 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-11 01:02:38,984 INFO L427 AbstractCegarLoop]: === Iteration 7 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:02:38,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:02:38,985 INFO L82 PathProgramCache]: Analyzing trace with hash 180139286, now seen corresponding path program 1 times [2020-07-11 01:02:38,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:02:38,985 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [791191815] [2020-07-11 01:02:38,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:02:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:02:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-11 01:02:39,178 INFO L280 TraceCheckUtils]: 0: Hoare triple {10494#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {10480#true} is VALID [2020-07-11 01:02:39,179 INFO L280 TraceCheckUtils]: 1: Hoare triple {10480#true} #valid := #valid[0 := 0]; {10480#true} is VALID [2020-07-11 01:02:39,179 INFO L280 TraceCheckUtils]: 2: Hoare triple {10480#true} assume 0 < #StackHeapBarrier; {10480#true} is VALID [2020-07-11 01:02:39,179 INFO L280 TraceCheckUtils]: 3: Hoare triple {10480#true} assume true; {10480#true} is VALID [2020-07-11 01:02:39,180 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {10480#true} {10480#true} #570#return; {10480#true} is VALID [2020-07-11 01:02:39,181 INFO L263 TraceCheckUtils]: 0: Hoare triple {10480#true} call ULTIMATE.init(); {10494#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-11 01:02:39,181 INFO L280 TraceCheckUtils]: 1: Hoare triple {10494#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {10480#true} is VALID [2020-07-11 01:02:39,181 INFO L280 TraceCheckUtils]: 2: Hoare triple {10480#true} #valid := #valid[0 := 0]; {10480#true} is VALID [2020-07-11 01:02:39,182 INFO L280 TraceCheckUtils]: 3: Hoare triple {10480#true} assume 0 < #StackHeapBarrier; {10480#true} is VALID [2020-07-11 01:02:39,182 INFO L280 TraceCheckUtils]: 4: Hoare triple {10480#true} assume true; {10480#true} is VALID [2020-07-11 01:02:39,182 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {10480#true} {10480#true} #570#return; {10480#true} is VALID [2020-07-11 01:02:39,182 INFO L263 TraceCheckUtils]: 6: Hoare triple {10480#true} call #t~ret44 := main(); {10480#true} is VALID [2020-07-11 01:02:39,182 INFO L280 TraceCheckUtils]: 7: Hoare triple {10480#true} ~data~0.base, ~data~0.offset := 0, 0; {10480#true} is VALID [2020-07-11 01:02:39,183 INFO L280 TraceCheckUtils]: 8: Hoare triple {10480#true} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {10480#true} is VALID [2020-07-11 01:02:39,183 INFO L280 TraceCheckUtils]: 9: Hoare triple {10480#true} assume !!(0 != #t~nondet36); {10480#true} is VALID [2020-07-11 01:02:39,183 INFO L280 TraceCheckUtils]: 10: Hoare triple {10480#true} havoc #t~nondet36; {10480#true} is VALID [2020-07-11 01:02:39,184 INFO L280 TraceCheckUtils]: 11: Hoare triple {10480#true} SUMMARY for call #t~malloc37.base, #t~malloc37.offset := #Ultimate.allocOnHeap(8); srcloc: L629 {10487#(not (= 0 |main_#t~malloc37.base|))} is VALID [2020-07-11 01:02:39,184 INFO L280 TraceCheckUtils]: 12: Hoare triple {10487#(not (= 0 |main_#t~malloc37.base|))} ~node~1.base, ~node~1.offset := #t~malloc37.base, #t~malloc37.offset; {10488#(not (= 0 main_~node~1.base))} is VALID [2020-07-11 01:02:39,185 INFO L280 TraceCheckUtils]: 13: Hoare triple {10488#(not (= 0 main_~node~1.base))} assume !(~node~1.base == 0 && ~node~1.offset == 0); {10488#(not (= 0 main_~node~1.base))} is VALID [2020-07-11 01:02:39,185 INFO L280 TraceCheckUtils]: 14: Hoare triple {10488#(not (= 0 main_~node~1.base))} SUMMARY for call write~$Pointer$(~node~1.base, ~node~1.offset, ~node~1.base, ~node~1.offset, 4); srcloc: L630-2 {10488#(not (= 0 main_~node~1.base))} is VALID [2020-07-11 01:02:39,186 INFO L280 TraceCheckUtils]: 15: Hoare triple {10488#(not (= 0 main_~node~1.base))} assume -2147483648 <= #t~nondet38 && #t~nondet38 <= 2147483647; {10488#(not (= 0 main_~node~1.base))} is VALID [2020-07-11 01:02:39,187 INFO L280 TraceCheckUtils]: 16: Hoare triple {10488#(not (= 0 main_~node~1.base))} SUMMARY for call write~int(#t~nondet38, ~node~1.base, 4 + ~node~1.offset, 4); srcloc: L633 {10488#(not (= 0 main_~node~1.base))} is VALID [2020-07-11 01:02:39,187 INFO L280 TraceCheckUtils]: 17: Hoare triple {10488#(not (= 0 main_~node~1.base))} havoc #t~nondet38; {10488#(not (= 0 main_~node~1.base))} is VALID [2020-07-11 01:02:39,188 INFO L280 TraceCheckUtils]: 18: Hoare triple {10488#(not (= 0 main_~node~1.base))} SUMMARY for call #t~malloc39.base, #t~malloc39.offset := #Ultimate.allocOnHeap(8); srcloc: L634 {10488#(not (= 0 main_~node~1.base))} is VALID [2020-07-11 01:02:39,189 INFO L280 TraceCheckUtils]: 19: Hoare triple {10488#(not (= 0 main_~node~1.base))} ~item~0.base, ~item~0.offset := #t~malloc39.base, #t~malloc39.offset; {10488#(not (= 0 main_~node~1.base))} is VALID [2020-07-11 01:02:39,189 INFO L280 TraceCheckUtils]: 20: Hoare triple {10488#(not (= 0 main_~node~1.base))} assume !(~item~0.base == 0 && ~item~0.offset == 0); {10488#(not (= 0 main_~node~1.base))} is VALID [2020-07-11 01:02:39,192 INFO L280 TraceCheckUtils]: 21: Hoare triple {10488#(not (= 0 main_~node~1.base))} SUMMARY for call write~$Pointer$(~node~1.base, ~node~1.offset, ~item~0.base, ~item~0.offset, 4); srcloc: L635-2 {10489#(not (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))} is VALID [2020-07-11 01:02:39,194 INFO L280 TraceCheckUtils]: 22: Hoare triple {10489#(not (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))} SUMMARY for call write~$Pointer$(~data~0.base, ~data~0.offset, ~item~0.base, 4 + ~item~0.offset, 4); srcloc: L637 {10489#(not (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))} is VALID [2020-07-11 01:02:39,196 INFO L280 TraceCheckUtils]: 23: Hoare triple {10489#(not (= 0 (select (select |#memory_$Pointer$.base| main_~item~0.base) main_~item~0.offset)))} ~data~0.base, ~data~0.offset := ~item~0.base, ~item~0.offset; {10490#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2020-07-11 01:02:39,201 INFO L280 TraceCheckUtils]: 24: Hoare triple {10490#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} assume -2147483648 <= #t~nondet36 && #t~nondet36 <= 2147483647; {10490#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2020-07-11 01:02:39,205 INFO L280 TraceCheckUtils]: 25: Hoare triple {10490#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} assume !(0 != #t~nondet36); {10490#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2020-07-11 01:02:39,206 INFO L280 TraceCheckUtils]: 26: Hoare triple {10490#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} havoc #t~nondet36; {10490#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2020-07-11 01:02:39,207 INFO L280 TraceCheckUtils]: 27: Hoare triple {10490#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} assume !(~data~0.base == 0 && ~data~0.offset == 0); {10490#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} is VALID [2020-07-11 01:02:39,208 INFO L263 TraceCheckUtils]: 28: Hoare triple {10490#(not (= 0 (select (select |#memory_$Pointer$.base| main_~data~0.base) main_~data~0.offset)))} call inspect_before(~data~0.base, ~data~0.offset); {10491#(not (= 0 (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)))} is VALID [2020-07-11 01:02:39,209 INFO L280 TraceCheckUtils]: 29: Hoare triple {10491#(not (= 0 (select (select |#memory_$Pointer$.base| |inspect_before_#in~shape.base|) |inspect_before_#in~shape.offset|)))} ~shape.base, ~shape.offset := #in~shape.base, #in~shape.offset; {10492#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-11 01:02:39,209 INFO L280 TraceCheckUtils]: 30: Hoare triple {10492#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} assume !(~shape.base == 0 && ~shape.offset == 0); {10492#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-11 01:02:39,210 INFO L280 TraceCheckUtils]: 31: Hoare triple {10492#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} goto; {10492#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-11 01:02:39,210 INFO L280 TraceCheckUtils]: 32: Hoare triple {10492#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} SUMMARY for call #t~mem25.base, #t~mem25.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); srcloc: L605-7 {10492#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-11 01:02:39,211 INFO L280 TraceCheckUtils]: 33: Hoare triple {10492#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} assume !!(#t~mem25.base != 0 || #t~mem25.offset != 0); {10492#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-11 01:02:39,211 INFO L280 TraceCheckUtils]: 34: Hoare triple {10492#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} havoc #t~mem25.base, #t~mem25.offset; {10492#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-11 01:02:39,212 INFO L280 TraceCheckUtils]: 35: Hoare triple {10492#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} assume !(~shape.base == 0 && ~shape.offset == 0); {10492#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-11 01:02:39,213 INFO L280 TraceCheckUtils]: 36: Hoare triple {10492#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} goto; {10492#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-11 01:02:39,213 INFO L280 TraceCheckUtils]: 37: Hoare triple {10492#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} SUMMARY for call #t~mem21.base, #t~mem21.offset := read~$Pointer$(~shape.base, 4 + ~shape.offset, 4); srcloc: L607-6 {10492#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-11 01:02:39,214 INFO L280 TraceCheckUtils]: 38: Hoare triple {10492#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} assume !(#t~mem21.base == 0 && #t~mem21.offset == 0); {10492#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-11 01:02:39,214 INFO L280 TraceCheckUtils]: 39: Hoare triple {10492#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} havoc #t~mem21.base, #t~mem21.offset; {10492#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-11 01:02:39,215 INFO L280 TraceCheckUtils]: 40: Hoare triple {10492#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} goto; {10492#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} is VALID [2020-07-11 01:02:39,216 INFO L280 TraceCheckUtils]: 41: Hoare triple {10492#(not (= (select (select |#memory_$Pointer$.base| inspect_before_~shape.base) inspect_before_~shape.offset) 0))} SUMMARY for call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~shape.base, ~shape.offset, 4); srcloc: L608-6 {10493#(not (= 0 |inspect_before_#t~mem22.base|))} is VALID [2020-07-11 01:02:39,216 INFO L280 TraceCheckUtils]: 42: Hoare triple {10493#(not (= 0 |inspect_before_#t~mem22.base|))} assume #t~mem22.base == 0 && #t~mem22.offset == 0; {10481#false} is VALID [2020-07-11 01:02:39,216 INFO L280 TraceCheckUtils]: 43: Hoare triple {10481#false} havoc #t~mem22.base, #t~mem22.offset; {10481#false} is VALID [2020-07-11 01:02:39,216 INFO L263 TraceCheckUtils]: 44: Hoare triple {10481#false} call fail(); {10481#false} is VALID [2020-07-11 01:02:39,217 INFO L280 TraceCheckUtils]: 45: Hoare triple {10481#false} assume !false; {10481#false} is VALID [2020-07-11 01:02:39,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-11 01:02:39,221 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [791191815] [2020-07-11 01:02:39,221 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-11 01:02:39,221 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-07-11 01:02:39,221 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080705503] [2020-07-11 01:02:39,222 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2020-07-11 01:02:39,222 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-11 01:02:39,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-11 01:02:39,265 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:02:39,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-11 01:02:39,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-11 01:02:39,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-11 01:02:39,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-07-11 01:02:39,266 INFO L87 Difference]: Start difference. First operand 234 states and 255 transitions. Second operand 10 states. [2020-07-11 01:02:43,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:43,327 INFO L93 Difference]: Finished difference Result 297 states and 326 transitions. [2020-07-11 01:02:43,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-11 01:02:43,328 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2020-07-11 01:02:43,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-11 01:02:43,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 01:02:43,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 326 transitions. [2020-07-11 01:02:43,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-11 01:02:43,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 326 transitions. [2020-07-11 01:02:43,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 326 transitions. [2020-07-11 01:02:43,761 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 326 edges. 326 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:02:43,771 INFO L225 Difference]: With dead ends: 297 [2020-07-11 01:02:43,771 INFO L226 Difference]: Without dead ends: 293 [2020-07-11 01:02:43,773 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2020-07-11 01:02:43,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2020-07-11 01:02:44,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 241. [2020-07-11 01:02:44,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-11 01:02:44,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 293 states. Second operand 241 states. [2020-07-11 01:02:44,283 INFO L74 IsIncluded]: Start isIncluded. First operand 293 states. Second operand 241 states. [2020-07-11 01:02:44,284 INFO L87 Difference]: Start difference. First operand 293 states. Second operand 241 states. [2020-07-11 01:02:44,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:44,303 INFO L93 Difference]: Finished difference Result 293 states and 322 transitions. [2020-07-11 01:02:44,303 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 322 transitions. [2020-07-11 01:02:44,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:02:44,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:02:44,305 INFO L74 IsIncluded]: Start isIncluded. First operand 241 states. Second operand 293 states. [2020-07-11 01:02:44,306 INFO L87 Difference]: Start difference. First operand 241 states. Second operand 293 states. [2020-07-11 01:02:44,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-11 01:02:44,318 INFO L93 Difference]: Finished difference Result 293 states and 322 transitions. [2020-07-11 01:02:44,319 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 322 transitions. [2020-07-11 01:02:44,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-11 01:02:44,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-11 01:02:44,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-11 01:02:44,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-11 01:02:44,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2020-07-11 01:02:44,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 262 transitions. [2020-07-11 01:02:44,328 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 262 transitions. Word has length 46 [2020-07-11 01:02:44,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-11 01:02:44,328 INFO L479 AbstractCegarLoop]: Abstraction has 241 states and 262 transitions. [2020-07-11 01:02:44,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-11 01:02:44,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 241 states and 262 transitions. [2020-07-11 01:02:44,788 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-11 01:02:44,789 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 262 transitions. [2020-07-11 01:02:44,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-07-11 01:02:44,789 INFO L414 BasicCegarLoop]: Found error trace [2020-07-11 01:02:44,789 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 01:02:44,790 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-11 01:02:44,790 INFO L427 AbstractCegarLoop]: === Iteration 8 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-11 01:02:44,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-11 01:02:44,791 INFO L82 PathProgramCache]: Analyzing trace with hash 797684937, now seen corresponding path program 1 times [2020-07-11 01:02:44,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-11 01:02:44,792 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [466331082] [2020-07-11 01:02:44,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-11 01:02:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 01:02:44,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-11 01:02:44,917 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-11 01:02:44,917 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-11 01:02:44,918 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-11 01:02:44,999 WARN L170 areAnnotationChecker]: failENTRY has no Hoare annotation [2020-07-11 01:02:44,999 WARN L170 areAnnotationChecker]: failENTRY has no Hoare annotation [2020-07-11 01:02:45,000 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-11 01:02:45,000 WARN L170 areAnnotationChecker]: merge_pairENTRY has no Hoare annotation [2020-07-11 01:02:45,000 WARN L170 areAnnotationChecker]: merge_single_nodeENTRY has no Hoare annotation [2020-07-11 01:02:45,000 WARN L170 areAnnotationChecker]: __bswap_32ENTRY has no Hoare annotation [2020-07-11 01:02:45,000 WARN L170 areAnnotationChecker]: seq_sort_coreENTRY has no Hoare annotation [2020-07-11 01:02:45,000 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 01:02:45,000 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-11 01:02:45,000 WARN L170 areAnnotationChecker]: __bswap_64ENTRY has no Hoare annotation [2020-07-11 01:02:45,000 WARN L170 areAnnotationChecker]: inspect_beforeENTRY has no Hoare annotation [2020-07-11 01:02:45,001 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-11 01:02:45,001 WARN L170 areAnnotationChecker]: inspect_afterENTRY has no Hoare annotation [2020-07-11 01:02:45,001 WARN L170 areAnnotationChecker]: failFINAL has no Hoare annotation [2020-07-11 01:02:45,001 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 01:02:45,001 WARN L170 areAnnotationChecker]: L573 has no Hoare annotation [2020-07-11 01:02:45,001 WARN L170 areAnnotationChecker]: L564 has no Hoare annotation [2020-07-11 01:02:45,005 WARN L170 areAnnotationChecker]: L66 has no Hoare annotation [2020-07-11 01:02:45,005 WARN L170 areAnnotationChecker]: L586 has no Hoare annotation [2020-07-11 01:02:45,006 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 01:02:45,006 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-11 01:02:45,006 WARN L170 areAnnotationChecker]: L71 has no Hoare annotation [2020-07-11 01:02:45,006 WARN L170 areAnnotationChecker]: L604-4 has no Hoare annotation [2020-07-11 01:02:45,006 WARN L170 areAnnotationChecker]: L604-4 has no Hoare annotation [2020-07-11 01:02:45,006 WARN L170 areAnnotationChecker]: L604-4 has no Hoare annotation [2020-07-11 01:02:45,006 WARN L170 areAnnotationChecker]: L628-5 has no Hoare annotation [2020-07-11 01:02:45,006 WARN L170 areAnnotationChecker]: L628-5 has no Hoare annotation [2020-07-11 01:02:45,006 WARN L170 areAnnotationChecker]: L618-4 has no Hoare annotation [2020-07-11 01:02:45,006 WARN L170 areAnnotationChecker]: L618-4 has no Hoare annotation [2020-07-11 01:02:45,007 WARN L170 areAnnotationChecker]: L618-4 has no Hoare annotation [2020-07-11 01:02:45,007 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-11 01:02:45,007 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-11 01:02:45,007 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-11 01:02:45,007 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-11 01:02:45,007 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-11 01:02:45,010 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-11 01:02:45,010 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-11 01:02:45,010 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-11 01:02:45,011 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-11 01:02:45,011 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-11 01:02:45,011 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-11 01:02:45,011 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-11 01:02:45,011 WARN L170 areAnnotationChecker]: failEXIT has no Hoare annotation [2020-07-11 01:02:45,011 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-11 01:02:45,011 WARN L170 areAnnotationChecker]: L573-1 has no Hoare annotation [2020-07-11 01:02:45,011 WARN L170 areAnnotationChecker]: L567 has no Hoare annotation [2020-07-11 01:02:45,011 WARN L170 areAnnotationChecker]: L66-1 has no Hoare annotation [2020-07-11 01:02:45,011 WARN L170 areAnnotationChecker]: L598-1 has no Hoare annotation [2020-07-11 01:02:45,012 WARN L170 areAnnotationChecker]: L598-1 has no Hoare annotation [2020-07-11 01:02:45,012 WARN L170 areAnnotationChecker]: L598-1 has no Hoare annotation [2020-07-11 01:02:45,012 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-11 01:02:45,012 WARN L170 areAnnotationChecker]: L71-1 has no Hoare annotation [2020-07-11 01:02:45,012 WARN L170 areAnnotationChecker]: L605-7 has no Hoare annotation [2020-07-11 01:02:45,012 WARN L170 areAnnotationChecker]: L605-7 has no Hoare annotation [2020-07-11 01:02:45,012 WARN L170 areAnnotationChecker]: L604-1 has no Hoare annotation [2020-07-11 01:02:45,012 WARN L170 areAnnotationChecker]: L604-1 has no Hoare annotation [2020-07-11 01:02:45,012 WARN L170 areAnnotationChecker]: L604-3 has no Hoare annotation [2020-07-11 01:02:45,012 WARN L170 areAnnotationChecker]: L604-3 has no Hoare annotation [2020-07-11 01:02:45,013 WARN L170 areAnnotationChecker]: L628-6 has no Hoare annotation [2020-07-11 01:02:45,013 WARN L170 areAnnotationChecker]: L628-6 has no Hoare annotation [2020-07-11 01:02:45,013 WARN L170 areAnnotationChecker]: L628-1 has no Hoare annotation [2020-07-11 01:02:45,013 WARN L170 areAnnotationChecker]: L628-1 has no Hoare annotation [2020-07-11 01:02:45,013 WARN L170 areAnnotationChecker]: L619-6 has no Hoare annotation [2020-07-11 01:02:45,013 WARN L170 areAnnotationChecker]: L619-6 has no Hoare annotation [2020-07-11 01:02:45,013 WARN L170 areAnnotationChecker]: L618-1 has no Hoare annotation [2020-07-11 01:02:45,013 WARN L170 areAnnotationChecker]: L618-1 has no Hoare annotation [2020-07-11 01:02:45,013 WARN L170 areAnnotationChecker]: L618-3 has no Hoare annotation [2020-07-11 01:02:45,013 WARN L170 areAnnotationChecker]: L618-3 has no Hoare annotation [2020-07-11 01:02:45,013 WARN L170 areAnnotationChecker]: L606-3 has no Hoare annotation [2020-07-11 01:02:45,014 WARN L170 areAnnotationChecker]: L606-3 has no Hoare annotation [2020-07-11 01:02:45,014 WARN L170 areAnnotationChecker]: L607-5 has no Hoare annotation [2020-07-11 01:02:45,014 WARN L170 areAnnotationChecker]: L607-5 has no Hoare annotation [2020-07-11 01:02:45,014 WARN L170 areAnnotationChecker]: L608-5 has no Hoare annotation [2020-07-11 01:02:45,014 WARN L170 areAnnotationChecker]: L608-5 has no Hoare annotation [2020-07-11 01:02:45,014 WARN L170 areAnnotationChecker]: L609-8 has no Hoare annotation [2020-07-11 01:02:45,014 WARN L170 areAnnotationChecker]: L609-8 has no Hoare annotation [2020-07-11 01:02:45,014 WARN L170 areAnnotationChecker]: L611-2 has no Hoare annotation [2020-07-11 01:02:45,014 WARN L170 areAnnotationChecker]: L611-2 has no Hoare annotation [2020-07-11 01:02:45,014 WARN L170 areAnnotationChecker]: L612-5 has no Hoare annotation [2020-07-11 01:02:45,015 WARN L170 areAnnotationChecker]: L612-5 has no Hoare annotation [2020-07-11 01:02:45,015 WARN L170 areAnnotationChecker]: L613-5 has no Hoare annotation [2020-07-11 01:02:45,015 WARN L170 areAnnotationChecker]: L613-5 has no Hoare annotation [2020-07-11 01:02:45,015 WARN L170 areAnnotationChecker]: L614-8 has no Hoare annotation [2020-07-11 01:02:45,015 WARN L170 areAnnotationChecker]: L614-8 has no Hoare annotation [2020-07-11 01:02:45,015 WARN L170 areAnnotationChecker]: L619-5 has no Hoare annotation [2020-07-11 01:02:45,015 WARN L170 areAnnotationChecker]: L619-5 has no Hoare annotation [2020-07-11 01:02:45,015 WARN L170 areAnnotationChecker]: L620-5 has no Hoare annotation [2020-07-11 01:02:45,015 WARN L170 areAnnotationChecker]: L620-5 has no Hoare annotation [2020-07-11 01:02:45,015 WARN L170 areAnnotationChecker]: L623-5 has no Hoare annotation [2020-07-11 01:02:45,016 WARN L170 areAnnotationChecker]: L623-5 has no Hoare annotation [2020-07-11 01:02:45,016 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-11 01:02:45,016 WARN L170 areAnnotationChecker]: L573-2 has no Hoare annotation [2020-07-11 01:02:45,016 WARN L170 areAnnotationChecker]: L567-1 has no Hoare annotation [2020-07-11 01:02:45,016 WARN L170 areAnnotationChecker]: __bswap_32FINAL has no Hoare annotation [2020-07-11 01:02:45,016 WARN L170 areAnnotationChecker]: L587-2 has no Hoare annotation [2020-07-11 01:02:45,016 WARN L170 areAnnotationChecker]: L588 has no Hoare annotation [2020-07-11 01:02:45,016 WARN L170 areAnnotationChecker]: __bswap_64FINAL has no Hoare annotation [2020-07-11 01:02:45,016 WARN L170 areAnnotationChecker]: L605 has no Hoare annotation [2020-07-11 01:02:45,016 WARN L170 areAnnotationChecker]: L605 has no Hoare annotation [2020-07-11 01:02:45,017 WARN L170 areAnnotationChecker]: L611-3 has no Hoare annotation [2020-07-11 01:02:45,017 WARN L170 areAnnotationChecker]: L611-3 has no Hoare annotation [2020-07-11 01:02:45,017 WARN L170 areAnnotationChecker]: L611-3 has no Hoare annotation [2020-07-11 01:02:45,017 WARN L170 areAnnotationChecker]: L642 has no Hoare annotation [2020-07-11 01:02:45,017 WARN L170 areAnnotationChecker]: L643 has no Hoare annotation [2020-07-11 01:02:45,017 WARN L170 areAnnotationChecker]: L643 has no Hoare annotation [2020-07-11 01:02:45,017 WARN L170 areAnnotationChecker]: L628-2 has no Hoare annotation [2020-07-11 01:02:45,017 WARN L170 areAnnotationChecker]: L628-4 has no Hoare annotation [2020-07-11 01:02:45,017 WARN L170 areAnnotationChecker]: L619 has no Hoare annotation [2020-07-11 01:02:45,017 WARN L170 areAnnotationChecker]: L619 has no Hoare annotation [2020-07-11 01:02:45,018 WARN L170 areAnnotationChecker]: L620-6 has no Hoare annotation [2020-07-11 01:02:45,018 WARN L170 areAnnotationChecker]: L620-6 has no Hoare annotation [2020-07-11 01:02:45,018 WARN L170 areAnnotationChecker]: L607-6 has no Hoare annotation [2020-07-11 01:02:45,018 WARN L170 areAnnotationChecker]: L607-6 has no Hoare annotation [2020-07-11 01:02:45,018 WARN L170 areAnnotationChecker]: L606-4 has no Hoare annotation [2020-07-11 01:02:45,018 WARN L170 areAnnotationChecker]: L606-4 has no Hoare annotation [2020-07-11 01:02:45,018 WARN L170 areAnnotationChecker]: L606-4 has no Hoare annotation [2020-07-11 01:02:45,018 WARN L170 areAnnotationChecker]: L608-6 has no Hoare annotation [2020-07-11 01:02:45,018 WARN L170 areAnnotationChecker]: L608-6 has no Hoare annotation [2020-07-11 01:02:45,018 WARN L170 areAnnotationChecker]: L609-9 has no Hoare annotation [2020-07-11 01:02:45,019 WARN L170 areAnnotationChecker]: L609-9 has no Hoare annotation [2020-07-11 01:02:45,019 WARN L170 areAnnotationChecker]: L605-4 has no Hoare annotation [2020-07-11 01:02:45,019 WARN L170 areAnnotationChecker]: L612-6 has no Hoare annotation [2020-07-11 01:02:45,019 WARN L170 areAnnotationChecker]: L612-6 has no Hoare annotation [2020-07-11 01:02:45,019 WARN L170 areAnnotationChecker]: L613-6 has no Hoare annotation [2020-07-11 01:02:45,019 WARN L170 areAnnotationChecker]: L613-6 has no Hoare annotation [2020-07-11 01:02:45,019 WARN L170 areAnnotationChecker]: L614-9 has no Hoare annotation [2020-07-11 01:02:45,019 WARN L170 areAnnotationChecker]: L614-9 has no Hoare annotation [2020-07-11 01:02:45,019 WARN L170 areAnnotationChecker]: L614-10 has no Hoare annotation [2020-07-11 01:02:45,020 WARN L170 areAnnotationChecker]: L620-7 has no Hoare annotation [2020-07-11 01:02:45,020 WARN L170 areAnnotationChecker]: L623-7 has no Hoare annotation [2020-07-11 01:02:45,020 WARN L170 areAnnotationChecker]: L623-6 has no Hoare annotation [2020-07-11 01:02:45,020 WARN L170 areAnnotationChecker]: L623-6 has no Hoare annotation [2020-07-11 01:02:45,020 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-11 01:02:45,020 WARN L170 areAnnotationChecker]: L573-3 has no Hoare annotation [2020-07-11 01:02:45,020 WARN L170 areAnnotationChecker]: L567-2 has no Hoare annotation [2020-07-11 01:02:45,020 WARN L170 areAnnotationChecker]: seq_sort_coreFINAL has no Hoare annotation [2020-07-11 01:02:45,020 WARN L170 areAnnotationChecker]: L588-1 has no Hoare annotation [2020-07-11 01:02:45,021 WARN L170 areAnnotationChecker]: L605-1 has no Hoare annotation [2020-07-11 01:02:45,021 WARN L170 areAnnotationChecker]: L605-3 has no Hoare annotation [2020-07-11 01:02:45,021 WARN L170 areAnnotationChecker]: L611 has no Hoare annotation [2020-07-11 01:02:45,021 WARN L170 areAnnotationChecker]: L611 has no Hoare annotation [2020-07-11 01:02:45,021 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-11 01:02:45,021 WARN L170 areAnnotationChecker]: L644-4 has no Hoare annotation [2020-07-11 01:02:45,021 WARN L170 areAnnotationChecker]: L644-4 has no Hoare annotation [2020-07-11 01:02:45,021 WARN L170 areAnnotationChecker]: L629 has no Hoare annotation [2020-07-11 01:02:45,021 WARN L170 areAnnotationChecker]: L619-1 has no Hoare annotation [2020-07-11 01:02:45,021 WARN L170 areAnnotationChecker]: L619-4 has no Hoare annotation [2020-07-11 01:02:45,022 WARN L170 areAnnotationChecker]: L620 has no Hoare annotation [2020-07-11 01:02:45,022 WARN L170 areAnnotationChecker]: L620 has no Hoare annotation [2020-07-11 01:02:45,022 WARN L170 areAnnotationChecker]: L607 has no Hoare annotation [2020-07-11 01:02:45,022 WARN L170 areAnnotationChecker]: L607 has no Hoare annotation [2020-07-11 01:02:45,022 WARN L170 areAnnotationChecker]: L606-1 has no Hoare annotation [2020-07-11 01:02:45,022 WARN L170 areAnnotationChecker]: L606-1 has no Hoare annotation [2020-07-11 01:02:45,022 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2020-07-11 01:02:45,022 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2020-07-11 01:02:45,022 WARN L170 areAnnotationChecker]: L609 has no Hoare annotation [2020-07-11 01:02:45,022 WARN L170 areAnnotationChecker]: L605-5 has no Hoare annotation [2020-07-11 01:02:45,023 WARN L170 areAnnotationChecker]: L612 has no Hoare annotation [2020-07-11 01:02:45,023 WARN L170 areAnnotationChecker]: L612 has no Hoare annotation [2020-07-11 01:02:45,023 WARN L170 areAnnotationChecker]: L613 has no Hoare annotation [2020-07-11 01:02:45,023 WARN L170 areAnnotationChecker]: L613 has no Hoare annotation [2020-07-11 01:02:45,023 WARN L170 areAnnotationChecker]: L614 has no Hoare annotation [2020-07-11 01:02:45,023 WARN L170 areAnnotationChecker]: inspect_beforeEXIT has no Hoare annotation [2020-07-11 01:02:45,023 WARN L170 areAnnotationChecker]: L622 has no Hoare annotation [2020-07-11 01:02:45,023 WARN L170 areAnnotationChecker]: inspect_afterEXIT has no Hoare annotation [2020-07-11 01:02:45,023 WARN L170 areAnnotationChecker]: L623 has no Hoare annotation [2020-07-11 01:02:45,023 WARN L170 areAnnotationChecker]: L623 has no Hoare annotation [2020-07-11 01:02:45,023 WARN L170 areAnnotationChecker]: L573-4 has no Hoare annotation [2020-07-11 01:02:45,024 WARN L170 areAnnotationChecker]: L568 has no Hoare annotation [2020-07-11 01:02:45,024 WARN L170 areAnnotationChecker]: seq_sort_coreEXIT has no Hoare annotation [2020-07-11 01:02:45,024 WARN L170 areAnnotationChecker]: L588-2 has no Hoare annotation [2020-07-11 01:02:45,024 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-11 01:02:45,024 WARN L170 areAnnotationChecker]: L644-5 has no Hoare annotation [2020-07-11 01:02:45,024 WARN L170 areAnnotationChecker]: L644-5 has no Hoare annotation [2020-07-11 01:02:45,024 WARN L170 areAnnotationChecker]: L644 has no Hoare annotation [2020-07-11 01:02:45,024 WARN L170 areAnnotationChecker]: L644 has no Hoare annotation [2020-07-11 01:02:45,024 WARN L170 areAnnotationChecker]: L629-1 has no Hoare annotation [2020-07-11 01:02:45,024 WARN L170 areAnnotationChecker]: L619-2 has no Hoare annotation [2020-07-11 01:02:45,025 WARN L170 areAnnotationChecker]: L619-2 has no Hoare annotation [2020-07-11 01:02:45,025 WARN L170 areAnnotationChecker]: L620-1 has no Hoare annotation [2020-07-11 01:02:45,025 WARN L170 areAnnotationChecker]: L620-4 has no Hoare annotation [2020-07-11 01:02:45,025 WARN L170 areAnnotationChecker]: L607-1 has no Hoare annotation [2020-07-11 01:02:45,025 WARN L170 areAnnotationChecker]: L607-4 has no Hoare annotation [2020-07-11 01:02:45,025 WARN L170 areAnnotationChecker]: L608-1 has no Hoare annotation [2020-07-11 01:02:45,025 WARN L170 areAnnotationChecker]: L608-4 has no Hoare annotation [2020-07-11 01:02:45,025 WARN L170 areAnnotationChecker]: L609-1 has no Hoare annotation [2020-07-11 01:02:45,025 WARN L170 areAnnotationChecker]: L609-1 has no Hoare annotation [2020-07-11 01:02:45,025 WARN L170 areAnnotationChecker]: L605-6 has no Hoare annotation [2020-07-11 01:02:45,026 WARN L170 areAnnotationChecker]: L612-1 has no Hoare annotation [2020-07-11 01:02:45,026 WARN L170 areAnnotationChecker]: L612-4 has no Hoare annotation [2020-07-11 01:02:45,026 WARN L170 areAnnotationChecker]: L613-1 has no Hoare annotation [2020-07-11 01:02:45,026 WARN L170 areAnnotationChecker]: L613-4 has no Hoare annotation [2020-07-11 01:02:45,026 WARN L170 areAnnotationChecker]: L614-1 has no Hoare annotation [2020-07-11 01:02:45,026 WARN L170 areAnnotationChecker]: L614-1 has no Hoare annotation [2020-07-11 01:02:45,026 WARN L170 areAnnotationChecker]: L622-1 has no Hoare annotation [2020-07-11 01:02:45,026 WARN L170 areAnnotationChecker]: L646 has no Hoare annotation [2020-07-11 01:02:45,026 WARN L170 areAnnotationChecker]: L623-1 has no Hoare annotation [2020-07-11 01:02:45,026 WARN L170 areAnnotationChecker]: L623-4 has no Hoare annotation [2020-07-11 01:02:45,027 WARN L170 areAnnotationChecker]: L581-1 has no Hoare annotation [2020-07-11 01:02:45,027 WARN L170 areAnnotationChecker]: L581-1 has no Hoare annotation [2020-07-11 01:02:45,027 WARN L170 areAnnotationChecker]: L568-1 has no Hoare annotation [2020-07-11 01:02:45,027 WARN L170 areAnnotationChecker]: L645-1 has no Hoare annotation [2020-07-11 01:02:45,027 WARN L170 areAnnotationChecker]: L589 has no Hoare annotation [2020-07-11 01:02:45,027 WARN L170 areAnnotationChecker]: L589 has no Hoare annotation [2020-07-11 01:02:45,027 WARN L170 areAnnotationChecker]: L644-1 has no Hoare annotation [2020-07-11 01:02:45,027 WARN L170 areAnnotationChecker]: L644-3 has no Hoare annotation [2020-07-11 01:02:45,027 WARN L170 areAnnotationChecker]: L630 has no Hoare annotation [2020-07-11 01:02:45,027 WARN L170 areAnnotationChecker]: L630 has no Hoare annotation [2020-07-11 01:02:45,028 WARN L170 areAnnotationChecker]: L620-2 has no Hoare annotation [2020-07-11 01:02:45,028 WARN L170 areAnnotationChecker]: L620-2 has no Hoare annotation [2020-07-11 01:02:45,028 WARN L170 areAnnotationChecker]: L607-2 has no Hoare annotation [2020-07-11 01:02:45,028 WARN L170 areAnnotationChecker]: L607-2 has no Hoare annotation [2020-07-11 01:02:45,028 WARN L170 areAnnotationChecker]: L608-2 has no Hoare annotation [2020-07-11 01:02:45,028 WARN L170 areAnnotationChecker]: L608-2 has no Hoare annotation [2020-07-11 01:02:45,028 WARN L170 areAnnotationChecker]: L609-2 has no Hoare annotation [2020-07-11 01:02:45,028 WARN L170 areAnnotationChecker]: L609-6 has no Hoare annotation [2020-07-11 01:02:45,028 WARN L170 areAnnotationChecker]: L612-2 has no Hoare annotation [2020-07-11 01:02:45,029 WARN L170 areAnnotationChecker]: L612-2 has no Hoare annotation [2020-07-11 01:02:45,029 WARN L170 areAnnotationChecker]: L613-2 has no Hoare annotation [2020-07-11 01:02:45,029 WARN L170 areAnnotationChecker]: L613-2 has no Hoare annotation [2020-07-11 01:02:45,029 WARN L170 areAnnotationChecker]: L614-2 has no Hoare annotation [2020-07-11 01:02:45,029 WARN L170 areAnnotationChecker]: L614-6 has no Hoare annotation [2020-07-11 01:02:45,029 WARN L170 areAnnotationChecker]: L622-2 has no Hoare annotation [2020-07-11 01:02:45,029 WARN L170 areAnnotationChecker]: L647 has no Hoare annotation [2020-07-11 01:02:45,029 WARN L170 areAnnotationChecker]: L623-2 has no Hoare annotation [2020-07-11 01:02:45,029 WARN L170 areAnnotationChecker]: L623-2 has no Hoare annotation [2020-07-11 01:02:45,030 WARN L170 areAnnotationChecker]: L577-13 has no Hoare annotation [2020-07-11 01:02:45,030 WARN L170 areAnnotationChecker]: L577 has no Hoare annotation [2020-07-11 01:02:45,030 WARN L170 areAnnotationChecker]: L568-2 has no Hoare annotation [2020-07-11 01:02:45,030 WARN L170 areAnnotationChecker]: L645-2 has no Hoare annotation [2020-07-11 01:02:45,030 WARN L170 areAnnotationChecker]: L590 has no Hoare annotation [2020-07-11 01:02:45,030 WARN L170 areAnnotationChecker]: L594 has no Hoare annotation [2020-07-11 01:02:45,030 WARN L170 areAnnotationChecker]: L645 has no Hoare annotation [2020-07-11 01:02:45,030 WARN L170 areAnnotationChecker]: L645 has no Hoare annotation [2020-07-11 01:02:45,030 WARN L170 areAnnotationChecker]: L631 has no Hoare annotation [2020-07-11 01:02:45,030 WARN L170 areAnnotationChecker]: L630-2 has no Hoare annotation [2020-07-11 01:02:45,031 WARN L170 areAnnotationChecker]: L609-3 has no Hoare annotation [2020-07-11 01:02:45,031 WARN L170 areAnnotationChecker]: L609-7 has no Hoare annotation [2020-07-11 01:02:45,031 WARN L170 areAnnotationChecker]: L614-3 has no Hoare annotation [2020-07-11 01:02:45,031 WARN L170 areAnnotationChecker]: L614-7 has no Hoare annotation [2020-07-11 01:02:45,031 WARN L170 areAnnotationChecker]: L622-11 has no Hoare annotation [2020-07-11 01:02:45,031 WARN L170 areAnnotationChecker]: L622-11 has no Hoare annotation [2020-07-11 01:02:45,031 WARN L170 areAnnotationChecker]: L647-1 has no Hoare annotation [2020-07-11 01:02:45,031 WARN L170 areAnnotationChecker]: L573-6 has no Hoare annotation [2020-07-11 01:02:45,031 WARN L170 areAnnotationChecker]: L577-1 has no Hoare annotation [2020-07-11 01:02:45,031 WARN L170 areAnnotationChecker]: L577-1 has no Hoare annotation [2020-07-11 01:02:45,032 WARN L170 areAnnotationChecker]: L569 has no Hoare annotation [2020-07-11 01:02:45,032 WARN L170 areAnnotationChecker]: L590-1 has no Hoare annotation [2020-07-11 01:02:45,032 WARN L170 areAnnotationChecker]: L594-1 has no Hoare annotation [2020-07-11 01:02:45,032 WARN L170 areAnnotationChecker]: L632 has no Hoare annotation [2020-07-11 01:02:45,032 WARN L170 areAnnotationChecker]: L609-4 has no Hoare annotation [2020-07-11 01:02:45,032 WARN L170 areAnnotationChecker]: L609-4 has no Hoare annotation [2020-07-11 01:02:45,032 WARN L170 areAnnotationChecker]: L614-4 has no Hoare annotation [2020-07-11 01:02:45,033 WARN L170 areAnnotationChecker]: L614-4 has no Hoare annotation [2020-07-11 01:02:45,033 WARN L170 areAnnotationChecker]: L622-4 has no Hoare annotation [2020-07-11 01:02:45,034 WARN L170 areAnnotationChecker]: L622-4 has no Hoare annotation [2020-07-11 01:02:45,034 WARN L170 areAnnotationChecker]: L648 has no Hoare annotation [2020-07-11 01:02:45,034 WARN L170 areAnnotationChecker]: L573-7 has no Hoare annotation [2020-07-11 01:02:45,035 WARN L170 areAnnotationChecker]: L577-5 has no Hoare annotation [2020-07-11 01:02:45,035 WARN L170 areAnnotationChecker]: L577-5 has no Hoare annotation [2020-07-11 01:02:45,035 WARN L170 areAnnotationChecker]: L577-3 has no Hoare annotation [2020-07-11 01:02:45,035 WARN L170 areAnnotationChecker]: L569-1 has no Hoare annotation [2020-07-11 01:02:45,035 WARN L170 areAnnotationChecker]: L594-2 has no Hoare annotation [2020-07-11 01:02:45,035 WARN L170 areAnnotationChecker]: L594-2 has no Hoare annotation [2020-07-11 01:02:45,035 WARN L170 areAnnotationChecker]: L633 has no Hoare annotation [2020-07-11 01:02:45,035 WARN L170 areAnnotationChecker]: L622-5 has no Hoare annotation [2020-07-11 01:02:45,035 WARN L170 areAnnotationChecker]: L622-7 has no Hoare annotation [2020-07-11 01:02:45,035 WARN L170 areAnnotationChecker]: L649-1 has no Hoare annotation [2020-07-11 01:02:45,036 WARN L170 areAnnotationChecker]: L649-1 has no Hoare annotation [2020-07-11 01:02:45,036 WARN L170 areAnnotationChecker]: L649-1 has no Hoare annotation [2020-07-11 01:02:45,036 WARN L170 areAnnotationChecker]: L573-8 has no Hoare annotation [2020-07-11 01:02:45,036 WARN L170 areAnnotationChecker]: L577-6 has no Hoare annotation [2020-07-11 01:02:45,036 WARN L170 areAnnotationChecker]: L577-10 has no Hoare annotation [2020-07-11 01:02:45,036 WARN L170 areAnnotationChecker]: L577-4 has no Hoare annotation [2020-07-11 01:02:45,036 WARN L170 areAnnotationChecker]: L570 has no Hoare annotation [2020-07-11 01:02:45,036 WARN L170 areAnnotationChecker]: L594-3 has no Hoare annotation [2020-07-11 01:02:45,036 WARN L170 areAnnotationChecker]: L633-1 has no Hoare annotation [2020-07-11 01:02:45,036 WARN L170 areAnnotationChecker]: L622-8 has no Hoare annotation [2020-07-11 01:02:45,036 WARN L170 areAnnotationChecker]: L649-2 has no Hoare annotation [2020-07-11 01:02:45,037 WARN L170 areAnnotationChecker]: L650 has no Hoare annotation [2020-07-11 01:02:45,037 WARN L170 areAnnotationChecker]: L573-9 has no Hoare annotation [2020-07-11 01:02:45,037 WARN L170 areAnnotationChecker]: L577-7 has no Hoare annotation [2020-07-11 01:02:45,037 WARN L170 areAnnotationChecker]: L577-11 has no Hoare annotation [2020-07-11 01:02:45,037 WARN L170 areAnnotationChecker]: L570-1 has no Hoare annotation [2020-07-11 01:02:45,037 WARN L170 areAnnotationChecker]: L594-4 has no Hoare annotation [2020-07-11 01:02:45,037 WARN L170 areAnnotationChecker]: L634 has no Hoare annotation [2020-07-11 01:02:45,037 WARN L170 areAnnotationChecker]: L622-9 has no Hoare annotation [2020-07-11 01:02:45,037 WARN L170 areAnnotationChecker]: L650-1 has no Hoare annotation [2020-07-11 01:02:45,037 WARN L170 areAnnotationChecker]: L573-10 has no Hoare annotation [2020-07-11 01:02:45,037 WARN L170 areAnnotationChecker]: L577-8 has no Hoare annotation [2020-07-11 01:02:45,038 WARN L170 areAnnotationChecker]: L577-12 has no Hoare annotation [2020-07-11 01:02:45,038 WARN L170 areAnnotationChecker]: L571 has no Hoare annotation [2020-07-11 01:02:45,038 WARN L170 areAnnotationChecker]: L595 has no Hoare annotation [2020-07-11 01:02:45,038 WARN L170 areAnnotationChecker]: L634-1 has no Hoare annotation [2020-07-11 01:02:45,038 WARN L170 areAnnotationChecker]: L622-10 has no Hoare annotation [2020-07-11 01:02:45,038 WARN L170 areAnnotationChecker]: L650-2 has no Hoare annotation [2020-07-11 01:02:45,038 WARN L170 areAnnotationChecker]: merge_pairFINAL has no Hoare annotation [2020-07-11 01:02:45,038 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2020-07-11 01:02:45,038 WARN L170 areAnnotationChecker]: merge_single_nodeFINAL has no Hoare annotation [2020-07-11 01:02:45,039 WARN L170 areAnnotationChecker]: L595-1 has no Hoare annotation [2020-07-11 01:02:45,039 WARN L170 areAnnotationChecker]: L635 has no Hoare annotation [2020-07-11 01:02:45,039 WARN L170 areAnnotationChecker]: L635 has no Hoare annotation [2020-07-11 01:02:45,039 WARN L170 areAnnotationChecker]: L651 has no Hoare annotation [2020-07-11 01:02:45,039 WARN L170 areAnnotationChecker]: merge_pairEXIT has no Hoare annotation [2020-07-11 01:02:45,039 WARN L170 areAnnotationChecker]: L578-1 has no Hoare annotation [2020-07-11 01:02:45,039 WARN L170 areAnnotationChecker]: merge_single_nodeEXIT has no Hoare annotation [2020-07-11 01:02:45,039 WARN L170 areAnnotationChecker]: merge_single_nodeEXIT has no Hoare annotation [2020-07-11 01:02:45,039 WARN L170 areAnnotationChecker]: L597 has no Hoare annotation [2020-07-11 01:02:45,039 WARN L170 areAnnotationChecker]: L636 has no Hoare annotation [2020-07-11 01:02:45,040 WARN L170 areAnnotationChecker]: L635-2 has no Hoare annotation [2020-07-11 01:02:45,040 WARN L170 areAnnotationChecker]: L651-1 has no Hoare annotation [2020-07-11 01:02:45,040 WARN L170 areAnnotationChecker]: L578-2 has no Hoare annotation [2020-07-11 01:02:45,040 WARN L170 areAnnotationChecker]: L578-2 has no Hoare annotation [2020-07-11 01:02:45,040 WARN L170 areAnnotationChecker]: L597-1 has no Hoare annotation [2020-07-11 01:02:45,040 WARN L170 areAnnotationChecker]: L637 has no Hoare annotation [2020-07-11 01:02:45,040 WARN L170 areAnnotationChecker]: L578-14 has no Hoare annotation [2020-07-11 01:02:45,040 WARN L170 areAnnotationChecker]: L578-14 has no Hoare annotation [2020-07-11 01:02:45,040 WARN L170 areAnnotationChecker]: L578-4 has no Hoare annotation [2020-07-11 01:02:45,040 WARN L170 areAnnotationChecker]: L597-2 has no Hoare annotation [2020-07-11 01:02:45,040 WARN L170 areAnnotationChecker]: L638 has no Hoare annotation [2020-07-11 01:02:45,041 WARN L170 areAnnotationChecker]: L578-15 has no Hoare annotation [2020-07-11 01:02:45,041 WARN L170 areAnnotationChecker]: L578-23 has no Hoare annotation [2020-07-11 01:02:45,041 WARN L170 areAnnotationChecker]: L578-5 has no Hoare annotation [2020-07-11 01:02:45,041 WARN L170 areAnnotationChecker]: L598 has no Hoare annotation [2020-07-11 01:02:45,041 WARN L170 areAnnotationChecker]: L578-16 has no Hoare annotation [2020-07-11 01:02:45,041 WARN L170 areAnnotationChecker]: L578-24 has no Hoare annotation [2020-07-11 01:02:45,041 WARN L170 areAnnotationChecker]: L578-6 has no Hoare annotation [2020-07-11 01:02:45,041 WARN L170 areAnnotationChecker]: L578-6 has no Hoare annotation [2020-07-11 01:02:45,041 WARN L170 areAnnotationChecker]: L578-17 has no Hoare annotation [2020-07-11 01:02:45,041 WARN L170 areAnnotationChecker]: L578-25 has no Hoare annotation [2020-07-11 01:02:45,042 WARN L170 areAnnotationChecker]: L578-7 has no Hoare annotation [2020-07-11 01:02:45,042 WARN L170 areAnnotationChecker]: L578-13 has no Hoare annotation [2020-07-11 01:02:45,042 WARN L170 areAnnotationChecker]: L578-18 has no Hoare annotation [2020-07-11 01:02:45,042 WARN L170 areAnnotationChecker]: L578-26 has no Hoare annotation [2020-07-11 01:02:45,042 WARN L170 areAnnotationChecker]: L578-8 has no Hoare annotation [2020-07-11 01:02:45,042 WARN L170 areAnnotationChecker]: L578-19 has no Hoare annotation [2020-07-11 01:02:45,042 WARN L170 areAnnotationChecker]: L578-27 has no Hoare annotation [2020-07-11 01:02:45,042 WARN L170 areAnnotationChecker]: L578-9 has no Hoare annotation [2020-07-11 01:02:45,042 WARN L170 areAnnotationChecker]: L578-20 has no Hoare annotation [2020-07-11 01:02:45,042 WARN L170 areAnnotationChecker]: L578-28 has no Hoare annotation [2020-07-11 01:02:45,043 WARN L170 areAnnotationChecker]: L578-10 has no Hoare annotation [2020-07-11 01:02:45,043 WARN L170 areAnnotationChecker]: L578-21 has no Hoare annotation [2020-07-11 01:02:45,043 WARN L170 areAnnotationChecker]: L578-29 has no Hoare annotation [2020-07-11 01:02:45,043 WARN L170 areAnnotationChecker]: L578-11 has no Hoare annotation [2020-07-11 01:02:45,043 WARN L170 areAnnotationChecker]: L578-22 has no Hoare annotation [2020-07-11 01:02:45,043 WARN L170 areAnnotationChecker]: L578-30 has no Hoare annotation [2020-07-11 01:02:45,043 WARN L170 areAnnotationChecker]: L579 has no Hoare annotation [2020-07-11 01:02:45,043 WARN L170 areAnnotationChecker]: L579 has no Hoare annotation [2020-07-11 01:02:45,043 WARN L170 areAnnotationChecker]: L581 has no Hoare annotation [2020-07-11 01:02:45,044 WARN L170 areAnnotationChecker]: L581 has no Hoare annotation [2020-07-11 01:02:45,044 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-11 01:02:45,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.07 01:02:45 BoogieIcfgContainer [2020-07-11 01:02:45,050 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-11 01:02:45,053 INFO L168 Benchmark]: Toolchain (without parser) took 31994.85 ms. Allocated memory was 144.2 MB in the beginning and 554.2 MB in the end (delta: 410.0 MB). Free memory was 100.7 MB in the beginning and 402.9 MB in the end (delta: -302.3 MB). Peak memory consumption was 107.7 MB. Max. memory is 7.1 GB. [2020-07-11 01:02:45,054 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 144.2 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-11 01:02:45,055 INFO L168 Benchmark]: CACSL2BoogieTranslator took 719.28 ms. Allocated memory was 144.2 MB in the beginning and 202.9 MB in the end (delta: 58.7 MB). Free memory was 100.5 MB in the beginning and 166.1 MB in the end (delta: -65.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. [2020-07-11 01:02:45,056 INFO L168 Benchmark]: Boogie Preprocessor took 107.82 ms. Allocated memory is still 202.9 MB. Free memory was 166.1 MB in the beginning and 160.8 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 7.1 GB. [2020-07-11 01:02:45,057 INFO L168 Benchmark]: RCFGBuilder took 1234.96 ms. Allocated memory was 202.9 MB in the beginning and 235.4 MB in the end (delta: 32.5 MB). Free memory was 160.8 MB in the beginning and 156.3 MB in the end (delta: 4.5 MB). Peak memory consumption was 77.8 MB. Max. memory is 7.1 GB. [2020-07-11 01:02:45,057 INFO L168 Benchmark]: TraceAbstraction took 29926.62 ms. Allocated memory was 235.4 MB in the beginning and 554.2 MB in the end (delta: 318.8 MB). Free memory was 156.3 MB in the beginning and 402.9 MB in the end (delta: -246.7 MB). Peak memory consumption was 72.1 MB. Max. memory is 7.1 GB. [2020-07-11 01:02:45,061 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 144.2 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 719.28 ms. Allocated memory was 144.2 MB in the beginning and 202.9 MB in the end (delta: 58.7 MB). Free memory was 100.5 MB in the beginning and 166.1 MB in the end (delta: -65.6 MB). Peak memory consumption was 23.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 107.82 ms. Allocated memory is still 202.9 MB. Free memory was 166.1 MB in the beginning and 160.8 MB in the end (delta: 5.3 MB). Peak memory consumption was 5.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1234.96 ms. Allocated memory was 202.9 MB in the beginning and 235.4 MB in the end (delta: 32.5 MB). Free memory was 160.8 MB in the beginning and 156.3 MB in the end (delta: 4.5 MB). Peak memory consumption was 77.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29926.62 ms. Allocated memory was 235.4 MB in the beginning and 554.2 MB in the end (delta: 318.8 MB). Free memory was 156.3 MB in the beginning and 402.9 MB in the end (delta: -246.7 MB). Peak memory consumption was 72.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 554]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L627] struct list *data = ((void *)0); VAL [data={0:0}] [L628] COND TRUE __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=1, data={0:0}] [L629] struct node *node = malloc(sizeof *node); VAL [data={0:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L630] COND FALSE !(!node) VAL [data={0:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L632] node->next = node VAL [data={0:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L633] node->value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=2, data={0:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L634] struct list *item = malloc(sizeof *item); VAL [data={0:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L635] COND FALSE !(!item) VAL [data={0:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L637] item->slist = node VAL [data={0:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L638] item->next = data VAL [data={0:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L639] data = item VAL [data={-2:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L628] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, data={-2:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L641] COND FALSE !(!data) VAL [data={-2:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L643] CALL inspect_before(data) VAL [shape={-2:0}] [L604] COND FALSE !(!(shape)) VAL [shape={-2:0}, shape={-2:0}] [L605] shape->next VAL [shape={-2:0}, shape={-2:0}, shape->next={0:0}] [L605] COND FALSE !(shape->next) VAL [shape={-2:0}, shape={-2:0}, shape->next={0:0}] [L611] COND FALSE !(!(shape)) VAL [shape={-2:0}, shape={-2:0}] [L612] EXPR shape->next VAL [shape={-2:0}, shape={-2:0}, shape->next={0:0}] [L612] COND FALSE !(!(shape->next == ((void *)0))) VAL [shape={-2:0}, shape={-2:0}, shape->next={0:0}] [L613] EXPR shape->slist VAL [shape={-2:0}, shape={-2:0}, shape->slist={-1:0}] [L613] COND FALSE !(!(shape->slist)) VAL [shape={-2:0}, shape={-2:0}, shape->slist={-1:0}] [L614] EXPR shape->slist VAL [shape={-2:0}, shape={-2:0}, shape->slist={-1:0}] [L614] EXPR shape->slist->next VAL [shape={-2:0}, shape={-2:0}, shape->slist={-1:0}, shape->slist->next={-1:0}] [L614] COND TRUE !(shape->slist->next == ((void *)0)) VAL [shape={-2:0}, shape={-2:0}, shape->slist={-1:0}, shape->slist->next={-1:0}] [L614] CALL fail() [L554] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 258 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 29.7s, OverallIterations: 8, TraceHistogramMax: 2, AutomataDifference: 22.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1648 SDtfs, 1772 SDslu, 2635 SDs, 0 SdLazy, 4336 SolverSat, 220 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 84 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=248occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 280 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 293 NumberOfCodeBlocks, 293 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 234 ConstructedInterpolants, 0 QuantifiedInterpolants, 36382 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 10/10 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...