java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/heap-data/shared_mem2_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:35:09,906 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:35:09,908 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:35:09,921 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:35:09,921 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:35:09,922 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:35:09,923 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:35:09,925 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:35:09,927 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:35:09,928 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:35:09,929 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:35:09,929 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:35:09,930 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:35:09,931 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:35:09,932 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:35:09,933 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:35:09,934 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:35:09,937 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:35:09,942 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:35:09,946 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:35:09,948 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:35:09,952 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:35:09,957 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:35:09,957 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:35:09,957 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:35:09,958 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:35:09,959 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:35:09,960 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:35:09,961 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:35:09,962 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:35:09,962 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:35:09,963 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:35:09,963 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:35:09,963 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:35:09,964 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:35:09,965 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:35:09,965 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-14 16:35:09,984 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:35:09,984 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:35:09,985 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:35:09,985 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:35:09,986 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:35:09,986 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:35:09,986 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:35:09,986 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:35:09,987 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:35:09,987 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:35:09,987 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:35:09,987 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:35:09,987 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:35:09,987 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:35:09,992 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:35:09,992 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:35:09,992 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:35:09,992 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:35:09,992 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:35:09,993 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:35:09,993 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:35:09,993 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:35:09,993 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:35:09,993 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:35:09,994 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:35:09,994 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:35:09,994 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:35:09,994 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:35:09,994 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:35:09,994 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:35:09,996 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:35:09,997 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:35:10,049 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:35:10,062 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:35:10,065 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:35:10,067 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:35:10,068 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:35:10,068 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/shared_mem2_true-unreach-call.i [2018-11-14 16:35:10,126 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a5828f65/d9198e144b544cacad4e787ef8cb5ea1/FLAGb9e530aec [2018-11-14 16:35:10,610 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:35:10,611 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/shared_mem2_true-unreach-call.i [2018-11-14 16:35:10,626 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a5828f65/d9198e144b544cacad4e787ef8cb5ea1/FLAGb9e530aec [2018-11-14 16:35:10,640 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1a5828f65/d9198e144b544cacad4e787ef8cb5ea1 [2018-11-14 16:35:10,651 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:35:10,653 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:35:10,654 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:35:10,654 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:35:10,658 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:35:10,660 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:35:10" (1/1) ... [2018-11-14 16:35:10,663 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c60f040 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:10, skipping insertion in model container [2018-11-14 16:35:10,663 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:35:10" (1/1) ... [2018-11-14 16:35:10,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:35:10,743 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:35:11,155 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:35:11,172 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:35:11,227 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:35:11,303 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:35:11,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:11 WrapperNode [2018-11-14 16:35:11,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:35:11,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:35:11,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:35:11,305 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:35:11,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:11" (1/1) ... [2018-11-14 16:35:11,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:11" (1/1) ... [2018-11-14 16:35:11,423 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:11" (1/1) ... [2018-11-14 16:35:11,427 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:11" (1/1) ... [2018-11-14 16:35:11,488 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:11" (1/1) ... [2018-11-14 16:35:11,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:11" (1/1) ... [2018-11-14 16:35:11,498 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:11" (1/1) ... [2018-11-14 16:35:11,506 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:35:11,507 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:35:11,507 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:35:11,507 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:35:11,508 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:11" (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 [2018-11-14 16:35:11,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:35:11,568 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:35:11,568 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 16:35:11,568 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 16:35:11,568 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:35:11,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:35:11,569 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:35:11,569 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 16:35:11,569 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 16:35:11,569 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 16:35:11,569 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 16:35:11,570 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 16:35:11,570 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 16:35:11,570 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 16:35:11,570 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 16:35:11,570 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 16:35:11,570 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 16:35:11,571 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 16:35:11,571 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 16:35:11,571 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 16:35:11,571 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 16:35:11,571 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 16:35:11,571 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 16:35:11,572 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 16:35:11,572 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 16:35:11,572 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 16:35:11,572 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 16:35:11,572 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 16:35:11,572 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 16:35:11,573 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 16:35:11,573 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 16:35:11,573 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 16:35:11,573 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 16:35:11,573 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 16:35:11,573 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 16:35:11,574 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 16:35:11,574 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 16:35:11,574 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 16:35:11,574 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 16:35:11,574 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 16:35:11,574 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 16:35:11,575 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 16:35:11,575 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 16:35:11,575 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 16:35:11,575 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 16:35:11,575 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 16:35:11,575 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 16:35:11,575 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 16:35:11,576 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 16:35:11,576 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 16:35:11,576 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 16:35:11,576 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 16:35:11,576 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 16:35:11,576 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 16:35:11,577 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 16:35:11,577 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 16:35:11,577 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 16:35:11,577 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 16:35:11,577 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 16:35:11,577 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 16:35:11,577 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 16:35:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 16:35:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 16:35:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 16:35:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 16:35:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 16:35:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 16:35:11,578 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 16:35:11,579 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 16:35:11,579 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 16:35:11,579 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 16:35:11,579 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 16:35:11,579 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 16:35:11,579 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 16:35:11,580 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 16:35:11,580 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 16:35:11,580 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 16:35:11,580 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 16:35:11,580 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 16:35:11,580 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 16:35:11,580 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 16:35:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 16:35:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 16:35:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 16:35:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 16:35:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 16:35:11,581 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 16:35:11,582 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 16:35:11,582 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 16:35:11,582 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 16:35:11,582 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 16:35:11,582 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 16:35:11,582 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 16:35:11,583 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 16:35:11,583 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 16:35:11,583 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 16:35:11,583 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 16:35:11,583 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 16:35:11,583 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 16:35:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 16:35:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 16:35:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 16:35:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 16:35:11,584 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 16:35:11,585 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 16:35:11,585 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 16:35:11,585 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 16:35:11,585 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 16:35:11,585 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 16:35:11,585 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 16:35:11,586 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 16:35:11,586 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 16:35:11,586 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:35:11,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:35:11,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 16:35:11,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 16:35:11,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 16:35:11,587 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 16:35:11,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:35:11,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:35:11,587 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 16:35:11,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:35:12,641 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:35:12,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:35:12 BoogieIcfgContainer [2018-11-14 16:35:12,642 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:35:12,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:35:12,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:35:12,646 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:35:12,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:35:10" (1/3) ... [2018-11-14 16:35:12,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d75f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:35:12, skipping insertion in model container [2018-11-14 16:35:12,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:35:11" (2/3) ... [2018-11-14 16:35:12,648 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d75f53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:35:12, skipping insertion in model container [2018-11-14 16:35:12,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:35:12" (3/3) ... [2018-11-14 16:35:12,650 INFO L112 eAbstractionObserver]: Analyzing ICFG shared_mem2_true-unreach-call.i [2018-11-14 16:35:12,658 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:35:12,666 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:35:12,684 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:35:12,717 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:35:12,718 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:35:12,718 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:35:12,718 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:35:12,718 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:35:12,719 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:35:12,719 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:35:12,719 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:35:12,719 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:35:12,737 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-11-14 16:35:12,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-14 16:35:12,744 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:35:12,745 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:35:12,748 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:35:12,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:35:12,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1040483851, now seen corresponding path program 1 times [2018-11-14 16:35:12,759 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:35:12,760 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:35:12,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:35:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:12,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:12,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:35:12,955 INFO L256 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {26#true} is VALID [2018-11-14 16:35:12,959 INFO L273 TraceCheckUtils]: 1: Hoare triple {26#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {26#true} is VALID [2018-11-14 16:35:12,959 INFO L273 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2018-11-14 16:35:12,960 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #62#return; {26#true} is VALID [2018-11-14 16:35:12,960 INFO L256 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret16 := main(); {26#true} is VALID [2018-11-14 16:35:12,960 INFO L273 TraceCheckUtils]: 5: Hoare triple {26#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~intINTTYPE4(0bv32, ~m~0.base, ~m~0.offset, 4bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(1bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {26#true} is VALID [2018-11-14 16:35:12,961 INFO L273 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2018-11-14 16:35:12,961 INFO L273 TraceCheckUtils]: 7: Hoare triple {27#false} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {27#false} is VALID [2018-11-14 16:35:12,962 INFO L273 TraceCheckUtils]: 8: Hoare triple {27#false} assume !true; {27#false} is VALID [2018-11-14 16:35:12,962 INFO L273 TraceCheckUtils]: 9: Hoare triple {27#false} call #t~mem15 := read~intINTTYPE4(~m~0.base, ~m~0.offset, 4bv32); {27#false} is VALID [2018-11-14 16:35:12,962 INFO L273 TraceCheckUtils]: 10: Hoare triple {27#false} assume !(#t~mem15 == 100bv32);havoc #t~mem15; {27#false} is VALID [2018-11-14 16:35:12,963 INFO L273 TraceCheckUtils]: 11: Hoare triple {27#false} assume !false; {27#false} is VALID [2018-11-14 16:35:12,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:35:12,966 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:35:12,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:35:12,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:35:12,976 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-14 16:35:12,979 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:35:12,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:35:13,090 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:13,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:35:13,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:35:13,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:35:13,103 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2018-11-14 16:35:13,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:13,235 INFO L93 Difference]: Finished difference Result 37 states and 46 transitions. [2018-11-14 16:35:13,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:35:13,235 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-14 16:35:13,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:35:13,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:35:13,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2018-11-14 16:35:13,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:35:13,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 46 transitions. [2018-11-14 16:35:13,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 46 transitions. [2018-11-14 16:35:13,675 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:13,691 INFO L225 Difference]: With dead ends: 37 [2018-11-14 16:35:13,692 INFO L226 Difference]: Without dead ends: 19 [2018-11-14 16:35:13,697 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:35:13,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-14 16:35:13,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-14 16:35:13,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:35:13,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-14 16:35:13,822 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-14 16:35:13,822 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-14 16:35:13,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:13,828 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-11-14 16:35:13,829 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2018-11-14 16:35:13,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:13,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:13,830 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-14 16:35:13,830 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-14 16:35:13,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:13,838 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2018-11-14 16:35:13,839 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2018-11-14 16:35:13,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:13,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:13,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:35:13,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:35:13,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 16:35:13,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-11-14 16:35:13,850 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 12 [2018-11-14 16:35:13,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:35:13,851 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-14 16:35:13,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:35:13,851 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2018-11-14 16:35:13,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 16:35:13,852 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:35:13,853 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:35:13,853 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:35:13,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:35:13,854 INFO L82 PathProgramCache]: Analyzing trace with hash -732435650, now seen corresponding path program 1 times [2018-11-14 16:35:13,854 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:35:13,854 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:35:13,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:35:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:14,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:14,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:35:14,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-14 16:35:14,423 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:14,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-14 16:35:14,640 INFO L477 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 8 treesize of output 7 [2018-11-14 16:35:14,643 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:14,836 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-14 16:35:14,847 INFO L477 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 8 treesize of output 7 [2018-11-14 16:35:14,849 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:14,906 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:14,932 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:15,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 16:35:15,047 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:36, output treesize:19 [2018-11-14 16:35:15,073 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:35:15,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-14 16:35:15,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-14 16:35:15,326 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:15,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-14 16:35:15,369 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:15,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:15,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:15,381 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-14 16:35:15,386 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:35:15,464 INFO L256 TraceCheckUtils]: 0: Hoare triple {170#true} call ULTIMATE.init(); {170#true} is VALID [2018-11-14 16:35:15,464 INFO L273 TraceCheckUtils]: 1: Hoare triple {170#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {170#true} is VALID [2018-11-14 16:35:15,464 INFO L273 TraceCheckUtils]: 2: Hoare triple {170#true} assume true; {170#true} is VALID [2018-11-14 16:35:15,464 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {170#true} {170#true} #62#return; {170#true} is VALID [2018-11-14 16:35:15,465 INFO L256 TraceCheckUtils]: 4: Hoare triple {170#true} call #t~ret16 := main(); {170#true} is VALID [2018-11-14 16:35:15,468 INFO L273 TraceCheckUtils]: 5: Hoare triple {170#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~intINTTYPE4(0bv32, ~m~0.base, ~m~0.offset, 4bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(1bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {190#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (exists ((main_~head~0.offset (_ BitVec 32)) (|main_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))))} is VALID [2018-11-14 16:35:15,474 INFO L273 TraceCheckUtils]: 6: Hoare triple {190#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (exists ((main_~head~0.offset (_ BitVec 32)) (|main_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))))} assume true; {190#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (exists ((main_~head~0.offset (_ BitVec 32)) (|main_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))))} is VALID [2018-11-14 16:35:15,475 INFO L273 TraceCheckUtils]: 7: Hoare triple {190#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (exists ((main_~head~0.offset (_ BitVec 32)) (|main_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))))} assume !(#t~nondet4 != 0bv32);havoc #t~nondet4; {190#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (exists ((main_~head~0.offset (_ BitVec 32)) (|main_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))))} is VALID [2018-11-14 16:35:15,476 INFO L273 TraceCheckUtils]: 8: Hoare triple {190#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (exists ((main_~head~0.offset (_ BitVec 32)) (|main_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))))} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {190#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (exists ((main_~head~0.offset (_ BitVec 32)) (|main_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))))} is VALID [2018-11-14 16:35:15,476 INFO L273 TraceCheckUtils]: 9: Hoare triple {190#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (exists ((main_~head~0.offset (_ BitVec 32)) (|main_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))))} assume true; {190#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (exists ((main_~head~0.offset (_ BitVec 32)) (|main_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))))} is VALID [2018-11-14 16:35:15,481 INFO L273 TraceCheckUtils]: 10: Hoare triple {190#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (exists ((main_~head~0.offset (_ BitVec 32)) (|main_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))))} call #t~mem7 := read~intINTTYPE4(~m~0.base, ~m~0.offset, 4bv32); {206#(= (_ bv0 32) |main_#t~mem7|)} is VALID [2018-11-14 16:35:15,482 INFO L273 TraceCheckUtils]: 11: Hoare triple {206#(= (_ bv0 32) |main_#t~mem7|)} assume !~bvslt32(#t~mem7, 100bv32);havoc #t~mem7; {171#false} is VALID [2018-11-14 16:35:15,482 INFO L273 TraceCheckUtils]: 12: Hoare triple {171#false} call #t~mem15 := read~intINTTYPE4(~m~0.base, ~m~0.offset, 4bv32); {171#false} is VALID [2018-11-14 16:35:15,483 INFO L273 TraceCheckUtils]: 13: Hoare triple {171#false} assume !(#t~mem15 == 100bv32);havoc #t~mem15; {171#false} is VALID [2018-11-14 16:35:15,483 INFO L273 TraceCheckUtils]: 14: Hoare triple {171#false} assume !false; {171#false} is VALID [2018-11-14 16:35:15,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:35:15,486 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:35:15,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:35:15,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 16:35:15,492 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-14 16:35:15,492 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:35:15,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 16:35:15,549 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:15,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 16:35:15,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 16:35:15,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 16:35:15,551 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 4 states. [2018-11-14 16:35:16,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:16,080 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-14 16:35:16,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 16:35:16,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-11-14 16:35:16,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:35:16,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:35:16,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2018-11-14 16:35:16,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 16:35:16,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2018-11-14 16:35:16,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2018-11-14 16:35:16,225 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:16,228 INFO L225 Difference]: With dead ends: 32 [2018-11-14 16:35:16,228 INFO L226 Difference]: Without dead ends: 28 [2018-11-14 16:35:16,230 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:35:16,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-14 16:35:16,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-14 16:35:16,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:35:16,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-14 16:35:16,248 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 16:35:16,248 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 16:35:16,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:16,252 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-11-14 16:35:16,252 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2018-11-14 16:35:16,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:16,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:16,253 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 16:35:16,253 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 16:35:16,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:16,259 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-11-14 16:35:16,259 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2018-11-14 16:35:16,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:16,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:16,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:35:16,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:35:16,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 16:35:16,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2018-11-14 16:35:16,266 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 15 [2018-11-14 16:35:16,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:35:16,266 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-11-14 16:35:16,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 16:35:16,266 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2018-11-14 16:35:16,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 16:35:16,268 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:35:16,269 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:35:16,269 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:35:16,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:35:16,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1072678751, now seen corresponding path program 1 times [2018-11-14 16:35:16,272 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:35:16,273 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:35:16,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:35:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:16,370 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:35:16,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-14 16:35:16,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:16,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-14 16:35:16,510 INFO L477 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 8 treesize of output 7 [2018-11-14 16:35:16,512 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:16,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-14 16:35:16,561 INFO L477 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 8 treesize of output 7 [2018-11-14 16:35:16,563 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:16,634 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:16,671 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:16,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 16:35:16,687 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:39, output treesize:22 [2018-11-14 16:35:16,706 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:35:16,854 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:35:16,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 26 treesize of output 64 [2018-11-14 16:35:16,996 INFO L477 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 44 treesize of output 42 [2018-11-14 16:35:17,006 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:17,353 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:35:17,355 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-11-14 16:35:17,360 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:17,460 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 29 [2018-11-14 16:35:17,465 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-14 16:35:17,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-14 16:35:17,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-14 16:35:17,636 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:39, output treesize:95 [2018-11-14 16:35:17,660 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:35:17,816 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 33 [2018-11-14 16:35:18,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 29 [2018-11-14 16:35:18,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 16 treesize of output 7 [2018-11-14 16:35:18,106 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:18,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-14 16:35:18,132 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:18,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:18,191 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:35:18,194 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:35:18,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 29 [2018-11-14 16:35:18,218 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2018-11-14 16:35:18,226 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:18,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 11 treesize of output 3 [2018-11-14 16:35:18,245 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:18,253 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:18,278 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:35:18,278 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 7 variables, input treesize:67, output treesize:11 [2018-11-14 16:35:18,286 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:35:18,319 INFO L256 TraceCheckUtils]: 0: Hoare triple {352#true} call ULTIMATE.init(); {352#true} is VALID [2018-11-14 16:35:18,320 INFO L273 TraceCheckUtils]: 1: Hoare triple {352#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {352#true} is VALID [2018-11-14 16:35:18,320 INFO L273 TraceCheckUtils]: 2: Hoare triple {352#true} assume true; {352#true} is VALID [2018-11-14 16:35:18,320 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {352#true} {352#true} #62#return; {352#true} is VALID [2018-11-14 16:35:18,321 INFO L256 TraceCheckUtils]: 4: Hoare triple {352#true} call #t~ret16 := main(); {352#true} is VALID [2018-11-14 16:35:18,324 INFO L273 TraceCheckUtils]: 5: Hoare triple {352#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~intINTTYPE4(0bv32, ~m~0.base, ~m~0.offset, 4bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(1bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {372#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (exists ((main_~head~0.offset (_ BitVec 32)) (|main_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= (_ bv0 32) main_~m~0.offset))} is VALID [2018-11-14 16:35:18,325 INFO L273 TraceCheckUtils]: 6: Hoare triple {372#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (exists ((main_~head~0.offset (_ BitVec 32)) (|main_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= (_ bv0 32) main_~m~0.offset))} assume true; {372#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (exists ((main_~head~0.offset (_ BitVec 32)) (|main_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= (_ bv0 32) main_~m~0.offset))} is VALID [2018-11-14 16:35:18,326 INFO L273 TraceCheckUtils]: 7: Hoare triple {372#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (exists ((main_~head~0.offset (_ BitVec 32)) (|main_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= (_ bv0 32) main_~m~0.offset))} assume !!(#t~nondet4 != 0bv32);havoc #t~nondet4;~x~0 := #t~nondet5;havoc #t~nondet5; {372#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (exists ((main_~head~0.offset (_ BitVec 32)) (|main_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= (_ bv0 32) main_~m~0.offset))} is VALID [2018-11-14 16:35:18,339 INFO L273 TraceCheckUtils]: 8: Hoare triple {372#(and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (exists ((main_~head~0.offset (_ BitVec 32)) (|main_#t~malloc3.base| (_ BitVec 32))) (and (= (_ bv1 32) (select (select |#memory_int| |main_#t~malloc3.base|) main_~head~0.offset)) (not (= |main_#t~malloc3.base| main_~m~0.base)))) (= (_ bv0 32) main_~m~0.offset))} assume ~bvsgt32(~x~0, 0bv32) && ~bvslt32(~x~0, 10bv32);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12bv32);~n~0.base, ~n~0.offset := #t~malloc6.base, #t~malloc6.offset;call write~intINTTYPE4(~x~0, ~n~0.base, ~n~0.offset, 4bv32);call write~$Pointer$(~m~0.base, ~m~0.offset, ~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~n~0.base, ~bvadd32(8bv32, ~n~0.offset), 4bv32);call write~$Pointer$(~n~0.base, ~n~0.offset, ~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32); {382#(or (and (exists ((v_prenex_5 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32))) (and (not (= v_prenex_5 main_~m~0.base)) (= (_ bv1 32) (select (select |#memory_int| v_prenex_5) v_prenex_4)))) (bvsgt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv10 32)) (= (_ bv0 32) main_~m~0.offset)) (and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (exists ((v_prenex_3 (_ BitVec 32))) (and (bvslt (select (select |#memory_int| v_prenex_3) (_ bv0 32)) (_ bv10 32)) (bvsgt (select (select |#memory_int| v_prenex_3) (_ bv0 32)) (_ bv0 32)) (not (= v_prenex_3 main_~m~0.base)))) (= (_ bv0 32) main_~m~0.offset)))} is VALID [2018-11-14 16:35:18,340 INFO L273 TraceCheckUtils]: 9: Hoare triple {382#(or (and (exists ((v_prenex_5 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32))) (and (not (= v_prenex_5 main_~m~0.base)) (= (_ bv1 32) (select (select |#memory_int| v_prenex_5) v_prenex_4)))) (bvsgt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv10 32)) (= (_ bv0 32) main_~m~0.offset)) (and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (exists ((v_prenex_3 (_ BitVec 32))) (and (bvslt (select (select |#memory_int| v_prenex_3) (_ bv0 32)) (_ bv10 32)) (bvsgt (select (select |#memory_int| v_prenex_3) (_ bv0 32)) (_ bv0 32)) (not (= v_prenex_3 main_~m~0.base)))) (= (_ bv0 32) main_~m~0.offset)))} assume true; {382#(or (and (exists ((v_prenex_5 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32))) (and (not (= v_prenex_5 main_~m~0.base)) (= (_ bv1 32) (select (select |#memory_int| v_prenex_5) v_prenex_4)))) (bvsgt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv10 32)) (= (_ bv0 32) main_~m~0.offset)) (and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (exists ((v_prenex_3 (_ BitVec 32))) (and (bvslt (select (select |#memory_int| v_prenex_3) (_ bv0 32)) (_ bv10 32)) (bvsgt (select (select |#memory_int| v_prenex_3) (_ bv0 32)) (_ bv0 32)) (not (= v_prenex_3 main_~m~0.base)))) (= (_ bv0 32) main_~m~0.offset)))} is VALID [2018-11-14 16:35:18,341 INFO L273 TraceCheckUtils]: 10: Hoare triple {382#(or (and (exists ((v_prenex_5 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32))) (and (not (= v_prenex_5 main_~m~0.base)) (= (_ bv1 32) (select (select |#memory_int| v_prenex_5) v_prenex_4)))) (bvsgt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv10 32)) (= (_ bv0 32) main_~m~0.offset)) (and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (exists ((v_prenex_3 (_ BitVec 32))) (and (bvslt (select (select |#memory_int| v_prenex_3) (_ bv0 32)) (_ bv10 32)) (bvsgt (select (select |#memory_int| v_prenex_3) (_ bv0 32)) (_ bv0 32)) (not (= v_prenex_3 main_~m~0.base)))) (= (_ bv0 32) main_~m~0.offset)))} assume !(#t~nondet4 != 0bv32);havoc #t~nondet4; {382#(or (and (exists ((v_prenex_5 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32))) (and (not (= v_prenex_5 main_~m~0.base)) (= (_ bv1 32) (select (select |#memory_int| v_prenex_5) v_prenex_4)))) (bvsgt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv10 32)) (= (_ bv0 32) main_~m~0.offset)) (and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (exists ((v_prenex_3 (_ BitVec 32))) (and (bvslt (select (select |#memory_int| v_prenex_3) (_ bv0 32)) (_ bv10 32)) (bvsgt (select (select |#memory_int| v_prenex_3) (_ bv0 32)) (_ bv0 32)) (not (= v_prenex_3 main_~m~0.base)))) (= (_ bv0 32) main_~m~0.offset)))} is VALID [2018-11-14 16:35:18,341 INFO L273 TraceCheckUtils]: 11: Hoare triple {382#(or (and (exists ((v_prenex_5 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32))) (and (not (= v_prenex_5 main_~m~0.base)) (= (_ bv1 32) (select (select |#memory_int| v_prenex_5) v_prenex_4)))) (bvsgt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv10 32)) (= (_ bv0 32) main_~m~0.offset)) (and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (exists ((v_prenex_3 (_ BitVec 32))) (and (bvslt (select (select |#memory_int| v_prenex_3) (_ bv0 32)) (_ bv10 32)) (bvsgt (select (select |#memory_int| v_prenex_3) (_ bv0 32)) (_ bv0 32)) (not (= v_prenex_3 main_~m~0.base)))) (= (_ bv0 32) main_~m~0.offset)))} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {382#(or (and (exists ((v_prenex_5 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32))) (and (not (= v_prenex_5 main_~m~0.base)) (= (_ bv1 32) (select (select |#memory_int| v_prenex_5) v_prenex_4)))) (bvsgt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv10 32)) (= (_ bv0 32) main_~m~0.offset)) (and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (exists ((v_prenex_3 (_ BitVec 32))) (and (bvslt (select (select |#memory_int| v_prenex_3) (_ bv0 32)) (_ bv10 32)) (bvsgt (select (select |#memory_int| v_prenex_3) (_ bv0 32)) (_ bv0 32)) (not (= v_prenex_3 main_~m~0.base)))) (= (_ bv0 32) main_~m~0.offset)))} is VALID [2018-11-14 16:35:18,343 INFO L273 TraceCheckUtils]: 12: Hoare triple {382#(or (and (exists ((v_prenex_5 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32))) (and (not (= v_prenex_5 main_~m~0.base)) (= (_ bv1 32) (select (select |#memory_int| v_prenex_5) v_prenex_4)))) (bvsgt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv10 32)) (= (_ bv0 32) main_~m~0.offset)) (and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (exists ((v_prenex_3 (_ BitVec 32))) (and (bvslt (select (select |#memory_int| v_prenex_3) (_ bv0 32)) (_ bv10 32)) (bvsgt (select (select |#memory_int| v_prenex_3) (_ bv0 32)) (_ bv0 32)) (not (= v_prenex_3 main_~m~0.base)))) (= (_ bv0 32) main_~m~0.offset)))} assume true; {382#(or (and (exists ((v_prenex_5 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32))) (and (not (= v_prenex_5 main_~m~0.base)) (= (_ bv1 32) (select (select |#memory_int| v_prenex_5) v_prenex_4)))) (bvsgt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv10 32)) (= (_ bv0 32) main_~m~0.offset)) (and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (exists ((v_prenex_3 (_ BitVec 32))) (and (bvslt (select (select |#memory_int| v_prenex_3) (_ bv0 32)) (_ bv10 32)) (bvsgt (select (select |#memory_int| v_prenex_3) (_ bv0 32)) (_ bv0 32)) (not (= v_prenex_3 main_~m~0.base)))) (= (_ bv0 32) main_~m~0.offset)))} is VALID [2018-11-14 16:35:18,346 INFO L273 TraceCheckUtils]: 13: Hoare triple {382#(or (and (exists ((v_prenex_5 (_ BitVec 32)) (v_prenex_4 (_ BitVec 32))) (and (not (= v_prenex_5 main_~m~0.base)) (= (_ bv1 32) (select (select |#memory_int| v_prenex_5) v_prenex_4)))) (bvsgt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv10 32)) (= (_ bv0 32) main_~m~0.offset)) (and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv0 32)) (exists ((v_prenex_3 (_ BitVec 32))) (and (bvslt (select (select |#memory_int| v_prenex_3) (_ bv0 32)) (_ bv10 32)) (bvsgt (select (select |#memory_int| v_prenex_3) (_ bv0 32)) (_ bv0 32)) (not (= v_prenex_3 main_~m~0.base)))) (= (_ bv0 32) main_~m~0.offset)))} call #t~mem7 := read~intINTTYPE4(~m~0.base, ~m~0.offset, 4bv32); {398#(or (= (_ bv0 32) |main_#t~mem7|) (and (bvsgt |main_#t~mem7| (_ bv0 32)) (bvslt |main_#t~mem7| (_ bv10 32))))} is VALID [2018-11-14 16:35:18,348 INFO L273 TraceCheckUtils]: 14: Hoare triple {398#(or (= (_ bv0 32) |main_#t~mem7|) (and (bvsgt |main_#t~mem7| (_ bv0 32)) (bvslt |main_#t~mem7| (_ bv10 32))))} assume !~bvslt32(#t~mem7, 100bv32);havoc #t~mem7; {353#false} is VALID [2018-11-14 16:35:18,349 INFO L273 TraceCheckUtils]: 15: Hoare triple {353#false} call #t~mem15 := read~intINTTYPE4(~m~0.base, ~m~0.offset, 4bv32); {353#false} is VALID [2018-11-14 16:35:18,349 INFO L273 TraceCheckUtils]: 16: Hoare triple {353#false} assume !(#t~mem15 == 100bv32);havoc #t~mem15; {353#false} is VALID [2018-11-14 16:35:18,350 INFO L273 TraceCheckUtils]: 17: Hoare triple {353#false} assume !false; {353#false} is VALID [2018-11-14 16:35:18,354 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:35:18,355 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:35:18,561 INFO L273 TraceCheckUtils]: 17: Hoare triple {353#false} assume !false; {353#false} is VALID [2018-11-14 16:35:18,562 INFO L273 TraceCheckUtils]: 16: Hoare triple {353#false} assume !(#t~mem15 == 100bv32);havoc #t~mem15; {353#false} is VALID [2018-11-14 16:35:18,562 INFO L273 TraceCheckUtils]: 15: Hoare triple {353#false} call #t~mem15 := read~intINTTYPE4(~m~0.base, ~m~0.offset, 4bv32); {353#false} is VALID [2018-11-14 16:35:18,563 INFO L273 TraceCheckUtils]: 14: Hoare triple {420#(bvslt |main_#t~mem7| (_ bv100 32))} assume !~bvslt32(#t~mem7, 100bv32);havoc #t~mem7; {353#false} is VALID [2018-11-14 16:35:18,565 INFO L273 TraceCheckUtils]: 13: Hoare triple {424#(bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))} call #t~mem7 := read~intINTTYPE4(~m~0.base, ~m~0.offset, 4bv32); {420#(bvslt |main_#t~mem7| (_ bv100 32))} is VALID [2018-11-14 16:35:18,565 INFO L273 TraceCheckUtils]: 12: Hoare triple {424#(bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))} assume true; {424#(bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))} is VALID [2018-11-14 16:35:18,570 INFO L273 TraceCheckUtils]: 11: Hoare triple {424#(bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {424#(bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))} is VALID [2018-11-14 16:35:18,571 INFO L273 TraceCheckUtils]: 10: Hoare triple {424#(bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))} assume !(#t~nondet4 != 0bv32);havoc #t~nondet4; {424#(bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))} is VALID [2018-11-14 16:35:18,572 INFO L273 TraceCheckUtils]: 9: Hoare triple {424#(bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))} assume true; {424#(bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))} is VALID [2018-11-14 16:35:18,579 INFO L273 TraceCheckUtils]: 8: Hoare triple {424#(bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))} assume ~bvsgt32(~x~0, 0bv32) && ~bvslt32(~x~0, 10bv32);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(12bv32);~n~0.base, ~n~0.offset := #t~malloc6.base, #t~malloc6.offset;call write~intINTTYPE4(~x~0, ~n~0.base, ~n~0.offset, 4bv32);call write~$Pointer$(~m~0.base, ~m~0.offset, ~n~0.base, ~bvadd32(4bv32, ~n~0.offset), 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~n~0.base, ~bvadd32(8bv32, ~n~0.offset), 4bv32);call write~$Pointer$(~n~0.base, ~n~0.offset, ~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32); {424#(bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))} is VALID [2018-11-14 16:35:18,580 INFO L273 TraceCheckUtils]: 7: Hoare triple {424#(bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))} assume !!(#t~nondet4 != 0bv32);havoc #t~nondet4;~x~0 := #t~nondet5;havoc #t~nondet5; {424#(bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))} is VALID [2018-11-14 16:35:18,581 INFO L273 TraceCheckUtils]: 6: Hoare triple {424#(bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))} assume true; {424#(bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))} is VALID [2018-11-14 16:35:18,583 INFO L273 TraceCheckUtils]: 5: Hoare triple {352#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~intINTTYPE4(0bv32, ~m~0.base, ~m~0.offset, 4bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(1bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {424#(bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))} is VALID [2018-11-14 16:35:18,583 INFO L256 TraceCheckUtils]: 4: Hoare triple {352#true} call #t~ret16 := main(); {352#true} is VALID [2018-11-14 16:35:18,584 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {352#true} {352#true} #62#return; {352#true} is VALID [2018-11-14 16:35:18,584 INFO L273 TraceCheckUtils]: 2: Hoare triple {352#true} assume true; {352#true} is VALID [2018-11-14 16:35:18,584 INFO L273 TraceCheckUtils]: 1: Hoare triple {352#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {352#true} is VALID [2018-11-14 16:35:18,584 INFO L256 TraceCheckUtils]: 0: Hoare triple {352#true} call ULTIMATE.init(); {352#true} is VALID [2018-11-14 16:35:18,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 16:35:18,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-14 16:35:18,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2018-11-14 16:35:18,590 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-14 16:35:18,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:35:18,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 16:35:18,720 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:18,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 16:35:18,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 16:35:18,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:35:18,722 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 7 states. [2018-11-14 16:35:19,376 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2018-11-14 16:35:20,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:20,016 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2018-11-14 16:35:20,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:35:20,016 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-11-14 16:35:20,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:35:20,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:35:20,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2018-11-14 16:35:20,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 16:35:20,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 57 transitions. [2018-11-14 16:35:20,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 57 transitions. [2018-11-14 16:35:20,294 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:20,296 INFO L225 Difference]: With dead ends: 46 [2018-11-14 16:35:20,296 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 16:35:20,297 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:35:20,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 16:35:20,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 24. [2018-11-14 16:35:20,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:35:20,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 24 states. [2018-11-14 16:35:20,334 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 24 states. [2018-11-14 16:35:20,334 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 24 states. [2018-11-14 16:35:20,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:20,338 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2018-11-14 16:35:20,338 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2018-11-14 16:35:20,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:20,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:20,339 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 42 states. [2018-11-14 16:35:20,339 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 42 states. [2018-11-14 16:35:20,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:20,343 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2018-11-14 16:35:20,343 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 52 transitions. [2018-11-14 16:35:20,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:20,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:20,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:35:20,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:35:20,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 16:35:20,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-14 16:35:20,346 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 18 [2018-11-14 16:35:20,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:35:20,347 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-14 16:35:20,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 16:35:20,347 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2018-11-14 16:35:20,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 16:35:20,348 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:35:20,348 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:35:20,348 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:35:20,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:35:20,349 INFO L82 PathProgramCache]: Analyzing trace with hash 168761927, now seen corresponding path program 1 times [2018-11-14 16:35:20,349 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:35:20,349 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:35:20,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:35:20,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:20,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:35:20,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-14 16:35:20,640 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-14 16:35:20,668 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:35:20,679 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-11-14 16:35:20,681 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:20,726 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:20,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:20,882 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-11-14 16:35:20,891 INFO L477 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 14 treesize of output 13 [2018-11-14 16:35:20,895 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:20,957 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:35:21,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 56 [2018-11-14 16:35:21,038 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 29 [2018-11-14 16:35:21,040 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:21,138 INFO L477 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 22 treesize of output 21 [2018-11-14 16:35:21,140 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:21,185 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:35:21,220 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:35:21,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-14 16:35:21,304 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-14 16:35:21,311 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:35:21,312 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:35:21,313 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 36 [2018-11-14 16:35:21,315 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:21,331 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:21,344 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:21,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-14 16:35:21,420 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 3 variables, input treesize:70, output treesize:123 [2018-11-14 16:35:31,833 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:35:31,981 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2018-11-14 16:35:32,402 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2018-11-14 16:35:32,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 79 [2018-11-14 16:35:32,529 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:35:32,531 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 41 [2018-11-14 16:35:32,534 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:32,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:32,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 53 [2018-11-14 16:35:32,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 21 [2018-11-14 16:35:32,763 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:32,789 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:32,946 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:35:32,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 90 [2018-11-14 16:35:32,991 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:35:32,993 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 23 [2018-11-14 16:35:32,996 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:33,032 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:33,117 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2018-11-14 16:35:33,125 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2018-11-14 16:35:33,127 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:33,184 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:33,296 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-11-14 16:35:33,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 11 [2018-11-14 16:35:33,309 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:33,321 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:33,377 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:35:33,378 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:35:33,385 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:35:33,386 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 56 [2018-11-14 16:35:33,415 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:35:33,444 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 54 [2018-11-14 16:35:33,457 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-14 16:35:33,509 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:33,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 6 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-14 16:35:33,577 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 8 variables, input treesize:179, output treesize:40 [2018-11-14 16:35:35,660 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:35:36,074 INFO L256 TraceCheckUtils]: 0: Hoare triple {646#true} call ULTIMATE.init(); {646#true} is VALID [2018-11-14 16:35:36,074 INFO L273 TraceCheckUtils]: 1: Hoare triple {646#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {646#true} is VALID [2018-11-14 16:35:36,075 INFO L273 TraceCheckUtils]: 2: Hoare triple {646#true} assume true; {646#true} is VALID [2018-11-14 16:35:36,075 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {646#true} {646#true} #62#return; {646#true} is VALID [2018-11-14 16:35:36,075 INFO L256 TraceCheckUtils]: 4: Hoare triple {646#true} call #t~ret16 := main(); {646#true} is VALID [2018-11-14 16:35:36,079 INFO L273 TraceCheckUtils]: 5: Hoare triple {646#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~intINTTYPE4(0bv32, ~m~0.base, ~m~0.offset, 4bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(1bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {666#(or (and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~head~0.base) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~m~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= (_ bv0 32) main_~head~0.offset)) (and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) main_~m~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~m~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-14 16:35:36,080 INFO L273 TraceCheckUtils]: 6: Hoare triple {666#(or (and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~head~0.base) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~m~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= (_ bv0 32) main_~head~0.offset)) (and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) main_~m~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~m~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= (_ bv0 32) main_~head~0.offset)))} assume true; {666#(or (and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~head~0.base) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~m~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= (_ bv0 32) main_~head~0.offset)) (and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) main_~m~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~m~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-14 16:35:36,082 INFO L273 TraceCheckUtils]: 7: Hoare triple {666#(or (and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~head~0.base) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~m~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= (_ bv0 32) main_~head~0.offset)) (and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) main_~m~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~m~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= (_ bv0 32) main_~head~0.offset)))} assume !(#t~nondet4 != 0bv32);havoc #t~nondet4; {666#(or (and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~head~0.base) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~m~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= (_ bv0 32) main_~head~0.offset)) (and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) main_~m~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~m~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= (_ bv0 32) main_~head~0.offset)))} is VALID [2018-11-14 16:35:36,086 INFO L273 TraceCheckUtils]: 8: Hoare triple {666#(or (and (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~head~0.base) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~m~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= (_ bv0 32) main_~head~0.offset)) (and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) main_~m~0.offset)) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32))) main_~head~0.base) (= main_~head~0.offset (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv8 32)))) (= (_ bv0 32) main_~m~0.offset) (= (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~head~0.offset) (= (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) main_~m~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (= (_ bv0 32) main_~head~0.offset)))} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {676#(or (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) main_~list~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv0 32) main_~m~0.offset) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))) (and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) main_~m~0.offset)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv0 32) main_~m~0.offset) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))))} is VALID [2018-11-14 16:35:36,087 INFO L273 TraceCheckUtils]: 9: Hoare triple {676#(or (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) main_~list~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv0 32) main_~m~0.offset) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))) (and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) main_~m~0.offset)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv0 32) main_~m~0.offset) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))))} assume true; {676#(or (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) main_~list~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv0 32) main_~m~0.offset) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))) (and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) main_~m~0.offset)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv0 32) main_~m~0.offset) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))))} is VALID [2018-11-14 16:35:36,092 INFO L273 TraceCheckUtils]: 10: Hoare triple {676#(or (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) main_~list~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv0 32) main_~m~0.offset) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))) (and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) main_~m~0.offset)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv0 32) main_~m~0.offset) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))))} call #t~mem7 := read~intINTTYPE4(~m~0.base, ~m~0.offset, 4bv32); {683#(and (or (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) main_~list~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv0 32) main_~m~0.offset) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))) (and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) main_~m~0.offset)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv0 32) main_~m~0.offset) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))))) (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) |main_#t~mem7|))} is VALID [2018-11-14 16:35:36,093 INFO L273 TraceCheckUtils]: 11: Hoare triple {683#(and (or (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) main_~list~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv0 32) main_~m~0.offset) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))) (and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) main_~m~0.offset)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv0 32) main_~m~0.offset) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))))) (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) |main_#t~mem7|))} assume !!~bvslt32(#t~mem7, 100bv32);havoc #t~mem7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call #t~mem9 := read~intINTTYPE4(#t~mem8.base, #t~mem8.offset, 4bv32);call #t~mem10 := read~intINTTYPE4(~list~0.base, ~list~0.offset, 4bv32); {676#(or (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) main_~list~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv0 32) main_~m~0.offset) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))) (and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) main_~m~0.offset)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv0 32) main_~m~0.offset) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))))} is VALID [2018-11-14 16:35:36,103 INFO L273 TraceCheckUtils]: 12: Hoare triple {676#(or (and (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) main_~list~0.base) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv0 32) main_~m~0.offset) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))) (and (= (_ bv0 32) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) main_~m~0.offset)) (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv1 32) (select (select |#memory_int| main_~list~0.base) main_~list~0.offset)) (= main_~list~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32)))) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (= (_ bv0 32) main_~m~0.offset) (= main_~list~0.offset (_ bv0 32)) (= main_~list~0.offset (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv8 32))))))} assume ~bvsle32(~bvadd32(#t~mem9, #t~mem10), 100bv32);havoc #t~mem8.base, #t~mem8.offset;havoc #t~mem10;havoc #t~mem9;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call #t~mem12 := read~intINTTYPE4(#t~mem11.base, #t~mem11.offset, 4bv32);call #t~mem13 := read~intINTTYPE4(~list~0.base, ~list~0.offset, 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem12, #t~mem13), #t~mem11.base, #t~mem11.offset, 4bv32);havoc #t~mem11.base, #t~mem11.offset;havoc #t~mem12;havoc #t~mem13; {690#(or (and (exists ((v_prenex_9 (_ BitVec 32))) (and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (bvadd (select (select |#memory_int| v_prenex_9) (_ bv0 32)) main_~m~0.offset)) (= (bvadd (select (select |#memory_int| v_prenex_9) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= main_~m~0.base v_prenex_9)))) (= (_ bv0 32) main_~m~0.offset)) (and (= (_ bv2 32) (select (select |#memory_int| main_~m~0.base) (_ bv0 32))) (= (_ bv0 32) main_~m~0.offset)))} is VALID [2018-11-14 16:35:36,104 INFO L273 TraceCheckUtils]: 13: Hoare triple {690#(or (and (exists ((v_prenex_9 (_ BitVec 32))) (and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (bvadd (select (select |#memory_int| v_prenex_9) (_ bv0 32)) main_~m~0.offset)) (= (bvadd (select (select |#memory_int| v_prenex_9) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= main_~m~0.base v_prenex_9)))) (= (_ bv0 32) main_~m~0.offset)) (and (= (_ bv2 32) (select (select |#memory_int| main_~m~0.base) (_ bv0 32))) (= (_ bv0 32) main_~m~0.offset)))} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32);~list~0.base, ~list~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset; {690#(or (and (exists ((v_prenex_9 (_ BitVec 32))) (and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (bvadd (select (select |#memory_int| v_prenex_9) (_ bv0 32)) main_~m~0.offset)) (= (bvadd (select (select |#memory_int| v_prenex_9) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= main_~m~0.base v_prenex_9)))) (= (_ bv0 32) main_~m~0.offset)) (and (= (_ bv2 32) (select (select |#memory_int| main_~m~0.base) (_ bv0 32))) (= (_ bv0 32) main_~m~0.offset)))} is VALID [2018-11-14 16:35:36,105 INFO L273 TraceCheckUtils]: 14: Hoare triple {690#(or (and (exists ((v_prenex_9 (_ BitVec 32))) (and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (bvadd (select (select |#memory_int| v_prenex_9) (_ bv0 32)) main_~m~0.offset)) (= (bvadd (select (select |#memory_int| v_prenex_9) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= main_~m~0.base v_prenex_9)))) (= (_ bv0 32) main_~m~0.offset)) (and (= (_ bv2 32) (select (select |#memory_int| main_~m~0.base) (_ bv0 32))) (= (_ bv0 32) main_~m~0.offset)))} assume true; {690#(or (and (exists ((v_prenex_9 (_ BitVec 32))) (and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (bvadd (select (select |#memory_int| v_prenex_9) (_ bv0 32)) main_~m~0.offset)) (= (bvadd (select (select |#memory_int| v_prenex_9) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= main_~m~0.base v_prenex_9)))) (= (_ bv0 32) main_~m~0.offset)) (and (= (_ bv2 32) (select (select |#memory_int| main_~m~0.base) (_ bv0 32))) (= (_ bv0 32) main_~m~0.offset)))} is VALID [2018-11-14 16:35:36,106 INFO L273 TraceCheckUtils]: 15: Hoare triple {690#(or (and (exists ((v_prenex_9 (_ BitVec 32))) (and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (bvadd (select (select |#memory_int| v_prenex_9) (_ bv0 32)) main_~m~0.offset)) (= (bvadd (select (select |#memory_int| v_prenex_9) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= main_~m~0.base v_prenex_9)))) (= (_ bv0 32) main_~m~0.offset)) (and (= (_ bv2 32) (select (select |#memory_int| main_~m~0.base) (_ bv0 32))) (= (_ bv0 32) main_~m~0.offset)))} call #t~mem7 := read~intINTTYPE4(~m~0.base, ~m~0.offset, 4bv32); {700#(or (and (= (_ bv2 32) (select (select |#memory_int| main_~m~0.base) (_ bv0 32))) (= (_ bv0 32) main_~m~0.offset) (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) |main_#t~mem7|)) (and (exists ((v_prenex_9 (_ BitVec 32))) (and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (bvadd (select (select |#memory_int| v_prenex_9) (_ bv0 32)) main_~m~0.offset)) (= (bvadd (select (select |#memory_int| v_prenex_9) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= main_~m~0.base v_prenex_9)))) (= (_ bv0 32) main_~m~0.offset) (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) |main_#t~mem7|)))} is VALID [2018-11-14 16:35:36,110 INFO L273 TraceCheckUtils]: 16: Hoare triple {700#(or (and (= (_ bv2 32) (select (select |#memory_int| main_~m~0.base) (_ bv0 32))) (= (_ bv0 32) main_~m~0.offset) (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) |main_#t~mem7|)) (and (exists ((v_prenex_9 (_ BitVec 32))) (and (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (bvadd (select (select |#memory_int| v_prenex_9) (_ bv0 32)) main_~m~0.offset)) (= (bvadd (select (select |#memory_int| v_prenex_9) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (not (= main_~m~0.base v_prenex_9)))) (= (_ bv0 32) main_~m~0.offset) (= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) |main_#t~mem7|)))} assume !~bvslt32(#t~mem7, 100bv32);havoc #t~mem7; {647#false} is VALID [2018-11-14 16:35:36,110 INFO L273 TraceCheckUtils]: 17: Hoare triple {647#false} call #t~mem15 := read~intINTTYPE4(~m~0.base, ~m~0.offset, 4bv32); {647#false} is VALID [2018-11-14 16:35:36,111 INFO L273 TraceCheckUtils]: 18: Hoare triple {647#false} assume !(#t~mem15 == 100bv32);havoc #t~mem15; {647#false} is VALID [2018-11-14 16:35:36,111 INFO L273 TraceCheckUtils]: 19: Hoare triple {647#false} assume !false; {647#false} is VALID [2018-11-14 16:35:36,114 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:35:36,114 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:35:37,098 INFO L273 TraceCheckUtils]: 19: Hoare triple {647#false} assume !false; {647#false} is VALID [2018-11-14 16:35:37,099 INFO L273 TraceCheckUtils]: 18: Hoare triple {716#(= (bvadd |main_#t~mem15| (_ bv4294967196 32)) (_ bv0 32))} assume !(#t~mem15 == 100bv32);havoc #t~mem15; {647#false} is VALID [2018-11-14 16:35:37,100 INFO L273 TraceCheckUtils]: 17: Hoare triple {720#(= (bvadd (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv4294967196 32)) (_ bv0 32))} call #t~mem15 := read~intINTTYPE4(~m~0.base, ~m~0.offset, 4bv32); {716#(= (bvadd |main_#t~mem15| (_ bv4294967196 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:37,100 INFO L273 TraceCheckUtils]: 16: Hoare triple {724#(or (bvslt |main_#t~mem7| (_ bv100 32)) (= (bvadd (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv4294967196 32)) (_ bv0 32)))} assume !~bvslt32(#t~mem7, 100bv32);havoc #t~mem7; {720#(= (bvadd (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv4294967196 32)) (_ bv0 32))} is VALID [2018-11-14 16:35:37,109 INFO L273 TraceCheckUtils]: 15: Hoare triple {728#(or (= (bvadd (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv4294967196 32)) (_ bv0 32)) (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32)))} call #t~mem7 := read~intINTTYPE4(~m~0.base, ~m~0.offset, 4bv32); {724#(or (bvslt |main_#t~mem7| (_ bv100 32)) (= (bvadd (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv4294967196 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:37,124 INFO L273 TraceCheckUtils]: 14: Hoare triple {728#(or (= (bvadd (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv4294967196 32)) (_ bv0 32)) (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32)))} assume true; {728#(or (= (bvadd (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv4294967196 32)) (_ bv0 32)) (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32)))} is VALID [2018-11-14 16:35:37,133 INFO L273 TraceCheckUtils]: 13: Hoare triple {728#(or (= (bvadd (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv4294967196 32)) (_ bv0 32)) (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32)))} call #t~mem14.base, #t~mem14.offset := read~$Pointer$(~list~0.base, ~bvadd32(8bv32, ~list~0.offset), 4bv32);~list~0.base, ~list~0.offset := #t~mem14.base, #t~mem14.offset;havoc #t~mem14.base, #t~mem14.offset; {728#(or (= (bvadd (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv4294967196 32)) (_ bv0 32)) (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32)))} is VALID [2018-11-14 16:35:37,144 INFO L273 TraceCheckUtils]: 12: Hoare triple {738#(or (bvslt (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))) main_~m~0.base) main_~m~0.offset) (_ bv100 32)) (= (bvadd (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))) main_~m~0.base) main_~m~0.offset) (_ bv4294967196 32)) (_ bv0 32)))} assume ~bvsle32(~bvadd32(#t~mem9, #t~mem10), 100bv32);havoc #t~mem8.base, #t~mem8.offset;havoc #t~mem10;havoc #t~mem9;call #t~mem11.base, #t~mem11.offset := read~$Pointer$(~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call #t~mem12 := read~intINTTYPE4(#t~mem11.base, #t~mem11.offset, 4bv32);call #t~mem13 := read~intINTTYPE4(~list~0.base, ~list~0.offset, 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem12, #t~mem13), #t~mem11.base, #t~mem11.offset, 4bv32);havoc #t~mem11.base, #t~mem11.offset;havoc #t~mem12;havoc #t~mem13; {728#(or (= (bvadd (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv4294967196 32)) (_ bv0 32)) (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32)))} is VALID [2018-11-14 16:35:37,147 INFO L273 TraceCheckUtils]: 11: Hoare triple {742#(or (bvslt (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))) main_~m~0.base) main_~m~0.offset) (_ bv100 32)) (not (bvslt |main_#t~mem7| (_ bv100 32))) (= (bvadd (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))) main_~m~0.base) main_~m~0.offset) (_ bv4294967196 32)) (_ bv0 32)))} assume !!~bvslt32(#t~mem7, 100bv32);havoc #t~mem7;call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~list~0.base, ~bvadd32(4bv32, ~list~0.offset), 4bv32);call #t~mem9 := read~intINTTYPE4(#t~mem8.base, #t~mem8.offset, 4bv32);call #t~mem10 := read~intINTTYPE4(~list~0.base, ~list~0.offset, 4bv32); {738#(or (bvslt (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))) main_~m~0.base) main_~m~0.offset) (_ bv100 32)) (= (bvadd (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))) main_~m~0.base) main_~m~0.offset) (_ bv4294967196 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:37,149 INFO L273 TraceCheckUtils]: 10: Hoare triple {746#(or (bvslt (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))) main_~m~0.base) main_~m~0.offset) (_ bv100 32)) (not (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))) (= (bvadd (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))) main_~m~0.base) main_~m~0.offset) (_ bv4294967196 32)) (_ bv0 32)))} call #t~mem7 := read~intINTTYPE4(~m~0.base, ~m~0.offset, 4bv32); {742#(or (bvslt (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))) main_~m~0.base) main_~m~0.offset) (_ bv100 32)) (not (bvslt |main_#t~mem7| (_ bv100 32))) (= (bvadd (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))) main_~m~0.base) main_~m~0.offset) (_ bv4294967196 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:37,150 INFO L273 TraceCheckUtils]: 9: Hoare triple {746#(or (bvslt (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))) main_~m~0.base) main_~m~0.offset) (_ bv100 32)) (not (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))) (= (bvadd (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))) main_~m~0.base) main_~m~0.offset) (_ bv4294967196 32)) (_ bv0 32)))} assume true; {746#(or (bvslt (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))) main_~m~0.base) main_~m~0.offset) (_ bv100 32)) (not (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))) (= (bvadd (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))) main_~m~0.base) main_~m~0.offset) (_ bv4294967196 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:37,154 INFO L273 TraceCheckUtils]: 8: Hoare triple {753#(or (= (_ bv100 32) (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)))) main_~m~0.base) main_~m~0.offset)) (not (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))) (bvslt (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)))) main_~m~0.base) main_~m~0.offset) (_ bv100 32)))} ~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {746#(or (bvslt (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))) main_~m~0.base) main_~m~0.offset) (_ bv100 32)) (not (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))) (= (bvadd (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~list~0.base) (bvadd main_~list~0.offset (_ bv4 32))))))) main_~m~0.base) main_~m~0.offset) (_ bv4294967196 32)) (_ bv0 32)))} is VALID [2018-11-14 16:35:37,155 INFO L273 TraceCheckUtils]: 7: Hoare triple {753#(or (= (_ bv100 32) (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)))) main_~m~0.base) main_~m~0.offset)) (not (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))) (bvslt (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)))) main_~m~0.base) main_~m~0.offset) (_ bv100 32)))} assume !(#t~nondet4 != 0bv32);havoc #t~nondet4; {753#(or (= (_ bv100 32) (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)))) main_~m~0.base) main_~m~0.offset)) (not (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))) (bvslt (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)))) main_~m~0.base) main_~m~0.offset) (_ bv100 32)))} is VALID [2018-11-14 16:35:37,156 INFO L273 TraceCheckUtils]: 6: Hoare triple {753#(or (= (_ bv100 32) (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)))) main_~m~0.base) main_~m~0.offset)) (not (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))) (bvslt (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)))) main_~m~0.base) main_~m~0.offset) (_ bv100 32)))} assume true; {753#(or (= (_ bv100 32) (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)))) main_~m~0.base) main_~m~0.offset)) (not (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))) (bvslt (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)))) main_~m~0.base) main_~m~0.offset) (_ bv100 32)))} is VALID [2018-11-14 16:35:37,166 INFO L273 TraceCheckUtils]: 5: Hoare triple {646#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4bv32);~m~0.base, ~m~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~intINTTYPE4(0bv32, ~m~0.base, ~m~0.offset, 4bv32);call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(12bv32);~head~0.base, ~head~0.offset := #t~malloc3.base, #t~malloc3.offset;call write~intINTTYPE4(1bv32, ~head~0.base, ~head~0.offset, 4bv32);call write~$Pointer$(~m~0.base, ~m~0.offset, ~head~0.base, ~bvadd32(4bv32, ~head~0.offset), 4bv32);call write~$Pointer$(~head~0.base, ~head~0.offset, ~head~0.base, ~bvadd32(8bv32, ~head~0.offset), 4bv32);~list~0.base, ~list~0.offset := ~head~0.base, ~head~0.offset; {753#(or (= (_ bv100 32) (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)))) main_~m~0.base) main_~m~0.offset)) (not (bvslt (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) (_ bv100 32))) (bvslt (select (select (store |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (store (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32))) (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_$Pointer$.offset| main_~head~0.base) (bvadd main_~head~0.offset (_ bv4 32)))) (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)))) main_~m~0.base) main_~m~0.offset) (_ bv100 32)))} is VALID [2018-11-14 16:35:37,167 INFO L256 TraceCheckUtils]: 4: Hoare triple {646#true} call #t~ret16 := main(); {646#true} is VALID [2018-11-14 16:35:37,167 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {646#true} {646#true} #62#return; {646#true} is VALID [2018-11-14 16:35:37,167 INFO L273 TraceCheckUtils]: 2: Hoare triple {646#true} assume true; {646#true} is VALID [2018-11-14 16:35:37,168 INFO L273 TraceCheckUtils]: 1: Hoare triple {646#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {646#true} is VALID [2018-11-14 16:35:37,168 INFO L256 TraceCheckUtils]: 0: Hoare triple {646#true} call ULTIMATE.init(); {646#true} is VALID [2018-11-14 16:35:37,170 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:35:37,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:35:37,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 15 [2018-11-14 16:35:37,173 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2018-11-14 16:35:37,173 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:35:37,173 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-14 16:35:37,273 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:37,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-14 16:35:37,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-14 16:35:37,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2018-11-14 16:35:37,275 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand 15 states. [2018-11-14 16:35:38,203 WARN L179 SmtUtils]: Spent 547.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 61 [2018-11-14 16:35:40,033 WARN L179 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-14 16:35:41,043 WARN L179 SmtUtils]: Spent 649.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2018-11-14 16:35:41,676 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2018-11-14 16:35:44,198 WARN L179 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 70 [2018-11-14 16:35:45,049 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2018-11-14 16:35:45,976 WARN L179 SmtUtils]: Spent 592.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2018-11-14 16:35:46,698 WARN L179 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2018-11-14 16:35:48,685 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-11-14 16:35:48,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:48,997 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2018-11-14 16:35:48,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 16:35:48,997 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2018-11-14 16:35:48,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:35:48,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:35:49,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2018-11-14 16:35:49,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-14 16:35:49,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 72 transitions. [2018-11-14 16:35:49,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 72 transitions. [2018-11-14 16:35:49,391 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:35:49,394 INFO L225 Difference]: With dead ends: 64 [2018-11-14 16:35:49,395 INFO L226 Difference]: Without dead ends: 58 [2018-11-14 16:35:49,395 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=168, Invalid=534, Unknown=0, NotChecked=0, Total=702 [2018-11-14 16:35:49,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-14 16:35:49,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 41. [2018-11-14 16:35:49,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:35:49,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 41 states. [2018-11-14 16:35:49,518 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 41 states. [2018-11-14 16:35:49,518 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 41 states. [2018-11-14 16:35:49,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:49,522 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2018-11-14 16:35:49,522 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2018-11-14 16:35:49,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:49,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:49,523 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 58 states. [2018-11-14 16:35:49,524 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 58 states. [2018-11-14 16:35:49,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:35:49,527 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2018-11-14 16:35:49,527 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2018-11-14 16:35:49,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:35:49,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:35:49,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:35:49,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:35:49,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 16:35:49,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 51 transitions. [2018-11-14 16:35:49,531 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 51 transitions. Word has length 20 [2018-11-14 16:35:49,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:35:49,531 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 51 transitions. [2018-11-14 16:35:49,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-14 16:35:49,531 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 51 transitions. [2018-11-14 16:35:49,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 16:35:49,532 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:35:49,533 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:35:49,533 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:35:49,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:35:49,533 INFO L82 PathProgramCache]: Analyzing trace with hash 299428062, now seen corresponding path program 2 times [2018-11-14 16:35:49,534 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:35:49,534 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:35:49,567 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 16:35:49,707 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:35:49,707 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:35:49,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:35:49,760 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:35:50,035 WARN L179 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-11-14 16:35:50,053 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 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 5 treesize of output 1 [2018-11-14 16:35:50,056 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:50,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2018-11-14 16:35:50,310 INFO L477 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 8 treesize of output 7 [2018-11-14 16:35:50,312 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:50,403 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:35:50,428 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 29 [2018-11-14 16:35:50,441 INFO L477 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 18 treesize of output 16 [2018-11-14 16:35:50,443 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:50,480 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:50,505 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:50,591 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-14 16:35:50,600 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-14 16:35:50,610 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:35:50,611 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:35:50,612 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 36 [2018-11-14 16:35:50,616 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:50,640 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:50,657 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:50,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-14 16:35:50,730 INFO L477 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 18 [2018-11-14 16:35:50,737 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:35:50,739 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:35:50,740 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-14 16:35:50,742 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-14 16:35:50,754 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:50,763 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:50,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:50,801 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 4 variables, input treesize:78, output treesize:57 [2018-11-14 16:35:50,924 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:35:51,122 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:35:51,125 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:35:51,133 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:35:51,135 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 98 [2018-11-14 16:35:51,160 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 16:35:51,173 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:35:51,224 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 72 treesize of output 123 [2018-11-14 16:35:51,242 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-14 16:35:51,290 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:51,337 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 16:35:51,338 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:108, output treesize:91 [2018-11-14 16:35:53,481 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 16:35:54,288 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:35:54,291 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 16:35:54,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 125 [2018-11-14 16:35:54,498 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:35:54,499 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Undeclared function symbol (bvneg (_ BitVec 32)) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:321) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.term(WrapperScript.java:192) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.BitvectorUtils$BitvectorOperation.notSimplified(BitvectorUtils.java:263) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.BitvectorUtils$BitvectorOperation.simplify_NonConstantCase(BitvectorUtils.java:259) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.BitvectorUtils$BitvectorOperation.simplifiedResult(BitvectorUtils.java:254) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.BitvectorUtils.termWithLocalSimplification(BitvectorUtils.java:180) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.neg(SmtUtils.java:560) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.AffineRelation.product(AffineRelation.java:350) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.linearterms.AffineRelation.onLeftHandSideOnly(AffineRelation.java:300) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.pqe.EqualityInformation.getEqinfo(EqualityInformation.java:145) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.pqe.EqualityInformation.getEqTerms(EqualityInformation.java:193) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.addComplimentaryEqualityInformation(Elim1Store.java:853) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.collectComplimentaryEqualityInformation(Elim1Store.java:890) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:284) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-14 16:35:54,504 INFO L168 Benchmark]: Toolchain (without parser) took 43852.51 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 864.0 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -292.5 MB). Peak memory consumption was 571.5 MB. Max. memory is 7.1 GB. [2018-11-14 16:35:54,505 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 16:35:54,505 INFO L168 Benchmark]: CACSL2BoogieTranslator took 650.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. [2018-11-14 16:35:54,506 INFO L168 Benchmark]: Boogie Preprocessor took 202.04 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -808.6 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. [2018-11-14 16:35:54,507 INFO L168 Benchmark]: RCFGBuilder took 1134.88 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 7.1 GB. [2018-11-14 16:35:54,507 INFO L168 Benchmark]: TraceAbstraction took 41860.23 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 125.8 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 440.6 MB). Peak memory consumption was 566.4 MB. Max. memory is 7.1 GB. [2018-11-14 16:35:54,510 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 650.25 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.3 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 202.04 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -808.6 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1134.88 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 54.1 MB). Peak memory consumption was 54.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 41860.23 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 125.8 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 440.6 MB). Peak memory consumption was 566.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: Undeclared function symbol (bvneg (_ BitVec 32)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: Undeclared function symbol (bvneg (_ BitVec 32)): de.uni_freiburg.informatik.ultimate.logic.NoopScript.term(NoopScript.java:321) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...