java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/heap-data/shared_mem2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 02:14:46,591 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 02:14:46,593 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 02:14:46,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 02:14:46,605 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 02:14:46,606 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 02:14:46,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 02:14:46,609 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 02:14:46,611 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 02:14:46,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 02:14:46,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 02:14:46,614 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 02:14:46,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 02:14:46,615 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 02:14:46,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 02:14:46,617 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 02:14:46,618 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 02:14:46,619 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 02:14:46,620 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 02:14:46,622 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 02:14:46,623 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 02:14:46,624 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 02:14:46,625 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 02:14:46,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 02:14:46,628 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 02:14:46,628 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 02:14:46,628 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 02:14:46,629 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 02:14:46,629 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 02:14:46,630 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 02:14:46,631 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 02:14:46,631 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 02:14:46,632 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 02:14:46,633 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 02:14:46,634 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 02:14:46,634 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 02:14:46,634 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 02:14:46,635 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 02:14:46,635 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 02:14:46,636 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 02:14:46,636 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 02:14:46,637 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 02:14:46,651 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 02:14:46,651 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 02:14:46,652 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 02:14:46,653 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 02:14:46,653 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 02:14:46,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 02:14:46,653 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 02:14:46,653 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 02:14:46,654 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 02:14:46,654 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 02:14:46,654 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 02:14:46,654 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 02:14:46,654 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 02:14:46,655 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 02:14:46,655 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 02:14:46,655 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 02:14:46,655 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 02:14:46,656 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 02:14:46,656 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 02:14:46,656 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 02:14:46,656 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 02:14:46,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 02:14:46,657 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 02:14:46,657 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 02:14:46,657 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 02:14:46,657 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 02:14:46,657 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 02:14:46,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 02:14:46,658 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 02:14:46,686 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 02:14:46,701 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 02:14:46,705 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 02:14:46,706 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 02:14:46,706 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 02:14:46,707 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/shared_mem2.i [2019-09-08 02:14:46,774 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b03a4e0e/760ba47932a34cc687c02691ef6e1fd2/FLAG6bea5af65 [2019-09-08 02:14:47,317 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 02:14:47,318 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/shared_mem2.i [2019-09-08 02:14:47,338 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b03a4e0e/760ba47932a34cc687c02691ef6e1fd2/FLAG6bea5af65 [2019-09-08 02:14:47,674 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b03a4e0e/760ba47932a34cc687c02691ef6e1fd2 [2019-09-08 02:14:47,685 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 02:14:47,687 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 02:14:47,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 02:14:47,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 02:14:47,692 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 02:14:47,693 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:14:47" (1/1) ... [2019-09-08 02:14:47,695 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37c295b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:14:47, skipping insertion in model container [2019-09-08 02:14:47,696 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 02:14:47" (1/1) ... [2019-09-08 02:14:47,703 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 02:14:47,739 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 02:14:48,129 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:14:48,139 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 02:14:48,208 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 02:14:48,262 INFO L192 MainTranslator]: Completed translation [2019-09-08 02:14:48,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:14:48 WrapperNode [2019-09-08 02:14:48,263 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 02:14:48,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 02:14:48,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 02:14:48,264 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 02:14:48,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:14:48" (1/1) ... [2019-09-08 02:14:48,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:14:48" (1/1) ... [2019-09-08 02:14:48,294 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:14:48" (1/1) ... [2019-09-08 02:14:48,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:14:48" (1/1) ... [2019-09-08 02:14:48,309 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:14:48" (1/1) ... [2019-09-08 02:14:48,314 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:14:48" (1/1) ... [2019-09-08 02:14:48,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:14:48" (1/1) ... [2019-09-08 02:14:48,323 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 02:14:48,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 02:14:48,324 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 02:14:48,324 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 02:14:48,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:14:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 02:14:48,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 02:14:48,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 02:14:48,383 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-09-08 02:14:48,383 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-09-08 02:14:48,383 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 02:14:48,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 02:14:48,384 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 02:14:48,384 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-09-08 02:14:48,384 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-09-08 02:14:48,384 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-08 02:14:48,385 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-08 02:14:48,385 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-08 02:14:48,385 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-08 02:14:48,385 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-08 02:14:48,387 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-08 02:14:48,387 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-08 02:14:48,389 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-08 02:14:48,390 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-08 02:14:48,390 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-08 02:14:48,390 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-08 02:14:48,390 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-08 02:14:48,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-08 02:14:48,391 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-08 02:14:48,391 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-08 02:14:48,391 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-08 02:14:48,391 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-08 02:14:48,393 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-08 02:14:48,393 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-08 02:14:48,393 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-08 02:14:48,394 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-08 02:14:48,394 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-08 02:14:48,394 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-08 02:14:48,394 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-08 02:14:48,394 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-08 02:14:48,394 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-08 02:14:48,395 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-08 02:14:48,395 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-08 02:14:48,395 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-08 02:14:48,395 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-08 02:14:48,395 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-08 02:14:48,395 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-08 02:14:48,396 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-08 02:14:48,396 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-08 02:14:48,396 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-08 02:14:48,396 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-08 02:14:48,396 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-08 02:14:48,396 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-08 02:14:48,396 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-08 02:14:48,397 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-08 02:14:48,397 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-08 02:14:48,397 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-08 02:14:48,397 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-08 02:14:48,397 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-08 02:14:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-08 02:14:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-08 02:14:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-08 02:14:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-08 02:14:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-08 02:14:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-08 02:14:48,398 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-08 02:14:48,399 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-08 02:14:48,399 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-08 02:14:48,400 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 02:14:48,400 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-08 02:14:48,400 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-08 02:14:48,400 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-08 02:14:48,400 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-08 02:14:48,400 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-08 02:14:48,401 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-08 02:14:48,401 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-08 02:14:48,401 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-08 02:14:48,401 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-08 02:14:48,401 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-08 02:14:48,401 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-08 02:14:48,402 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-08 02:14:48,402 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-08 02:14:48,402 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-08 02:14:48,402 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-08 02:14:48,402 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-08 02:14:48,402 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-08 02:14:48,402 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-08 02:14:48,402 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-08 02:14:48,403 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-08 02:14:48,403 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-08 02:14:48,403 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-08 02:14:48,403 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-08 02:14:48,403 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-08 02:14:48,403 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-08 02:14:48,403 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-08 02:14:48,404 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-08 02:14:48,404 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-08 02:14:48,404 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-08 02:14:48,404 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-08 02:14:48,404 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-08 02:14:48,404 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-08 02:14:48,405 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-08 02:14:48,405 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-08 02:14:48,405 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-08 02:14:48,405 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-08 02:14:48,405 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-08 02:14:48,405 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-08 02:14:48,405 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-08 02:14:48,405 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-08 02:14:48,405 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-08 02:14:48,406 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-08 02:14:48,406 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-08 02:14:48,406 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-08 02:14:48,406 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-08 02:14:48,406 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-08 02:14:48,406 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-08 02:14:48,406 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-08 02:14:48,406 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-08 02:14:48,406 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 02:14:48,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-08 02:14:48,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 02:14:48,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 02:14:48,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 02:14:48,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 02:14:48,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 02:14:48,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 02:14:48,407 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 02:14:48,947 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 02:14:48,947 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-08 02:14:48,948 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:14:48 BoogieIcfgContainer [2019-09-08 02:14:48,948 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 02:14:48,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 02:14:48,950 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 02:14:48,953 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 02:14:48,953 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 02:14:47" (1/3) ... [2019-09-08 02:14:48,954 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b218e28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:14:48, skipping insertion in model container [2019-09-08 02:14:48,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 02:14:48" (2/3) ... [2019-09-08 02:14:48,955 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b218e28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 02:14:48, skipping insertion in model container [2019-09-08 02:14:48,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 02:14:48" (3/3) ... [2019-09-08 02:14:48,958 INFO L109 eAbstractionObserver]: Analyzing ICFG shared_mem2.i [2019-09-08 02:14:48,968 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 02:14:48,979 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 02:14:48,996 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 02:14:49,029 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 02:14:49,030 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 02:14:49,030 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 02:14:49,031 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 02:14:49,032 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 02:14:49,032 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 02:14:49,032 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 02:14:49,032 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 02:14:49,032 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 02:14:49,047 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2019-09-08 02:14:49,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-09-08 02:14:49,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:14:49,053 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:14:49,055 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:14:49,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:14:49,061 INFO L82 PathProgramCache]: Analyzing trace with hash 976014476, now seen corresponding path program 1 times [2019-09-08 02:14:49,063 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:14:49,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:14:49,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:14:49,121 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:14:49,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:14:49,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:14:49,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:14:49,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:14:49,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-08 02:14:49,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-08 02:14:49,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-08 02:14:49,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-08 02:14:49,241 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2019-09-08 02:14:49,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:14:49,262 INFO L93 Difference]: Finished difference Result 35 states and 44 transitions. [2019-09-08 02:14:49,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-08 02:14:49,264 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-09-08 02:14:49,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:14:49,273 INFO L225 Difference]: With dead ends: 35 [2019-09-08 02:14:49,273 INFO L226 Difference]: Without dead ends: 18 [2019-09-08 02:14:49,276 INFO L628 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 [2019-09-08 02:14:49,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-09-08 02:14:49,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-09-08 02:14:49,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-09-08 02:14:49,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2019-09-08 02:14:49,310 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 12 [2019-09-08 02:14:49,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:14:49,311 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2019-09-08 02:14:49,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-08 02:14:49,311 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2019-09-08 02:14:49,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-08 02:14:49,312 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:14:49,312 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:14:49,312 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:14:49,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:14:49,313 INFO L82 PathProgramCache]: Analyzing trace with hash 2140991581, now seen corresponding path program 1 times [2019-09-08 02:14:49,313 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:14:49,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:14:49,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:14:49,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:14:49,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:14:49,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:14:49,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:14:49,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 02:14:49,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 02:14:49,457 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 02:14:49,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 02:14:49,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 02:14:49,458 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand 5 states. [2019-09-08 02:14:49,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:14:49,551 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-09-08 02:14:49,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 02:14:49,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-08 02:14:49,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:14:49,553 INFO L225 Difference]: With dead ends: 30 [2019-09-08 02:14:49,553 INFO L226 Difference]: Without dead ends: 26 [2019-09-08 02:14:49,554 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 02:14:49,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-09-08 02:14:49,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-09-08 02:14:49,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-08 02:14:49,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-09-08 02:14:49,566 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 14 [2019-09-08 02:14:49,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:14:49,567 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-09-08 02:14:49,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 02:14:49,567 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2019-09-08 02:14:49,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-08 02:14:49,568 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:14:49,569 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:14:49,569 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:14:49,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:14:49,570 INFO L82 PathProgramCache]: Analyzing trace with hash -295797189, now seen corresponding path program 1 times [2019-09-08 02:14:49,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:14:49,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:14:49,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:14:49,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:14:49,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:14:49,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:14:49,803 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:14:49,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:14:49,803 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 [2019-09-08 02:14:49,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:14:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:14:49,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 22 conjunts are in the unsatisfiable core [2019-09-08 02:14:49,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:14:49,963 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-09-08 02:14:49,964 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2019-09-08 02:14:49,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:49,988 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:49,993 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_24|], 2=[|v_#memory_int_21|]} [2019-09-08 02:14:50,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:50,018 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2019-09-08 02:14:50,018 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:50,039 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:50,056 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-09-08 02:14:50,057 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-09-08 02:14:50,058 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:50,071 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:50,072 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:14:50,072 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:75, output treesize:29 [2019-09-08 02:14:50,157 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:50,158 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-09-08 02:14:50,161 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:50,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:50,206 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_22|, |v_#memory_int_23|], 10=[|v_#memory_int_25|]} [2019-09-08 02:14:50,215 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:14:50,255 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:50,259 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:14:50,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:50,340 INFO L341 Elim1Store]: treesize reduction 90, result has 25.0 percent of original size [2019-09-08 02:14:50,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 52 [2019-09-08 02:14:50,342 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:50,365 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:50,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:50,370 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:14:50,371 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 10 variables, input treesize:94, output treesize:7 [2019-09-08 02:14:50,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:14:50,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:14:50,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-09-08 02:14:50,402 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 02:14:50,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 02:14:50,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-08 02:14:50,403 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 8 states. [2019-09-08 02:14:50,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:14:50,592 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2019-09-08 02:14:50,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 02:14:50,593 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2019-09-08 02:14:50,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:14:50,595 INFO L225 Difference]: With dead ends: 42 [2019-09-08 02:14:50,596 INFO L226 Difference]: Without dead ends: 38 [2019-09-08 02:14:50,596 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-09-08 02:14:50,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-08 02:14:50,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 22. [2019-09-08 02:14:50,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-08 02:14:50,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-09-08 02:14:50,602 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 17 [2019-09-08 02:14:50,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:14:50,603 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-09-08 02:14:50,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 02:14:50,603 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-09-08 02:14:50,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-08 02:14:50,604 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:14:50,604 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:14:50,604 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:14:50,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:14:50,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1470664204, now seen corresponding path program 1 times [2019-09-08 02:14:50,605 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:14:50,605 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:14:50,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:14:50,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:14:50,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:14:50,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:14:50,908 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:14:50,909 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:14:50,909 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 [2019-09-08 02:14:50,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:14:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:14:50,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 21 conjunts are in the unsatisfiable core [2019-09-08 02:14:50,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:14:50,976 INFO L375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-09-08 02:14:50,977 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:50,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:50,995 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_27|], 2=[|v_#memory_int_26|]} [2019-09-08 02:14:51,008 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-08 02:14:51,015 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2019-09-08 02:14:51,016 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:51,026 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:51,042 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-09-08 02:14:51,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-09-08 02:14:51,044 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:51,055 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:51,056 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-08 02:14:51,056 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:66, output treesize:19 [2019-09-08 02:14:51,127 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_20|, |v_#memory_$Pointer$.offset_20|], 20=[|v_#memory_int_28|]} [2019-09-08 02:14:51,146 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 53 [2019-09-08 02:14:51,147 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:14:51,161 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:51,165 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 35 [2019-09-08 02:14:51,166 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:14:51,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:51,349 WARN L188 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-09-08 02:14:51,349 INFO L341 Elim1Store]: treesize reduction 24, result has 85.0 percent of original size [2019-09-08 02:14:51,350 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 49 treesize of output 156 [2019-09-08 02:14:51,352 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,360 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:51,541 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-09-08 02:14:51,542 INFO L567 ElimStorePlain]: treesize reduction 106, result has 61.9 percent of original size [2019-09-08 02:14:51,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,558 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,575 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,593 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,633 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-09-08 02:14:51,633 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:95, output treesize:171 [2019-09-08 02:14:51,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,720 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:51,722 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:51,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:51,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,725 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,726 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,741 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:51,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,750 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,752 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,756 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:51,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,761 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,762 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:51,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:51,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,771 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,772 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:51,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,776 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,779 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:51,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,784 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:51,797 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:51,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,802 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,815 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:51,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,820 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,821 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,824 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:51,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,832 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:51,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,836 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,840 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:51,858 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:53,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:53,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:53,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,277 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,279 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:53,284 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,285 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,286 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,287 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:53,290 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,291 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:53,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:53,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,297 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:53,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,303 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:53,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,310 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,315 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,316 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,317 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,318 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:53,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:53,319 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,320 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,321 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,322 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,323 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,325 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,326 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,327 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,328 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:53,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,331 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,332 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:53,334 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,335 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,336 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,339 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-09-08 02:14:53,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,340 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,341 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:53,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:55,869 WARN L188 SmtUtils]: Spent 2.21 s on a formula simplification. DAG size of input: 221 DAG size of output: 65 [2019-09-08 02:14:55,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-09-08 02:14:56,039 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 48 [2019-09-08 02:14:56,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:14:56,066 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:56,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 36 [2019-09-08 02:14:56,067 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:56,079 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:14:56,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 36 [2019-09-08 02:14:56,080 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-08 02:14:56,140 INFO L567 ElimStorePlain]: treesize reduction 8, result has 85.5 percent of original size [2019-09-08 02:14:56,143 INFO L496 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:14:56,144 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 11 variables, input treesize:97, output treesize:7 [2019-09-08 02:14:56,181 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:14:56,190 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:14:56,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2019-09-08 02:14:56,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 02:14:56,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 02:14:56,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2019-09-08 02:14:56,193 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 14 states. [2019-09-08 02:15:01,259 WARN L188 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 47 [2019-09-08 02:15:10,429 WARN L188 SmtUtils]: Spent 8.85 s on a formula simplification. DAG size of input: 69 DAG size of output: 67 [2019-09-08 02:15:10,585 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 24 [2019-09-08 02:15:10,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:15:10,889 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2019-09-08 02:15:10,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-08 02:15:10,889 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 18 [2019-09-08 02:15:10,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:15:10,891 INFO L225 Difference]: With dead ends: 48 [2019-09-08 02:15:10,891 INFO L226 Difference]: Without dead ends: 42 [2019-09-08 02:15:10,893 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 14.3s TimeCoverageRelationStatistics Valid=130, Invalid=422, Unknown=0, NotChecked=0, Total=552 [2019-09-08 02:15:10,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-08 02:15:10,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2019-09-08 02:15:10,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-08 02:15:10,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-09-08 02:15:10,900 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 18 [2019-09-08 02:15:10,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:15:10,901 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-09-08 02:15:10,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 02:15:10,901 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-09-08 02:15:10,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-09-08 02:15:10,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 02:15:10,902 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 02:15:10,902 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 02:15:10,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 02:15:10,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1648172846, now seen corresponding path program 1 times [2019-09-08 02:15:10,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 02:15:10,903 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 02:15:10,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:15:10,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:15:10,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 02:15:10,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:15:11,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 02:15:11,218 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 02:15:11,218 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 02:15:11,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 02:15:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 02:15:11,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 15 conjunts are in the unsatisfiable core [2019-09-08 02:15:11,273 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 02:15:11,317 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_21|, |v_#memory_$Pointer$.base_21|], 12=[|v_#memory_int_29|]} [2019-09-08 02:15:11,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 59 [2019-09-08 02:15:11,320 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:15:11,334 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:11,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2019-09-08 02:15:11,337 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-08 02:15:11,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:11,458 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2019-09-08 02:15:11,459 INFO L341 Elim1Store]: treesize reduction 12, result has 88.3 percent of original size [2019-09-08 02:15:11,459 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 108 [2019-09-08 02:15:11,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:11,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:11,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:11,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:11,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:11,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:11,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:11,467 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:11,680 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 41 [2019-09-08 02:15:11,681 INFO L567 ElimStorePlain]: treesize reduction 174, result has 35.8 percent of original size [2019-09-08 02:15:11,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:11,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:11,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:11,684 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-09-08 02:15:11,684 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:84, output treesize:96 [2019-09-08 02:15:11,687 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:11,688 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:11,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,765 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,766 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,767 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,845 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,846 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,847 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,848 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:15,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-08 02:15:21,974 WARN L188 SmtUtils]: Spent 6.09 s on a formula simplification. DAG size of input: 55 DAG size of output: 10 [2019-09-08 02:15:21,997 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-09-08 02:15:21,998 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-08 02:15:22,003 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-08 02:15:22,003 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-08 02:15:22,003 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2019-09-08 02:15:22,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 02:15:22,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 02:15:22,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 15 [2019-09-08 02:15:22,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-08 02:15:22,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-08 02:15:22,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=169, Unknown=2, NotChecked=0, Total=210 [2019-09-08 02:15:22,027 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 15 states. [2019-09-08 02:15:24,603 WARN L188 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 43 [2019-09-08 02:15:30,782 WARN L188 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 57 [2019-09-08 02:15:40,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 02:15:40,978 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2019-09-08 02:15:40,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 02:15:40,978 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 21 [2019-09-08 02:15:40,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 02:15:40,979 INFO L225 Difference]: With dead ends: 61 [2019-09-08 02:15:40,979 INFO L226 Difference]: Without dead ends: 0 [2019-09-08 02:15:40,981 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=136, Invalid=509, Unknown=5, NotChecked=0, Total=650 [2019-09-08 02:15:40,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-08 02:15:40,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-08 02:15:40,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-08 02:15:40,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-08 02:15:40,982 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2019-09-08 02:15:40,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 02:15:40,982 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-08 02:15:40,982 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-08 02:15:40,982 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-08 02:15:40,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-08 02:15:40,987 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-09-08 02:15:41,179 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-09-08 02:15:45,250 WARN L188 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 106 DAG size of output: 45 [2019-09-08 02:15:45,252 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-09-08 02:15:45,253 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-09-08 02:15:45,253 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-09-08 02:15:45,253 INFO L443 ceAbstractionStarter]: For program point __bswap_32ENTRY(lines 64 68) no Hoare annotation was computed. [2019-09-08 02:15:45,253 INFO L443 ceAbstractionStarter]: For program point __bswap_32FINAL(lines 64 68) no Hoare annotation was computed. [2019-09-08 02:15:45,253 INFO L443 ceAbstractionStarter]: For program point __bswap_32EXIT(lines 64 68) no Hoare annotation was computed. [2019-09-08 02:15:45,253 INFO L443 ceAbstractionStarter]: For program point __bswap_64ENTRY(lines 69 73) no Hoare annotation was computed. [2019-09-08 02:15:45,253 INFO L443 ceAbstractionStarter]: For program point __bswap_64FINAL(lines 69 73) no Hoare annotation was computed. [2019-09-08 02:15:45,254 INFO L443 ceAbstractionStarter]: For program point __bswap_64EXIT(lines 69 73) no Hoare annotation was computed. [2019-09-08 02:15:45,254 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-09-08 02:15:45,254 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-09-08 02:15:45,254 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-09-08 02:15:45,254 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-09-08 02:15:45,254 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 565 591) no Hoare annotation was computed. [2019-09-08 02:15:45,254 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 590) no Hoare annotation was computed. [2019-09-08 02:15:45,254 INFO L443 ceAbstractionStarter]: For program point L589(lines 589 590) no Hoare annotation was computed. [2019-09-08 02:15:45,254 INFO L443 ceAbstractionStarter]: For program point L589-2(lines 565 591) no Hoare annotation was computed. [2019-09-08 02:15:45,254 INFO L443 ceAbstractionStarter]: For program point L585(lines 585 586) no Hoare annotation was computed. [2019-09-08 02:15:45,254 INFO L443 ceAbstractionStarter]: For program point L585-2(lines 585 586) no Hoare annotation was computed. [2019-09-08 02:15:45,255 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 581) no Hoare annotation was computed. [2019-09-08 02:15:45,255 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 565 591) the Hoare annotation is: true [2019-09-08 02:15:45,255 INFO L439 ceAbstractionStarter]: At program point L575-2(lines 573 582) the Hoare annotation is: (let ((.cse2 (select (select |#memory_int| main_~m~0.base) main_~m~0.offset)) (.cse4 (+ main_~list~0.offset 4))) (let ((.cse0 (= main_~m~0.base (select (select |#memory_$Pointer$.base| main_~list~0.base) .cse4))) (.cse1 (= .cse2 |main_#t~mem7|))) (and (= 1 (select (select |#memory_int| main_~head~0.base) main_~head~0.offset)) (not (= main_~head~0.offset (+ main_~list~0.offset 8))) (= (select |#valid| main_~m~0.base) 1) (= 1 (select |#valid| main_~head~0.base)) (= main_~head~0.base main_~list~0.base) (not (= main_~m~0.base main_~list~0.base)) (or .cse0 .cse1) (= 0 .cse2) (or (not .cse0) (let ((.cse3 (= (select (select |#memory_$Pointer$.offset| main_~list~0.base) .cse4) main_~m~0.offset))) (and (or (not .cse3) (= (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 1)) (or .cse3 .cse1))))))) [2019-09-08 02:15:45,255 INFO L443 ceAbstractionStarter]: For program point L573-1(lines 573 582) no Hoare annotation was computed. [2019-09-08 02:15:45,255 INFO L443 ceAbstractionStarter]: For program point L573-3(lines 573 582) no Hoare annotation was computed. [2019-09-08 02:15:45,255 INFO L443 ceAbstractionStarter]: For program point L590(line 590) no Hoare annotation was computed. [2019-09-08 02:15:45,255 INFO L443 ceAbstractionStarter]: For program point L584-1(lines 584 588) no Hoare annotation was computed. [2019-09-08 02:15:45,256 INFO L439 ceAbstractionStarter]: At program point L584-3(lines 584 588) the Hoare annotation is: (or (exists ((main_~list~0.offset Int) (v_arrayElimCell_25 Int) (v_arrayElimCell_24 Int) (main_~list~0.base Int)) (let ((.cse4 (select (select |#memory_int| v_arrayElimCell_25) v_arrayElimCell_24))) (and (let ((.cse3 (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 99)) (.cse1 (= main_~m~0.offset v_arrayElimCell_24)) (.cse2 (= main_~m~0.base v_arrayElimCell_25)) (.cse5 (= main_~list~0.offset v_arrayElimCell_24)) (.cse6 (= main_~list~0.base v_arrayElimCell_25))) (or (and (let ((.cse0 (= 0 (mod .cse4 (- 2))))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse3))) .cse5 .cse6) (and (or (and (or (not .cse1) (not .cse2)) .cse3) (and (<= .cse4 (+ (select (select |#memory_int| main_~list~0.base) main_~list~0.offset) 99)) .cse1 .cse2)) (or (not .cse5) (not .cse6))))) (<= .cse4 100)))) (<= (select (select |#memory_int| main_~m~0.base) main_~m~0.offset) 99)) [2019-09-08 02:15:45,256 INFO L443 ceAbstractionStarter]: For program point L584-4(lines 584 588) no Hoare annotation was computed. [2019-09-08 02:15:45,264 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-08 02:15:45,265 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-08 02:15:45,265 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-08 02:15:45,265 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-08 02:15:45,267 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,268 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-08 02:15:45,268 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,268 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,268 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-08 02:15:45,269 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-08 02:15:45,269 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,269 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-08 02:15:45,269 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,274 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-08 02:15:45,275 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-08 02:15:45,275 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-08 02:15:45,276 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-08 02:15:45,276 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,276 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-08 02:15:45,277 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,277 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,277 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-08 02:15:45,277 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-08 02:15:45,277 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,278 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-08 02:15:45,278 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,281 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,281 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,281 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,282 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,282 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,282 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,282 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.offset,QUANTIFIED] [2019-09-08 02:15:45,282 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,283 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.base,QUANTIFIED] [2019-09-08 02:15:45,283 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,283 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,283 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,284 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,284 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,284 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.base,QUANTIFIED] [2019-09-08 02:15:45,284 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.offset,QUANTIFIED] [2019-09-08 02:15:45,285 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,285 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,285 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.offset,QUANTIFIED] [2019-09-08 02:15:45,285 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,285 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.base,QUANTIFIED] [2019-09-08 02:15:45,287 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,287 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,288 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,288 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,288 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,288 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,289 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,289 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,289 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,289 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,290 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,290 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,291 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,292 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,292 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.offset,QUANTIFIED] [2019-09-08 02:15:45,292 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,292 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.base,QUANTIFIED] [2019-09-08 02:15:45,292 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,293 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,293 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,293 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,293 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,294 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.base,QUANTIFIED] [2019-09-08 02:15:45,294 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.offset,QUANTIFIED] [2019-09-08 02:15:45,294 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,294 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,294 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.offset,QUANTIFIED] [2019-09-08 02:15:45,295 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,295 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.base,QUANTIFIED] [2019-09-08 02:15:45,295 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,295 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,295 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,296 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,296 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,296 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,296 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,297 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,297 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,297 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,297 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.09 02:15:45 BoogieIcfgContainer [2019-09-08 02:15:45,300 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-08 02:15:45,305 INFO L168 Benchmark]: Toolchain (without parser) took 57614.99 ms. Allocated memory was 143.1 MB in the beginning and 312.5 MB in the end (delta: 169.3 MB). Free memory was 89.3 MB in the beginning and 202.9 MB in the end (delta: -113.7 MB). Peak memory consumption was 55.7 MB. Max. memory is 7.1 GB. [2019-09-08 02:15:45,305 INFO L168 Benchmark]: CDTParser took 0.45 ms. Allocated memory is still 143.1 MB. Free memory was 109.1 MB in the beginning and 108.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-08 02:15:45,306 INFO L168 Benchmark]: CACSL2BoogieTranslator took 575.06 ms. Allocated memory was 143.1 MB in the beginning and 202.9 MB in the end (delta: 59.8 MB). Free memory was 89.1 MB in the beginning and 168.1 MB in the end (delta: -79.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. [2019-09-08 02:15:45,307 INFO L168 Benchmark]: Boogie Preprocessor took 60.37 ms. Allocated memory is still 202.9 MB. Free memory was 168.1 MB in the beginning and 165.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-09-08 02:15:45,308 INFO L168 Benchmark]: RCFGBuilder took 624.56 ms. Allocated memory is still 202.9 MB. Free memory was 165.3 MB in the beginning and 123.9 MB in the end (delta: 41.5 MB). Peak memory consumption was 41.5 MB. Max. memory is 7.1 GB. [2019-09-08 02:15:45,309 INFO L168 Benchmark]: TraceAbstraction took 56350.45 ms. Allocated memory was 202.9 MB in the beginning and 312.5 MB in the end (delta: 109.6 MB). Free memory was 123.9 MB in the beginning and 202.9 MB in the end (delta: -79.1 MB). Peak memory consumption was 30.5 MB. Max. memory is 7.1 GB. [2019-09-08 02:15:45,316 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.45 ms. Allocated memory is still 143.1 MB. Free memory was 109.1 MB in the beginning and 108.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 575.06 ms. Allocated memory was 143.1 MB in the beginning and 202.9 MB in the end (delta: 59.8 MB). Free memory was 89.1 MB in the beginning and 168.1 MB in the end (delta: -79.1 MB). Peak memory consumption was 20.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 60.37 ms. Allocated memory is still 202.9 MB. Free memory was 168.1 MB in the beginning and 165.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 624.56 ms. Allocated memory is still 202.9 MB. Free memory was 165.3 MB in the beginning and 123.9 MB in the end (delta: 41.5 MB). Peak memory consumption was 41.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 56350.45 ms. Allocated memory was 202.9 MB in the beginning and 312.5 MB in the end (delta: 109.6 MB). Free memory was 123.9 MB in the beginning and 202.9 MB in the end (delta: -79.1 MB). Peak memory consumption was 30.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.base,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 590]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 573]: Loop Invariant [2019-09-08 02:15:45,331 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-08 02:15:45,331 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-08 02:15:45,331 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-08 02:15:45,332 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-08 02:15:45,332 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,332 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-08 02:15:45,332 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-08 02:15:45,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-08 02:15:45,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-08 02:15:45,333 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,334 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-08 02:15:45,334 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-09-08 02:15:45,335 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-08 02:15:45,335 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-09-08 02:15:45,335 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,336 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-08 02:15:45,336 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,336 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,336 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-08 02:15:45,336 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-08 02:15:45,336 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,337 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-09-08 02:15:45,337 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((((1 == unknown-#memory_int-unknown[head][head] && !(head == list + 8)) && \valid[m] == 1) && 1 == \valid[head]) && head == list) && !(m == list)) && (m == #memory_$Pointer$[list][list + 4] || unknown-#memory_int-unknown[m][m] == aux-m->val-aux)) && 0 == unknown-#memory_int-unknown[m][m]) && (!(m == #memory_$Pointer$[list][list + 4]) || ((!(#memory_$Pointer$[list][list + 4] == m) || unknown-#memory_int-unknown[list][list] == 1) && (#memory_$Pointer$[list][list + 4] == m || unknown-#memory_int-unknown[m][m] == aux-m->val-aux))) - InvariantResult [Line: 584]: Loop Invariant [2019-09-08 02:15:45,337 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,338 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.offset,QUANTIFIED] [2019-09-08 02:15:45,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.base,QUANTIFIED] [2019-09-08 02:15:45,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,339 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.base,QUANTIFIED] [2019-09-08 02:15:45,340 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.offset,QUANTIFIED] [2019-09-08 02:15:45,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,341 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.offset,QUANTIFIED] [2019-09-08 02:15:45,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.base,QUANTIFIED] [2019-09-08 02:15:45,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,342 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,342 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,343 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,343 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,344 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,344 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,344 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,345 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,345 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,346 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.offset,QUANTIFIED] [2019-09-08 02:15:45,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.base,QUANTIFIED] [2019-09-08 02:15:45,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,347 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,348 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,350 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,350 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.base,QUANTIFIED] [2019-09-08 02:15:45,350 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.offset,QUANTIFIED] [2019-09-08 02:15:45,351 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,351 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,351 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.offset,QUANTIFIED] [2019-09-08 02:15:45,351 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,351 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~list~0.base,QUANTIFIED] [2019-09-08 02:15:45,351 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_25,QUANTIFIED] [2019-09-08 02:15:45,352 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_arrayElimCell_24,QUANTIFIED] [2019-09-08 02:15:45,352 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,352 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,352 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,353 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,353 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,353 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,353 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-09-08 02:15:45,353 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (\exists main_~list~0.offset : int, v_arrayElimCell_25 : int, v_arrayElimCell_24 : int, main_~list~0.base : int :: ((((((0 == unknown-#memory_int-unknown[v_arrayElimCell_25][v_arrayElimCell_24] % -2 && m == v_arrayElimCell_24) && m == v_arrayElimCell_25) || (0 == unknown-#memory_int-unknown[v_arrayElimCell_25][v_arrayElimCell_24] % -2 && unknown-#memory_int-unknown[m][m] <= 99)) && main_~list~0.offset == v_arrayElimCell_24) && main_~list~0.base == v_arrayElimCell_25) || ((((!(m == v_arrayElimCell_24) || !(m == v_arrayElimCell_25)) && unknown-#memory_int-unknown[m][m] <= 99) || ((unknown-#memory_int-unknown[v_arrayElimCell_25][v_arrayElimCell_24] <= unknown-#memory_int-unknown[main_~list~0.base][main_~list~0.offset] + 99 && m == v_arrayElimCell_24) && m == v_arrayElimCell_25)) && (!(main_~list~0.offset == v_arrayElimCell_24) || !(main_~list~0.base == v_arrayElimCell_25)))) && unknown-#memory_int-unknown[v_arrayElimCell_25][v_arrayElimCell_24] <= 100) || unknown-#memory_int-unknown[m][m] <= 99 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 28 locations, 1 error locations. SAFE Result, 56.2s OverallTime, 5 OverallIterations, 2 TraceHistogramMax, 33.9s AutomataDifference, 0.0s DeadEndRemovalTime, 4.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 84 SDtfs, 89 SDslu, 268 SDs, 0 SdLazy, 272 SolverSat, 63 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 12.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 35.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 28 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 19 NumberOfFragments, 213 HoareAnnotationTreeSize, 6 FomulaSimplifications, 2911 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 311 FormulaSimplificationTreeSizeReductionInter, 4.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 17.3s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 130 ConstructedInterpolants, 15 QuantifiedInterpolants, 35439 SizeOfPredicates, 28 NumberOfNonLiveVariables, 334 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 3/16 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...