/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/forester-heap/dll-token-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 22:24:26,642 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 22:24:26,644 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 22:24:26,657 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 22:24:26,657 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 22:24:26,658 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 22:24:26,659 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 22:24:26,661 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 22:24:26,663 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 22:24:26,664 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 22:24:26,665 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 22:24:26,666 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 22:24:26,667 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 22:24:26,668 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 22:24:26,669 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 22:24:26,670 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 22:24:26,671 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 22:24:26,672 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 22:24:26,674 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 22:24:26,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 22:24:26,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 22:24:26,679 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 22:24:26,680 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 22:24:26,681 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 22:24:26,683 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 22:24:26,683 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 22:24:26,683 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 22:24:26,684 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 22:24:26,685 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 22:24:26,686 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 22:24:26,686 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 22:24:26,687 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 22:24:26,687 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 22:24:26,688 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 22:24:26,689 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 22:24:26,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 22:24:26,690 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 22:24:26,690 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 22:24:26,691 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 22:24:26,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 22:24:26,692 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 22:24:26,693 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 22:24:26,702 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 22:24:26,703 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 22:24:26,707 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 22:24:26,707 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 22:24:26,708 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 22:24:26,708 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 22:24:26,708 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 22:24:26,708 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 22:24:26,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 22:24:26,709 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 22:24:26,709 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 22:24:26,709 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 22:24:26,710 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 22:24:26,710 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 22:24:26,710 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 22:24:26,711 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 22:24:26,711 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 22:24:26,711 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 22:24:26,711 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 22:24:26,711 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 22:24:26,712 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 22:24:26,712 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 22:24:26,712 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-08 22:24:27,018 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 22:24:27,031 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 22:24:27,035 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 22:24:27,037 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 22:24:27,037 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 22:24:27,038 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-token-2.i [2020-07-08 22:24:27,112 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c2b61f4e/fc0916ed19bb4056b32fca2db7547c5b/FLAG4c4e5712f [2020-07-08 22:24:27,674 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 22:24:27,674 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-token-2.i [2020-07-08 22:24:27,687 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c2b61f4e/fc0916ed19bb4056b32fca2db7547c5b/FLAG4c4e5712f [2020-07-08 22:24:28,013 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c2b61f4e/fc0916ed19bb4056b32fca2db7547c5b [2020-07-08 22:24:28,021 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 22:24:28,023 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 22:24:28,024 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 22:24:28,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 22:24:28,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 22:24:28,030 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 10:24:28" (1/1) ... [2020-07-08 22:24:28,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a1a3246 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:24:28, skipping insertion in model container [2020-07-08 22:24:28,035 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 10:24:28" (1/1) ... [2020-07-08 22:24:28,043 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 22:24:28,105 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 22:24:28,591 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 22:24:28,602 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 22:24:28,649 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 22:24:28,734 INFO L208 MainTranslator]: Completed translation [2020-07-08 22:24:28,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:24:28 WrapperNode [2020-07-08 22:24:28,735 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 22:24:28,735 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 22:24:28,735 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 22:24:28,736 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 22:24:28,747 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:24:28" (1/1) ... [2020-07-08 22:24:28,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:24:28" (1/1) ... [2020-07-08 22:24:28,763 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:24:28" (1/1) ... [2020-07-08 22:24:28,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:24:28" (1/1) ... [2020-07-08 22:24:28,788 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:24:28" (1/1) ... [2020-07-08 22:24:28,797 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:24:28" (1/1) ... [2020-07-08 22:24:28,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:24:28" (1/1) ... [2020-07-08 22:24:28,808 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 22:24:28,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 22:24:28,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 22:24:28,809 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 22:24:28,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:24:28" (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-08 22:24:28,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 22:24:28,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 22:24:28,874 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 22:24:28,874 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-08 22:24:28,875 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-08 22:24:28,875 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-08 22:24:28,875 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-08 22:24:28,875 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-08 22:24:28,875 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-08 22:24:28,876 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-08 22:24:28,876 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-08 22:24:28,876 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-08 22:24:28,876 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-08 22:24:28,876 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-08 22:24:28,876 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-08 22:24:28,877 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-08 22:24:28,877 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-08 22:24:28,877 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-08 22:24:28,877 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-08 22:24:28,877 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-08 22:24:28,877 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-08 22:24:28,878 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-08 22:24:28,880 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-08 22:24:28,880 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-08 22:24:28,880 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-08 22:24:28,881 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-08 22:24:28,881 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-08 22:24:28,881 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-08 22:24:28,882 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-08 22:24:28,882 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-08 22:24:28,882 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-08 22:24:28,882 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-08 22:24:28,884 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-08 22:24:28,884 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-08 22:24:28,884 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-08 22:24:28,884 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-08 22:24:28,884 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-08 22:24:28,885 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-08 22:24:28,885 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-08 22:24:28,885 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-08 22:24:28,885 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-08 22:24:28,885 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-08 22:24:28,886 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-08 22:24:28,886 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-08 22:24:28,886 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-08 22:24:28,886 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-08 22:24:28,887 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-08 22:24:28,887 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-08 22:24:28,887 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-08 22:24:28,887 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-08 22:24:28,887 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-08 22:24:28,887 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-08 22:24:28,888 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-08 22:24:28,888 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 22:24:28,888 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-08 22:24:28,888 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-08 22:24:28,888 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-08 22:24:28,888 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-08 22:24:28,888 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-08 22:24:28,889 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-08 22:24:28,889 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-08 22:24:28,889 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-08 22:24:28,889 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 22:24:28,889 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-08 22:24:28,889 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-08 22:24:28,889 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-08 22:24:28,890 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-08 22:24:28,890 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-08 22:24:28,890 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-08 22:24:28,890 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-08 22:24:28,890 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-08 22:24:28,891 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-08 22:24:28,891 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-08 22:24:28,891 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-08 22:24:28,892 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-08 22:24:28,892 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-08 22:24:28,892 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-08 22:24:28,893 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-08 22:24:28,893 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-08 22:24:28,893 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-08 22:24:28,894 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-08 22:24:28,894 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-08 22:24:28,894 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-08 22:24:28,894 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-08 22:24:28,895 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-08 22:24:28,895 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-08 22:24:28,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-08 22:24:28,897 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-08 22:24:28,897 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-08 22:24:28,897 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-08 22:24:28,897 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-08 22:24:28,897 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-08 22:24:28,898 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-08 22:24:28,898 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-08 22:24:28,898 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-08 22:24:28,899 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-08 22:24:28,899 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-08 22:24:28,899 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-08 22:24:28,899 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-08 22:24:28,899 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-08 22:24:28,899 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-08 22:24:28,899 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-08 22:24:28,900 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-08 22:24:28,900 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-08 22:24:28,900 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-08 22:24:28,900 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-08 22:24:28,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 22:24:28,900 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 22:24:28,900 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 22:24:28,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 22:24:28,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-08 22:24:28,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 22:24:28,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-08 22:24:28,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 22:24:28,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 22:24:28,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 22:24:28,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 22:24:29,684 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 22:24:29,685 INFO L295 CfgBuilder]: Removed 15 assume(true) statements. [2020-07-08 22:24:29,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 10:24:29 BoogieIcfgContainer [2020-07-08 22:24:29,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 22:24:29,696 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 22:24:29,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 22:24:29,699 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 22:24:29,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 10:24:28" (1/3) ... [2020-07-08 22:24:29,701 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db651ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 10:24:29, skipping insertion in model container [2020-07-08 22:24:29,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 10:24:28" (2/3) ... [2020-07-08 22:24:29,703 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4db651ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 10:24:29, skipping insertion in model container [2020-07-08 22:24:29,704 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 10:24:29" (3/3) ... [2020-07-08 22:24:29,707 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-token-2.i [2020-07-08 22:24:29,718 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 22:24:29,727 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 6 error locations. [2020-07-08 22:24:29,742 INFO L251 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-07-08 22:24:29,762 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 22:24:29,763 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 22:24:29,763 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-07-08 22:24:29,763 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 22:24:29,763 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 22:24:29,764 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 22:24:29,764 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 22:24:29,764 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 22:24:29,780 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states. [2020-07-08 22:24:29,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-08 22:24:29,791 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:24:29,792 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:24:29,792 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:24:29,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:24:29,798 INFO L82 PathProgramCache]: Analyzing trace with hash 536950687, now seen corresponding path program 1 times [2020-07-08 22:24:29,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:24:29,806 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1177514891] [2020-07-08 22:24:29,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:24:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:24:30,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:24:30,077 INFO L280 TraceCheckUtils]: 0: Hoare triple {111#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {104#true} is VALID [2020-07-08 22:24:30,078 INFO L280 TraceCheckUtils]: 1: Hoare triple {104#true} #valid := #valid[0 := 0]; {104#true} is VALID [2020-07-08 22:24:30,079 INFO L280 TraceCheckUtils]: 2: Hoare triple {104#true} assume 0 < #StackHeapBarrier; {104#true} is VALID [2020-07-08 22:24:30,079 INFO L280 TraceCheckUtils]: 3: Hoare triple {104#true} assume true; {104#true} is VALID [2020-07-08 22:24:30,080 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {104#true} {104#true} #213#return; {104#true} is VALID [2020-07-08 22:24:30,083 INFO L263 TraceCheckUtils]: 0: Hoare triple {104#true} call ULTIMATE.init(); {111#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 22:24:30,084 INFO L280 TraceCheckUtils]: 1: Hoare triple {111#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {104#true} is VALID [2020-07-08 22:24:30,084 INFO L280 TraceCheckUtils]: 2: Hoare triple {104#true} #valid := #valid[0 := 0]; {104#true} is VALID [2020-07-08 22:24:30,084 INFO L280 TraceCheckUtils]: 3: Hoare triple {104#true} assume 0 < #StackHeapBarrier; {104#true} is VALID [2020-07-08 22:24:30,085 INFO L280 TraceCheckUtils]: 4: Hoare triple {104#true} assume true; {104#true} is VALID [2020-07-08 22:24:30,085 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {104#true} {104#true} #213#return; {104#true} is VALID [2020-07-08 22:24:30,085 INFO L263 TraceCheckUtils]: 6: Hoare triple {104#true} call #t~ret18 := main(); {104#true} is VALID [2020-07-08 22:24:30,086 INFO L280 TraceCheckUtils]: 7: Hoare triple {104#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {104#true} is VALID [2020-07-08 22:24:30,086 INFO L280 TraceCheckUtils]: 8: Hoare triple {104#true} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {104#true} is VALID [2020-07-08 22:24:30,087 INFO L280 TraceCheckUtils]: 9: Hoare triple {104#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {104#true} is VALID [2020-07-08 22:24:30,087 INFO L280 TraceCheckUtils]: 10: Hoare triple {104#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {104#true} is VALID [2020-07-08 22:24:30,087 INFO L280 TraceCheckUtils]: 11: Hoare triple {104#true} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {104#true} is VALID [2020-07-08 22:24:30,088 INFO L280 TraceCheckUtils]: 12: Hoare triple {104#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {104#true} is VALID [2020-07-08 22:24:30,089 INFO L280 TraceCheckUtils]: 13: Hoare triple {104#true} assume !true; {105#false} is VALID [2020-07-08 22:24:30,089 INFO L280 TraceCheckUtils]: 14: Hoare triple {105#false} SUMMARY for call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1001-5 {105#false} is VALID [2020-07-08 22:24:30,090 INFO L280 TraceCheckUtils]: 15: Hoare triple {105#false} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(12); srcloc: L1010 {105#false} is VALID [2020-07-08 22:24:30,090 INFO L280 TraceCheckUtils]: 16: Hoare triple {105#false} SUMMARY for call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1011 {105#false} is VALID [2020-07-08 22:24:30,090 INFO L280 TraceCheckUtils]: 17: Hoare triple {105#false} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1011-1 {105#false} is VALID [2020-07-08 22:24:30,091 INFO L280 TraceCheckUtils]: 18: Hoare triple {105#false} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4); srcloc: L1012 {105#false} is VALID [2020-07-08 22:24:30,091 INFO L280 TraceCheckUtils]: 19: Hoare triple {105#false} havoc #t~mem6.base, #t~mem6.offset; {105#false} is VALID [2020-07-08 22:24:30,091 INFO L280 TraceCheckUtils]: 20: Hoare triple {105#false} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1013 {105#false} is VALID [2020-07-08 22:24:30,092 INFO L280 TraceCheckUtils]: 21: Hoare triple {105#false} SUMMARY for call write~int(2, #t~mem7.base, 8 + #t~mem7.offset, 4); srcloc: L1013-1 {105#false} is VALID [2020-07-08 22:24:30,092 INFO L280 TraceCheckUtils]: 22: Hoare triple {105#false} havoc #t~mem7.base, #t~mem7.offset; {105#false} is VALID [2020-07-08 22:24:30,092 INFO L280 TraceCheckUtils]: 23: Hoare triple {105#false} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {105#false} is VALID [2020-07-08 22:24:30,093 INFO L280 TraceCheckUtils]: 24: Hoare triple {105#false} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {105#false} is VALID [2020-07-08 22:24:30,093 INFO L280 TraceCheckUtils]: 25: Hoare triple {105#false} assume !false; {105#false} is VALID [2020-07-08 22:24:30,096 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-08 22:24:30,097 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1177514891] [2020-07-08 22:24:30,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:24:30,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 22:24:30,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695854498] [2020-07-08 22:24:30,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-08 22:24:30,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:24:30,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 22:24:30,164 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:24:30,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 22:24:30,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:24:30,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 22:24:30,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 22:24:30,177 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 3 states. [2020-07-08 22:24:30,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:24:30,622 INFO L93 Difference]: Finished difference Result 189 states and 235 transitions. [2020-07-08 22:24:30,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 22:24:30,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2020-07-08 22:24:30,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:24:30,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:24:30,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 235 transitions. [2020-07-08 22:24:30,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 22:24:30,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 235 transitions. [2020-07-08 22:24:30,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 235 transitions. [2020-07-08 22:24:30,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:24:30,988 INFO L225 Difference]: With dead ends: 189 [2020-07-08 22:24:30,989 INFO L226 Difference]: Without dead ends: 90 [2020-07-08 22:24:31,019 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-08 22:24:31,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-07-08 22:24:31,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2020-07-08 22:24:31,125 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:24:31,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 90 states. [2020-07-08 22:24:31,127 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 90 states. [2020-07-08 22:24:31,127 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 90 states. [2020-07-08 22:24:31,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:24:31,140 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2020-07-08 22:24:31,141 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2020-07-08 22:24:31,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:24:31,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:24:31,143 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 90 states. [2020-07-08 22:24:31,143 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 90 states. [2020-07-08 22:24:31,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:24:31,155 INFO L93 Difference]: Finished difference Result 90 states and 92 transitions. [2020-07-08 22:24:31,155 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2020-07-08 22:24:31,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:24:31,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:24:31,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:24:31,158 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:24:31,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-07-08 22:24:31,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2020-07-08 22:24:31,179 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 26 [2020-07-08 22:24:31,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:24:31,179 INFO L479 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2020-07-08 22:24:31,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 22:24:31,180 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 90 states and 92 transitions. [2020-07-08 22:24:31,290 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:24:31,290 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2020-07-08 22:24:31,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-08 22:24:31,292 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:24:31,292 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:24:31,292 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 22:24:31,293 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:24:31,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:24:31,294 INFO L82 PathProgramCache]: Analyzing trace with hash -692885691, now seen corresponding path program 1 times [2020-07-08 22:24:31,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:24:31,295 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1034298891] [2020-07-08 22:24:31,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:24:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:24:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:24:31,648 INFO L280 TraceCheckUtils]: 0: Hoare triple {868#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {852#true} is VALID [2020-07-08 22:24:31,649 INFO L280 TraceCheckUtils]: 1: Hoare triple {852#true} #valid := #valid[0 := 0]; {852#true} is VALID [2020-07-08 22:24:31,649 INFO L280 TraceCheckUtils]: 2: Hoare triple {852#true} assume 0 < #StackHeapBarrier; {852#true} is VALID [2020-07-08 22:24:31,649 INFO L280 TraceCheckUtils]: 3: Hoare triple {852#true} assume true; {852#true} is VALID [2020-07-08 22:24:31,649 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {852#true} {852#true} #213#return; {852#true} is VALID [2020-07-08 22:24:31,651 INFO L263 TraceCheckUtils]: 0: Hoare triple {852#true} call ULTIMATE.init(); {868#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 22:24:31,651 INFO L280 TraceCheckUtils]: 1: Hoare triple {868#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {852#true} is VALID [2020-07-08 22:24:31,652 INFO L280 TraceCheckUtils]: 2: Hoare triple {852#true} #valid := #valid[0 := 0]; {852#true} is VALID [2020-07-08 22:24:31,652 INFO L280 TraceCheckUtils]: 3: Hoare triple {852#true} assume 0 < #StackHeapBarrier; {852#true} is VALID [2020-07-08 22:24:31,652 INFO L280 TraceCheckUtils]: 4: Hoare triple {852#true} assume true; {852#true} is VALID [2020-07-08 22:24:31,653 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {852#true} {852#true} #213#return; {852#true} is VALID [2020-07-08 22:24:31,653 INFO L263 TraceCheckUtils]: 6: Hoare triple {852#true} call #t~ret18 := main(); {852#true} is VALID [2020-07-08 22:24:31,654 INFO L280 TraceCheckUtils]: 7: Hoare triple {852#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {859#(= 1 (select |#valid| |main_#t~malloc0.base|))} is VALID [2020-07-08 22:24:31,655 INFO L280 TraceCheckUtils]: 8: Hoare triple {859#(= 1 (select |#valid| |main_#t~malloc0.base|))} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {860#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-08 22:24:31,656 INFO L280 TraceCheckUtils]: 9: Hoare triple {860#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {860#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-08 22:24:31,657 INFO L280 TraceCheckUtils]: 10: Hoare triple {860#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {860#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-08 22:24:31,657 INFO L280 TraceCheckUtils]: 11: Hoare triple {860#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {860#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-08 22:24:31,659 INFO L280 TraceCheckUtils]: 12: Hoare triple {860#(= 1 (select |#valid| main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {861#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-08 22:24:31,660 INFO L280 TraceCheckUtils]: 13: Hoare triple {861#(= 1 (select |#valid| main_~x~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {861#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-08 22:24:31,664 INFO L280 TraceCheckUtils]: 14: Hoare triple {861#(= 1 (select |#valid| main_~x~0.base))} assume !!(0 != #t~nondet1); {861#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-08 22:24:31,669 INFO L280 TraceCheckUtils]: 15: Hoare triple {861#(= 1 (select |#valid| main_~x~0.base))} havoc #t~nondet1; {861#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-08 22:24:31,670 INFO L280 TraceCheckUtils]: 16: Hoare triple {861#(= 1 (select |#valid| main_~x~0.base))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); srcloc: L1004 {862#(and (not (= 0 |main_#t~malloc2.base|)) (not (= |main_#t~malloc2.base| main_~x~0.base)))} is VALID [2020-07-08 22:24:31,671 INFO L280 TraceCheckUtils]: 17: Hoare triple {862#(and (not (= 0 |main_#t~malloc2.base|)) (not (= |main_#t~malloc2.base| main_~x~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1004-1 {863#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} is VALID [2020-07-08 22:24:31,673 INFO L280 TraceCheckUtils]: 18: Hoare triple {863#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1004-2 {864#(and (not (= |main_#t~mem3.base| main_~x~0.base)) (not (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem3.base| (store (select |#memory_$Pointer$.base| |main_#t~mem3.base|) (+ |main_#t~mem3.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-08 22:24:31,674 INFO L280 TraceCheckUtils]: 19: Hoare triple {864#(and (not (= |main_#t~mem3.base| main_~x~0.base)) (not (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem3.base| (store (select |#memory_$Pointer$.base| |main_#t~mem3.base|) (+ |main_#t~mem3.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))))} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); srcloc: L1005 {865#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-08 22:24:31,683 INFO L280 TraceCheckUtils]: 20: Hoare triple {865#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} havoc #t~mem3.base, #t~mem3.offset; {865#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-08 22:24:31,685 INFO L280 TraceCheckUtils]: 21: Hoare triple {865#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1006 {866#(not (= 0 |main_#t~mem4.base|))} is VALID [2020-07-08 22:24:31,685 INFO L280 TraceCheckUtils]: 22: Hoare triple {866#(not (= 0 |main_#t~mem4.base|))} ~x~0.base, ~x~0.offset := #t~mem4.base, #t~mem4.offset; {867#(not (= 0 main_~x~0.base))} is VALID [2020-07-08 22:24:31,686 INFO L280 TraceCheckUtils]: 23: Hoare triple {867#(not (= 0 main_~x~0.base))} havoc #t~mem4.base, #t~mem4.offset; {867#(not (= 0 main_~x~0.base))} is VALID [2020-07-08 22:24:31,687 INFO L280 TraceCheckUtils]: 24: Hoare triple {867#(not (= 0 main_~x~0.base))} SUMMARY for call write~int(0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1007 {867#(not (= 0 main_~x~0.base))} is VALID [2020-07-08 22:24:31,687 INFO L280 TraceCheckUtils]: 25: Hoare triple {867#(not (= 0 main_~x~0.base))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {853#false} is VALID [2020-07-08 22:24:31,687 INFO L280 TraceCheckUtils]: 26: Hoare triple {853#false} assume !false; {853#false} is VALID [2020-07-08 22:24:31,690 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-08 22:24:31,690 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1034298891] [2020-07-08 22:24:31,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:24:31,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-08 22:24:31,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394682059] [2020-07-08 22:24:31,692 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2020-07-08 22:24:31,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:24:31,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-08 22:24:31,730 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:24:31,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-08 22:24:31,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:24:31,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-08 22:24:31,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-07-08 22:24:31,732 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand 12 states. [2020-07-08 22:24:33,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:24:33,947 INFO L93 Difference]: Finished difference Result 174 states and 179 transitions. [2020-07-08 22:24:33,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-08 22:24:33,947 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2020-07-08 22:24:33,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:24:33,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 22:24:33,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 179 transitions. [2020-07-08 22:24:33,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 22:24:33,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 179 transitions. [2020-07-08 22:24:33,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 179 transitions. [2020-07-08 22:24:34,165 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:24:34,180 INFO L225 Difference]: With dead ends: 174 [2020-07-08 22:24:34,180 INFO L226 Difference]: Without dead ends: 172 [2020-07-08 22:24:34,181 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=288, Unknown=0, NotChecked=0, Total=380 [2020-07-08 22:24:34,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2020-07-08 22:24:34,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 103. [2020-07-08 22:24:34,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:24:34,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand 103 states. [2020-07-08 22:24:34,388 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand 103 states. [2020-07-08 22:24:34,388 INFO L87 Difference]: Start difference. First operand 172 states. Second operand 103 states. [2020-07-08 22:24:34,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:24:34,398 INFO L93 Difference]: Finished difference Result 172 states and 177 transitions. [2020-07-08 22:24:34,398 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 177 transitions. [2020-07-08 22:24:34,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:24:34,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:24:34,400 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 172 states. [2020-07-08 22:24:34,400 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 172 states. [2020-07-08 22:24:34,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:24:34,412 INFO L93 Difference]: Finished difference Result 172 states and 177 transitions. [2020-07-08 22:24:34,412 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 177 transitions. [2020-07-08 22:24:34,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:24:34,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:24:34,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:24:34,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:24:34,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2020-07-08 22:24:34,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 106 transitions. [2020-07-08 22:24:34,423 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 106 transitions. Word has length 27 [2020-07-08 22:24:34,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:24:34,424 INFO L479 AbstractCegarLoop]: Abstraction has 103 states and 106 transitions. [2020-07-08 22:24:34,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-08 22:24:34,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 103 states and 106 transitions. [2020-07-08 22:24:34,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:24:34,555 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 106 transitions. [2020-07-08 22:24:34,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-08 22:24:34,556 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:24:34,557 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:24:34,557 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 22:24:34,557 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:24:34,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:24:34,558 INFO L82 PathProgramCache]: Analyzing trace with hash 2098857180, now seen corresponding path program 1 times [2020-07-08 22:24:34,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:24:34,558 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1036893724] [2020-07-08 22:24:34,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:24:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:24:34,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:24:34,660 INFO L280 TraceCheckUtils]: 0: Hoare triple {1795#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1785#true} is VALID [2020-07-08 22:24:34,661 INFO L280 TraceCheckUtils]: 1: Hoare triple {1785#true} #valid := #valid[0 := 0]; {1785#true} is VALID [2020-07-08 22:24:34,661 INFO L280 TraceCheckUtils]: 2: Hoare triple {1785#true} assume 0 < #StackHeapBarrier; {1785#true} is VALID [2020-07-08 22:24:34,661 INFO L280 TraceCheckUtils]: 3: Hoare triple {1785#true} assume true; {1785#true} is VALID [2020-07-08 22:24:34,662 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1785#true} {1785#true} #213#return; {1785#true} is VALID [2020-07-08 22:24:34,663 INFO L263 TraceCheckUtils]: 0: Hoare triple {1785#true} call ULTIMATE.init(); {1795#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 22:24:34,663 INFO L280 TraceCheckUtils]: 1: Hoare triple {1795#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1785#true} is VALID [2020-07-08 22:24:34,663 INFO L280 TraceCheckUtils]: 2: Hoare triple {1785#true} #valid := #valid[0 := 0]; {1785#true} is VALID [2020-07-08 22:24:34,663 INFO L280 TraceCheckUtils]: 3: Hoare triple {1785#true} assume 0 < #StackHeapBarrier; {1785#true} is VALID [2020-07-08 22:24:34,664 INFO L280 TraceCheckUtils]: 4: Hoare triple {1785#true} assume true; {1785#true} is VALID [2020-07-08 22:24:34,664 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1785#true} {1785#true} #213#return; {1785#true} is VALID [2020-07-08 22:24:34,664 INFO L263 TraceCheckUtils]: 6: Hoare triple {1785#true} call #t~ret18 := main(); {1785#true} is VALID [2020-07-08 22:24:34,665 INFO L280 TraceCheckUtils]: 7: Hoare triple {1785#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {1792#(not (= 0 |main_#t~malloc0.base|))} is VALID [2020-07-08 22:24:34,666 INFO L280 TraceCheckUtils]: 8: Hoare triple {1792#(not (= 0 |main_#t~malloc0.base|))} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-08 22:24:34,666 INFO L280 TraceCheckUtils]: 9: Hoare triple {1793#(not (= 0 main_~head~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-08 22:24:34,667 INFO L280 TraceCheckUtils]: 10: Hoare triple {1793#(not (= 0 main_~head~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-08 22:24:34,668 INFO L280 TraceCheckUtils]: 11: Hoare triple {1793#(not (= 0 main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-08 22:24:34,668 INFO L280 TraceCheckUtils]: 12: Hoare triple {1793#(not (= 0 main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-08 22:24:34,668 INFO L280 TraceCheckUtils]: 13: Hoare triple {1793#(not (= 0 main_~head~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-08 22:24:34,669 INFO L280 TraceCheckUtils]: 14: Hoare triple {1793#(not (= 0 main_~head~0.base))} assume !(0 != #t~nondet1); {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-08 22:24:34,669 INFO L280 TraceCheckUtils]: 15: Hoare triple {1793#(not (= 0 main_~head~0.base))} havoc #t~nondet1; {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-08 22:24:34,670 INFO L280 TraceCheckUtils]: 16: Hoare triple {1793#(not (= 0 main_~head~0.base))} SUMMARY for call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1001-5 {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-08 22:24:34,670 INFO L280 TraceCheckUtils]: 17: Hoare triple {1793#(not (= 0 main_~head~0.base))} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(12); srcloc: L1010 {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-08 22:24:34,671 INFO L280 TraceCheckUtils]: 18: Hoare triple {1793#(not (= 0 main_~head~0.base))} SUMMARY for call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1011 {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-08 22:24:34,671 INFO L280 TraceCheckUtils]: 19: Hoare triple {1793#(not (= 0 main_~head~0.base))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1011-1 {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-08 22:24:34,672 INFO L280 TraceCheckUtils]: 20: Hoare triple {1793#(not (= 0 main_~head~0.base))} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4); srcloc: L1012 {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-08 22:24:34,675 INFO L280 TraceCheckUtils]: 21: Hoare triple {1793#(not (= 0 main_~head~0.base))} havoc #t~mem6.base, #t~mem6.offset; {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-08 22:24:34,678 INFO L280 TraceCheckUtils]: 22: Hoare triple {1793#(not (= 0 main_~head~0.base))} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1013 {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-08 22:24:34,681 INFO L280 TraceCheckUtils]: 23: Hoare triple {1793#(not (= 0 main_~head~0.base))} SUMMARY for call write~int(2, #t~mem7.base, 8 + #t~mem7.offset, 4); srcloc: L1013-1 {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-08 22:24:34,681 INFO L280 TraceCheckUtils]: 24: Hoare triple {1793#(not (= 0 main_~head~0.base))} havoc #t~mem7.base, #t~mem7.offset; {1793#(not (= 0 main_~head~0.base))} is VALID [2020-07-08 22:24:34,682 INFO L280 TraceCheckUtils]: 25: Hoare triple {1793#(not (= 0 main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {1794#(not (= 0 main_~x~0.base))} is VALID [2020-07-08 22:24:34,683 INFO L280 TraceCheckUtils]: 26: Hoare triple {1794#(not (= 0 main_~x~0.base))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {1786#false} is VALID [2020-07-08 22:24:34,683 INFO L280 TraceCheckUtils]: 27: Hoare triple {1786#false} assume !false; {1786#false} is VALID [2020-07-08 22:24:34,685 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-08 22:24:34,685 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1036893724] [2020-07-08 22:24:34,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:24:34,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 22:24:34,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212238549] [2020-07-08 22:24:34,686 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-08 22:24:34,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:24:34,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 22:24:34,716 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:24:34,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 22:24:34,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:24:34,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 22:24:34,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 22:24:34,718 INFO L87 Difference]: Start difference. First operand 103 states and 106 transitions. Second operand 6 states. [2020-07-08 22:24:35,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:24:35,661 INFO L93 Difference]: Finished difference Result 160 states and 164 transitions. [2020-07-08 22:24:35,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 22:24:35,661 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2020-07-08 22:24:35,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:24:35,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 22:24:35,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2020-07-08 22:24:35,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 22:24:35,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 161 transitions. [2020-07-08 22:24:35,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 161 transitions. [2020-07-08 22:24:35,844 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:24:35,848 INFO L225 Difference]: With dead ends: 160 [2020-07-08 22:24:35,849 INFO L226 Difference]: Without dead ends: 158 [2020-07-08 22:24:35,849 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-07-08 22:24:35,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2020-07-08 22:24:36,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 101. [2020-07-08 22:24:36,112 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:24:36,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 101 states. [2020-07-08 22:24:36,113 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 101 states. [2020-07-08 22:24:36,113 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 101 states. [2020-07-08 22:24:36,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:24:36,120 INFO L93 Difference]: Finished difference Result 158 states and 162 transitions. [2020-07-08 22:24:36,120 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 162 transitions. [2020-07-08 22:24:36,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:24:36,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:24:36,121 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 158 states. [2020-07-08 22:24:36,121 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 158 states. [2020-07-08 22:24:36,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:24:36,127 INFO L93 Difference]: Finished difference Result 158 states and 162 transitions. [2020-07-08 22:24:36,127 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 162 transitions. [2020-07-08 22:24:36,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:24:36,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:24:36,128 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:24:36,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:24:36,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2020-07-08 22:24:36,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 104 transitions. [2020-07-08 22:24:36,132 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 104 transitions. Word has length 28 [2020-07-08 22:24:36,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:24:36,133 INFO L479 AbstractCegarLoop]: Abstraction has 101 states and 104 transitions. [2020-07-08 22:24:36,133 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 22:24:36,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 101 states and 104 transitions. [2020-07-08 22:24:36,305 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:24:36,305 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 104 transitions. [2020-07-08 22:24:36,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-08 22:24:36,306 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:24:36,307 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:24:36,307 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 22:24:36,308 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:24:36,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:24:36,308 INFO L82 PathProgramCache]: Analyzing trace with hash 578708441, now seen corresponding path program 1 times [2020-07-08 22:24:36,309 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:24:36,309 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2107531601] [2020-07-08 22:24:36,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:24:36,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:24:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:24:36,409 INFO L280 TraceCheckUtils]: 0: Hoare triple {2650#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2640#true} is VALID [2020-07-08 22:24:36,409 INFO L280 TraceCheckUtils]: 1: Hoare triple {2640#true} #valid := #valid[0 := 0]; {2640#true} is VALID [2020-07-08 22:24:36,410 INFO L280 TraceCheckUtils]: 2: Hoare triple {2640#true} assume 0 < #StackHeapBarrier; {2640#true} is VALID [2020-07-08 22:24:36,410 INFO L280 TraceCheckUtils]: 3: Hoare triple {2640#true} assume true; {2640#true} is VALID [2020-07-08 22:24:36,410 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2640#true} {2640#true} #213#return; {2640#true} is VALID [2020-07-08 22:24:36,411 INFO L263 TraceCheckUtils]: 0: Hoare triple {2640#true} call ULTIMATE.init(); {2650#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 22:24:36,412 INFO L280 TraceCheckUtils]: 1: Hoare triple {2650#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2640#true} is VALID [2020-07-08 22:24:36,412 INFO L280 TraceCheckUtils]: 2: Hoare triple {2640#true} #valid := #valid[0 := 0]; {2640#true} is VALID [2020-07-08 22:24:36,412 INFO L280 TraceCheckUtils]: 3: Hoare triple {2640#true} assume 0 < #StackHeapBarrier; {2640#true} is VALID [2020-07-08 22:24:36,413 INFO L280 TraceCheckUtils]: 4: Hoare triple {2640#true} assume true; {2640#true} is VALID [2020-07-08 22:24:36,413 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2640#true} {2640#true} #213#return; {2640#true} is VALID [2020-07-08 22:24:36,413 INFO L263 TraceCheckUtils]: 6: Hoare triple {2640#true} call #t~ret18 := main(); {2640#true} is VALID [2020-07-08 22:24:36,413 INFO L280 TraceCheckUtils]: 7: Hoare triple {2640#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {2640#true} is VALID [2020-07-08 22:24:36,414 INFO L280 TraceCheckUtils]: 8: Hoare triple {2640#true} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {2640#true} is VALID [2020-07-08 22:24:36,414 INFO L280 TraceCheckUtils]: 9: Hoare triple {2640#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {2640#true} is VALID [2020-07-08 22:24:36,414 INFO L280 TraceCheckUtils]: 10: Hoare triple {2640#true} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {2640#true} is VALID [2020-07-08 22:24:36,415 INFO L280 TraceCheckUtils]: 11: Hoare triple {2640#true} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {2640#true} is VALID [2020-07-08 22:24:36,415 INFO L280 TraceCheckUtils]: 12: Hoare triple {2640#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {2640#true} is VALID [2020-07-08 22:24:36,415 INFO L280 TraceCheckUtils]: 13: Hoare triple {2640#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {2640#true} is VALID [2020-07-08 22:24:36,416 INFO L280 TraceCheckUtils]: 14: Hoare triple {2640#true} assume !(0 != #t~nondet1); {2640#true} is VALID [2020-07-08 22:24:36,416 INFO L280 TraceCheckUtils]: 15: Hoare triple {2640#true} havoc #t~nondet1; {2640#true} is VALID [2020-07-08 22:24:36,416 INFO L280 TraceCheckUtils]: 16: Hoare triple {2640#true} SUMMARY for call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1001-5 {2640#true} is VALID [2020-07-08 22:24:36,430 INFO L280 TraceCheckUtils]: 17: Hoare triple {2640#true} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(12); srcloc: L1010 {2640#true} is VALID [2020-07-08 22:24:36,431 INFO L280 TraceCheckUtils]: 18: Hoare triple {2640#true} SUMMARY for call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1011 {2640#true} is VALID [2020-07-08 22:24:36,431 INFO L280 TraceCheckUtils]: 19: Hoare triple {2640#true} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1011-1 {2640#true} is VALID [2020-07-08 22:24:36,431 INFO L280 TraceCheckUtils]: 20: Hoare triple {2640#true} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4); srcloc: L1012 {2640#true} is VALID [2020-07-08 22:24:36,431 INFO L280 TraceCheckUtils]: 21: Hoare triple {2640#true} havoc #t~mem6.base, #t~mem6.offset; {2640#true} is VALID [2020-07-08 22:24:36,432 INFO L280 TraceCheckUtils]: 22: Hoare triple {2640#true} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1013 {2640#true} is VALID [2020-07-08 22:24:36,432 INFO L280 TraceCheckUtils]: 23: Hoare triple {2640#true} SUMMARY for call write~int(2, #t~mem7.base, 8 + #t~mem7.offset, 4); srcloc: L1013-1 {2640#true} is VALID [2020-07-08 22:24:36,432 INFO L280 TraceCheckUtils]: 24: Hoare triple {2640#true} havoc #t~mem7.base, #t~mem7.offset; {2640#true} is VALID [2020-07-08 22:24:36,432 INFO L280 TraceCheckUtils]: 25: Hoare triple {2640#true} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {2640#true} is VALID [2020-07-08 22:24:36,433 INFO L280 TraceCheckUtils]: 26: Hoare triple {2640#true} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {2640#true} is VALID [2020-07-08 22:24:36,433 INFO L280 TraceCheckUtils]: 27: Hoare triple {2640#true} goto; {2640#true} is VALID [2020-07-08 22:24:36,434 INFO L280 TraceCheckUtils]: 28: Hoare triple {2640#true} SUMMARY for call #t~mem8 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1019-4 {2647#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) |main_#t~mem8|)} is VALID [2020-07-08 22:24:36,438 INFO L280 TraceCheckUtils]: 29: Hoare triple {2647#(= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) |main_#t~mem8|)} assume !(1 != #t~mem8); {2648#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} is VALID [2020-07-08 22:24:36,439 INFO L280 TraceCheckUtils]: 30: Hoare triple {2648#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} havoc #t~mem8; {2648#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} is VALID [2020-07-08 22:24:36,440 INFO L280 TraceCheckUtils]: 31: Hoare triple {2648#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} SUMMARY for call #t~mem11 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1024-6 {2649#(= |main_#t~mem11| 1)} is VALID [2020-07-08 22:24:36,441 INFO L280 TraceCheckUtils]: 32: Hoare triple {2649#(= |main_#t~mem11| 1)} assume !(1 == #t~mem11); {2641#false} is VALID [2020-07-08 22:24:36,441 INFO L280 TraceCheckUtils]: 33: Hoare triple {2641#false} havoc #t~mem11; {2641#false} is VALID [2020-07-08 22:24:36,441 INFO L280 TraceCheckUtils]: 34: Hoare triple {2641#false} assume !false; {2641#false} is VALID [2020-07-08 22:24:36,443 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-08 22:24:36,443 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2107531601] [2020-07-08 22:24:36,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:24:36,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 22:24:36,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394231756] [2020-07-08 22:24:36,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-07-08 22:24:36,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:24:36,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 22:24:36,486 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:24:36,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 22:24:36,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:24:36,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 22:24:36,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-08 22:24:36,488 INFO L87 Difference]: Start difference. First operand 101 states and 104 transitions. Second operand 6 states. [2020-07-08 22:24:37,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:24:37,211 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2020-07-08 22:24:37,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 22:24:37,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2020-07-08 22:24:37,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:24:37,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 22:24:37,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2020-07-08 22:24:37,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 22:24:37,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 90 transitions. [2020-07-08 22:24:37,219 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 90 transitions. [2020-07-08 22:24:37,324 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:24:37,328 INFO L225 Difference]: With dead ends: 101 [2020-07-08 22:24:37,328 INFO L226 Difference]: Without dead ends: 98 [2020-07-08 22:24:37,329 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-08 22:24:37,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-08 22:24:37,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2020-07-08 22:24:37,607 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:24:37,607 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 98 states. [2020-07-08 22:24:37,607 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 98 states. [2020-07-08 22:24:37,607 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 98 states. [2020-07-08 22:24:37,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:24:37,611 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2020-07-08 22:24:37,612 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2020-07-08 22:24:37,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:24:37,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:24:37,614 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 98 states. [2020-07-08 22:24:37,615 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 98 states. [2020-07-08 22:24:37,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:24:37,618 INFO L93 Difference]: Finished difference Result 98 states and 101 transitions. [2020-07-08 22:24:37,618 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2020-07-08 22:24:37,619 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:24:37,619 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:24:37,619 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:24:37,619 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:24:37,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-07-08 22:24:37,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2020-07-08 22:24:37,623 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 35 [2020-07-08 22:24:37,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:24:37,623 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2020-07-08 22:24:37,623 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 22:24:37,624 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 98 states and 101 transitions. [2020-07-08 22:24:37,781 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:24:37,782 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2020-07-08 22:24:37,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-08 22:24:37,783 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:24:37,783 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:24:37,783 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 22:24:37,783 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:24:37,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:24:37,784 INFO L82 PathProgramCache]: Analyzing trace with hash 666566073, now seen corresponding path program 1 times [2020-07-08 22:24:37,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:24:37,784 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [247497077] [2020-07-08 22:24:37,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:24:37,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:24:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:24:38,327 INFO L280 TraceCheckUtils]: 0: Hoare triple {3269#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3251#true} is VALID [2020-07-08 22:24:38,327 INFO L280 TraceCheckUtils]: 1: Hoare triple {3251#true} #valid := #valid[0 := 0]; {3251#true} is VALID [2020-07-08 22:24:38,327 INFO L280 TraceCheckUtils]: 2: Hoare triple {3251#true} assume 0 < #StackHeapBarrier; {3251#true} is VALID [2020-07-08 22:24:38,327 INFO L280 TraceCheckUtils]: 3: Hoare triple {3251#true} assume true; {3251#true} is VALID [2020-07-08 22:24:38,328 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3251#true} {3251#true} #213#return; {3251#true} is VALID [2020-07-08 22:24:38,328 INFO L263 TraceCheckUtils]: 0: Hoare triple {3251#true} call ULTIMATE.init(); {3269#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 22:24:38,329 INFO L280 TraceCheckUtils]: 1: Hoare triple {3269#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3251#true} is VALID [2020-07-08 22:24:38,329 INFO L280 TraceCheckUtils]: 2: Hoare triple {3251#true} #valid := #valid[0 := 0]; {3251#true} is VALID [2020-07-08 22:24:38,329 INFO L280 TraceCheckUtils]: 3: Hoare triple {3251#true} assume 0 < #StackHeapBarrier; {3251#true} is VALID [2020-07-08 22:24:38,329 INFO L280 TraceCheckUtils]: 4: Hoare triple {3251#true} assume true; {3251#true} is VALID [2020-07-08 22:24:38,329 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3251#true} {3251#true} #213#return; {3251#true} is VALID [2020-07-08 22:24:38,330 INFO L263 TraceCheckUtils]: 6: Hoare triple {3251#true} call #t~ret18 := main(); {3251#true} is VALID [2020-07-08 22:24:38,336 INFO L280 TraceCheckUtils]: 7: Hoare triple {3251#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {3258#(and (= 1 (select |#valid| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|))} is VALID [2020-07-08 22:24:38,337 INFO L280 TraceCheckUtils]: 8: Hoare triple {3258#(and (= 1 (select |#valid| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|))} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {3259#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-08 22:24:38,338 INFO L280 TraceCheckUtils]: 9: Hoare triple {3259#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {3259#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-08 22:24:38,340 INFO L280 TraceCheckUtils]: 10: Hoare triple {3259#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {3259#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-08 22:24:38,341 INFO L280 TraceCheckUtils]: 11: Hoare triple {3259#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {3259#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-08 22:24:38,342 INFO L280 TraceCheckUtils]: 12: Hoare triple {3259#(and (= 1 (select |#valid| main_~head~0.base)) (= 0 main_~head~0.offset))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {3260#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-08 22:24:38,343 INFO L280 TraceCheckUtils]: 13: Hoare triple {3260#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {3260#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-08 22:24:38,343 INFO L280 TraceCheckUtils]: 14: Hoare triple {3260#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} assume !(0 != #t~nondet1); {3260#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-08 22:24:38,344 INFO L280 TraceCheckUtils]: 15: Hoare triple {3260#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} havoc #t~nondet1; {3260#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-08 22:24:38,346 INFO L280 TraceCheckUtils]: 16: Hoare triple {3260#(and (= main_~x~0.offset main_~head~0.offset) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} SUMMARY for call write~int(1, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1001-5 {3261#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} is VALID [2020-07-08 22:24:38,348 INFO L280 TraceCheckUtils]: 17: Hoare triple {3261#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 1 (select |#valid| main_~x~0.base)) (= 0 main_~head~0.offset))} SUMMARY for call #t~malloc5.base, #t~malloc5.offset := #Ultimate.allocOnHeap(12); srcloc: L1010 {3262#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset) (not (= |main_#t~malloc5.base| main_~x~0.base)))} is VALID [2020-07-08 22:24:38,349 INFO L280 TraceCheckUtils]: 18: Hoare triple {3262#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset) (not (= |main_#t~malloc5.base| main_~x~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc5.base, #t~malloc5.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1011 {3263#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} is VALID [2020-07-08 22:24:38,351 INFO L280 TraceCheckUtils]: 19: Hoare triple {3263#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} SUMMARY for call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1011-1 {3264#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem6.base|) (not (= |main_#t~mem6.base| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset))} is VALID [2020-07-08 22:24:38,352 INFO L280 TraceCheckUtils]: 20: Hoare triple {3264#(and (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) |main_#t~mem6.base|) (not (= |main_#t~mem6.base| main_~x~0.base)) (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset))} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem6.base, 4 + #t~mem6.offset, 4); srcloc: L1012 {3263#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} is VALID [2020-07-08 22:24:38,353 INFO L280 TraceCheckUtils]: 21: Hoare triple {3263#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} havoc #t~mem6.base, #t~mem6.offset; {3263#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} is VALID [2020-07-08 22:24:38,354 INFO L280 TraceCheckUtils]: 22: Hoare triple {3263#(and (= main_~x~0.offset main_~head~0.offset) (= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8))) (= main_~head~0.base main_~x~0.base) (= 0 main_~head~0.offset) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} SUMMARY for call #t~mem7.base, #t~mem7.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1013 {3265#(and (= 1 (select (select (store |#memory_int| |main_#t~mem7.base| (store (select |#memory_int| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 8) 2)) main_~head~0.base) (+ main_~head~0.offset 8))) (= 0 main_~head~0.offset))} is VALID [2020-07-08 22:24:38,355 INFO L280 TraceCheckUtils]: 23: Hoare triple {3265#(and (= 1 (select (select (store |#memory_int| |main_#t~mem7.base| (store (select |#memory_int| |main_#t~mem7.base|) (+ |main_#t~mem7.offset| 8) 2)) main_~head~0.base) (+ main_~head~0.offset 8))) (= 0 main_~head~0.offset))} SUMMARY for call write~int(2, #t~mem7.base, 8 + #t~mem7.offset, 4); srcloc: L1013-1 {3266#(and (= 0 main_~head~0.offset) (= 1 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8))))} is VALID [2020-07-08 22:24:38,356 INFO L280 TraceCheckUtils]: 24: Hoare triple {3266#(and (= 0 main_~head~0.offset) (= 1 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8))))} havoc #t~mem7.base, #t~mem7.offset; {3266#(and (= 0 main_~head~0.offset) (= 1 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8))))} is VALID [2020-07-08 22:24:38,357 INFO L280 TraceCheckUtils]: 25: Hoare triple {3266#(and (= 0 main_~head~0.offset) (= 1 (select (select |#memory_int| main_~head~0.base) (+ main_~head~0.offset 8))))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {3267#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} is VALID [2020-07-08 22:24:38,357 INFO L280 TraceCheckUtils]: 26: Hoare triple {3267#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {3267#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} is VALID [2020-07-08 22:24:38,358 INFO L280 TraceCheckUtils]: 27: Hoare triple {3267#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} goto; {3267#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} is VALID [2020-07-08 22:24:38,359 INFO L280 TraceCheckUtils]: 28: Hoare triple {3267#(= 1 (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)))} SUMMARY for call #t~mem8 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1019-4 {3268#(= 1 |main_#t~mem8|)} is VALID [2020-07-08 22:24:38,359 INFO L280 TraceCheckUtils]: 29: Hoare triple {3268#(= 1 |main_#t~mem8|)} assume !!(1 != #t~mem8); {3252#false} is VALID [2020-07-08 22:24:38,359 INFO L280 TraceCheckUtils]: 30: Hoare triple {3252#false} havoc #t~mem8; {3252#false} is VALID [2020-07-08 22:24:38,360 INFO L280 TraceCheckUtils]: 31: Hoare triple {3252#false} SUMMARY for call #t~mem9 := read~int(~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1021-7 {3252#false} is VALID [2020-07-08 22:24:38,360 INFO L280 TraceCheckUtils]: 32: Hoare triple {3252#false} assume !(0 == #t~mem9); {3252#false} is VALID [2020-07-08 22:24:38,360 INFO L280 TraceCheckUtils]: 33: Hoare triple {3252#false} havoc #t~mem9; {3252#false} is VALID [2020-07-08 22:24:38,360 INFO L280 TraceCheckUtils]: 34: Hoare triple {3252#false} assume !false; {3252#false} is VALID [2020-07-08 22:24:38,366 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-08 22:24:38,366 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [247497077] [2020-07-08 22:24:38,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 22:24:38,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2020-07-08 22:24:38,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948807363] [2020-07-08 22:24:38,367 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2020-07-08 22:24:38,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:24:38,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2020-07-08 22:24:38,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:24:38,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-07-08 22:24:38,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:24:38,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-07-08 22:24:38,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2020-07-08 22:24:38,414 INFO L87 Difference]: Start difference. First operand 98 states and 101 transitions. Second operand 14 states. [2020-07-08 22:24:41,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:24:41,362 INFO L93 Difference]: Finished difference Result 229 states and 235 transitions. [2020-07-08 22:24:41,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-08 22:24:41,362 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2020-07-08 22:24:41,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:24:41,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 22:24:41,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 232 transitions. [2020-07-08 22:24:41,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 22:24:41,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 232 transitions. [2020-07-08 22:24:41,372 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 232 transitions. [2020-07-08 22:24:41,640 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 232 edges. 232 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:24:41,643 INFO L225 Difference]: With dead ends: 229 [2020-07-08 22:24:41,644 INFO L226 Difference]: Without dead ends: 186 [2020-07-08 22:24:41,645 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=188, Invalid=514, Unknown=0, NotChecked=0, Total=702 [2020-07-08 22:24:41,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2020-07-08 22:24:42,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 113. [2020-07-08 22:24:42,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:24:42,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand 113 states. [2020-07-08 22:24:42,185 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 113 states. [2020-07-08 22:24:42,186 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 113 states. [2020-07-08 22:24:42,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:24:42,192 INFO L93 Difference]: Finished difference Result 186 states and 190 transitions. [2020-07-08 22:24:42,193 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 190 transitions. [2020-07-08 22:24:42,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:24:42,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:24:42,194 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 186 states. [2020-07-08 22:24:42,194 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 186 states. [2020-07-08 22:24:42,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:24:42,200 INFO L93 Difference]: Finished difference Result 186 states and 190 transitions. [2020-07-08 22:24:42,200 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 190 transitions. [2020-07-08 22:24:42,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:24:42,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:24:42,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:24:42,202 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:24:42,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-07-08 22:24:42,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 116 transitions. [2020-07-08 22:24:42,206 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 116 transitions. Word has length 35 [2020-07-08 22:24:42,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:24:42,206 INFO L479 AbstractCegarLoop]: Abstraction has 113 states and 116 transitions. [2020-07-08 22:24:42,206 INFO L480 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-07-08 22:24:42,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 113 states and 116 transitions. [2020-07-08 22:24:42,430 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:24:42,430 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 116 transitions. [2020-07-08 22:24:42,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-08 22:24:42,431 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:24:42,431 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:24:42,432 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 22:24:42,432 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:24:42,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:24:42,433 INFO L82 PathProgramCache]: Analyzing trace with hash 323200756, now seen corresponding path program 1 times [2020-07-08 22:24:42,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:24:42,433 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1858764876] [2020-07-08 22:24:42,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:24:42,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:24:42,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 22:24:42,785 INFO L280 TraceCheckUtils]: 0: Hoare triple {4375#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4354#true} is VALID [2020-07-08 22:24:42,786 INFO L280 TraceCheckUtils]: 1: Hoare triple {4354#true} #valid := #valid[0 := 0]; {4354#true} is VALID [2020-07-08 22:24:42,786 INFO L280 TraceCheckUtils]: 2: Hoare triple {4354#true} assume 0 < #StackHeapBarrier; {4354#true} is VALID [2020-07-08 22:24:42,786 INFO L280 TraceCheckUtils]: 3: Hoare triple {4354#true} assume true; {4354#true} is VALID [2020-07-08 22:24:42,786 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {4354#true} {4354#true} #213#return; {4354#true} is VALID [2020-07-08 22:24:42,788 INFO L263 TraceCheckUtils]: 0: Hoare triple {4354#true} call ULTIMATE.init(); {4375#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 22:24:42,788 INFO L280 TraceCheckUtils]: 1: Hoare triple {4375#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {4354#true} is VALID [2020-07-08 22:24:42,788 INFO L280 TraceCheckUtils]: 2: Hoare triple {4354#true} #valid := #valid[0 := 0]; {4354#true} is VALID [2020-07-08 22:24:42,789 INFO L280 TraceCheckUtils]: 3: Hoare triple {4354#true} assume 0 < #StackHeapBarrier; {4354#true} is VALID [2020-07-08 22:24:42,789 INFO L280 TraceCheckUtils]: 4: Hoare triple {4354#true} assume true; {4354#true} is VALID [2020-07-08 22:24:42,789 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {4354#true} {4354#true} #213#return; {4354#true} is VALID [2020-07-08 22:24:42,789 INFO L263 TraceCheckUtils]: 6: Hoare triple {4354#true} call #t~ret18 := main(); {4354#true} is VALID [2020-07-08 22:24:42,791 INFO L280 TraceCheckUtils]: 7: Hoare triple {4354#true} SUMMARY for call #t~malloc0.base, #t~malloc0.offset := #Ultimate.allocOnHeap(12); srcloc: mainENTRY {4361#(= 1 (select |#valid| |main_#t~malloc0.base|))} is VALID [2020-07-08 22:24:42,792 INFO L280 TraceCheckUtils]: 8: Hoare triple {4361#(= 1 (select |#valid| |main_#t~malloc0.base|))} ~head~0.base, ~head~0.offset := #t~malloc0.base, #t~malloc0.offset; {4362#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-08 22:24:42,793 INFO L280 TraceCheckUtils]: 9: Hoare triple {4362#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, ~head~0.offset, 4); srcloc: L994 {4362#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-08 22:24:42,794 INFO L280 TraceCheckUtils]: 10: Hoare triple {4362#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~$Pointer$(0, 0, ~head~0.base, 4 + ~head~0.offset, 4); srcloc: L994-1 {4362#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-08 22:24:42,799 INFO L280 TraceCheckUtils]: 11: Hoare triple {4362#(= 1 (select |#valid| main_~head~0.base))} SUMMARY for call write~int(0, ~head~0.base, 8 + ~head~0.offset, 4); srcloc: L995 {4362#(= 1 (select |#valid| main_~head~0.base))} is VALID [2020-07-08 22:24:42,799 INFO L280 TraceCheckUtils]: 12: Hoare triple {4362#(= 1 (select |#valid| main_~head~0.base))} ~x~0.base, ~x~0.offset := ~head~0.base, ~head~0.offset; {4363#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-08 22:24:42,800 INFO L280 TraceCheckUtils]: 13: Hoare triple {4363#(= 1 (select |#valid| main_~x~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4363#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-08 22:24:42,800 INFO L280 TraceCheckUtils]: 14: Hoare triple {4363#(= 1 (select |#valid| main_~x~0.base))} assume !!(0 != #t~nondet1); {4363#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-08 22:24:42,801 INFO L280 TraceCheckUtils]: 15: Hoare triple {4363#(= 1 (select |#valid| main_~x~0.base))} havoc #t~nondet1; {4363#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-08 22:24:42,802 INFO L280 TraceCheckUtils]: 16: Hoare triple {4363#(= 1 (select |#valid| main_~x~0.base))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); srcloc: L1004 {4364#(and (= (select |#valid| |main_#t~malloc2.base|) 1) (not (= |main_#t~malloc2.base| main_~x~0.base)))} is VALID [2020-07-08 22:24:42,803 INFO L280 TraceCheckUtils]: 17: Hoare triple {4364#(and (= (select |#valid| |main_#t~malloc2.base|) 1) (not (= |main_#t~malloc2.base| main_~x~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1004-1 {4365#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} is VALID [2020-07-08 22:24:42,804 INFO L280 TraceCheckUtils]: 18: Hoare triple {4365#(and (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1004-2 {4366#(and (not (= |main_#t~mem3.base| main_~x~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem3.base| (store (select |#memory_$Pointer$.base| |main_#t~mem3.base|) (+ |main_#t~mem3.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-08 22:24:42,805 INFO L280 TraceCheckUtils]: 19: Hoare triple {4366#(and (not (= |main_#t~mem3.base| main_~x~0.base)) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |main_#t~mem3.base| (store (select |#memory_$Pointer$.base| |main_#t~mem3.base|) (+ |main_#t~mem3.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))))} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); srcloc: L1005 {4367#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-08 22:24:42,806 INFO L280 TraceCheckUtils]: 20: Hoare triple {4367#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} havoc #t~mem3.base, #t~mem3.offset; {4367#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-08 22:24:42,806 INFO L280 TraceCheckUtils]: 21: Hoare triple {4367#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1006 {4368#(= 1 (select |#valid| |main_#t~mem4.base|))} is VALID [2020-07-08 22:24:42,815 INFO L280 TraceCheckUtils]: 22: Hoare triple {4368#(= 1 (select |#valid| |main_#t~mem4.base|))} ~x~0.base, ~x~0.offset := #t~mem4.base, #t~mem4.offset; {4363#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-08 22:24:42,816 INFO L280 TraceCheckUtils]: 23: Hoare triple {4363#(= 1 (select |#valid| main_~x~0.base))} havoc #t~mem4.base, #t~mem4.offset; {4363#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-08 22:24:42,817 INFO L280 TraceCheckUtils]: 24: Hoare triple {4363#(= 1 (select |#valid| main_~x~0.base))} SUMMARY for call write~int(0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1007 {4363#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-08 22:24:42,817 INFO L280 TraceCheckUtils]: 25: Hoare triple {4363#(= 1 (select |#valid| main_~x~0.base))} assume !!(0 != ~x~0.base || 0 != ~x~0.offset); {4363#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-08 22:24:42,818 INFO L280 TraceCheckUtils]: 26: Hoare triple {4363#(= 1 (select |#valid| main_~x~0.base))} goto; {4363#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-08 22:24:42,818 INFO L280 TraceCheckUtils]: 27: Hoare triple {4363#(= 1 (select |#valid| main_~x~0.base))} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647; {4363#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-08 22:24:42,819 INFO L280 TraceCheckUtils]: 28: Hoare triple {4363#(= 1 (select |#valid| main_~x~0.base))} assume !!(0 != #t~nondet1); {4363#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-08 22:24:42,819 INFO L280 TraceCheckUtils]: 29: Hoare triple {4363#(= 1 (select |#valid| main_~x~0.base))} havoc #t~nondet1; {4363#(= 1 (select |#valid| main_~x~0.base))} is VALID [2020-07-08 22:24:42,820 INFO L280 TraceCheckUtils]: 30: Hoare triple {4363#(= 1 (select |#valid| main_~x~0.base))} SUMMARY for call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(12); srcloc: L1004 {4369#(and (not (= 0 |main_#t~malloc2.base|)) (not (= |main_#t~malloc2.base| main_~x~0.base)))} is VALID [2020-07-08 22:24:42,821 INFO L280 TraceCheckUtils]: 31: Hoare triple {4369#(and (not (= 0 |main_#t~malloc2.base|)) (not (= |main_#t~malloc2.base| main_~x~0.base)))} SUMMARY for call write~$Pointer$(#t~malloc2.base, #t~malloc2.offset, ~x~0.base, ~x~0.offset, 4); srcloc: L1004-1 {4370#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} is VALID [2020-07-08 22:24:42,822 INFO L280 TraceCheckUtils]: 32: Hoare triple {4370#(and (not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset))) (not (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset) main_~x~0.base)))} SUMMARY for call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1004-2 {4371#(and (not (= |main_#t~mem3.base| main_~x~0.base)) (not (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem3.base| (store (select |#memory_$Pointer$.base| |main_#t~mem3.base|) (+ |main_#t~mem3.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))))} is VALID [2020-07-08 22:24:42,823 INFO L280 TraceCheckUtils]: 33: Hoare triple {4371#(and (not (= |main_#t~mem3.base| main_~x~0.base)) (not (= 0 (select (select (store |#memory_$Pointer$.base| |main_#t~mem3.base| (store (select |#memory_$Pointer$.base| |main_#t~mem3.base|) (+ |main_#t~mem3.offset| 4) main_~x~0.base)) main_~x~0.base) main_~x~0.offset))))} SUMMARY for call write~$Pointer$(~x~0.base, ~x~0.offset, #t~mem3.base, 4 + #t~mem3.offset, 4); srcloc: L1005 {4372#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-08 22:24:42,824 INFO L280 TraceCheckUtils]: 34: Hoare triple {4372#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} havoc #t~mem3.base, #t~mem3.offset; {4372#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} is VALID [2020-07-08 22:24:42,825 INFO L280 TraceCheckUtils]: 35: Hoare triple {4372#(not (= 0 (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~x~0.offset)))} SUMMARY for call #t~mem4.base, #t~mem4.offset := read~$Pointer$(~x~0.base, ~x~0.offset, 4); srcloc: L1006 {4373#(not (= 0 |main_#t~mem4.base|))} is VALID [2020-07-08 22:24:42,825 INFO L280 TraceCheckUtils]: 36: Hoare triple {4373#(not (= 0 |main_#t~mem4.base|))} ~x~0.base, ~x~0.offset := #t~mem4.base, #t~mem4.offset; {4374#(not (= 0 main_~x~0.base))} is VALID [2020-07-08 22:24:42,826 INFO L280 TraceCheckUtils]: 37: Hoare triple {4374#(not (= 0 main_~x~0.base))} havoc #t~mem4.base, #t~mem4.offset; {4374#(not (= 0 main_~x~0.base))} is VALID [2020-07-08 22:24:42,826 INFO L280 TraceCheckUtils]: 38: Hoare triple {4374#(not (= 0 main_~x~0.base))} SUMMARY for call write~int(0, ~x~0.base, 8 + ~x~0.offset, 4); srcloc: L1007 {4374#(not (= 0 main_~x~0.base))} is VALID [2020-07-08 22:24:42,827 INFO L280 TraceCheckUtils]: 39: Hoare triple {4374#(not (= 0 main_~x~0.base))} assume !(0 != ~x~0.base || 0 != ~x~0.offset); {4355#false} is VALID [2020-07-08 22:24:42,827 INFO L280 TraceCheckUtils]: 40: Hoare triple {4355#false} assume !false; {4355#false} is VALID [2020-07-08 22:24:42,831 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-08 22:24:42,832 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1858764876] [2020-07-08 22:24:42,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-08 22:24:42,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2020-07-08 22:24:42,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152771897] [2020-07-08 22:24:42,833 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2020-07-08 22:24:42,834 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 22:24:42,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-08 22:24:42,879 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:24:42,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-08 22:24:42,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 22:24:42,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-08 22:24:42,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2020-07-08 22:24:42,881 INFO L87 Difference]: Start difference. First operand 113 states and 116 transitions. Second operand 17 states. [2020-07-08 22:24:46,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:24:46,194 INFO L93 Difference]: Finished difference Result 146 states and 150 transitions. [2020-07-08 22:24:46,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-08 22:24:46,194 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 41 [2020-07-08 22:24:46,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 22:24:46,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-08 22:24:46,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 143 transitions. [2020-07-08 22:24:46,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-08 22:24:46,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 143 transitions. [2020-07-08 22:24:46,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 143 transitions. [2020-07-08 22:24:46,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:24:46,372 INFO L225 Difference]: With dead ends: 146 [2020-07-08 22:24:46,373 INFO L226 Difference]: Without dead ends: 144 [2020-07-08 22:24:46,373 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=196, Invalid=616, Unknown=0, NotChecked=0, Total=812 [2020-07-08 22:24:46,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-07-08 22:24:46,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 100. [2020-07-08 22:24:46,796 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 22:24:46,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand 100 states. [2020-07-08 22:24:46,796 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 100 states. [2020-07-08 22:24:46,797 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 100 states. [2020-07-08 22:24:46,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:24:46,802 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2020-07-08 22:24:46,802 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2020-07-08 22:24:46,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:24:46,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:24:46,803 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand 144 states. [2020-07-08 22:24:46,803 INFO L87 Difference]: Start difference. First operand 100 states. Second operand 144 states. [2020-07-08 22:24:46,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 22:24:46,808 INFO L93 Difference]: Finished difference Result 144 states and 148 transitions. [2020-07-08 22:24:46,808 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2020-07-08 22:24:46,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 22:24:46,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 22:24:46,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 22:24:46,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 22:24:46,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2020-07-08 22:24:46,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 103 transitions. [2020-07-08 22:24:46,812 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 103 transitions. Word has length 41 [2020-07-08 22:24:46,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 22:24:46,813 INFO L479 AbstractCegarLoop]: Abstraction has 100 states and 103 transitions. [2020-07-08 22:24:46,813 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-08 22:24:46,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 100 states and 103 transitions. [2020-07-08 22:24:47,052 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 22:24:47,052 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 103 transitions. [2020-07-08 22:24:47,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-08 22:24:47,052 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 22:24:47,053 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 22:24:47,053 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 22:24:47,053 INFO L427 AbstractCegarLoop]: === Iteration 7 === [mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 22:24:47,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 22:24:47,053 INFO L82 PathProgramCache]: Analyzing trace with hash 957359950, now seen corresponding path program 1 times [2020-07-08 22:24:47,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 22:24:47,054 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1145123567] [2020-07-08 22:24:47,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 22:24:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 22:24:47,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 22:24:47,157 INFO L174 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2020-07-08 22:24:47,157 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 22:24:47,157 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-08 22:24:47,237 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 22:24:47,238 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 22:24:47,238 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 22:24:47,238 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 22:24:47,238 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 22:24:47,238 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 22:24:47,238 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 22:24:47,238 WARN L170 areAnnotationChecker]: L993 has no Hoare annotation [2020-07-08 22:24:47,238 WARN L170 areAnnotationChecker]: L-1-1 has no Hoare annotation [2020-07-08 22:24:47,238 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 22:24:47,238 WARN L170 areAnnotationChecker]: L994 has no Hoare annotation [2020-07-08 22:24:47,239 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 22:24:47,239 WARN L170 areAnnotationChecker]: L994-1 has no Hoare annotation [2020-07-08 22:24:47,239 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 22:24:47,239 WARN L170 areAnnotationChecker]: L995 has no Hoare annotation [2020-07-08 22:24:47,239 WARN L170 areAnnotationChecker]: L996 has no Hoare annotation [2020-07-08 22:24:47,239 WARN L170 areAnnotationChecker]: L1008-4 has no Hoare annotation [2020-07-08 22:24:47,240 WARN L170 areAnnotationChecker]: L1008-4 has no Hoare annotation [2020-07-08 22:24:47,240 WARN L170 areAnnotationChecker]: L1001-5 has no Hoare annotation [2020-07-08 22:24:47,240 WARN L170 areAnnotationChecker]: L1001-1 has no Hoare annotation [2020-07-08 22:24:47,240 WARN L170 areAnnotationChecker]: L1001-1 has no Hoare annotation [2020-07-08 22:24:47,240 WARN L170 areAnnotationChecker]: L1010 has no Hoare annotation [2020-07-08 22:24:47,240 WARN L170 areAnnotationChecker]: L1001-2 has no Hoare annotation [2020-07-08 22:24:47,240 WARN L170 areAnnotationChecker]: L1001-4 has no Hoare annotation [2020-07-08 22:24:47,240 WARN L170 areAnnotationChecker]: L1011 has no Hoare annotation [2020-07-08 22:24:47,241 WARN L170 areAnnotationChecker]: L1004 has no Hoare annotation [2020-07-08 22:24:47,241 WARN L170 areAnnotationChecker]: L1011-1 has no Hoare annotation [2020-07-08 22:24:47,241 WARN L170 areAnnotationChecker]: L1004-1 has no Hoare annotation [2020-07-08 22:24:47,241 WARN L170 areAnnotationChecker]: L1012 has no Hoare annotation [2020-07-08 22:24:47,241 WARN L170 areAnnotationChecker]: L1004-2 has no Hoare annotation [2020-07-08 22:24:47,241 WARN L170 areAnnotationChecker]: L1012-1 has no Hoare annotation [2020-07-08 22:24:47,241 WARN L170 areAnnotationChecker]: L1005 has no Hoare annotation [2020-07-08 22:24:47,242 WARN L170 areAnnotationChecker]: L1013 has no Hoare annotation [2020-07-08 22:24:47,242 WARN L170 areAnnotationChecker]: L1005-1 has no Hoare annotation [2020-07-08 22:24:47,242 WARN L170 areAnnotationChecker]: L1013-1 has no Hoare annotation [2020-07-08 22:24:47,242 WARN L170 areAnnotationChecker]: L1006 has no Hoare annotation [2020-07-08 22:24:47,242 WARN L170 areAnnotationChecker]: L1013-2 has no Hoare annotation [2020-07-08 22:24:47,242 WARN L170 areAnnotationChecker]: L1006-1 has no Hoare annotation [2020-07-08 22:24:47,242 WARN L170 areAnnotationChecker]: L1015 has no Hoare annotation [2020-07-08 22:24:47,242 WARN L170 areAnnotationChecker]: L1006-2 has no Hoare annotation [2020-07-08 22:24:47,242 WARN L170 areAnnotationChecker]: L1017-4 has no Hoare annotation [2020-07-08 22:24:47,243 WARN L170 areAnnotationChecker]: L1017-4 has no Hoare annotation [2020-07-08 22:24:47,243 WARN L170 areAnnotationChecker]: L1017-4 has no Hoare annotation [2020-07-08 22:24:47,243 WARN L170 areAnnotationChecker]: L1007 has no Hoare annotation [2020-07-08 22:24:47,243 WARN L170 areAnnotationChecker]: L1019-4 has no Hoare annotation [2020-07-08 22:24:47,243 WARN L170 areAnnotationChecker]: L1019-4 has no Hoare annotation [2020-07-08 22:24:47,243 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-08 22:24:47,243 WARN L170 areAnnotationChecker]: L1017-1 has no Hoare annotation [2020-07-08 22:24:47,244 WARN L170 areAnnotationChecker]: L1017-3 has no Hoare annotation [2020-07-08 22:24:47,244 WARN L170 areAnnotationChecker]: L1017-3 has no Hoare annotation [2020-07-08 22:24:47,244 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-08 22:24:47,244 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-08 22:24:47,244 WARN L170 areAnnotationChecker]: L1008-3 has no Hoare annotation [2020-07-08 22:24:47,244 WARN L170 areAnnotationChecker]: L1024-6 has no Hoare annotation [2020-07-08 22:24:47,244 WARN L170 areAnnotationChecker]: L1024-6 has no Hoare annotation [2020-07-08 22:24:47,244 WARN L170 areAnnotationChecker]: L1019 has no Hoare annotation [2020-07-08 22:24:47,244 WARN L170 areAnnotationChecker]: L1019 has no Hoare annotation [2020-07-08 22:24:47,245 WARN L170 areAnnotationChecker]: L1008 has no Hoare annotation [2020-07-08 22:24:47,245 WARN L170 areAnnotationChecker]: L1008 has no Hoare annotation [2020-07-08 22:24:47,245 WARN L170 areAnnotationChecker]: L1008-2 has no Hoare annotation [2020-07-08 22:24:47,245 WARN L170 areAnnotationChecker]: L1008-2 has no Hoare annotation [2020-07-08 22:24:47,245 WARN L170 areAnnotationChecker]: L1024 has no Hoare annotation [2020-07-08 22:24:47,245 WARN L170 areAnnotationChecker]: L1024 has no Hoare annotation [2020-07-08 22:24:47,245 WARN L170 areAnnotationChecker]: L1024-7 has no Hoare annotation [2020-07-08 22:24:47,245 WARN L170 areAnnotationChecker]: L1019-1 has no Hoare annotation [2020-07-08 22:24:47,245 WARN L170 areAnnotationChecker]: L1019-3 has no Hoare annotation [2020-07-08 22:24:47,246 WARN L170 areAnnotationChecker]: L1024-1 has no Hoare annotation [2020-07-08 22:24:47,246 WARN L170 areAnnotationChecker]: L1024-4 has no Hoare annotation [2020-07-08 22:24:47,246 WARN L170 areAnnotationChecker]: L1025 has no Hoare annotation [2020-07-08 22:24:47,246 WARN L170 areAnnotationChecker]: L1021-7 has no Hoare annotation [2020-07-08 22:24:47,246 WARN L170 areAnnotationChecker]: L1021-7 has no Hoare annotation [2020-07-08 22:24:47,246 WARN L170 areAnnotationChecker]: L1024-2 has no Hoare annotation [2020-07-08 22:24:47,246 WARN L170 areAnnotationChecker]: L1024-2 has no Hoare annotation [2020-07-08 22:24:47,246 WARN L170 areAnnotationChecker]: L1024-5 has no Hoare annotation [2020-07-08 22:24:47,246 WARN L170 areAnnotationChecker]: L1024-5 has no Hoare annotation [2020-07-08 22:24:47,247 WARN L170 areAnnotationChecker]: L1025-1 has no Hoare annotation [2020-07-08 22:24:47,247 WARN L170 areAnnotationChecker]: L1021-1 has no Hoare annotation [2020-07-08 22:24:47,247 WARN L170 areAnnotationChecker]: L1021-1 has no Hoare annotation [2020-07-08 22:24:47,247 WARN L170 areAnnotationChecker]: L1021-8 has no Hoare annotation [2020-07-08 22:24:47,247 WARN L170 areAnnotationChecker]: L1026-7 has no Hoare annotation [2020-07-08 22:24:47,247 WARN L170 areAnnotationChecker]: L1026-7 has no Hoare annotation [2020-07-08 22:24:47,247 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2020-07-08 22:24:47,247 WARN L170 areAnnotationChecker]: L1021-5 has no Hoare annotation [2020-07-08 22:24:47,247 WARN L170 areAnnotationChecker]: L1022 has no Hoare annotation [2020-07-08 22:24:47,247 WARN L170 areAnnotationChecker]: L1026-1 has no Hoare annotation [2020-07-08 22:24:47,248 WARN L170 areAnnotationChecker]: L1026-1 has no Hoare annotation [2020-07-08 22:24:47,248 WARN L170 areAnnotationChecker]: L1026-8 has no Hoare annotation [2020-07-08 22:24:47,248 WARN L170 areAnnotationChecker]: L1021-3 has no Hoare annotation [2020-07-08 22:24:47,248 WARN L170 areAnnotationChecker]: L1021-3 has no Hoare annotation [2020-07-08 22:24:47,248 WARN L170 areAnnotationChecker]: L1021-6 has no Hoare annotation [2020-07-08 22:24:47,248 WARN L170 areAnnotationChecker]: L1021-6 has no Hoare annotation [2020-07-08 22:24:47,248 WARN L170 areAnnotationChecker]: L1022-1 has no Hoare annotation [2020-07-08 22:24:47,248 WARN L170 areAnnotationChecker]: L1026-2 has no Hoare annotation [2020-07-08 22:24:47,249 WARN L170 areAnnotationChecker]: L1026-5 has no Hoare annotation [2020-07-08 22:24:47,249 WARN L170 areAnnotationChecker]: L1034-1 has no Hoare annotation [2020-07-08 22:24:47,249 WARN L170 areAnnotationChecker]: L1034-1 has no Hoare annotation [2020-07-08 22:24:47,249 WARN L170 areAnnotationChecker]: L1026-3 has no Hoare annotation [2020-07-08 22:24:47,249 WARN L170 areAnnotationChecker]: L1026-3 has no Hoare annotation [2020-07-08 22:24:47,249 WARN L170 areAnnotationChecker]: L1026-6 has no Hoare annotation [2020-07-08 22:24:47,249 WARN L170 areAnnotationChecker]: L1026-6 has no Hoare annotation [2020-07-08 22:24:47,250 WARN L170 areAnnotationChecker]: L1036-6 has no Hoare annotation [2020-07-08 22:24:47,250 WARN L170 areAnnotationChecker]: L1036-6 has no Hoare annotation [2020-07-08 22:24:47,250 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2020-07-08 22:24:47,250 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2020-07-08 22:24:47,250 WARN L170 areAnnotationChecker]: L1036 has no Hoare annotation [2020-07-08 22:24:47,250 WARN L170 areAnnotationChecker]: L1036 has no Hoare annotation [2020-07-08 22:24:47,250 WARN L170 areAnnotationChecker]: L1036-7 has no Hoare annotation [2020-07-08 22:24:47,250 WARN L170 areAnnotationChecker]: L1030-2 has no Hoare annotation [2020-07-08 22:24:47,250 WARN L170 areAnnotationChecker]: L1030-4 has no Hoare annotation [2020-07-08 22:24:47,250 WARN L170 areAnnotationChecker]: L1036-1 has no Hoare annotation [2020-07-08 22:24:47,250 WARN L170 areAnnotationChecker]: L1036-4 has no Hoare annotation [2020-07-08 22:24:47,251 WARN L170 areAnnotationChecker]: L1037 has no Hoare annotation [2020-07-08 22:24:47,251 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2020-07-08 22:24:47,251 WARN L170 areAnnotationChecker]: L1036-2 has no Hoare annotation [2020-07-08 22:24:47,251 WARN L170 areAnnotationChecker]: L1036-2 has no Hoare annotation [2020-07-08 22:24:47,251 WARN L170 areAnnotationChecker]: L1036-5 has no Hoare annotation [2020-07-08 22:24:47,251 WARN L170 areAnnotationChecker]: L1036-5 has no Hoare annotation [2020-07-08 22:24:47,251 WARN L170 areAnnotationChecker]: L1037-1 has no Hoare annotation [2020-07-08 22:24:47,251 WARN L170 areAnnotationChecker]: L1033 has no Hoare annotation [2020-07-08 22:24:47,251 WARN L170 areAnnotationChecker]: L1038 has no Hoare annotation [2020-07-08 22:24:47,251 WARN L170 areAnnotationChecker]: L1033-1 has no Hoare annotation [2020-07-08 22:24:47,252 WARN L170 areAnnotationChecker]: L1038-1 has no Hoare annotation [2020-07-08 22:24:47,252 WARN L170 areAnnotationChecker]: L1033-2 has no Hoare annotation [2020-07-08 22:24:47,252 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 22:24:47,252 WARN L170 areAnnotationChecker]: L1034 has no Hoare annotation [2020-07-08 22:24:47,252 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 22:24:47,252 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-08 22:24:47,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 10:24:47 BoogieIcfgContainer [2020-07-08 22:24:47,258 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 22:24:47,262 INFO L168 Benchmark]: Toolchain (without parser) took 19237.68 ms. Allocated memory was 144.2 MB in the beginning and 443.5 MB in the end (delta: 299.4 MB). Free memory was 100.5 MB in the beginning and 395.2 MB in the end (delta: -294.7 MB). Peak memory consumption was 4.6 MB. Max. memory is 7.1 GB. [2020-07-08 22:24:47,263 INFO L168 Benchmark]: CDTParser took 0.26 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: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 22:24:47,269 INFO L168 Benchmark]: CACSL2BoogieTranslator took 710.57 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 100.3 MB in the beginning and 167.2 MB in the end (delta: -67.0 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. [2020-07-08 22:24:47,270 INFO L168 Benchmark]: Boogie Preprocessor took 72.85 ms. Allocated memory is still 201.3 MB. Free memory was 167.2 MB in the beginning and 163.2 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2020-07-08 22:24:47,273 INFO L168 Benchmark]: RCFGBuilder took 883.90 ms. Allocated memory is still 201.3 MB. Free memory was 163.2 MB in the beginning and 96.3 MB in the end (delta: 66.9 MB). Peak memory consumption was 66.9 MB. Max. memory is 7.1 GB. [2020-07-08 22:24:47,274 INFO L168 Benchmark]: TraceAbstraction took 17562.51 ms. Allocated memory was 201.3 MB in the beginning and 443.5 MB in the end (delta: 242.2 MB). Free memory was 95.6 MB in the beginning and 395.2 MB in the end (delta: -299.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-08 22:24:47,285 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.26 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: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 710.57 ms. Allocated memory was 144.2 MB in the beginning and 201.3 MB in the end (delta: 57.1 MB). Free memory was 100.3 MB in the beginning and 167.2 MB in the end (delta: -67.0 MB). Peak memory consumption was 22.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 72.85 ms. Allocated memory is still 201.3 MB. Free memory was 167.2 MB in the beginning and 163.2 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 883.90 ms. Allocated memory is still 201.3 MB. Free memory was 163.2 MB in the beginning and 96.3 MB in the end (delta: 66.9 MB). Peak memory consumption was 66.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17562.51 ms. Allocated memory was 201.3 MB in the beginning and 443.5 MB in the end (delta: 242.2 MB). Free memory was 95.6 MB in the beginning and 395.2 MB in the end (delta: -299.6 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1026]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L993] SLL* head = malloc(sizeof(SLL)); VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L994] head->next = ((void*)0) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L995] head->prev = ((void*)0) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L996] head->data = 0 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}] [L998] SLL* x = head; VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}] [L1001] COND FALSE !(__VERIFIER_nondet_int()) VAL [__VERIFIER_nondet_int()=0, head={-1:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}] [L1010] x->data = 1 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, x={-1:0}] [L1011] x->next = malloc(sizeof(SLL)) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}] [L1012] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}, x->next={-2:0}] [L1012] x->next->prev = x VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}, x->next={-2:0}] [L1013] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}, x->next={-2:0}] [L1013] x->next->data = 2 VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}, x->next={-2:0}] [L1015] x = head VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}] [L1017] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}] [L1019] EXPR x->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}, x->data=1] [L1019] COND FALSE !(1 != x->data) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}, x->data=1] [L1024] EXPR x->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}, x->data=1] [L1024] COND FALSE !(!(1 == x->data)) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}, x->data=1] [L1025] EXPR x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-1:0}, x->next={-2:0}] [L1025] x = x->next VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-2:0}, x->next={-2:0}] [L1026] EXPR x->data VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-2:0}, x->data=2] [L1026] COND TRUE !(2 != x->data) VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-2:0}, x->data=2] [L1026] __VERIFIER_error() VAL [head={-1:0}, malloc(sizeof(SLL))={-1:0}, malloc(sizeof(SLL))={-2:0}, x={-2:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 101 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.3s, OverallIterations: 7, TraceHistogramMax: 2, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 425 SDtfs, 1378 SDslu, 1662 SDs, 0 SdLazy, 1859 SolverSat, 148 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=113occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 6 MinimizatonAttempts, 243 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 234 NumberOfCodeBlocks, 234 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 186 ConstructedInterpolants, 0 QuantifiedInterpolants, 32087 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 4/13 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...