java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/SifaC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-queue-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-584d7b9 [2019-08-31 03:46:49,880 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-31 03:46:49,882 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-31 03:46:49,894 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-31 03:46:49,894 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-31 03:46:49,895 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-31 03:46:49,897 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-31 03:46:49,899 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-31 03:46:49,900 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-31 03:46:49,901 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-31 03:46:49,902 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-08-31 03:46:49,903 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-31 03:46:49,903 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-31 03:46:49,904 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-31 03:46:49,905 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-31 03:46:49,906 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-31 03:46:49,907 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-31 03:46:49,908 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-31 03:46:49,910 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-31 03:46:49,912 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-31 03:46:49,913 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-31 03:46:49,914 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-31 03:46:49,916 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-31 03:46:49,916 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-31 03:46:49,919 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-31 03:46:49,919 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-31 03:46:49,920 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-31 03:46:49,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-31 03:46:49,921 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-31 03:46:49,923 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-31 03:46:49,924 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-31 03:46:49,925 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-31 03:46:49,927 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-31 03:46:49,928 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-31 03:46:49,929 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-31 03:46:49,929 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-31 03:46:49,930 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-31 03:46:49,930 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-31 03:46:49,930 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-31 03:46:49,933 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-31 03:46:49,934 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-31 03:46:49,936 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-08-31 03:46:49,963 INFO L113 SettingsManager]: Loading preferences was successful [2019-08-31 03:46:49,963 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-08-31 03:46:49,965 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-08-31 03:46:49,965 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-08-31 03:46:49,965 INFO L138 SettingsManager]: * Use SBE=true [2019-08-31 03:46:49,965 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-08-31 03:46:49,965 INFO L138 SettingsManager]: * sizeof long=4 [2019-08-31 03:46:49,966 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-08-31 03:46:49,966 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-08-31 03:46:49,966 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-08-31 03:46:49,967 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-08-31 03:46:49,967 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-08-31 03:46:49,967 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-08-31 03:46:49,968 INFO L138 SettingsManager]: * sizeof long double=12 [2019-08-31 03:46:49,968 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-08-31 03:46:49,968 INFO L138 SettingsManager]: * Use constant arrays=true [2019-08-31 03:46:49,968 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-08-31 03:46:49,969 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-08-31 03:46:49,969 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-08-31 03:46:49,969 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-08-31 03:46:49,970 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-08-31 03:46:49,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-08-31 03:46:49,970 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-08-31 03:46:49,970 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-08-31 03:46:49,970 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-08-31 03:46:49,971 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-08-31 03:46:49,971 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-08-31 03:46:49,971 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-08-31 03:46:49,971 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-08-31 03:46:50,019 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-31 03:46:50,031 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-31 03:46:50,035 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-31 03:46:50,036 INFO L271 PluginConnector]: Initializing CDTParser... [2019-08-31 03:46:50,037 INFO L275 PluginConnector]: CDTParser initialized [2019-08-31 03:46:50,038 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-queue-1.i [2019-08-31 03:46:50,101 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a0c2fbee/6280c5f3bda94ec0b76fd374661771f7/FLAG0f33d39bc [2019-08-31 03:46:50,620 INFO L306 CDTParser]: Found 1 translation units. [2019-08-31 03:46:50,621 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-queue-1.i [2019-08-31 03:46:50,642 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a0c2fbee/6280c5f3bda94ec0b76fd374661771f7/FLAG0f33d39bc [2019-08-31 03:46:50,920 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a0c2fbee/6280c5f3bda94ec0b76fd374661771f7 [2019-08-31 03:46:50,929 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-31 03:46:50,931 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-31 03:46:50,932 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-08-31 03:46:50,932 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-08-31 03:46:50,936 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-08-31 03:46:50,937 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 03:46:50" (1/1) ... [2019-08-31 03:46:50,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e08dc9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:46:50, skipping insertion in model container [2019-08-31 03:46:50,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 03:46:50" (1/1) ... [2019-08-31 03:46:50,948 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-08-31 03:46:51,007 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-08-31 03:46:51,418 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-08-31 03:46:51,429 INFO L188 MainTranslator]: Completed pre-run [2019-08-31 03:46:51,484 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-08-31 03:46:51,543 INFO L192 MainTranslator]: Completed translation [2019-08-31 03:46:51,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:46:51 WrapperNode [2019-08-31 03:46:51,545 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-08-31 03:46:51,546 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-31 03:46:51,546 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-31 03:46:51,546 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-31 03:46:51,557 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:46:51" (1/1) ... [2019-08-31 03:46:51,557 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:46:51" (1/1) ... [2019-08-31 03:46:51,579 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:46:51" (1/1) ... [2019-08-31 03:46:51,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:46:51" (1/1) ... [2019-08-31 03:46:51,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:46:51" (1/1) ... [2019-08-31 03:46:51,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:46:51" (1/1) ... [2019-08-31 03:46:51,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:46:51" (1/1) ... [2019-08-31 03:46:51,660 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-31 03:46:51,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-31 03:46:51,661 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-31 03:46:51,661 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-31 03:46:51,663 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 03:46:51" (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 [2019-08-31 03:46:51,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-08-31 03:46:51,717 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-31 03:46:51,717 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-31 03:46:51,717 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-08-31 03:46:51,717 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-08-31 03:46:51,717 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-08-31 03:46:51,717 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-08-31 03:46:51,718 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-08-31 03:46:51,718 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-08-31 03:46:51,718 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-08-31 03:46:51,718 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-08-31 03:46:51,718 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-08-31 03:46:51,718 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-08-31 03:46:51,719 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-08-31 03:46:51,719 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-08-31 03:46:51,719 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-08-31 03:46:51,719 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-08-31 03:46:51,719 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-08-31 03:46:51,720 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-08-31 03:46:51,720 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-08-31 03:46:51,720 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-08-31 03:46:51,720 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-08-31 03:46:51,720 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-08-31 03:46:51,720 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-08-31 03:46:51,721 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-08-31 03:46:51,721 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-08-31 03:46:51,721 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-08-31 03:46:51,721 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-08-31 03:46:51,721 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-08-31 03:46:51,721 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-08-31 03:46:51,722 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-08-31 03:46:51,722 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-08-31 03:46:51,722 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-08-31 03:46:51,722 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-08-31 03:46:51,722 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-08-31 03:46:51,722 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-08-31 03:46:51,723 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-08-31 03:46:51,723 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-08-31 03:46:51,723 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-08-31 03:46:51,723 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-08-31 03:46:51,723 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-08-31 03:46:51,723 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-08-31 03:46:51,724 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-08-31 03:46:51,724 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-08-31 03:46:51,724 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-08-31 03:46:51,724 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-08-31 03:46:51,724 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-08-31 03:46:51,724 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-08-31 03:46:51,724 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-08-31 03:46:51,725 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-08-31 03:46:51,725 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-08-31 03:46:51,725 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-08-31 03:46:51,725 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-08-31 03:46:51,725 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-08-31 03:46:51,725 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-08-31 03:46:51,726 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-08-31 03:46:51,726 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-08-31 03:46:51,726 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-08-31 03:46:51,726 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-08-31 03:46:51,726 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-08-31 03:46:51,726 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-08-31 03:46:51,726 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-08-31 03:46:51,727 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-08-31 03:46:51,727 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-08-31 03:46:51,727 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-08-31 03:46:51,727 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-08-31 03:46:51,727 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-08-31 03:46:51,727 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-08-31 03:46:51,728 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-08-31 03:46:51,728 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-08-31 03:46:51,728 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-08-31 03:46:51,728 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-08-31 03:46:51,728 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-08-31 03:46:51,728 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-08-31 03:46:51,729 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-08-31 03:46:51,729 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-08-31 03:46:51,729 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-08-31 03:46:51,729 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-08-31 03:46:51,729 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-08-31 03:46:51,729 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-08-31 03:46:51,729 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-08-31 03:46:51,730 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-08-31 03:46:51,730 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-08-31 03:46:51,730 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-08-31 03:46:51,730 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-08-31 03:46:51,730 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-08-31 03:46:51,730 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-08-31 03:46:51,731 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-08-31 03:46:51,731 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-08-31 03:46:51,731 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-08-31 03:46:51,731 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-08-31 03:46:51,731 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-08-31 03:46:51,731 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-08-31 03:46:51,732 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-08-31 03:46:51,732 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-08-31 03:46:51,732 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-08-31 03:46:51,732 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-08-31 03:46:51,732 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-08-31 03:46:51,732 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-08-31 03:46:51,732 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-08-31 03:46:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-08-31 03:46:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-08-31 03:46:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-08-31 03:46:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-08-31 03:46:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-08-31 03:46:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-08-31 03:46:51,733 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-08-31 03:46:51,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-08-31 03:46:51,734 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-31 03:46:51,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-08-31 03:46:51,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-08-31 03:46:51,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-08-31 03:46:51,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-08-31 03:46:51,734 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-08-31 03:46:51,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-08-31 03:46:51,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-08-31 03:46:51,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-31 03:46:52,409 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-31 03:46:52,409 INFO L283 CfgBuilder]: Removed 31 assume(true) statements. [2019-08-31 03:46:52,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 03:46:52 BoogieIcfgContainer [2019-08-31 03:46:52,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-31 03:46:52,411 INFO L113 PluginConnector]: ------------------------Sifa---------------------------- [2019-08-31 03:46:52,411 INFO L271 PluginConnector]: Initializing Sifa... [2019-08-31 03:46:52,412 INFO L275 PluginConnector]: Sifa initialized [2019-08-31 03:46:52,413 INFO L185 PluginConnector]: Executing the observer SifaObserver from plugin Sifa for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 03:46:52" (1/1) ... [2019-08-31 03:46:52,450 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-08-31 03:46:52,451 INFO L169 IcfgInterpreter]: Building call graph [2019-08-31 03:46:52,460 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-08-31 03:46:52,469 INFO L179 IcfgInterpreter]: Starting interpretation [2019-08-31 03:46:52,470 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-08-31 03:46:52,562 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-08-31 03:46:52,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 03:46:52,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:46:52,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-08-31 03:46:52,589 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-08-31 03:46:52,605 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 27 for LOIs [2019-08-31 03:46:53,744 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:46:53,934 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 66 [2019-08-31 03:46:53,935 INFO L567 ElimStorePlain]: treesize reduction 9, result has 92.9 percent of original size [2019-08-31 03:46:53,936 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:46:53,937 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:138, output treesize:117 [2019-08-31 03:46:53,969 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_9|], 4=[|v_#memory_$Pointer$.base_26|, |v_#memory_$Pointer$.offset_26|]} [2019-08-31 03:46:53,981 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:46:54,377 WARN L188 SmtUtils]: Spent 394.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-08-31 03:46:54,377 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:46:54,387 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:46:54,645 WARN L188 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-08-31 03:46:54,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:46:54,654 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:46:54,864 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-08-31 03:46:54,864 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:46:54,866 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-08-31 03:46:54,866 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:217, output treesize:214 [2019-08-31 03:46:54,893 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:46:55,211 WARN L188 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-08-31 03:46:55,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:46:55,214 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-08-31 03:46:55,215 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:249, output treesize:237 [2019-08-31 03:46:55,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:46:55,323 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:46:55,334 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:46:57,570 WARN L188 SmtUtils]: Spent 2.24 s on a formula simplification. DAG size of input: 137 DAG size of output: 123 [2019-08-31 03:46:57,571 INFO L567 ElimStorePlain]: treesize reduction 362, result has 49.4 percent of original size [2019-08-31 03:46:57,600 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:46:58,678 WARN L188 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 119 [2019-08-31 03:46:58,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:46:58,693 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:47:00,117 WARN L188 SmtUtils]: Spent 1.42 s on a formula simplification that was a NOOP. DAG size: 116 [2019-08-31 03:47:00,118 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:47:00,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2019-08-31 03:47:00,122 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:663, output treesize:418 [2019-08-31 03:47:00,205 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:47:01,871 WARN L188 SmtUtils]: Spent 1.66 s on a formula simplification that was a NOOP. DAG size: 124 [2019-08-31 03:47:01,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:47:01,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2019-08-31 03:47:01,873 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:453, output treesize:441 [2019-08-31 03:47:02,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:47:02,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:47:02,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:47:02,297 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:47:02,308 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:47:02,340 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:47:02,356 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:47:48,567 WARN L188 SmtUtils]: Spent 46.21 s on a formula simplification. DAG size of input: 220 DAG size of output: 200 [2019-08-31 03:47:48,568 INFO L567 ElimStorePlain]: treesize reduction 1015, result has 49.6 percent of original size [2019-08-31 03:47:48,597 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:47:48,623 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:48:06,497 WARN L188 SmtUtils]: Spent 17.87 s on a formula simplification that was a NOOP. DAG size: 201 [2019-08-31 03:48:06,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:48:06,511 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:48:06,528 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:48:31,937 WARN L188 SmtUtils]: Spent 25.41 s on a formula simplification that was a NOOP. DAG size: 202 [2019-08-31 03:48:31,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:48:31,941 INFO L496 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 3 dim-2 vars, End of recursive call: 23 dim-0 vars, and 2 xjuncts. [2019-08-31 03:48:31,942 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 19 variables, input treesize:1739, output treesize:1224 [2019-08-31 03:48:32,950 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:48:33,947 WARN L188 SmtUtils]: Spent 996.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2019-08-31 03:48:33,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:48:33,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2019-08-31 03:48:33,949 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:453, output treesize:441 [2019-08-31 03:48:33,988 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-08-31 03:48:38,908 WARN L188 SmtUtils]: Spent 4.92 s on a formula simplification that was a NOOP. DAG size: 152 [2019-08-31 03:48:38,909 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:48:38,911 INFO L496 ElimStorePlain]: Start of recursive call 1: 14 dim-0 vars, 1 dim-2 vars, End of recursive call: 15 dim-0 vars, and 1 xjuncts. [2019-08-31 03:48:38,911 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 15 variables, input treesize:840, output treesize:828 [2019-08-31 03:48:38,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:38,942 INFO L392 ElimStorePlain]: Different costs {0=[|v_#length_11|], 1=[|v_#valid_18|]} [2019-08-31 03:48:38,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 125 [2019-08-31 03:48:38,957 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:38,973 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 125 [2019-08-31 03:48:38,973 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:38,989 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 125 [2019-08-31 03:48:38,990 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:39,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 125 [2019-08-31 03:48:39,007 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:39,339 WARN L188 SmtUtils]: Spent 331.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-08-31 03:48:39,339 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:48:39,366 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 122 [2019-08-31 03:48:39,367 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:39,411 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 122 [2019-08-31 03:48:39,412 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:39,434 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 122 [2019-08-31 03:48:39,435 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:39,450 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 122 [2019-08-31 03:48:39,451 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:39,756 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-08-31 03:48:39,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:48:39,758 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_35|, |v_#memory_int_29|, |v_#memory_$Pointer$.offset_35|], 2=[|v_#memory_int_9|]} [2019-08-31 03:48:39,804 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:48:39,805 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 130 [2019-08-31 03:48:39,805 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:39,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:48:39,833 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 106 [2019-08-31 03:48:39,834 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:39,851 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:48:39,862 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 106 [2019-08-31 03:48:39,862 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:39,895 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:48:39,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 119 treesize of output 130 [2019-08-31 03:48:39,896 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:40,440 WARN L188 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-08-31 03:48:40,440 INFO L567 ElimStorePlain]: treesize reduction 32, result has 93.2 percent of original size [2019-08-31 03:48:40,451 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 91 [2019-08-31 03:48:40,451 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:40,461 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 99 [2019-08-31 03:48:40,462 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:40,473 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 99 [2019-08-31 03:48:40,473 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:40,482 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 91 [2019-08-31 03:48:40,482 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:40,736 WARN L188 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-08-31 03:48:40,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:48:40,751 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 78 [2019-08-31 03:48:40,751 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:40,783 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:48:40,783 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 110 [2019-08-31 03:48:40,784 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:40,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 78 [2019-08-31 03:48:40,800 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:40,828 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:48:40,829 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 110 [2019-08-31 03:48:40,829 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:41,165 WARN L188 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-08-31 03:48:41,166 INFO L567 ElimStorePlain]: treesize reduction 32, result has 91.5 percent of original size [2019-08-31 03:48:41,173 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 63 [2019-08-31 03:48:41,174 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:41,181 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 63 [2019-08-31 03:48:41,182 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:41,190 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 79 [2019-08-31 03:48:41,190 INFO L496 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:41,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 79 [2019-08-31 03:48:41,197 INFO L496 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:41,340 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-08-31 03:48:41,341 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:48:41,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:41,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:41,344 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, 4 dim-2 vars, End of recursive call: 8 dim-0 vars, and 4 xjuncts. [2019-08-31 03:48:41,345 INFO L221 ElimStorePlain]: Needed 25 recursive calls to eliminate 8 variables, input treesize:505, output treesize:285 [2019-08-31 03:48:41,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:41,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:41,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:41,361 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:41,370 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_30|], 30=[|v_#memory_$Pointer$.base_36|, |v_#memory_$Pointer$.offset_36|]} [2019-08-31 03:48:41,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 99 [2019-08-31 03:48:41,391 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:41,407 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:48:41,408 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 1 [2019-08-31 03:48:41,408 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:41,428 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 113 [2019-08-31 03:48:41,429 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:41,448 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 113 [2019-08-31 03:48:41,449 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:41,469 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 99 [2019-08-31 03:48:41,470 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:41,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:48:41,488 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 1 [2019-08-31 03:48:41,488 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:41,793 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 57 [2019-08-31 03:48:41,794 INFO L567 ElimStorePlain]: treesize reduction 234, result has 44.9 percent of original size [2019-08-31 03:48:41,802 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:48:41,807 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 79 [2019-08-31 03:48:41,808 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:41,817 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:48:41,821 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 79 [2019-08-31 03:48:41,821 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:41,929 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-08-31 03:48:41,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:48:41,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:48:41,944 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 60 [2019-08-31 03:48:41,944 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:41,954 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:48:41,956 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 60 [2019-08-31 03:48:41,957 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:42,034 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:48:42,035 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-08-31 03:48:42,036 INFO L221 ElimStorePlain]: Needed 11 recursive calls to eliminate 11 variables, input treesize:675, output treesize:115 [2019-08-31 03:48:42,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:42,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:42,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:42,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:42,052 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_31|], 30=[|v_#memory_$Pointer$.base_37|, |v_#memory_$Pointer$.offset_37|]} [2019-08-31 03:48:42,081 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 113 [2019-08-31 03:48:42,082 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:42,097 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 113 [2019-08-31 03:48:42,098 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:42,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 113 [2019-08-31 03:48:42,115 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:42,131 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 113 [2019-08-31 03:48:42,132 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:42,149 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 99 [2019-08-31 03:48:42,150 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:42,163 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 99 [2019-08-31 03:48:42,164 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:42,426 WARN L188 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 58 [2019-08-31 03:48:42,427 INFO L567 ElimStorePlain]: treesize reduction 460, result has 29.3 percent of original size [2019-08-31 03:48:42,448 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:48:42,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 79 [2019-08-31 03:48:42,460 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:42,468 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:48:42,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 79 [2019-08-31 03:48:42,471 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:42,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:48:42,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:48:42,566 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 60 [2019-08-31 03:48:42,566 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:42,572 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:48:42,575 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 60 [2019-08-31 03:48:42,575 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:42,642 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:48:42,643 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-08-31 03:48:42,644 INFO L221 ElimStorePlain]: Needed 11 recursive calls to eliminate 11 variables, input treesize:675, output treesize:115 [2019-08-31 03:48:42,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:42,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:42,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:42,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:42,666 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_32|], 30=[|v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.offset_38|]} [2019-08-31 03:48:42,681 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 99 [2019-08-31 03:48:42,682 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:42,698 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 99 [2019-08-31 03:48:42,699 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:42,756 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:48:42,756 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 1 [2019-08-31 03:48:42,757 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:42,771 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:48:42,772 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 1 [2019-08-31 03:48:42,772 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:42,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:48:42,784 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 1 [2019-08-31 03:48:42,784 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:42,794 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:48:42,794 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 1 [2019-08-31 03:48:42,795 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:43,008 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 58 [2019-08-31 03:48:43,009 INFO L567 ElimStorePlain]: treesize reduction 8, result has 96.0 percent of original size [2019-08-31 03:48:43,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:48:43,021 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 79 [2019-08-31 03:48:43,021 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:43,028 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:48:43,031 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 79 [2019-08-31 03:48:43,031 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:43,119 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:48:43,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:48:43,130 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 60 [2019-08-31 03:48:43,131 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:43,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-08-31 03:48:43,139 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 60 [2019-08-31 03:48:43,139 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-08-31 03:48:43,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-08-31 03:48:43,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-08-31 03:48:43,207 INFO L221 ElimStorePlain]: Needed 11 recursive calls to eliminate 11 variables, input treesize:675, output treesize:115 [2019-08-31 03:48:46,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,375 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,382 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,481 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,487 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,509 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,556 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,780 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:46,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:47,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:47,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:47,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:47,170 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:47,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:47,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:47,233 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:47,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:47,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:47,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:47,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-31 03:48:47,323 INFO L183 IcfgInterpreter]: Interpretation finished [2019-08-31 03:48:47,323 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-08-31 03:48:47,328 INFO L193 IcfgInterpreter]: Reachable states at location mainErr9ASSERT_VIOLATIONERROR_FUNCTION satisfy 14666#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (<= 3 main_~status~0) (<= main_~status~0 3) (or (not (= main_~status~0 2)) (and (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (<= 2 main_~status~0) (<= main_~status~0 2) (or (and (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) (and (or (not (= 0 main_~item~0.offset)) (not (= main_~item~0.base 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= main_~status~0 1)) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))))) (= main_~status~0 3) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) [2019-08-31 03:48:47,328 INFO L193 IcfgInterpreter]: Reachable states at location mainErr12ASSERT_VIOLATIONERROR_FUNCTION satisfy 13936#(and (<= 3 main_~status~0) (<= main_~status~0 3) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) 4)) 3))) [2019-08-31 03:48:47,329 INFO L193 IcfgInterpreter]: Reachable states at location mainErr8ASSERT_VIOLATIONERROR_FUNCTION satisfy 14745#(and (= 0 main_~head~0.offset) (<= 0 main_~head~0.base) (= 0 main_~head~0.base) (<= 3 main_~status~0) (<= main_~status~0 3) (<= main_~head~0.offset 0) (or (not (= main_~status~0 2)) (and (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (<= 2 main_~status~0) (<= main_~status~0 2) (or (and (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) (and (or (not (= 0 main_~item~0.offset)) (not (= main_~item~0.base 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= main_~status~0 1)) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))))) (<= main_~head~0.base 0) (<= 0 main_~head~0.offset) (= main_~status~0 3)) [2019-08-31 03:48:47,329 INFO L193 IcfgInterpreter]: Reachable states at location mainErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 6542#(and (= 0 main_~head~0.offset) (<= 0 main_~head~0.base) (= 0 main_~head~0.base) (<= main_~head~0.offset 0) (<= main_~head~0.base 0) (<= 0 main_~head~0.offset)) [2019-08-31 03:48:47,329 INFO L193 IcfgInterpreter]: Reachable states at location mainErr1ASSERT_VIOLATIONERROR_FUNCTION satisfy 6536#(and (<= 0 main_~item~0.base) (= 0 main_~item~0.offset) (<= main_~item~0.base 0) (= main_~item~0.base 0) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (<= 0 main_~item~0.offset) (<= main_~item~0.offset 0)) [2019-08-31 03:48:47,330 INFO L193 IcfgInterpreter]: Reachable states at location mainErr4ASSERT_VIOLATIONERROR_FUNCTION satisfy 11956#true [2019-08-31 03:48:47,330 INFO L193 IcfgInterpreter]: Reachable states at location mainErr13ASSERT_VIOLATIONERROR_FUNCTION satisfy 14436#(and (not (= main_~status~0 0)) (<= (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4)) 0)) [2019-08-31 03:48:47,330 INFO L193 IcfgInterpreter]: Reachable states at location mainErr2ASSERT_VIOLATIONERROR_FUNCTION satisfy 6924#(and (= 0 main_~head~0.offset) (<= 0 main_~head~0.base) (= 0 main_~head~0.base) (<= main_~head~0.offset 0) (<= main_~head~0.base 0) (<= 0 main_~head~0.offset) (exists ((v_DerPreprocessor_1 Int)) (or (and (not (= 0 main_~item~0.offset)) (not (= 0 main_~head~0.base))) (and (not (= 0 main_~head~0.offset)) (not (= main_~item~0.base 0))) (and (not (= main_~item~0.base 0)) (not (= 0 main_~head~0.base))) (and (= (store |old(#memory_$Pointer$.offset)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.offset)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (+ main_~head~0.offset 4)))) |#memory_$Pointer$.offset|) (<= |#NULL.base| 0) (= 0 |main_#t~malloc0.offset|) (= main_~head~0.offset main_~item~0.offset) (= main_~status~0 0) (<= 0 |#NULL.base|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| main_~head~0.base (store (store (select |old(#memory_$Pointer$.base)| main_~head~0.base) main_~head~0.offset 0) (+ main_~head~0.offset 4) (select (select |#memory_$Pointer$.base| main_~head~0.base) (+ main_~head~0.offset 4))))) (= main_~item~0.base main_~head~0.base) (= 0 (select |old(#valid)| 0)) (= (store |old(#memory_int)| main_~head~0.base (store (store (select |old(#memory_int)| main_~head~0.base) main_~head~0.offset v_DerPreprocessor_1) (+ main_~head~0.offset 4) 0)) |#memory_int|) (= |main_#t~malloc0.base| main_~head~0.base) (= main_~head~0.offset |main_#t~malloc0.offset|) (= |#length| (store |old(#length)| |main_#t~malloc0.base| 8)) (= (select |old(#valid)| |main_#t~malloc0.base|) 0) (< |#StackHeapBarrier| |main_#t~malloc0.base|) (not (= |main_#t~malloc0.base| 0)) (= |#NULL.offset| 0) (= (store |old(#valid)| |main_#t~malloc0.base| 1) |#valid|)) (and (not (= 0 main_~item~0.offset)) (not (= 0 main_~head~0.offset)))))) [2019-08-31 03:48:47,331 INFO L193 IcfgInterpreter]: Reachable states at location mainErr7ASSERT_VIOLATIONERROR_FUNCTION satisfy 14553#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0) (<= 2 main_~status~0) (<= main_~status~0 2) (or (and (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) (and (or (not (= 0 main_~item~0.offset)) (not (= main_~item~0.base 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= main_~status~0 1)) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) [2019-08-31 03:48:47,331 INFO L193 IcfgInterpreter]: Reachable states at location mainErr6ASSERT_VIOLATIONERROR_FUNCTION satisfy 14699#(and (<= 2 main_~status~0) (<= main_~status~0 2) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (or (= main_~status~0 2) (and (or (not (= 0 main_~item~0.offset)) (not (= main_~item~0.base 0))) (= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= main_~status~0 1)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) [2019-08-31 03:48:47,331 INFO L193 IcfgInterpreter]: Reachable states at location mainErr5ASSERT_VIOLATIONERROR_FUNCTION satisfy 11980#(and (= 0 main_~head~0.offset) (<= 0 main_~head~0.base) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (= 0 main_~head~0.base) (<= main_~head~0.offset 0) (<= main_~head~0.base 0) (<= 0 main_~head~0.offset)) [2019-08-31 03:48:47,331 INFO L193 IcfgInterpreter]: Reachable states at location mainErr10ASSERT_VIOLATIONERROR_FUNCTION satisfy 14511#(and (or (not (= main_~status~0 2)) (and (or (and (or (not (= 0 main_~item~0.offset)) (not (= main_~item~0.base 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= main_~status~0 1))) (and (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0))) (and (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (and (or (not (= 0 main_~item~0.offset)) (not (= main_~item~0.base 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= main_~status~0 1)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (<= 2 main_~status~0) (<= main_~status~0 2))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (<= 3 main_~status~0) (<= main_~status~0 3) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0) (= main_~status~0 3) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) [2019-08-31 03:48:47,332 INFO L193 IcfgInterpreter]: Reachable states at location mainErr3ASSERT_VIOLATIONERROR_FUNCTION satisfy 11999#false [2019-08-31 03:48:47,332 INFO L193 IcfgInterpreter]: Reachable states at location mainErr11ASSERT_VIOLATIONERROR_FUNCTION satisfy 14310#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) 0) (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (<= 3 main_~status~0) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (<= main_~status~0 3) (= main_~status~0 3) (or (not (= main_~status~0 2)) (and (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (<= 2 main_~status~0) (<= main_~status~0 2) (or (and (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base)))) (and (or (not (= 0 main_~item~0.offset)) (not (= main_~item~0.base 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= main_~status~0 1))) (and (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (and (or (not (= 0 main_~item~0.offset)) (not (= main_~item~0.base 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= main_~status~0 1)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) [2019-08-31 03:48:47,370 INFO L103 SifaObserver]: ✘ Some error locations might be reachable, see reported results. [2019-08-31 03:48:47,371 INFO L132 PluginConnector]: ------------------------ END Sifa---------------------------- [2019-08-31 03:48:47,373 INFO L168 Benchmark]: Toolchain (without parser) took 116441.92 ms. Allocated memory was 132.1 MB in the beginning and 555.7 MB in the end (delta: 423.6 MB). Free memory was 86.0 MB in the beginning and 478.5 MB in the end (delta: -392.5 MB). Peak memory consumption was 31.1 MB. Max. memory is 7.1 GB. [2019-08-31 03:48:47,373 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 132.1 MB. Free memory is still 104.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-31 03:48:47,374 INFO L168 Benchmark]: CACSL2BoogieTranslator took 613.47 ms. Allocated memory was 132.1 MB in the beginning and 199.8 MB in the end (delta: 67.6 MB). Free memory was 85.5 MB in the beginning and 164.1 MB in the end (delta: -78.5 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. [2019-08-31 03:48:47,381 INFO L168 Benchmark]: Boogie Preprocessor took 114.50 ms. Allocated memory is still 199.8 MB. Free memory was 164.1 MB in the beginning and 160.0 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2019-08-31 03:48:47,381 INFO L168 Benchmark]: RCFGBuilder took 750.30 ms. Allocated memory is still 199.8 MB. Free memory was 160.0 MB in the beginning and 107.5 MB in the end (delta: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 7.1 GB. [2019-08-31 03:48:47,382 INFO L168 Benchmark]: Sifa took 114959.87 ms. Allocated memory was 199.8 MB in the beginning and 555.7 MB in the end (delta: 356.0 MB). Free memory was 107.5 MB in the beginning and 478.5 MB in the end (delta: -370.9 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-08-31 03:48:47,386 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 132.1 MB. Free memory is still 104.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 613.47 ms. Allocated memory was 132.1 MB in the beginning and 199.8 MB in the end (delta: 67.6 MB). Free memory was 85.5 MB in the beginning and 164.1 MB in the end (delta: -78.5 MB). Peak memory consumption was 27.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.50 ms. Allocated memory is still 199.8 MB. Free memory was 164.1 MB in the beginning and 160.0 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 750.30 ms. Allocated memory is still 199.8 MB. Free memory was 160.0 MB in the beginning and 107.5 MB in the end (delta: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 7.1 GB. * Sifa took 114959.87 ms. Allocated memory was 199.8 MB in the beginning and 555.7 MB in the end (delta: 356.0 MB). Free memory was 107.5 MB in the beginning and 478.5 MB in the end (delta: -370.9 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.sifa: - StatisticsResult: Symbolic Interpretation with Fluid Abstractions 114.9s OVERALL_TIME, 2 ICFG_INTERPRETER_ENTERED_PROCEDURES, 7612 DAG_INTERPRETER_EARLY_EXIT_QUERIES, 987 DAG_INTERPRETER_EARLY_EXITS, 5998 TOOLS_POST_APPLICATIONS, 109.2s TOOLS_POST_TIME, 2 TOOLS_POST_CALL_APPLICATIONS, 0.0s TOOLS_POST_CALL_TIME, 1 TOOLS_POST_RETURN_APPLICATIONS, 0.0s TOOLS_POST_RETURN_TIME, 108.9s TOOLS_QUANTIFIERELIM_TIME, 0.1s FLUID_QUERY_TIME, 8544 FLUID_QUERIES, 182 FLUID_YES_ANSWERS, 1848 DOMAIN_JOIN_APPLICATIONS, 1.0s DOMAIN_JOIN_TIME, 182 DOMAIN_ALPHA_APPLICATIONS, 0.2s DOMAIN_ALPHA_TIME, 2 DOMAIN_WIDEN_APPLICATIONS, 0.0s DOMAIN_WIDEN_TIME, 932 DOMAIN_ISSUBSETEQ_APPLICATIONS, 0.0s DOMAIN_ISSUBSETEQ_TIME, 2301 DOMAIN_ISBOTTOM_APPLICATIONS, 2.8s DOMAIN_ISBOTTOM_TIME, 1023 LOOP_SUMMARIZER_APPLICATIONS, 930 LOOP_SUMMARIZER_CACHE_MISSES, 109.7s LOOP_SUMMARIZER_OVERALL_TIME, 109.7s LOOP_SUMMARIZER_NEW_COMPUTATION_TIME, 932 LOOP_SUMMARIZER_FIXPOINT_ITERATIONS, 1 CALL_SUMMARIZER_APPLICATIONS, 1 CALL_SUMMARIZER_CACHE_MISSES, 0.1s CALL_SUMMARIZER_OVERALL_TIME, 0.1s CALL_SUMMARIZER_NEW_COMPUTATION_TIME, 0.0s PROCEDURE_GRAPH_BUILDER_TIME, 0.0s PATH_EXPR_TIME, 0.0s REGEX_TO_DAG_TIME, 1.0s DAG_COMPRESSION_TIME, 45132 DAG_COMPRESSION_PROCESSED_NODES, 17686 DAG_COMPRESSION_RETAINED_NODES - UnprovableResult [Line: 1032]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 14666#(and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (<= 3 main_~status~0) (<= main_~status~0 3) (or (not (= main_~status~0 2)) (and (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (<= 2 main_~status~0) (<= main_~status~0 2) (or (and (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) (and (or (not (= 0 main_~item~0.offset)) (not (= main_~item~0.base 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= main_~status~0 1)) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))))) (= main_~status~0 3) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))). Possible FailurePath: - UnprovableResult [Line: 1035]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 13936#(and (<= 3 main_~status~0) (<= main_~status~0 3) (not (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (+ (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) 4)) 3))). Possible FailurePath: - UnprovableResult [Line: 1031]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 14745#(and (= 0 main_~head~0.offset) (<= 0 main_~head~0.base) (= 0 main_~head~0.base) (<= 3 main_~status~0) (<= main_~status~0 3) (<= main_~head~0.offset 0) (or (not (= main_~status~0 2)) (and (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (<= 2 main_~status~0) (<= main_~status~0 2) (or (and (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) (and (or (not (= 0 main_~item~0.offset)) (not (= main_~item~0.base 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= main_~status~0 1)) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))))) (<= main_~head~0.base 0) (<= 0 main_~head~0.offset) (= main_~status~0 3)). Possible FailurePath: - UnprovableResult [Line: 1013]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 6542#(and (= 0 main_~head~0.offset) (<= 0 main_~head~0.base) (= 0 main_~head~0.base) (<= main_~head~0.offset 0) (<= main_~head~0.base 0) (<= 0 main_~head~0.offset)). Possible FailurePath: - UnprovableResult [Line: 1014]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 6536#(and (<= 0 main_~item~0.base) (= 0 main_~item~0.offset) (<= main_~item~0.base 0) (= main_~item~0.base 0) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (<= 0 main_~item~0.offset) (<= main_~item~0.offset 0)). Possible FailurePath: - UnprovableResult [Line: 1021]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 11956#true. Possible FailurePath: - UnprovableResult [Line: 1042]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 14436#(and (not (= main_~status~0 0)) (<= (select (select |#memory_int| main_~item~0.base) (+ main_~item~0.offset 4)) 0)). Possible FailurePath: - PositiveResult [Line: 1017]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - UnprovableResult [Line: 1027]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 14553#(and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0) (<= 2 main_~status~0) (<= main_~status~0 2) (or (and (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) (and (or (not (= 0 main_~item~0.offset)) (not (= main_~item~0.base 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= main_~status~0 1)) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))))) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)). Possible FailurePath: - UnprovableResult [Line: 1026]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 14699#(and (<= 2 main_~status~0) (<= main_~status~0 2) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (or (= main_~status~0 2) (and (or (not (= 0 main_~item~0.offset)) (not (= main_~item~0.base 0))) (= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= main_~status~0 1)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))). Possible FailurePath: - UnprovableResult [Line: 1025]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 11980#(and (= 0 main_~head~0.offset) (<= 0 main_~head~0.base) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (= 0 main_~head~0.base) (<= main_~head~0.offset 0) (<= main_~head~0.base 0) (<= 0 main_~head~0.offset)). Possible FailurePath: - UnprovableResult [Line: 1033]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 14511#(and (or (not (= main_~status~0 2)) (and (or (and (or (not (= 0 main_~item~0.offset)) (not (= main_~item~0.base 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= main_~status~0 1))) (and (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0))) (and (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (and (or (not (= 0 main_~item~0.offset)) (not (= main_~item~0.base 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= main_~status~0 1)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))) (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (<= 2 main_~status~0) (<= main_~status~0 2))) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (<= 3 main_~status~0) (<= main_~status~0 3) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0) (= main_~status~0 3) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))). Possible FailurePath: - PositiveResult [Line: 1020]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - UnprovableResult [Line: 1034]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: Over-approximation of reachable states at this location is 14310#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) 0) (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (<= 3 main_~status~0) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (<= main_~status~0 3) (= main_~status~0 3) (or (not (= main_~status~0 2)) (and (or (not (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)) 0))) (<= 2 main_~status~0) (<= main_~status~0 2) (or (and (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base)))) (and (or (not (= 0 main_~item~0.offset)) (not (= main_~item~0.base 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= main_~status~0 1))) (and (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (and (or (not (= 0 main_~item~0.offset)) (not (= main_~item~0.base 0))) (<= 2 main_~status~0) (= main_~status~0 2) (<= main_~status~0 2) (or (not (= 0 main_~head~0.offset)) (not (= 0 main_~head~0.base))) (not (= main_~status~0 1)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))))) (= 0 (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset)) (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset)))) (or (not (= (select (select |#memory_$Pointer$.base| main_~head~0.base) main_~head~0.offset) 0)) (not (= 0 (select (select |#memory_$Pointer$.offset| main_~head~0.base) main_~head~0.offset))))). Possible FailurePath: RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...