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_Default-Const.epf -i ../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr_false-unreach-call_false-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 19:12:40,382 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 19:12:40,386 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 19:12:40,401 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 19:12:40,402 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 19:12:40,403 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 19:12:40,405 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 19:12:40,407 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 19:12:40,409 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 19:12:40,409 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 19:12:40,411 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 19:12:40,412 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 19:12:40,413 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 19:12:40,414 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 19:12:40,415 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 19:12:40,419 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 19:12:40,420 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 19:12:40,422 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 19:12:40,431 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 19:12:40,433 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 19:12:40,434 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 19:12:40,435 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 19:12:40,437 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 19:12:40,437 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 19:12:40,437 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 19:12:40,438 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 19:12:40,439 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 19:12:40,440 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 19:12:40,441 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 19:12:40,442 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 19:12:40,442 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 19:12:40,442 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 19:12:40,443 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 19:12:40,443 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 19:12:40,444 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 19:12:40,445 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 19:12:40,445 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 19:12:40,464 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 19:12:40,464 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 19:12:40,465 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 19:12:40,465 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 19:12:40,467 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 19:12:40,467 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 19:12:40,467 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 19:12:40,467 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 19:12:40,469 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 19:12:40,469 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 19:12:40,469 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 19:12:40,469 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 19:12:40,469 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 19:12:40,470 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 19:12:40,470 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 19:12:40,470 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 19:12:40,470 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 19:12:40,470 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 19:12:40,470 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 19:12:40,472 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 19:12:40,472 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 19:12:40,472 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 19:12:40,472 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 19:12:40,472 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 19:12:40,473 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 19:12:40,473 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 19:12:40,473 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 19:12:40,473 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 19:12:40,473 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 19:12:40,474 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 19:12:40,474 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 19:12:40,530 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 19:12:40,541 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 19:12:40,545 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 19:12:40,547 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 19:12:40,547 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 19:12:40,549 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr_false-unreach-call_false-termination.i [2018-11-14 19:12:40,615 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6612f8e2/caa3c5c116a74b8e965e870b9127e2ee/FLAG69e3f60ab [2018-11-14 19:12:41,174 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 19:12:41,175 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/list_and_tree_cnstr_false-unreach-call_false-termination.i [2018-11-14 19:12:41,188 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6612f8e2/caa3c5c116a74b8e965e870b9127e2ee/FLAG69e3f60ab [2018-11-14 19:12:41,202 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6612f8e2/caa3c5c116a74b8e965e870b9127e2ee [2018-11-14 19:12:41,212 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 19:12:41,213 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 19:12:41,214 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 19:12:41,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 19:12:41,218 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 19:12:41,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:12:41" (1/1) ... [2018-11-14 19:12:41,223 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b3e026a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:41, skipping insertion in model container [2018-11-14 19:12:41,223 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 07:12:41" (1/1) ... [2018-11-14 19:12:41,234 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 19:12:41,281 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 19:12:41,657 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:12:41,672 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 19:12:41,786 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 19:12:41,853 INFO L195 MainTranslator]: Completed translation [2018-11-14 19:12:41,854 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:41 WrapperNode [2018-11-14 19:12:41,854 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 19:12:41,855 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 19:12:41,855 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 19:12:41,855 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 19:12:41,942 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:41" (1/1) ... [2018-11-14 19:12:41,942 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:41" (1/1) ... [2018-11-14 19:12:41,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:41" (1/1) ... [2018-11-14 19:12:41,964 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:41" (1/1) ... [2018-11-14 19:12:42,006 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:41" (1/1) ... [2018-11-14 19:12:42,017 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:41" (1/1) ... [2018-11-14 19:12:42,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:41" (1/1) ... [2018-11-14 19:12:42,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 19:12:42,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 19:12:42,029 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 19:12:42,029 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 19:12:42,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:41" (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 19:12:42,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 19:12:42,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 19:12:42,090 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 19:12:42,091 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 19:12:42,091 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-14 19:12:42,091 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 19:12:42,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 19:12:42,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 19:12:42,092 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 19:12:42,092 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 19:12:42,092 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 19:12:42,092 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 19:12:42,092 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 19:12:42,093 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 19:12:42,093 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 19:12:42,093 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 19:12:42,093 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 19:12:42,093 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 19:12:42,093 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 19:12:42,093 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 19:12:42,094 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 19:12:42,094 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 19:12:42,094 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 19:12:42,094 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 19:12:42,094 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 19:12:42,094 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 19:12:42,094 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 19:12:42,095 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 19:12:42,095 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 19:12:42,095 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 19:12:42,095 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 19:12:42,095 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 19:12:42,095 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 19:12:42,096 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 19:12:42,096 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 19:12:42,096 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 19:12:42,096 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 19:12:42,096 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 19:12:42,096 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 19:12:42,096 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 19:12:42,097 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 19:12:42,097 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 19:12:42,097 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 19:12:42,097 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 19:12:42,097 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 19:12:42,097 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 19:12:42,097 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 19:12:42,098 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 19:12:42,098 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 19:12:42,098 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 19:12:42,098 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 19:12:42,098 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 19:12:42,098 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 19:12:42,098 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 19:12:42,099 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 19:12:42,099 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 19:12:42,099 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 19:12:42,099 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 19:12:42,099 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 19:12:42,099 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 19:12:42,099 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 19:12:42,100 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 19:12:42,100 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 19:12:42,100 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 19:12:42,100 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 19:12:42,100 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 19:12:42,100 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 19:12:42,101 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 19:12:42,101 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 19:12:42,101 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 19:12:42,101 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 19:12:42,101 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 19:12:42,101 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 19:12:42,102 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 19:12:42,102 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 19:12:42,102 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 19:12:42,102 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 19:12:42,102 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 19:12:42,103 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 19:12:42,103 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 19:12:42,103 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 19:12:42,104 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 19:12:42,104 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 19:12:42,104 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 19:12:42,104 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 19:12:42,104 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 19:12:42,104 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 19:12:42,105 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 19:12:42,105 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 19:12:42,105 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 19:12:42,105 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 19:12:42,105 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 19:12:42,106 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 19:12:42,106 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 19:12:42,106 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 19:12:42,106 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 19:12:42,106 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 19:12:42,106 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 19:12:42,107 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 19:12:42,107 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 19:12:42,107 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 19:12:42,107 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 19:12:42,107 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 19:12:42,107 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 19:12:42,108 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 19:12:42,108 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 19:12:42,108 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 19:12:42,108 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 19:12:42,108 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 19:12:42,109 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 19:12:42,109 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 19:12:42,109 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 19:12:42,109 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 19:12:42,109 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 19:12:42,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 19:12:42,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 19:12:42,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 19:12:42,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 19:12:42,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 19:12:42,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 19:12:42,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 19:12:42,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 19:12:42,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 19:12:43,891 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 19:12:43,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:12:43 BoogieIcfgContainer [2018-11-14 19:12:43,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 19:12:43,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 19:12:43,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 19:12:43,898 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 19:12:43,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 07:12:41" (1/3) ... [2018-11-14 19:12:43,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280cedc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:12:43, skipping insertion in model container [2018-11-14 19:12:43,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 07:12:41" (2/3) ... [2018-11-14 19:12:43,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@280cedc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 07:12:43, skipping insertion in model container [2018-11-14 19:12:43,900 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 07:12:43" (3/3) ... [2018-11-14 19:12:43,902 INFO L112 eAbstractionObserver]: Analyzing ICFG list_and_tree_cnstr_false-unreach-call_false-termination.i [2018-11-14 19:12:43,911 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 19:12:43,918 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 19:12:43,934 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 19:12:43,967 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 19:12:43,968 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 19:12:43,968 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 19:12:43,968 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 19:12:43,968 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 19:12:43,970 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 19:12:43,970 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 19:12:43,970 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 19:12:43,971 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 19:12:44,004 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states. [2018-11-14 19:12:44,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 19:12:44,018 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:12:44,019 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:12:44,022 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:12:44,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:12:44,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1522087756, now seen corresponding path program 1 times [2018-11-14 19:12:44,038 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:12:44,038 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:12:44,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:44,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:12:44,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:44,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:12:44,207 INFO L256 TraceCheckUtils]: 0: Hoare triple {68#true} call ULTIMATE.init(); {68#true} is VALID [2018-11-14 19:12:44,211 INFO L273 TraceCheckUtils]: 1: Hoare triple {68#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {68#true} is VALID [2018-11-14 19:12:44,212 INFO L273 TraceCheckUtils]: 2: Hoare triple {68#true} assume true; {68#true} is VALID [2018-11-14 19:12:44,212 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {68#true} {68#true} #232#return; {68#true} is VALID [2018-11-14 19:12:44,213 INFO L256 TraceCheckUtils]: 4: Hoare triple {68#true} call #t~ret41 := main(); {68#true} is VALID [2018-11-14 19:12:44,213 INFO L273 TraceCheckUtils]: 5: Hoare triple {68#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset + 0, 4);call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset + 4, 4); {68#true} is VALID [2018-11-14 19:12:44,216 INFO L273 TraceCheckUtils]: 6: Hoare triple {68#true} assume !true; {69#false} is VALID [2018-11-14 19:12:44,216 INFO L273 TraceCheckUtils]: 7: Hoare triple {69#false} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {69#false} is VALID [2018-11-14 19:12:44,216 INFO L273 TraceCheckUtils]: 8: Hoare triple {69#false} assume !true; {69#false} is VALID [2018-11-14 19:12:44,217 INFO L273 TraceCheckUtils]: 9: Hoare triple {69#false} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {69#false} is VALID [2018-11-14 19:12:44,217 INFO L273 TraceCheckUtils]: 10: Hoare triple {69#false} assume !(~a~0.base == 0 && ~a~0.offset == 0); {69#false} is VALID [2018-11-14 19:12:44,217 INFO L273 TraceCheckUtils]: 11: Hoare triple {69#false} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {69#false} is VALID [2018-11-14 19:12:44,218 INFO L273 TraceCheckUtils]: 12: Hoare triple {69#false} assume !true; {69#false} is VALID [2018-11-14 19:12:44,218 INFO L273 TraceCheckUtils]: 13: Hoare triple {69#false} assume !true; {69#false} is VALID [2018-11-14 19:12:44,218 INFO L273 TraceCheckUtils]: 14: Hoare triple {69#false} call write~int(3, ~p~0.base, ~p~0.offset + 0, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {69#false} is VALID [2018-11-14 19:12:44,219 INFO L273 TraceCheckUtils]: 15: Hoare triple {69#false} assume !true; {69#false} is VALID [2018-11-14 19:12:44,219 INFO L273 TraceCheckUtils]: 16: Hoare triple {69#false} assume !true; {69#false} is VALID [2018-11-14 19:12:44,220 INFO L273 TraceCheckUtils]: 17: Hoare triple {69#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset + 0, 4); {69#false} is VALID [2018-11-14 19:12:44,220 INFO L273 TraceCheckUtils]: 18: Hoare triple {69#false} assume #t~mem40 != 3;havoc #t~mem40; {69#false} is VALID [2018-11-14 19:12:44,220 INFO L273 TraceCheckUtils]: 19: Hoare triple {69#false} assume !false; {69#false} is VALID [2018-11-14 19:12:44,225 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 19:12:44,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:12:44,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 19:12:44,234 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-14 19:12:44,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:12:44,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 19:12:44,511 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:12:44,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 19:12:44,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 19:12:44,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 19:12:44,523 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 2 states. [2018-11-14 19:12:45,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:45,105 INFO L93 Difference]: Finished difference Result 124 states and 180 transitions. [2018-11-14 19:12:45,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 19:12:45,106 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-14 19:12:45,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:12:45,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:12:45,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 180 transitions. [2018-11-14 19:12:45,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 19:12:45,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 180 transitions. [2018-11-14 19:12:45,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 180 transitions. [2018-11-14 19:12:45,499 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:12:45,513 INFO L225 Difference]: With dead ends: 124 [2018-11-14 19:12:45,513 INFO L226 Difference]: Without dead ends: 55 [2018-11-14 19:12:45,518 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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 19:12:45,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-14 19:12:45,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-11-14 19:12:45,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:12:45,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 55 states. [2018-11-14 19:12:45,559 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2018-11-14 19:12:45,559 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2018-11-14 19:12:45,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:45,565 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2018-11-14 19:12:45,566 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2018-11-14 19:12:45,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:45,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:45,567 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 55 states. [2018-11-14 19:12:45,567 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 55 states. [2018-11-14 19:12:45,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:45,573 INFO L93 Difference]: Finished difference Result 55 states and 72 transitions. [2018-11-14 19:12:45,573 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2018-11-14 19:12:45,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:45,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:45,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:12:45,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:12:45,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-14 19:12:45,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 72 transitions. [2018-11-14 19:12:45,581 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 72 transitions. Word has length 20 [2018-11-14 19:12:45,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:12:45,581 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 72 transitions. [2018-11-14 19:12:45,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 19:12:45,582 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 72 transitions. [2018-11-14 19:12:45,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 19:12:45,583 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:12:45,583 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:12:45,584 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:12:45,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:12:45,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1332619352, now seen corresponding path program 1 times [2018-11-14 19:12:45,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:12:45,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:12:45,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:45,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:12:45,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:45,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:12:45,720 INFO L256 TraceCheckUtils]: 0: Hoare triple {395#true} call ULTIMATE.init(); {395#true} is VALID [2018-11-14 19:12:45,721 INFO L273 TraceCheckUtils]: 1: Hoare triple {395#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {395#true} is VALID [2018-11-14 19:12:45,721 INFO L273 TraceCheckUtils]: 2: Hoare triple {395#true} assume true; {395#true} is VALID [2018-11-14 19:12:45,721 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {395#true} {395#true} #232#return; {395#true} is VALID [2018-11-14 19:12:45,722 INFO L256 TraceCheckUtils]: 4: Hoare triple {395#true} call #t~ret41 := main(); {395#true} is VALID [2018-11-14 19:12:45,737 INFO L273 TraceCheckUtils]: 5: Hoare triple {395#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset + 0, 4);call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset + 4, 4); {397#(not (= main_~root~0.base 0))} is VALID [2018-11-14 19:12:45,751 INFO L273 TraceCheckUtils]: 6: Hoare triple {397#(not (= main_~root~0.base 0))} assume true; {397#(not (= main_~root~0.base 0))} is VALID [2018-11-14 19:12:45,751 INFO L273 TraceCheckUtils]: 7: Hoare triple {397#(not (= main_~root~0.base 0))} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {397#(not (= main_~root~0.base 0))} is VALID [2018-11-14 19:12:45,752 INFO L273 TraceCheckUtils]: 8: Hoare triple {397#(not (= main_~root~0.base 0))} assume !(#t~nondet3 != 0);havoc #t~nondet3; {397#(not (= main_~root~0.base 0))} is VALID [2018-11-14 19:12:45,753 INFO L273 TraceCheckUtils]: 9: Hoare triple {397#(not (= main_~root~0.base 0))} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {397#(not (= main_~root~0.base 0))} is VALID [2018-11-14 19:12:45,753 INFO L273 TraceCheckUtils]: 10: Hoare triple {397#(not (= main_~root~0.base 0))} assume true; {397#(not (= main_~root~0.base 0))} is VALID [2018-11-14 19:12:45,754 INFO L273 TraceCheckUtils]: 11: Hoare triple {397#(not (= main_~root~0.base 0))} assume !(~root~0.base != 0 || ~root~0.offset != 0); {396#false} is VALID [2018-11-14 19:12:45,754 INFO L273 TraceCheckUtils]: 12: Hoare triple {396#false} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {396#false} is VALID [2018-11-14 19:12:45,754 INFO L273 TraceCheckUtils]: 13: Hoare triple {396#false} assume !(~a~0.base == 0 && ~a~0.offset == 0); {396#false} is VALID [2018-11-14 19:12:45,755 INFO L273 TraceCheckUtils]: 14: Hoare triple {396#false} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {396#false} is VALID [2018-11-14 19:12:45,755 INFO L273 TraceCheckUtils]: 15: Hoare triple {396#false} assume true; {396#false} is VALID [2018-11-14 19:12:45,755 INFO L273 TraceCheckUtils]: 16: Hoare triple {396#false} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {396#false} is VALID [2018-11-14 19:12:45,756 INFO L273 TraceCheckUtils]: 17: Hoare triple {396#false} assume !(#t~nondet30 != 0);havoc #t~nondet30; {396#false} is VALID [2018-11-14 19:12:45,756 INFO L273 TraceCheckUtils]: 18: Hoare triple {396#false} assume true; {396#false} is VALID [2018-11-14 19:12:45,757 INFO L273 TraceCheckUtils]: 19: Hoare triple {396#false} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {396#false} is VALID [2018-11-14 19:12:45,757 INFO L273 TraceCheckUtils]: 20: Hoare triple {396#false} assume !(#t~nondet33 != 0);havoc #t~nondet33; {396#false} is VALID [2018-11-14 19:12:45,758 INFO L273 TraceCheckUtils]: 21: Hoare triple {396#false} call write~int(3, ~p~0.base, ~p~0.offset + 0, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {396#false} is VALID [2018-11-14 19:12:45,758 INFO L273 TraceCheckUtils]: 22: Hoare triple {396#false} assume true; {396#false} is VALID [2018-11-14 19:12:45,759 INFO L273 TraceCheckUtils]: 23: Hoare triple {396#false} call #t~mem36 := read~int(~p~0.base, ~p~0.offset + 0, 4); {396#false} is VALID [2018-11-14 19:12:45,759 INFO L273 TraceCheckUtils]: 24: Hoare triple {396#false} assume !(#t~mem36 == 2);havoc #t~mem36; {396#false} is VALID [2018-11-14 19:12:45,759 INFO L273 TraceCheckUtils]: 25: Hoare triple {396#false} assume true; {396#false} is VALID [2018-11-14 19:12:45,759 INFO L273 TraceCheckUtils]: 26: Hoare triple {396#false} call #t~mem38 := read~int(~p~0.base, ~p~0.offset + 0, 4); {396#false} is VALID [2018-11-14 19:12:45,761 INFO L273 TraceCheckUtils]: 27: Hoare triple {396#false} assume !(#t~mem38 == 1);havoc #t~mem38; {396#false} is VALID [2018-11-14 19:12:45,761 INFO L273 TraceCheckUtils]: 28: Hoare triple {396#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset + 0, 4); {396#false} is VALID [2018-11-14 19:12:45,761 INFO L273 TraceCheckUtils]: 29: Hoare triple {396#false} assume #t~mem40 != 3;havoc #t~mem40; {396#false} is VALID [2018-11-14 19:12:45,762 INFO L273 TraceCheckUtils]: 30: Hoare triple {396#false} assume !false; {396#false} is VALID [2018-11-14 19:12:45,772 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 19:12:45,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:12:45,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 19:12:45,779 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-14 19:12:45,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:12:45,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 19:12:45,850 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:12:45,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 19:12:45,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 19:12:45,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:12:45,851 INFO L87 Difference]: Start difference. First operand 55 states and 72 transitions. Second operand 3 states. [2018-11-14 19:12:46,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:46,168 INFO L93 Difference]: Finished difference Result 89 states and 115 transitions. [2018-11-14 19:12:46,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 19:12:46,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-11-14 19:12:46,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:12:46,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:12:46,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2018-11-14 19:12:46,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 19:12:46,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2018-11-14 19:12:46,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 115 transitions. [2018-11-14 19:12:46,442 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:12:46,445 INFO L225 Difference]: With dead ends: 89 [2018-11-14 19:12:46,445 INFO L226 Difference]: Without dead ends: 65 [2018-11-14 19:12:46,446 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 19:12:46,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-14 19:12:46,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-14 19:12:46,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:12:46,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 65 states. [2018-11-14 19:12:46,483 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2018-11-14 19:12:46,484 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2018-11-14 19:12:46,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:46,488 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2018-11-14 19:12:46,488 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2018-11-14 19:12:46,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:46,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:46,490 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2018-11-14 19:12:46,490 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2018-11-14 19:12:46,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:46,494 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2018-11-14 19:12:46,495 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2018-11-14 19:12:46,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:46,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:46,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:12:46,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:12:46,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-14 19:12:46,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 87 transitions. [2018-11-14 19:12:46,500 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 87 transitions. Word has length 31 [2018-11-14 19:12:46,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:12:46,500 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 87 transitions. [2018-11-14 19:12:46,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 19:12:46,501 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 87 transitions. [2018-11-14 19:12:46,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 19:12:46,502 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:12:46,502 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:12:46,503 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:12:46,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:12:46,503 INFO L82 PathProgramCache]: Analyzing trace with hash -2084215142, now seen corresponding path program 1 times [2018-11-14 19:12:46,503 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:12:46,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:12:46,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:46,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:12:46,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:46,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:12:46,665 INFO L256 TraceCheckUtils]: 0: Hoare triple {710#true} call ULTIMATE.init(); {710#true} is VALID [2018-11-14 19:12:46,665 INFO L273 TraceCheckUtils]: 1: Hoare triple {710#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {710#true} is VALID [2018-11-14 19:12:46,666 INFO L273 TraceCheckUtils]: 2: Hoare triple {710#true} assume true; {710#true} is VALID [2018-11-14 19:12:46,666 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {710#true} {710#true} #232#return; {710#true} is VALID [2018-11-14 19:12:46,667 INFO L256 TraceCheckUtils]: 4: Hoare triple {710#true} call #t~ret41 := main(); {710#true} is VALID [2018-11-14 19:12:46,667 INFO L273 TraceCheckUtils]: 5: Hoare triple {710#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset + 0, 4);call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset + 4, 4); {710#true} is VALID [2018-11-14 19:12:46,668 INFO L273 TraceCheckUtils]: 6: Hoare triple {710#true} assume true; {710#true} is VALID [2018-11-14 19:12:46,668 INFO L273 TraceCheckUtils]: 7: Hoare triple {710#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {710#true} is VALID [2018-11-14 19:12:46,668 INFO L273 TraceCheckUtils]: 8: Hoare triple {710#true} assume !(#t~nondet3 != 0);havoc #t~nondet3; {710#true} is VALID [2018-11-14 19:12:46,668 INFO L273 TraceCheckUtils]: 9: Hoare triple {710#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {710#true} is VALID [2018-11-14 19:12:46,669 INFO L273 TraceCheckUtils]: 10: Hoare triple {710#true} assume true; {710#true} is VALID [2018-11-14 19:12:46,669 INFO L273 TraceCheckUtils]: 11: Hoare triple {710#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {710#true} is VALID [2018-11-14 19:12:46,669 INFO L273 TraceCheckUtils]: 12: Hoare triple {710#true} assume true; {710#true} is VALID [2018-11-14 19:12:46,670 INFO L273 TraceCheckUtils]: 13: Hoare triple {710#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset + 0, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {710#true} is VALID [2018-11-14 19:12:46,670 INFO L273 TraceCheckUtils]: 14: Hoare triple {710#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, ~n~0.offset + 4, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {710#true} is VALID [2018-11-14 19:12:46,670 INFO L273 TraceCheckUtils]: 15: Hoare triple {710#true} assume !#t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~short24;havoc #t~mem23.base, #t~mem23.offset; {710#true} is VALID [2018-11-14 19:12:46,671 INFO L273 TraceCheckUtils]: 16: Hoare triple {710#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {710#true} is VALID [2018-11-14 19:12:46,671 INFO L273 TraceCheckUtils]: 17: Hoare triple {710#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {710#true} is VALID [2018-11-14 19:12:46,671 INFO L273 TraceCheckUtils]: 18: Hoare triple {710#true} assume true; {710#true} is VALID [2018-11-14 19:12:46,672 INFO L273 TraceCheckUtils]: 19: Hoare triple {710#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {710#true} is VALID [2018-11-14 19:12:46,672 INFO L273 TraceCheckUtils]: 20: Hoare triple {710#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {710#true} is VALID [2018-11-14 19:12:46,672 INFO L273 TraceCheckUtils]: 21: Hoare triple {710#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {710#true} is VALID [2018-11-14 19:12:46,673 INFO L273 TraceCheckUtils]: 22: Hoare triple {710#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {712#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:46,675 INFO L273 TraceCheckUtils]: 23: Hoare triple {712#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {712#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:46,675 INFO L273 TraceCheckUtils]: 24: Hoare triple {712#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {712#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:46,677 INFO L273 TraceCheckUtils]: 25: Hoare triple {712#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(#t~nondet30 != 0);havoc #t~nondet30; {712#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:46,680 INFO L273 TraceCheckUtils]: 26: Hoare triple {712#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {712#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:46,685 INFO L273 TraceCheckUtils]: 27: Hoare triple {712#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {712#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:46,687 INFO L273 TraceCheckUtils]: 28: Hoare triple {712#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(#t~nondet33 != 0);havoc #t~nondet33; {712#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:46,689 INFO L273 TraceCheckUtils]: 29: Hoare triple {712#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~int(3, ~p~0.base, ~p~0.offset + 0, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {713#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:12:46,691 INFO L273 TraceCheckUtils]: 30: Hoare triple {713#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {713#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:12:46,691 INFO L273 TraceCheckUtils]: 31: Hoare triple {713#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset + 0, 4); {713#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:12:46,692 INFO L273 TraceCheckUtils]: 32: Hoare triple {713#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(#t~mem36 == 2);havoc #t~mem36; {713#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:12:46,692 INFO L273 TraceCheckUtils]: 33: Hoare triple {713#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {713#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:12:46,693 INFO L273 TraceCheckUtils]: 34: Hoare triple {713#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem38 := read~int(~p~0.base, ~p~0.offset + 0, 4); {713#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:12:46,693 INFO L273 TraceCheckUtils]: 35: Hoare triple {713#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(#t~mem38 == 1);havoc #t~mem38; {713#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:12:46,694 INFO L273 TraceCheckUtils]: 36: Hoare triple {713#(= 3 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem40 := read~int(~p~0.base, ~p~0.offset + 0, 4); {714#(= 3 |main_#t~mem40|)} is VALID [2018-11-14 19:12:46,695 INFO L273 TraceCheckUtils]: 37: Hoare triple {714#(= 3 |main_#t~mem40|)} assume #t~mem40 != 3;havoc #t~mem40; {711#false} is VALID [2018-11-14 19:12:46,695 INFO L273 TraceCheckUtils]: 38: Hoare triple {711#false} assume !false; {711#false} is VALID [2018-11-14 19:12:46,700 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 19:12:46,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:12:46,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 19:12:46,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-14 19:12:46,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:12:46,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:12:46,780 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 19:12:46,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:12:46,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:12:46,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:12:46,781 INFO L87 Difference]: Start difference. First operand 65 states and 87 transitions. Second operand 5 states. [2018-11-14 19:12:47,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:47,313 INFO L93 Difference]: Finished difference Result 96 states and 122 transitions. [2018-11-14 19:12:47,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:12:47,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2018-11-14 19:12:47,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:12:47,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:12:47,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2018-11-14 19:12:47,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:12:47,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2018-11-14 19:12:47,319 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 107 transitions. [2018-11-14 19:12:47,539 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:12:47,543 INFO L225 Difference]: With dead ends: 96 [2018-11-14 19:12:47,543 INFO L226 Difference]: Without dead ends: 92 [2018-11-14 19:12:47,544 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:12:47,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-14 19:12:47,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 78. [2018-11-14 19:12:47,573 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:12:47,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 78 states. [2018-11-14 19:12:47,573 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 78 states. [2018-11-14 19:12:47,574 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 78 states. [2018-11-14 19:12:47,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:47,579 INFO L93 Difference]: Finished difference Result 92 states and 118 transitions. [2018-11-14 19:12:47,580 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 118 transitions. [2018-11-14 19:12:47,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:47,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:47,581 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 92 states. [2018-11-14 19:12:47,581 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 92 states. [2018-11-14 19:12:47,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:47,586 INFO L93 Difference]: Finished difference Result 92 states and 118 transitions. [2018-11-14 19:12:47,587 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 118 transitions. [2018-11-14 19:12:47,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:47,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:47,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:12:47,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:12:47,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-14 19:12:47,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 103 transitions. [2018-11-14 19:12:47,592 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 103 transitions. Word has length 39 [2018-11-14 19:12:47,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:12:47,593 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 103 transitions. [2018-11-14 19:12:47,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:12:47,593 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 103 transitions. [2018-11-14 19:12:47,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-14 19:12:47,595 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:12:47,595 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:12:47,595 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:12:47,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:12:47,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1357180956, now seen corresponding path program 1 times [2018-11-14 19:12:47,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:12:47,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:12:47,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:47,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:12:47,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:47,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:12:47,784 INFO L256 TraceCheckUtils]: 0: Hoare triple {1108#true} call ULTIMATE.init(); {1108#true} is VALID [2018-11-14 19:12:47,784 INFO L273 TraceCheckUtils]: 1: Hoare triple {1108#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1108#true} is VALID [2018-11-14 19:12:47,785 INFO L273 TraceCheckUtils]: 2: Hoare triple {1108#true} assume true; {1108#true} is VALID [2018-11-14 19:12:47,785 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1108#true} {1108#true} #232#return; {1108#true} is VALID [2018-11-14 19:12:47,786 INFO L256 TraceCheckUtils]: 4: Hoare triple {1108#true} call #t~ret41 := main(); {1108#true} is VALID [2018-11-14 19:12:47,786 INFO L273 TraceCheckUtils]: 5: Hoare triple {1108#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset + 0, 4);call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset + 4, 4); {1108#true} is VALID [2018-11-14 19:12:47,786 INFO L273 TraceCheckUtils]: 6: Hoare triple {1108#true} assume true; {1108#true} is VALID [2018-11-14 19:12:47,787 INFO L273 TraceCheckUtils]: 7: Hoare triple {1108#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1108#true} is VALID [2018-11-14 19:12:47,787 INFO L273 TraceCheckUtils]: 8: Hoare triple {1108#true} assume !(#t~nondet3 != 0);havoc #t~nondet3; {1108#true} is VALID [2018-11-14 19:12:47,787 INFO L273 TraceCheckUtils]: 9: Hoare triple {1108#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {1108#true} is VALID [2018-11-14 19:12:47,788 INFO L273 TraceCheckUtils]: 10: Hoare triple {1108#true} assume true; {1108#true} is VALID [2018-11-14 19:12:47,788 INFO L273 TraceCheckUtils]: 11: Hoare triple {1108#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {1108#true} is VALID [2018-11-14 19:12:47,788 INFO L273 TraceCheckUtils]: 12: Hoare triple {1108#true} assume true; {1108#true} is VALID [2018-11-14 19:12:47,788 INFO L273 TraceCheckUtils]: 13: Hoare triple {1108#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset + 0, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {1108#true} is VALID [2018-11-14 19:12:47,789 INFO L273 TraceCheckUtils]: 14: Hoare triple {1108#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, ~n~0.offset + 4, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {1108#true} is VALID [2018-11-14 19:12:47,789 INFO L273 TraceCheckUtils]: 15: Hoare triple {1108#true} assume !#t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~short24;havoc #t~mem23.base, #t~mem23.offset; {1108#true} is VALID [2018-11-14 19:12:47,789 INFO L273 TraceCheckUtils]: 16: Hoare triple {1108#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {1108#true} is VALID [2018-11-14 19:12:47,790 INFO L273 TraceCheckUtils]: 17: Hoare triple {1108#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {1108#true} is VALID [2018-11-14 19:12:47,790 INFO L273 TraceCheckUtils]: 18: Hoare triple {1108#true} assume true; {1108#true} is VALID [2018-11-14 19:12:47,790 INFO L273 TraceCheckUtils]: 19: Hoare triple {1108#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {1108#true} is VALID [2018-11-14 19:12:47,790 INFO L273 TraceCheckUtils]: 20: Hoare triple {1108#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {1108#true} is VALID [2018-11-14 19:12:47,791 INFO L273 TraceCheckUtils]: 21: Hoare triple {1108#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1108#true} is VALID [2018-11-14 19:12:47,794 INFO L273 TraceCheckUtils]: 22: Hoare triple {1108#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1110#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:47,797 INFO L273 TraceCheckUtils]: 23: Hoare triple {1110#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {1110#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:47,797 INFO L273 TraceCheckUtils]: 24: Hoare triple {1110#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {1110#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:47,802 INFO L273 TraceCheckUtils]: 25: Hoare triple {1110#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(#t~nondet30 != 0);havoc #t~nondet30; {1110#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:47,802 INFO L273 TraceCheckUtils]: 26: Hoare triple {1110#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {1110#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:47,804 INFO L273 TraceCheckUtils]: 27: Hoare triple {1110#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {1110#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:47,807 INFO L273 TraceCheckUtils]: 28: Hoare triple {1110#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(#t~nondet33 != 0);havoc #t~nondet33; {1110#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:47,808 INFO L273 TraceCheckUtils]: 29: Hoare triple {1110#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~int(3, ~p~0.base, ~p~0.offset + 0, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1111#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} is VALID [2018-11-14 19:12:47,809 INFO L273 TraceCheckUtils]: 30: Hoare triple {1111#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} assume true; {1111#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} is VALID [2018-11-14 19:12:47,825 INFO L273 TraceCheckUtils]: 31: Hoare triple {1111#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} call #t~mem36 := read~int(~p~0.base, ~p~0.offset + 0, 4); {1111#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} is VALID [2018-11-14 19:12:47,826 INFO L273 TraceCheckUtils]: 32: Hoare triple {1111#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} assume !(#t~mem36 == 2);havoc #t~mem36; {1111#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} is VALID [2018-11-14 19:12:47,827 INFO L273 TraceCheckUtils]: 33: Hoare triple {1111#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} assume true; {1111#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} is VALID [2018-11-14 19:12:47,827 INFO L273 TraceCheckUtils]: 34: Hoare triple {1111#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} call #t~mem38 := read~int(~p~0.base, ~p~0.offset + 0, 4); {1112#(= |main_#t~mem38| 3)} is VALID [2018-11-14 19:12:47,830 INFO L273 TraceCheckUtils]: 35: Hoare triple {1112#(= |main_#t~mem38| 3)} assume !!(#t~mem38 == 1);havoc #t~mem38;call #t~mem39.base, #t~mem39.offset := read~$Pointer$(~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := #t~mem39.base, #t~mem39.offset;havoc #t~mem39.base, #t~mem39.offset; {1109#false} is VALID [2018-11-14 19:12:47,830 INFO L273 TraceCheckUtils]: 36: Hoare triple {1109#false} assume true; {1109#false} is VALID [2018-11-14 19:12:47,831 INFO L273 TraceCheckUtils]: 37: Hoare triple {1109#false} call #t~mem38 := read~int(~p~0.base, ~p~0.offset + 0, 4); {1109#false} is VALID [2018-11-14 19:12:47,832 INFO L273 TraceCheckUtils]: 38: Hoare triple {1109#false} assume !(#t~mem38 == 1);havoc #t~mem38; {1109#false} is VALID [2018-11-14 19:12:47,832 INFO L273 TraceCheckUtils]: 39: Hoare triple {1109#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset + 0, 4); {1109#false} is VALID [2018-11-14 19:12:47,833 INFO L273 TraceCheckUtils]: 40: Hoare triple {1109#false} assume #t~mem40 != 3;havoc #t~mem40; {1109#false} is VALID [2018-11-14 19:12:47,833 INFO L273 TraceCheckUtils]: 41: Hoare triple {1109#false} assume !false; {1109#false} is VALID [2018-11-14 19:12:47,837 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 19:12:47,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:12:47,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 19:12:47,838 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-14 19:12:47,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:12:47,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:12:47,901 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:12:47,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:12:47,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:12:47,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:12:47,902 INFO L87 Difference]: Start difference. First operand 78 states and 103 transitions. Second operand 5 states. [2018-11-14 19:12:48,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:48,417 INFO L93 Difference]: Finished difference Result 99 states and 125 transitions. [2018-11-14 19:12:48,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:12:48,418 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-14 19:12:48,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:12:48,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:12:48,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2018-11-14 19:12:48,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:12:48,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2018-11-14 19:12:48,423 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 110 transitions. [2018-11-14 19:12:48,549 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:12:48,552 INFO L225 Difference]: With dead ends: 99 [2018-11-14 19:12:48,552 INFO L226 Difference]: Without dead ends: 89 [2018-11-14 19:12:48,553 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:12:48,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-14 19:12:48,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 75. [2018-11-14 19:12:48,620 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:12:48,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 75 states. [2018-11-14 19:12:48,620 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 75 states. [2018-11-14 19:12:48,620 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 75 states. [2018-11-14 19:12:48,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:48,624 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2018-11-14 19:12:48,624 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2018-11-14 19:12:48,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:48,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:48,625 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 89 states. [2018-11-14 19:12:48,626 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 89 states. [2018-11-14 19:12:48,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:48,630 INFO L93 Difference]: Finished difference Result 89 states and 114 transitions. [2018-11-14 19:12:48,630 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 114 transitions. [2018-11-14 19:12:48,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:48,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:48,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:12:48,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:12:48,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-14 19:12:48,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 99 transitions. [2018-11-14 19:12:48,635 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 99 transitions. Word has length 42 [2018-11-14 19:12:48,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:12:48,635 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 99 transitions. [2018-11-14 19:12:48,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:12:48,635 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 99 transitions. [2018-11-14 19:12:48,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-14 19:12:48,636 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:12:48,637 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:12:48,637 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:12:48,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:12:48,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1337487629, now seen corresponding path program 1 times [2018-11-14 19:12:48,638 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:12:48,638 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:12:48,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:48,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:12:48,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:12:48,833 INFO L256 TraceCheckUtils]: 0: Hoare triple {1500#true} call ULTIMATE.init(); {1500#true} is VALID [2018-11-14 19:12:48,833 INFO L273 TraceCheckUtils]: 1: Hoare triple {1500#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1500#true} is VALID [2018-11-14 19:12:48,833 INFO L273 TraceCheckUtils]: 2: Hoare triple {1500#true} assume true; {1500#true} is VALID [2018-11-14 19:12:48,833 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1500#true} {1500#true} #232#return; {1500#true} is VALID [2018-11-14 19:12:48,834 INFO L256 TraceCheckUtils]: 4: Hoare triple {1500#true} call #t~ret41 := main(); {1500#true} is VALID [2018-11-14 19:12:48,834 INFO L273 TraceCheckUtils]: 5: Hoare triple {1500#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset + 0, 4);call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset + 4, 4); {1500#true} is VALID [2018-11-14 19:12:48,834 INFO L273 TraceCheckUtils]: 6: Hoare triple {1500#true} assume true; {1500#true} is VALID [2018-11-14 19:12:48,834 INFO L273 TraceCheckUtils]: 7: Hoare triple {1500#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1500#true} is VALID [2018-11-14 19:12:48,835 INFO L273 TraceCheckUtils]: 8: Hoare triple {1500#true} assume !(#t~nondet3 != 0);havoc #t~nondet3; {1500#true} is VALID [2018-11-14 19:12:48,835 INFO L273 TraceCheckUtils]: 9: Hoare triple {1500#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {1500#true} is VALID [2018-11-14 19:12:48,835 INFO L273 TraceCheckUtils]: 10: Hoare triple {1500#true} assume true; {1500#true} is VALID [2018-11-14 19:12:48,835 INFO L273 TraceCheckUtils]: 11: Hoare triple {1500#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {1500#true} is VALID [2018-11-14 19:12:48,835 INFO L273 TraceCheckUtils]: 12: Hoare triple {1500#true} assume true; {1500#true} is VALID [2018-11-14 19:12:48,836 INFO L273 TraceCheckUtils]: 13: Hoare triple {1500#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset + 0, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {1500#true} is VALID [2018-11-14 19:12:48,836 INFO L273 TraceCheckUtils]: 14: Hoare triple {1500#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, ~n~0.offset + 4, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {1500#true} is VALID [2018-11-14 19:12:48,836 INFO L273 TraceCheckUtils]: 15: Hoare triple {1500#true} assume !#t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~short24;havoc #t~mem23.base, #t~mem23.offset; {1500#true} is VALID [2018-11-14 19:12:48,836 INFO L273 TraceCheckUtils]: 16: Hoare triple {1500#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {1500#true} is VALID [2018-11-14 19:12:48,836 INFO L273 TraceCheckUtils]: 17: Hoare triple {1500#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {1500#true} is VALID [2018-11-14 19:12:48,837 INFO L273 TraceCheckUtils]: 18: Hoare triple {1500#true} assume true; {1500#true} is VALID [2018-11-14 19:12:48,837 INFO L273 TraceCheckUtils]: 19: Hoare triple {1500#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {1500#true} is VALID [2018-11-14 19:12:48,837 INFO L273 TraceCheckUtils]: 20: Hoare triple {1500#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {1500#true} is VALID [2018-11-14 19:12:48,837 INFO L273 TraceCheckUtils]: 21: Hoare triple {1500#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1500#true} is VALID [2018-11-14 19:12:48,838 INFO L273 TraceCheckUtils]: 22: Hoare triple {1500#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1502#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:48,838 INFO L273 TraceCheckUtils]: 23: Hoare triple {1502#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {1502#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:48,843 INFO L273 TraceCheckUtils]: 24: Hoare triple {1502#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {1502#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:48,843 INFO L273 TraceCheckUtils]: 25: Hoare triple {1502#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(#t~nondet30 != 0);havoc #t~nondet30; {1502#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:48,844 INFO L273 TraceCheckUtils]: 26: Hoare triple {1502#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {1502#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:48,844 INFO L273 TraceCheckUtils]: 27: Hoare triple {1502#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {1502#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:48,845 INFO L273 TraceCheckUtils]: 28: Hoare triple {1502#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(#t~nondet33 != 0);havoc #t~nondet33; {1502#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:48,845 INFO L273 TraceCheckUtils]: 29: Hoare triple {1502#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~int(3, ~p~0.base, ~p~0.offset + 0, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1503#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} is VALID [2018-11-14 19:12:48,846 INFO L273 TraceCheckUtils]: 30: Hoare triple {1503#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} assume true; {1503#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} is VALID [2018-11-14 19:12:48,846 INFO L273 TraceCheckUtils]: 31: Hoare triple {1503#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)} call #t~mem36 := read~int(~p~0.base, ~p~0.offset + 0, 4); {1504#(= |main_#t~mem36| 3)} is VALID [2018-11-14 19:12:48,847 INFO L273 TraceCheckUtils]: 32: Hoare triple {1504#(= |main_#t~mem36| 3)} assume !!(#t~mem36 == 2);havoc #t~mem36;call #t~mem37.base, #t~mem37.offset := read~$Pointer$(~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := #t~mem37.base, #t~mem37.offset;havoc #t~mem37.base, #t~mem37.offset; {1501#false} is VALID [2018-11-14 19:12:48,848 INFO L273 TraceCheckUtils]: 33: Hoare triple {1501#false} assume true; {1501#false} is VALID [2018-11-14 19:12:48,848 INFO L273 TraceCheckUtils]: 34: Hoare triple {1501#false} call #t~mem36 := read~int(~p~0.base, ~p~0.offset + 0, 4); {1501#false} is VALID [2018-11-14 19:12:48,848 INFO L273 TraceCheckUtils]: 35: Hoare triple {1501#false} assume !(#t~mem36 == 2);havoc #t~mem36; {1501#false} is VALID [2018-11-14 19:12:48,849 INFO L273 TraceCheckUtils]: 36: Hoare triple {1501#false} assume true; {1501#false} is VALID [2018-11-14 19:12:48,849 INFO L273 TraceCheckUtils]: 37: Hoare triple {1501#false} call #t~mem38 := read~int(~p~0.base, ~p~0.offset + 0, 4); {1501#false} is VALID [2018-11-14 19:12:48,849 INFO L273 TraceCheckUtils]: 38: Hoare triple {1501#false} assume !(#t~mem38 == 1);havoc #t~mem38; {1501#false} is VALID [2018-11-14 19:12:48,850 INFO L273 TraceCheckUtils]: 39: Hoare triple {1501#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset + 0, 4); {1501#false} is VALID [2018-11-14 19:12:48,850 INFO L273 TraceCheckUtils]: 40: Hoare triple {1501#false} assume #t~mem40 != 3;havoc #t~mem40; {1501#false} is VALID [2018-11-14 19:12:48,850 INFO L273 TraceCheckUtils]: 41: Hoare triple {1501#false} assume !false; {1501#false} is VALID [2018-11-14 19:12:48,854 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 19:12:48,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 19:12:48,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 19:12:48,855 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-14 19:12:48,855 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:12:48,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:12:48,929 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:12:48,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:12:48,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:12:48,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:12:48,931 INFO L87 Difference]: Start difference. First operand 75 states and 99 transitions. Second operand 5 states. [2018-11-14 19:12:49,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:49,587 INFO L93 Difference]: Finished difference Result 99 states and 125 transitions. [2018-11-14 19:12:49,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:12:49,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2018-11-14 19:12:49,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:12:49,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:12:49,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2018-11-14 19:12:49,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:12:49,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 110 transitions. [2018-11-14 19:12:49,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 110 transitions. [2018-11-14 19:12:49,810 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:12:49,812 INFO L225 Difference]: With dead ends: 99 [2018-11-14 19:12:49,812 INFO L226 Difference]: Without dead ends: 85 [2018-11-14 19:12:49,813 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 19:12:49,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-14 19:12:49,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 71. [2018-11-14 19:12:49,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:12:49,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 71 states. [2018-11-14 19:12:49,851 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 71 states. [2018-11-14 19:12:49,851 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 71 states. [2018-11-14 19:12:49,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:49,854 INFO L93 Difference]: Finished difference Result 85 states and 109 transitions. [2018-11-14 19:12:49,854 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 109 transitions. [2018-11-14 19:12:49,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:49,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:49,855 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 85 states. [2018-11-14 19:12:49,855 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 85 states. [2018-11-14 19:12:49,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:49,859 INFO L93 Difference]: Finished difference Result 85 states and 109 transitions. [2018-11-14 19:12:49,859 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 109 transitions. [2018-11-14 19:12:49,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:49,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:49,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:12:49,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:12:49,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-14 19:12:49,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 94 transitions. [2018-11-14 19:12:49,863 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 94 transitions. Word has length 42 [2018-11-14 19:12:49,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:12:49,864 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 94 transitions. [2018-11-14 19:12:49,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:12:49,864 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 94 transitions. [2018-11-14 19:12:49,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-14 19:12:49,865 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:12:49,865 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:12:49,866 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:12:49,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:12:49,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1952639320, now seen corresponding path program 1 times [2018-11-14 19:12:49,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:12:49,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:12:49,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:49,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:12:49,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:12:50,113 INFO L256 TraceCheckUtils]: 0: Hoare triple {1880#true} call ULTIMATE.init(); {1880#true} is VALID [2018-11-14 19:12:50,113 INFO L273 TraceCheckUtils]: 1: Hoare triple {1880#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1880#true} is VALID [2018-11-14 19:12:50,114 INFO L273 TraceCheckUtils]: 2: Hoare triple {1880#true} assume true; {1880#true} is VALID [2018-11-14 19:12:50,114 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1880#true} {1880#true} #232#return; {1880#true} is VALID [2018-11-14 19:12:50,114 INFO L256 TraceCheckUtils]: 4: Hoare triple {1880#true} call #t~ret41 := main(); {1880#true} is VALID [2018-11-14 19:12:50,114 INFO L273 TraceCheckUtils]: 5: Hoare triple {1880#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset + 0, 4);call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset + 4, 4); {1880#true} is VALID [2018-11-14 19:12:50,115 INFO L273 TraceCheckUtils]: 6: Hoare triple {1880#true} assume true; {1880#true} is VALID [2018-11-14 19:12:50,115 INFO L273 TraceCheckUtils]: 7: Hoare triple {1880#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1880#true} is VALID [2018-11-14 19:12:50,115 INFO L273 TraceCheckUtils]: 8: Hoare triple {1880#true} assume !(#t~nondet3 != 0);havoc #t~nondet3; {1880#true} is VALID [2018-11-14 19:12:50,115 INFO L273 TraceCheckUtils]: 9: Hoare triple {1880#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {1880#true} is VALID [2018-11-14 19:12:50,115 INFO L273 TraceCheckUtils]: 10: Hoare triple {1880#true} assume true; {1880#true} is VALID [2018-11-14 19:12:50,116 INFO L273 TraceCheckUtils]: 11: Hoare triple {1880#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {1880#true} is VALID [2018-11-14 19:12:50,116 INFO L273 TraceCheckUtils]: 12: Hoare triple {1880#true} assume true; {1880#true} is VALID [2018-11-14 19:12:50,116 INFO L273 TraceCheckUtils]: 13: Hoare triple {1880#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset + 0, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {1880#true} is VALID [2018-11-14 19:12:50,116 INFO L273 TraceCheckUtils]: 14: Hoare triple {1880#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, ~n~0.offset + 4, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {1880#true} is VALID [2018-11-14 19:12:50,116 INFO L273 TraceCheckUtils]: 15: Hoare triple {1880#true} assume !#t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~short24;havoc #t~mem23.base, #t~mem23.offset; {1880#true} is VALID [2018-11-14 19:12:50,117 INFO L273 TraceCheckUtils]: 16: Hoare triple {1880#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {1880#true} is VALID [2018-11-14 19:12:50,117 INFO L273 TraceCheckUtils]: 17: Hoare triple {1880#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {1880#true} is VALID [2018-11-14 19:12:50,119 INFO L273 TraceCheckUtils]: 18: Hoare triple {1880#true} assume true; {1880#true} is VALID [2018-11-14 19:12:50,119 INFO L273 TraceCheckUtils]: 19: Hoare triple {1880#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {1880#true} is VALID [2018-11-14 19:12:50,121 INFO L273 TraceCheckUtils]: 20: Hoare triple {1880#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {1882#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-14 19:12:50,122 INFO L273 TraceCheckUtils]: 21: Hoare triple {1882#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1882#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-14 19:12:50,122 INFO L273 TraceCheckUtils]: 22: Hoare triple {1882#(= (select |#valid| main_~a~0.base) 1)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1883#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:50,127 INFO L273 TraceCheckUtils]: 23: Hoare triple {1883#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {1883#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:50,127 INFO L273 TraceCheckUtils]: 24: Hoare triple {1883#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {1883#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:50,128 INFO L273 TraceCheckUtils]: 25: Hoare triple {1883#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(#t~nondet30 != 0);havoc #t~nondet30; {1883#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:50,129 INFO L273 TraceCheckUtils]: 26: Hoare triple {1883#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {1883#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:50,129 INFO L273 TraceCheckUtils]: 27: Hoare triple {1883#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {1883#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:50,131 INFO L273 TraceCheckUtils]: 28: Hoare triple {1883#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !!(#t~nondet33 != 0);havoc #t~nondet33;call write~int(2, ~p~0.base, ~p~0.offset + 0, 4);call #t~malloc34.base, #t~malloc34.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc34.base, #t~malloc34.offset; {1884#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:50,132 INFO L273 TraceCheckUtils]: 29: Hoare triple {1884#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {1884#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:50,140 INFO L273 TraceCheckUtils]: 30: Hoare triple {1884#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~p~0.offset + 4, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {1885#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 19:12:50,141 INFO L273 TraceCheckUtils]: 31: Hoare triple {1885#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume true; {1885#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 19:12:50,142 INFO L273 TraceCheckUtils]: 32: Hoare triple {1885#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {1885#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 19:12:50,142 INFO L273 TraceCheckUtils]: 33: Hoare triple {1885#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume !(#t~nondet33 != 0);havoc #t~nondet33; {1885#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 19:12:50,143 INFO L273 TraceCheckUtils]: 34: Hoare triple {1885#(= 2 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} call write~int(3, ~p~0.base, ~p~0.offset + 0, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1886#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:12:50,144 INFO L273 TraceCheckUtils]: 35: Hoare triple {1886#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {1886#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:12:50,144 INFO L273 TraceCheckUtils]: 36: Hoare triple {1886#(= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset + 0, 4); {1887#(= 2 |main_#t~mem36|)} is VALID [2018-11-14 19:12:50,145 INFO L273 TraceCheckUtils]: 37: Hoare triple {1887#(= 2 |main_#t~mem36|)} assume !(#t~mem36 == 2);havoc #t~mem36; {1881#false} is VALID [2018-11-14 19:12:50,145 INFO L273 TraceCheckUtils]: 38: Hoare triple {1881#false} assume true; {1881#false} is VALID [2018-11-14 19:12:50,145 INFO L273 TraceCheckUtils]: 39: Hoare triple {1881#false} call #t~mem38 := read~int(~p~0.base, ~p~0.offset + 0, 4); {1881#false} is VALID [2018-11-14 19:12:50,145 INFO L273 TraceCheckUtils]: 40: Hoare triple {1881#false} assume !(#t~mem38 == 1);havoc #t~mem38; {1881#false} is VALID [2018-11-14 19:12:50,146 INFO L273 TraceCheckUtils]: 41: Hoare triple {1881#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset + 0, 4); {1881#false} is VALID [2018-11-14 19:12:50,146 INFO L273 TraceCheckUtils]: 42: Hoare triple {1881#false} assume #t~mem40 != 3;havoc #t~mem40; {1881#false} is VALID [2018-11-14 19:12:50,146 INFO L273 TraceCheckUtils]: 43: Hoare triple {1881#false} assume !false; {1881#false} is VALID [2018-11-14 19:12:50,152 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 19:12:50,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:12:50,153 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:12:50,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:12:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:12:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:12:50,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:12:50,482 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 6 treesize of output 5 [2018-11-14 19:12:50,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 19:12:50,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:12:50,529 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-14 19:12:50,543 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 19:12:50,704 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:12:50,705 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:12:50,706 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 11 treesize of output 4 [2018-11-14 19:12:50,708 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 19:12:50,770 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 19:12:50,776 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 19:12:50,779 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 19:12:50,781 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:12:50,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:12:50,834 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2018-11-14 19:12:50,837 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 19:12:51,173 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 19:12:51,185 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 19:12:51,187 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 19:12:51,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:12:51,218 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 19:12:51,218 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-14 19:12:51,227 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 19:12:51,342 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 19:12:51,356 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 19:12:51,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 19:12:51,373 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 19:12:51,374 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 19:12:51,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:12:51,383 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 19:12:51,383 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-14 19:12:51,385 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 19:12:51,395 INFO L256 TraceCheckUtils]: 0: Hoare triple {1880#true} call ULTIMATE.init(); {1880#true} is VALID [2018-11-14 19:12:51,395 INFO L273 TraceCheckUtils]: 1: Hoare triple {1880#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1880#true} is VALID [2018-11-14 19:12:51,396 INFO L273 TraceCheckUtils]: 2: Hoare triple {1880#true} assume true; {1880#true} is VALID [2018-11-14 19:12:51,396 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1880#true} {1880#true} #232#return; {1880#true} is VALID [2018-11-14 19:12:51,396 INFO L256 TraceCheckUtils]: 4: Hoare triple {1880#true} call #t~ret41 := main(); {1880#true} is VALID [2018-11-14 19:12:51,397 INFO L273 TraceCheckUtils]: 5: Hoare triple {1880#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset + 0, 4);call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset + 4, 4); {1880#true} is VALID [2018-11-14 19:12:51,397 INFO L273 TraceCheckUtils]: 6: Hoare triple {1880#true} assume true; {1880#true} is VALID [2018-11-14 19:12:51,397 INFO L273 TraceCheckUtils]: 7: Hoare triple {1880#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {1880#true} is VALID [2018-11-14 19:12:51,398 INFO L273 TraceCheckUtils]: 8: Hoare triple {1880#true} assume !(#t~nondet3 != 0);havoc #t~nondet3; {1880#true} is VALID [2018-11-14 19:12:51,398 INFO L273 TraceCheckUtils]: 9: Hoare triple {1880#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {1880#true} is VALID [2018-11-14 19:12:51,398 INFO L273 TraceCheckUtils]: 10: Hoare triple {1880#true} assume true; {1880#true} is VALID [2018-11-14 19:12:51,398 INFO L273 TraceCheckUtils]: 11: Hoare triple {1880#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {1880#true} is VALID [2018-11-14 19:12:51,398 INFO L273 TraceCheckUtils]: 12: Hoare triple {1880#true} assume true; {1880#true} is VALID [2018-11-14 19:12:51,399 INFO L273 TraceCheckUtils]: 13: Hoare triple {1880#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset + 0, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {1880#true} is VALID [2018-11-14 19:12:51,399 INFO L273 TraceCheckUtils]: 14: Hoare triple {1880#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, ~n~0.offset + 4, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {1880#true} is VALID [2018-11-14 19:12:51,399 INFO L273 TraceCheckUtils]: 15: Hoare triple {1880#true} assume !#t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~short24;havoc #t~mem23.base, #t~mem23.offset; {1880#true} is VALID [2018-11-14 19:12:51,399 INFO L273 TraceCheckUtils]: 16: Hoare triple {1880#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {1880#true} is VALID [2018-11-14 19:12:51,400 INFO L273 TraceCheckUtils]: 17: Hoare triple {1880#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {1880#true} is VALID [2018-11-14 19:12:51,400 INFO L273 TraceCheckUtils]: 18: Hoare triple {1880#true} assume true; {1880#true} is VALID [2018-11-14 19:12:51,400 INFO L273 TraceCheckUtils]: 19: Hoare triple {1880#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {1880#true} is VALID [2018-11-14 19:12:51,419 INFO L273 TraceCheckUtils]: 20: Hoare triple {1880#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {1882#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-14 19:12:51,433 INFO L273 TraceCheckUtils]: 21: Hoare triple {1882#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {1882#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-14 19:12:51,437 INFO L273 TraceCheckUtils]: 22: Hoare triple {1882#(= (select |#valid| main_~a~0.base) 1)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1883#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:51,438 INFO L273 TraceCheckUtils]: 23: Hoare triple {1883#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {1883#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:51,439 INFO L273 TraceCheckUtils]: 24: Hoare triple {1883#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {1883#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:51,439 INFO L273 TraceCheckUtils]: 25: Hoare triple {1883#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(#t~nondet30 != 0);havoc #t~nondet30; {1883#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:51,440 INFO L273 TraceCheckUtils]: 26: Hoare triple {1883#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {1883#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:51,440 INFO L273 TraceCheckUtils]: 27: Hoare triple {1883#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {1883#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:51,442 INFO L273 TraceCheckUtils]: 28: Hoare triple {1883#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !!(#t~nondet33 != 0);havoc #t~nondet33;call write~int(2, ~p~0.base, ~p~0.offset + 0, 4);call #t~malloc34.base, #t~malloc34.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc34.base, #t~malloc34.offset; {1884#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:51,443 INFO L273 TraceCheckUtils]: 29: Hoare triple {1884#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {1884#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:51,445 INFO L273 TraceCheckUtils]: 30: Hoare triple {1884#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~p~0.offset + 4, 4);call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {1981#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 19:12:51,450 INFO L273 TraceCheckUtils]: 31: Hoare triple {1981#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume true; {1981#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 19:12:51,451 INFO L273 TraceCheckUtils]: 32: Hoare triple {1981#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {1981#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 19:12:51,455 INFO L273 TraceCheckUtils]: 33: Hoare triple {1981#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(#t~nondet33 != 0);havoc #t~nondet33; {1981#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 19:12:51,457 INFO L273 TraceCheckUtils]: 34: Hoare triple {1981#(and (not (= main_~a~0.base main_~p~0.base)) (= 2 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~int(3, ~p~0.base, ~p~0.offset + 0, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {1994#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.offset_18 Int) (v_main_~p~0.base_18 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18) 3) (not (= v_main_~p~0.base_18 main_~p~0.base)))))} is VALID [2018-11-14 19:12:51,463 INFO L273 TraceCheckUtils]: 35: Hoare triple {1994#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.offset_18 Int) (v_main_~p~0.base_18 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18) 3) (not (= v_main_~p~0.base_18 main_~p~0.base)))))} assume true; {1994#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.offset_18 Int) (v_main_~p~0.base_18 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18) 3) (not (= v_main_~p~0.base_18 main_~p~0.base)))))} is VALID [2018-11-14 19:12:51,467 INFO L273 TraceCheckUtils]: 36: Hoare triple {1994#(and (= 2 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.offset_18 Int) (v_main_~p~0.base_18 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18) 3) (not (= v_main_~p~0.base_18 main_~p~0.base)))))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset + 0, 4); {1887#(= 2 |main_#t~mem36|)} is VALID [2018-11-14 19:12:51,472 INFO L273 TraceCheckUtils]: 37: Hoare triple {1887#(= 2 |main_#t~mem36|)} assume !(#t~mem36 == 2);havoc #t~mem36; {1881#false} is VALID [2018-11-14 19:12:51,472 INFO L273 TraceCheckUtils]: 38: Hoare triple {1881#false} assume true; {1881#false} is VALID [2018-11-14 19:12:51,472 INFO L273 TraceCheckUtils]: 39: Hoare triple {1881#false} call #t~mem38 := read~int(~p~0.base, ~p~0.offset + 0, 4); {1881#false} is VALID [2018-11-14 19:12:51,473 INFO L273 TraceCheckUtils]: 40: Hoare triple {1881#false} assume !(#t~mem38 == 1);havoc #t~mem38; {1881#false} is VALID [2018-11-14 19:12:51,473 INFO L273 TraceCheckUtils]: 41: Hoare triple {1881#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset + 0, 4); {1881#false} is VALID [2018-11-14 19:12:51,473 INFO L273 TraceCheckUtils]: 42: Hoare triple {1881#false} assume #t~mem40 != 3;havoc #t~mem40; {1881#false} is VALID [2018-11-14 19:12:51,474 INFO L273 TraceCheckUtils]: 43: Hoare triple {1881#false} assume !false; {1881#false} is VALID [2018-11-14 19:12:51,479 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 19:12:51,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:12:51,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-14 19:12:51,501 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2018-11-14 19:12:51,501 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:12:51,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 19:12:51,644 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:12:51,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 19:12:51,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 19:12:51,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-14 19:12:51,645 INFO L87 Difference]: Start difference. First operand 71 states and 94 transitions. Second operand 10 states. [2018-11-14 19:12:53,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:53,071 INFO L93 Difference]: Finished difference Result 101 states and 127 transitions. [2018-11-14 19:12:53,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 19:12:53,071 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2018-11-14 19:12:53,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:12:53,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 19:12:53,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2018-11-14 19:12:53,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 19:12:53,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 112 transitions. [2018-11-14 19:12:53,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 112 transitions. [2018-11-14 19:12:53,342 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:12:53,344 INFO L225 Difference]: With dead ends: 101 [2018-11-14 19:12:53,344 INFO L226 Difference]: Without dead ends: 94 [2018-11-14 19:12:53,344 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-14 19:12:53,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-11-14 19:12:53,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2018-11-14 19:12:53,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:12:53,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand 80 states. [2018-11-14 19:12:53,372 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 80 states. [2018-11-14 19:12:53,372 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 80 states. [2018-11-14 19:12:53,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:53,375 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2018-11-14 19:12:53,375 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2018-11-14 19:12:53,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:53,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:53,376 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 94 states. [2018-11-14 19:12:53,376 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 94 states. [2018-11-14 19:12:53,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:53,378 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2018-11-14 19:12:53,379 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 119 transitions. [2018-11-14 19:12:53,379 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:53,379 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:53,379 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:12:53,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:12:53,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-14 19:12:53,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 104 transitions. [2018-11-14 19:12:53,383 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 104 transitions. Word has length 44 [2018-11-14 19:12:53,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:12:53,383 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 104 transitions. [2018-11-14 19:12:53,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 19:12:53,383 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 104 transitions. [2018-11-14 19:12:53,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-14 19:12:53,384 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:12:53,385 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:12:53,385 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:12:53,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:12:53,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1003938405, now seen corresponding path program 1 times [2018-11-14 19:12:53,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:12:53,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:12:53,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:53,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:12:53,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:12:53,766 INFO L256 TraceCheckUtils]: 0: Hoare triple {2431#true} call ULTIMATE.init(); {2431#true} is VALID [2018-11-14 19:12:53,767 INFO L273 TraceCheckUtils]: 1: Hoare triple {2431#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2431#true} is VALID [2018-11-14 19:12:53,767 INFO L273 TraceCheckUtils]: 2: Hoare triple {2431#true} assume true; {2431#true} is VALID [2018-11-14 19:12:53,767 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2431#true} {2431#true} #232#return; {2431#true} is VALID [2018-11-14 19:12:53,767 INFO L256 TraceCheckUtils]: 4: Hoare triple {2431#true} call #t~ret41 := main(); {2431#true} is VALID [2018-11-14 19:12:53,767 INFO L273 TraceCheckUtils]: 5: Hoare triple {2431#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset + 0, 4);call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset + 4, 4); {2431#true} is VALID [2018-11-14 19:12:53,768 INFO L273 TraceCheckUtils]: 6: Hoare triple {2431#true} assume true; {2431#true} is VALID [2018-11-14 19:12:53,768 INFO L273 TraceCheckUtils]: 7: Hoare triple {2431#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2431#true} is VALID [2018-11-14 19:12:53,768 INFO L273 TraceCheckUtils]: 8: Hoare triple {2431#true} assume !(#t~nondet3 != 0);havoc #t~nondet3; {2431#true} is VALID [2018-11-14 19:12:53,768 INFO L273 TraceCheckUtils]: 9: Hoare triple {2431#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {2431#true} is VALID [2018-11-14 19:12:53,768 INFO L273 TraceCheckUtils]: 10: Hoare triple {2431#true} assume true; {2431#true} is VALID [2018-11-14 19:12:53,768 INFO L273 TraceCheckUtils]: 11: Hoare triple {2431#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {2431#true} is VALID [2018-11-14 19:12:53,768 INFO L273 TraceCheckUtils]: 12: Hoare triple {2431#true} assume true; {2431#true} is VALID [2018-11-14 19:12:53,769 INFO L273 TraceCheckUtils]: 13: Hoare triple {2431#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset + 0, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {2431#true} is VALID [2018-11-14 19:12:53,769 INFO L273 TraceCheckUtils]: 14: Hoare triple {2431#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, ~n~0.offset + 4, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {2431#true} is VALID [2018-11-14 19:12:53,769 INFO L273 TraceCheckUtils]: 15: Hoare triple {2431#true} assume !#t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~short24;havoc #t~mem23.base, #t~mem23.offset; {2431#true} is VALID [2018-11-14 19:12:53,769 INFO L273 TraceCheckUtils]: 16: Hoare triple {2431#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {2431#true} is VALID [2018-11-14 19:12:53,769 INFO L273 TraceCheckUtils]: 17: Hoare triple {2431#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {2431#true} is VALID [2018-11-14 19:12:53,769 INFO L273 TraceCheckUtils]: 18: Hoare triple {2431#true} assume true; {2431#true} is VALID [2018-11-14 19:12:53,770 INFO L273 TraceCheckUtils]: 19: Hoare triple {2431#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {2431#true} is VALID [2018-11-14 19:12:53,771 INFO L273 TraceCheckUtils]: 20: Hoare triple {2431#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {2433#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-14 19:12:53,771 INFO L273 TraceCheckUtils]: 21: Hoare triple {2433#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {2433#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-14 19:12:53,772 INFO L273 TraceCheckUtils]: 22: Hoare triple {2433#(= (select |#valid| main_~a~0.base) 1)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2434#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:53,772 INFO L273 TraceCheckUtils]: 23: Hoare triple {2434#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {2434#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:53,773 INFO L273 TraceCheckUtils]: 24: Hoare triple {2434#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {2434#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:53,774 INFO L273 TraceCheckUtils]: 25: Hoare triple {2434#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !!(#t~nondet30 != 0);havoc #t~nondet30;call write~int(1, ~p~0.base, ~p~0.offset + 0, 4);call #t~malloc31.base, #t~malloc31.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc31.base, #t~malloc31.offset; {2435#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:53,787 INFO L273 TraceCheckUtils]: 26: Hoare triple {2435#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {2435#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:53,789 INFO L273 TraceCheckUtils]: 27: Hoare triple {2435#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~p~0.offset + 4, 4);call #t~mem32.base, #t~mem32.offset := read~$Pointer$(~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := #t~mem32.base, #t~mem32.offset;havoc #t~mem32.base, #t~mem32.offset; {2436#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 19:12:53,789 INFO L273 TraceCheckUtils]: 28: Hoare triple {2436#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume true; {2436#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 19:12:53,790 INFO L273 TraceCheckUtils]: 29: Hoare triple {2436#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {2436#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 19:12:53,790 INFO L273 TraceCheckUtils]: 30: Hoare triple {2436#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume !(#t~nondet30 != 0);havoc #t~nondet30; {2436#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 19:12:53,791 INFO L273 TraceCheckUtils]: 31: Hoare triple {2436#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume true; {2436#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 19:12:53,791 INFO L273 TraceCheckUtils]: 32: Hoare triple {2436#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {2436#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 19:12:53,792 INFO L273 TraceCheckUtils]: 33: Hoare triple {2436#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} assume !(#t~nondet33 != 0);havoc #t~nondet33; {2436#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 19:12:53,793 INFO L273 TraceCheckUtils]: 34: Hoare triple {2436#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 3)) main_~a~0.base) main_~a~0.offset))} call write~int(3, ~p~0.base, ~p~0.offset + 0, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2437#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:12:53,793 INFO L273 TraceCheckUtils]: 35: Hoare triple {2437#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {2437#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:12:53,794 INFO L273 TraceCheckUtils]: 36: Hoare triple {2437#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset + 0, 4); {2437#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:12:53,794 INFO L273 TraceCheckUtils]: 37: Hoare triple {2437#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !(#t~mem36 == 2);havoc #t~mem36; {2437#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:12:53,795 INFO L273 TraceCheckUtils]: 38: Hoare triple {2437#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {2437#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 19:12:53,796 INFO L273 TraceCheckUtils]: 39: Hoare triple {2437#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} call #t~mem38 := read~int(~p~0.base, ~p~0.offset + 0, 4); {2438#(= 1 |main_#t~mem38|)} is VALID [2018-11-14 19:12:53,797 INFO L273 TraceCheckUtils]: 40: Hoare triple {2438#(= 1 |main_#t~mem38|)} assume !(#t~mem38 == 1);havoc #t~mem38; {2432#false} is VALID [2018-11-14 19:12:53,798 INFO L273 TraceCheckUtils]: 41: Hoare triple {2432#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset + 0, 4); {2432#false} is VALID [2018-11-14 19:12:53,798 INFO L273 TraceCheckUtils]: 42: Hoare triple {2432#false} assume #t~mem40 != 3;havoc #t~mem40; {2432#false} is VALID [2018-11-14 19:12:53,798 INFO L273 TraceCheckUtils]: 43: Hoare triple {2432#false} assume !false; {2432#false} is VALID [2018-11-14 19:12:53,801 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 19:12:53,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 19:12:53,802 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 19:12:53,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:12:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:12:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:12:53,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:12:53,902 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 6 treesize of output 5 [2018-11-14 19:12:53,904 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 19:12:53,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:12:53,907 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-14 19:12:53,909 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 19:12:53,941 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:12:53,942 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 19:12:53,945 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 11 treesize of output 4 [2018-11-14 19:12:53,946 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 19:12:53,963 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 19:12:53,974 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 19:12:53,975 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 19:12:53,977 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:12:53,986 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:12:53,987 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2018-11-14 19:12:53,990 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 19:12:54,083 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 19:12:54,123 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 19:12:54,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 19:12:54,134 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:12:54,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 19:12:54,141 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-14 19:12:54,145 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 19:12:54,208 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 19:12:54,220 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 19:12:54,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 19:12:54,229 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 19:12:54,230 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 19:12:54,232 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 19:12:54,238 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 19:12:54,238 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-14 19:12:54,241 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 19:12:54,248 INFO L256 TraceCheckUtils]: 0: Hoare triple {2431#true} call ULTIMATE.init(); {2431#true} is VALID [2018-11-14 19:12:54,249 INFO L273 TraceCheckUtils]: 1: Hoare triple {2431#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2431#true} is VALID [2018-11-14 19:12:54,249 INFO L273 TraceCheckUtils]: 2: Hoare triple {2431#true} assume true; {2431#true} is VALID [2018-11-14 19:12:54,249 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2431#true} {2431#true} #232#return; {2431#true} is VALID [2018-11-14 19:12:54,249 INFO L256 TraceCheckUtils]: 4: Hoare triple {2431#true} call #t~ret41 := main(); {2431#true} is VALID [2018-11-14 19:12:54,249 INFO L273 TraceCheckUtils]: 5: Hoare triple {2431#true} call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~root~0.base, ~root~0.offset := #t~malloc2.base, #t~malloc2.offset;havoc ~n~0.base, ~n~0.offset;call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset + 0, 4);call write~$Pointer$(0, 0, ~root~0.base, ~root~0.offset + 4, 4); {2431#true} is VALID [2018-11-14 19:12:54,249 INFO L273 TraceCheckUtils]: 6: Hoare triple {2431#true} assume true; {2431#true} is VALID [2018-11-14 19:12:54,249 INFO L273 TraceCheckUtils]: 7: Hoare triple {2431#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2431#true} is VALID [2018-11-14 19:12:54,250 INFO L273 TraceCheckUtils]: 8: Hoare triple {2431#true} assume !(#t~nondet3 != 0);havoc #t~nondet3; {2431#true} is VALID [2018-11-14 19:12:54,250 INFO L273 TraceCheckUtils]: 9: Hoare triple {2431#true} ~n~0.base, ~n~0.offset := 0, 0;havoc ~pred~0.base, ~pred~0.offset; {2431#true} is VALID [2018-11-14 19:12:54,250 INFO L273 TraceCheckUtils]: 10: Hoare triple {2431#true} assume true; {2431#true} is VALID [2018-11-14 19:12:54,250 INFO L273 TraceCheckUtils]: 11: Hoare triple {2431#true} assume !!(~root~0.base != 0 || ~root~0.offset != 0);~pred~0.base, ~pred~0.offset := 0, 0;~n~0.base, ~n~0.offset := ~root~0.base, ~root~0.offset; {2431#true} is VALID [2018-11-14 19:12:54,250 INFO L273 TraceCheckUtils]: 12: Hoare triple {2431#true} assume true; {2431#true} is VALID [2018-11-14 19:12:54,250 INFO L273 TraceCheckUtils]: 13: Hoare triple {2431#true} call #t~mem22.base, #t~mem22.offset := read~$Pointer$(~n~0.base, ~n~0.offset + 0, 4);#t~short24 := #t~mem22.base != 0 || #t~mem22.offset != 0; {2431#true} is VALID [2018-11-14 19:12:54,250 INFO L273 TraceCheckUtils]: 14: Hoare triple {2431#true} assume !#t~short24;call #t~mem23.base, #t~mem23.offset := read~$Pointer$(~n~0.base, ~n~0.offset + 4, 4);#t~short24 := #t~mem23.base != 0 || #t~mem23.offset != 0; {2431#true} is VALID [2018-11-14 19:12:54,251 INFO L273 TraceCheckUtils]: 15: Hoare triple {2431#true} assume !#t~short24;havoc #t~mem22.base, #t~mem22.offset;havoc #t~short24;havoc #t~mem23.base, #t~mem23.offset; {2431#true} is VALID [2018-11-14 19:12:54,251 INFO L273 TraceCheckUtils]: 16: Hoare triple {2431#true} assume !(~pred~0.base != 0 || ~pred~0.offset != 0);~root~0.base, ~root~0.offset := 0, 0; {2431#true} is VALID [2018-11-14 19:12:54,251 INFO L273 TraceCheckUtils]: 17: Hoare triple {2431#true} call ULTIMATE.dealloc(~n~0.base, ~n~0.offset); {2431#true} is VALID [2018-11-14 19:12:54,251 INFO L273 TraceCheckUtils]: 18: Hoare triple {2431#true} assume true; {2431#true} is VALID [2018-11-14 19:12:54,251 INFO L273 TraceCheckUtils]: 19: Hoare triple {2431#true} assume !(~root~0.base != 0 || ~root~0.offset != 0); {2431#true} is VALID [2018-11-14 19:12:54,252 INFO L273 TraceCheckUtils]: 20: Hoare triple {2431#true} call #t~malloc29.base, #t~malloc29.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc29.base, #t~malloc29.offset; {2433#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-14 19:12:54,252 INFO L273 TraceCheckUtils]: 21: Hoare triple {2433#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {2433#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-14 19:12:54,253 INFO L273 TraceCheckUtils]: 22: Hoare triple {2433#(= (select |#valid| main_~a~0.base) 1)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2434#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:54,253 INFO L273 TraceCheckUtils]: 23: Hoare triple {2434#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {2434#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:54,254 INFO L273 TraceCheckUtils]: 24: Hoare triple {2434#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {2434#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:54,255 INFO L273 TraceCheckUtils]: 25: Hoare triple {2434#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !!(#t~nondet30 != 0);havoc #t~nondet30;call write~int(1, ~p~0.base, ~p~0.offset + 0, 4);call #t~malloc31.base, #t~malloc31.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc31.base, #t~malloc31.offset; {2435#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:54,255 INFO L273 TraceCheckUtils]: 26: Hoare triple {2435#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {2435#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 19:12:54,256 INFO L273 TraceCheckUtils]: 27: Hoare triple {2435#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~p~0.offset + 4, 4);call #t~mem32.base, #t~mem32.offset := read~$Pointer$(~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := #t~mem32.base, #t~mem32.offset;havoc #t~mem32.base, #t~mem32.offset; {2523#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 19:12:54,257 INFO L273 TraceCheckUtils]: 28: Hoare triple {2523#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume true; {2523#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 19:12:54,265 INFO L273 TraceCheckUtils]: 29: Hoare triple {2523#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet30 && #t~nondet30 <= 2147483647; {2523#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 19:12:54,266 INFO L273 TraceCheckUtils]: 30: Hoare triple {2523#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(#t~nondet30 != 0);havoc #t~nondet30; {2523#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 19:12:54,266 INFO L273 TraceCheckUtils]: 31: Hoare triple {2523#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume true; {2523#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 19:12:54,267 INFO L273 TraceCheckUtils]: 32: Hoare triple {2523#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet33 && #t~nondet33 <= 2147483647; {2523#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 19:12:54,267 INFO L273 TraceCheckUtils]: 33: Hoare triple {2523#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(#t~nondet33 != 0);havoc #t~nondet33; {2523#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 19:12:54,268 INFO L273 TraceCheckUtils]: 34: Hoare triple {2523#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~int(3, ~p~0.base, ~p~0.offset + 0, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {2545#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} is VALID [2018-11-14 19:12:54,271 INFO L273 TraceCheckUtils]: 35: Hoare triple {2545#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} assume true; {2545#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} is VALID [2018-11-14 19:12:54,280 INFO L273 TraceCheckUtils]: 36: Hoare triple {2545#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} call #t~mem36 := read~int(~p~0.base, ~p~0.offset + 0, 4); {2545#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} is VALID [2018-11-14 19:12:54,280 INFO L273 TraceCheckUtils]: 37: Hoare triple {2545#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} assume !(#t~mem36 == 2);havoc #t~mem36; {2545#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} is VALID [2018-11-14 19:12:54,281 INFO L273 TraceCheckUtils]: 38: Hoare triple {2545#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} assume true; {2545#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} is VALID [2018-11-14 19:12:54,282 INFO L273 TraceCheckUtils]: 39: Hoare triple {2545#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_20 Int) (v_main_~p~0.offset_20 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_20) v_main_~p~0.offset_20) 3) (not (= v_main_~p~0.base_20 main_~p~0.base)))))} call #t~mem38 := read~int(~p~0.base, ~p~0.offset + 0, 4); {2438#(= 1 |main_#t~mem38|)} is VALID [2018-11-14 19:12:54,299 INFO L273 TraceCheckUtils]: 40: Hoare triple {2438#(= 1 |main_#t~mem38|)} assume !(#t~mem38 == 1);havoc #t~mem38; {2432#false} is VALID [2018-11-14 19:12:54,299 INFO L273 TraceCheckUtils]: 41: Hoare triple {2432#false} call #t~mem40 := read~int(~p~0.base, ~p~0.offset + 0, 4); {2432#false} is VALID [2018-11-14 19:12:54,299 INFO L273 TraceCheckUtils]: 42: Hoare triple {2432#false} assume #t~mem40 != 3;havoc #t~mem40; {2432#false} is VALID [2018-11-14 19:12:54,300 INFO L273 TraceCheckUtils]: 43: Hoare triple {2432#false} assume !false; {2432#false} is VALID [2018-11-14 19:12:54,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 19:12:54,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 19:12:54,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-14 19:12:54,335 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2018-11-14 19:12:54,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:12:54,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 19:12:54,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:12:54,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 19:12:54,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 19:12:54,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-11-14 19:12:54,399 INFO L87 Difference]: Start difference. First operand 80 states and 104 transitions. Second operand 10 states. [2018-11-14 19:12:55,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:55,557 INFO L93 Difference]: Finished difference Result 113 states and 141 transitions. [2018-11-14 19:12:55,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 19:12:55,557 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2018-11-14 19:12:55,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:12:55,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 19:12:55,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2018-11-14 19:12:55,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 19:12:55,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 118 transitions. [2018-11-14 19:12:55,564 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 118 transitions. [2018-11-14 19:12:55,792 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:12:55,796 INFO L225 Difference]: With dead ends: 113 [2018-11-14 19:12:55,797 INFO L226 Difference]: Without dead ends: 109 [2018-11-14 19:12:55,797 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-11-14 19:12:55,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-14 19:12:55,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 95. [2018-11-14 19:12:55,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:12:55,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 95 states. [2018-11-14 19:12:55,844 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 95 states. [2018-11-14 19:12:55,844 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 95 states. [2018-11-14 19:12:55,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:55,849 INFO L93 Difference]: Finished difference Result 109 states and 137 transitions. [2018-11-14 19:12:55,850 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 137 transitions. [2018-11-14 19:12:55,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:55,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:55,850 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 109 states. [2018-11-14 19:12:55,850 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 109 states. [2018-11-14 19:12:55,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:12:55,855 INFO L93 Difference]: Finished difference Result 109 states and 137 transitions. [2018-11-14 19:12:55,855 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 137 transitions. [2018-11-14 19:12:55,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:12:55,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:12:55,856 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:12:55,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:12:55,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-14 19:12:55,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 122 transitions. [2018-11-14 19:12:55,859 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 122 transitions. Word has length 44 [2018-11-14 19:12:55,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:12:55,860 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 122 transitions. [2018-11-14 19:12:55,860 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 19:12:55,860 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 122 transitions. [2018-11-14 19:12:55,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-14 19:12:55,860 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:12:55,861 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:12:55,861 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:12:55,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:12:55,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1427651621, now seen corresponding path program 1 times [2018-11-14 19:12:55,861 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:12:55,861 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:12:55,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:55,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:12:55,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:12:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:12:56,378 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:128) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) 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 19:12:56,384 INFO L168 Benchmark]: Toolchain (without parser) took 15171.32 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 855.6 MB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -434.2 MB). Peak memory consumption was 421.4 MB. Max. memory is 7.1 GB. [2018-11-14 19:12:56,386 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 19:12:56,386 INFO L168 Benchmark]: CACSL2BoogieTranslator took 639.82 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-14 19:12:56,387 INFO L168 Benchmark]: Boogie Preprocessor took 173.93 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 705.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -801.1 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2018-11-14 19:12:56,387 INFO L168 Benchmark]: RCFGBuilder took 1863.84 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 79.7 MB). Peak memory consumption was 79.7 MB. Max. memory is 7.1 GB. [2018-11-14 19:12:56,388 INFO L168 Benchmark]: TraceAbstraction took 12488.74 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 149.9 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 244.9 MB). Peak memory consumption was 394.8 MB. Max. memory is 7.1 GB. [2018-11-14 19:12:56,391 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.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 639.82 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 173.93 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 705.7 MB). Free memory was 1.3 GB in the beginning and 2.2 GB in the end (delta: -801.1 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1863.84 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 79.7 MB). Peak memory consumption was 79.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12488.74 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 149.9 MB). Free memory was 2.1 GB in the beginning and 1.8 GB in the end (delta: 244.9 MB). Peak memory consumption was 394.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...