/usr/bin/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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/heap-data/shared_mem1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:59:38,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:59:38,718 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:59:38,730 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:59:38,731 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:59:38,732 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:59:38,733 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:59:38,735 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:59:38,736 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:59:38,737 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:59:38,738 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:59:38,739 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:59:38,740 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:59:38,740 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:59:38,741 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:59:38,744 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:59:38,745 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:59:38,746 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:59:38,750 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:59:38,753 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:59:38,756 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:59:38,758 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:59:38,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:59:38,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:59:38,764 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:59:38,765 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:59:38,765 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:59:38,766 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:59:38,766 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:59:38,769 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:59:38,769 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:59:38,772 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:59:38,773 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:59:38,774 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:59:38,777 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:59:38,778 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:59:38,779 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:59:38,780 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:59:38,780 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:59:38,783 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:59:38,784 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:59:38,785 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-11-06 22:59:38,805 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:59:38,806 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:59:38,808 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:59:38,808 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:59:38,809 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:59:38,809 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:59:38,809 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:59:38,809 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:59:38,809 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:59:38,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:59:38,811 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:59:38,811 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:59:38,811 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:59:38,812 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:59:38,812 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:59:38,812 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:59:38,812 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:59:38,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:59:38,813 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:59:38,813 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:59:38,813 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:59:38,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:59:38,814 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:59:38,814 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:59:38,814 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:59:38,814 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:59:38,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:59:38,815 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:59:38,815 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-06 22:59:39,086 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:59:39,102 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:59:39,105 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:59:39,107 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:59:39,107 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:59:39,108 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/shared_mem1.i [2019-11-06 22:59:39,179 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f7e6ef2d/ea22277e3b144e3a848b564375644968/FLAGb158205c9 [2019-11-06 22:59:39,765 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:59:39,766 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/shared_mem1.i [2019-11-06 22:59:39,780 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f7e6ef2d/ea22277e3b144e3a848b564375644968/FLAGb158205c9 [2019-11-06 22:59:40,075 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f7e6ef2d/ea22277e3b144e3a848b564375644968 [2019-11-06 22:59:40,083 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:59:40,085 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:59:40,086 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:59:40,086 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:59:40,089 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:59:40,090 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:59:40" (1/1) ... [2019-11-06 22:59:40,094 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e2d26de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:40, skipping insertion in model container [2019-11-06 22:59:40,094 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:59:40" (1/1) ... [2019-11-06 22:59:40,101 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:59:40,157 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:59:40,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:59:40,563 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:59:40,609 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:59:40,681 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:59:40,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:40 WrapperNode [2019-11-06 22:59:40,682 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:59:40,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:59:40,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:59:40,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:59:40,696 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:40" (1/1) ... [2019-11-06 22:59:40,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:40" (1/1) ... [2019-11-06 22:59:40,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:40" (1/1) ... [2019-11-06 22:59:40,711 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:40" (1/1) ... [2019-11-06 22:59:40,727 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:40" (1/1) ... [2019-11-06 22:59:40,732 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:40" (1/1) ... [2019-11-06 22:59:40,735 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:40" (1/1) ... [2019-11-06 22:59:40,742 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:59:40,749 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:59:40,749 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:59:40,749 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:59:40,751 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:40" (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-11-06 22:59:40,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:59:40,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:59:40,808 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-06 22:59:40,808 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-06 22:59:40,808 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:59:40,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:59:40,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:59:40,809 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-06 22:59:40,809 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-06 22:59:40,810 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-06 22:59:40,810 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-06 22:59:40,810 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-06 22:59:40,810 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-06 22:59:40,810 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-06 22:59:40,810 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-06 22:59:40,810 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-06 22:59:40,811 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-06 22:59:40,811 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-06 22:59:40,811 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-06 22:59:40,811 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-06 22:59:40,811 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-06 22:59:40,811 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-06 22:59:40,811 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-06 22:59:40,812 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-06 22:59:40,812 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-06 22:59:40,812 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-06 22:59:40,812 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-06 22:59:40,812 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-06 22:59:40,812 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-06 22:59:40,813 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-06 22:59:40,813 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-06 22:59:40,813 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-06 22:59:40,813 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-06 22:59:40,813 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-06 22:59:40,814 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-06 22:59:40,814 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-06 22:59:40,814 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-06 22:59:40,814 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-06 22:59:40,814 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-06 22:59:40,814 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-06 22:59:40,815 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-06 22:59:40,815 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-06 22:59:40,815 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-06 22:59:40,815 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-06 22:59:40,815 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-06 22:59:40,815 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-06 22:59:40,815 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-06 22:59:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-06 22:59:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-06 22:59:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-06 22:59:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-06 22:59:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-06 22:59:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-06 22:59:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-06 22:59:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-06 22:59:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-06 22:59:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-06 22:59:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-06 22:59:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-06 22:59:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 22:59:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-06 22:59:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-06 22:59:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-06 22:59:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-06 22:59:40,818 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-06 22:59:40,819 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-06 22:59:40,819 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-06 22:59:40,819 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-06 22:59:40,819 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-06 22:59:40,819 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-06 22:59:40,819 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-06 22:59:40,820 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-06 22:59:40,820 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 22:59:40,820 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-06 22:59:40,820 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-06 22:59:40,820 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-06 22:59:40,820 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-06 22:59:40,820 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-06 22:59:40,821 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-06 22:59:40,821 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-06 22:59:40,821 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-06 22:59:40,821 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-06 22:59:40,821 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-06 22:59:40,821 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-06 22:59:40,822 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-06 22:59:40,822 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-06 22:59:40,822 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-06 22:59:40,822 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-06 22:59:40,822 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-06 22:59:40,822 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-06 22:59:40,822 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-06 22:59:40,823 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-06 22:59:40,823 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-06 22:59:40,823 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-06 22:59:40,823 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-06 22:59:40,823 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-06 22:59:40,823 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-06 22:59:40,823 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-06 22:59:40,824 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-06 22:59:40,824 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-06 22:59:40,824 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-06 22:59:40,824 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-06 22:59:40,824 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-06 22:59:40,824 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-06 22:59:40,824 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-06 22:59:40,825 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-06 22:59:40,825 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-06 22:59:40,825 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-06 22:59:40,825 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-06 22:59:40,825 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-06 22:59:40,825 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-06 22:59:40,825 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-06 22:59:40,826 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:59:40,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 22:59:40,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 22:59:40,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-06 22:59:40,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-06 22:59:40,826 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 22:59:40,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:59:40,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:59:40,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 22:59:41,400 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:59:41,401 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-06 22:59:41,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:59:41 BoogieIcfgContainer [2019-11-06 22:59:41,402 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:59:41,404 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:59:41,404 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:59:41,406 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:59:41,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:59:40" (1/3) ... [2019-11-06 22:59:41,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d7a9815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:59:41, skipping insertion in model container [2019-11-06 22:59:41,408 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:40" (2/3) ... [2019-11-06 22:59:41,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d7a9815 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:59:41, skipping insertion in model container [2019-11-06 22:59:41,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:59:41" (3/3) ... [2019-11-06 22:59:41,410 INFO L109 eAbstractionObserver]: Analyzing ICFG shared_mem1.i [2019-11-06 22:59:41,421 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:59:41,429 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 22:59:41,441 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 22:59:41,466 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:59:41,466 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:59:41,466 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:59:41,466 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:59:41,466 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:59:41,466 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:59:41,467 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:59:41,467 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:59:41,481 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-11-06 22:59:41,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-06 22:59:41,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:41,488 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:59:41,489 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:41,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:41,494 INFO L82 PathProgramCache]: Analyzing trace with hash -53964180, now seen corresponding path program 1 times [2019-11-06 22:59:41,503 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:41,503 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563649471] [2019-11-06 22:59:41,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:41,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:59:41,662 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563649471] [2019-11-06 22:59:41,663 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:59:41,664 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-06 22:59:41,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995478455] [2019-11-06 22:59:41,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-06 22:59:41,672 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:41,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-06 22:59:41,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-06 22:59:41,695 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states. [2019-11-06 22:59:41,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:41,723 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2019-11-06 22:59:41,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 22:59:41,724 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-11-06 22:59:41,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:41,739 INFO L225 Difference]: With dead ends: 33 [2019-11-06 22:59:41,739 INFO L226 Difference]: Without dead ends: 17 [2019-11-06 22:59:41,748 INFO L630 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-11-06 22:59:41,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-11-06 22:59:41,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-11-06 22:59:41,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-11-06 22:59:41,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-11-06 22:59:41,810 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 14 [2019-11-06 22:59:41,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:41,811 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-11-06 22:59:41,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-06 22:59:41,812 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-11-06 22:59:41,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-06 22:59:41,814 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:41,814 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:59:41,815 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:41,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:41,816 INFO L82 PathProgramCache]: Analyzing trace with hash 1423019225, now seen corresponding path program 1 times [2019-11-06 22:59:41,817 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:41,817 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458526267] [2019-11-06 22:59:41,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:42,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:59:42,328 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458526267] [2019-11-06 22:59:42,328 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:59:42,329 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-06 22:59:42,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830624023] [2019-11-06 22:59:42,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 22:59:42,331 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:42,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 22:59:42,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:59:42,332 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 8 states. [2019-11-06 22:59:42,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:42,659 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2019-11-06 22:59:42,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:59:42,659 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-11-06 22:59:42,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:42,662 INFO L225 Difference]: With dead ends: 33 [2019-11-06 22:59:42,662 INFO L226 Difference]: Without dead ends: 31 [2019-11-06 22:59:42,663 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-11-06 22:59:42,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-11-06 22:59:42,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2019-11-06 22:59:42,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-06 22:59:42,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2019-11-06 22:59:42,671 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 15 [2019-11-06 22:59:42,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:42,672 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-11-06 22:59:42,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 22:59:42,672 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2019-11-06 22:59:42,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-06 22:59:42,673 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:42,673 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:59:42,673 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:42,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:42,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1423021147, now seen corresponding path program 1 times [2019-11-06 22:59:42,674 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:42,674 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779251152] [2019-11-06 22:59:42,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:42,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:59:42,942 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779251152] [2019-11-06 22:59:42,943 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:59:42,943 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 22:59:42,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419635161] [2019-11-06 22:59:42,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 22:59:42,944 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:42,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 22:59:42,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-06 22:59:42,945 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 7 states. [2019-11-06 22:59:43,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:43,219 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2019-11-06 22:59:43,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:59:43,220 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-11-06 22:59:43,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:43,221 INFO L225 Difference]: With dead ends: 35 [2019-11-06 22:59:43,221 INFO L226 Difference]: Without dead ends: 28 [2019-11-06 22:59:43,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-06 22:59:43,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-06 22:59:43,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-11-06 22:59:43,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-06 22:59:43,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-06 22:59:43,230 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 15 [2019-11-06 22:59:43,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:43,231 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-06 22:59:43,231 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 22:59:43,231 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-06 22:59:43,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 22:59:43,232 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:43,232 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:59:43,232 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:43,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:43,233 INFO L82 PathProgramCache]: Analyzing trace with hash -442037965, now seen corresponding path program 1 times [2019-11-06 22:59:43,233 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:43,233 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287502583] [2019-11-06 22:59:43,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:43,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:43,658 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:59:43,659 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287502583] [2019-11-06 22:59:43,660 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927823364] [2019-11-06 22:59:43,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:59:43,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:43,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 40 conjunts are in the unsatisfiable core [2019-11-06 22:59:43,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:59:43,949 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-11-06 22:59:43,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-11-06 22:59:43,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:44,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:44,008 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_26|, |v_#memory_$Pointer$.offset_22|, |v_#memory_$Pointer$.base_22|], 2=[|v_#memory_int_23|]} [2019-11-06 22:59:44,023 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:44,100 INFO L341 Elim1Store]: treesize reduction 33, result has 55.4 percent of original size [2019-11-06 22:59:44,101 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 48 [2019-11-06 22:59:44,102 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:44,207 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-11-06 22:59:44,207 INFO L567 ElimStorePlain]: treesize reduction 16, result has 86.9 percent of original size [2019-11-06 22:59:44,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:44,220 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-06 22:59:44,221 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:44,285 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:44,302 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:44,304 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-11-06 22:59:44,305 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:44,356 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:44,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:44,419 INFO L341 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-11-06 22:59:44,420 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 2 case distinctions, treesize of input 51 treesize of output 60 [2019-11-06 22:59:44,421 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:44,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:44,426 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:44,543 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-11-06 22:59:44,543 INFO L567 ElimStorePlain]: treesize reduction 55, result has 63.8 percent of original size [2019-11-06 22:59:44,545 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:44,545 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:112, output treesize:96 [2019-11-06 22:59:44,680 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-11-06 22:59:44,751 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:44,751 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 239 treesize of output 243 [2019-11-06 22:59:44,753 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:44,812 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:44,813 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 241 treesize of output 245 [2019-11-06 22:59:44,814 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:44,865 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:44,866 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 241 treesize of output 245 [2019-11-06 22:59:44,867 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:44,905 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:44,905 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 244 [2019-11-06 22:59:44,907 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:46,152 WARN L191 SmtUtils]: Spent 1.24 s on a formula simplification that was a NOOP. DAG size: 98 [2019-11-06 22:59:46,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:46,156 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_24|, |v_#memory_int_25|], 6=[|v_#memory_$Pointer$.base_24|, |v_#memory_$Pointer$.base_23|, |v_#memory_$Pointer$.offset_24|, |v_#memory_$Pointer$.offset_23|], 10=[|v_#memory_int_27|]} [2019-11-06 22:59:46,176 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:46,191 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:46,204 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:46,216 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:48,074 WARN L191 SmtUtils]: Spent 1.86 s on a formula simplification that was a NOOP. DAG size: 116 [2019-11-06 22:59:48,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:48,085 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:48,102 INFO L496 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:48,114 INFO L496 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:48,125 INFO L496 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:49,559 WARN L191 SmtUtils]: Spent 1.43 s on a formula simplification that was a NOOP. DAG size: 118 [2019-11-06 22:59:49,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:49,597 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:49,668 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 220 [2019-11-06 22:59:49,669 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:49,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:49,788 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 221 [2019-11-06 22:59:49,789 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:49,819 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:49,860 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 221 [2019-11-06 22:59:49,862 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:49,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:49,932 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 219 [2019-11-06 22:59:49,933 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:51,397 WARN L191 SmtUtils]: Spent 1.46 s on a formula simplification that was a NOOP. DAG size: 112 [2019-11-06 22:59:51,397 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:51,423 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:51,431 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:51,567 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 0 case distinctions, treesize of input 213 treesize of output 194 [2019-11-06 22:59:51,568 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:51,601 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:51,607 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:51,754 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 0 case distinctions, treesize of input 215 treesize of output 196 [2019-11-06 22:59:51,755 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:51,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:51,790 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:51,907 INFO L235 Elim1Store]: Index analysis took 129 ms [2019-11-06 22:59:52,021 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 0 case distinctions, treesize of input 214 treesize of output 195 [2019-11-06 22:59:52,022 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:52,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:52,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:52,114 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 0 case distinctions, treesize of input 215 treesize of output 196 [2019-11-06 22:59:52,116 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:52,960 WARN L191 SmtUtils]: Spent 843.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-11-06 22:59:52,961 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:52,979 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:53,013 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 181 [2019-11-06 22:59:53,015 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:53,036 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:53,074 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 181 [2019-11-06 22:59:53,075 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:53,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:53,133 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 179 [2019-11-06 22:59:53,134 INFO L496 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:53,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:53,182 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 180 [2019-11-06 22:59:53,183 INFO L496 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:53,907 WARN L191 SmtUtils]: Spent 723.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-11-06 22:59:53,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:53,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:53,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:53,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:54,055 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 156 [2019-11-06 22:59:54,057 INFO L496 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:54,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:54,081 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:54,230 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 0 case distinctions, treesize of input 174 treesize of output 155 [2019-11-06 22:59:54,231 INFO L496 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:54,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:54,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:54,292 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:54,351 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 156 [2019-11-06 22:59:54,352 INFO L496 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:54,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:54,369 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:54,409 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 0 case distinctions, treesize of input 173 treesize of output 154 [2019-11-06 22:59:54,410 INFO L496 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:54,854 WARN L191 SmtUtils]: Spent 443.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-11-06 22:59:54,855 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:54,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:54,872 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:54,876 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:54,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:54,912 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 123 [2019-11-06 22:59:54,914 INFO L496 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:54,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:54,938 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:54,939 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:54,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:55,179 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-11-06 22:59:55,193 INFO L341 Elim1Store]: treesize reduction 51, result has 72.4 percent of original size [2019-11-06 22:59:55,194 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 149 treesize of output 251 [2019-11-06 22:59:55,195 INFO L496 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:55,205 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:55,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:55,207 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:55,208 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:55,224 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 123 [2019-11-06 22:59:55,225 INFO L496 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:55,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:55,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:55,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:55,266 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:55,277 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 121 [2019-11-06 22:59:55,278 INFO L496 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:55,773 WARN L191 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-11-06 22:59:55,774 INFO L567 ElimStorePlain]: treesize reduction 95, result has 84.4 percent of original size [2019-11-06 22:59:55,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 7 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-11-06 22:59:55,779 INFO L221 ElimStorePlain]: Needed 33 recursive calls to eliminate 11 variables, input treesize:962, output treesize:593 [2019-11-06 22:59:56,107 WARN L191 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-11-06 22:59:56,289 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-06 22:59:56,486 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-06 22:59:56,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 22:59:56,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-06 22:59:56,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-06 22:59:56,526 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_28|, v_prenex_3], 10=[v_prenex_1, v_prenex_2], 12=[|v_#memory_$Pointer$.base_25|, |v_#memory_$Pointer$.offset_25|], 39=[v_prenex_6], 46=[v_prenex_4, v_prenex_5]} [2019-11-06 22:59:56,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:56,542 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 0 case distinctions, treesize of input 181 treesize of output 146 [2019-11-06 22:59:56,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:57,291 WARN L191 SmtUtils]: Spent 746.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 162 [2019-11-06 22:59:57,291 INFO L567 ElimStorePlain]: treesize reduction 30, result has 97.3 percent of original size [2019-11-06 22:59:57,301 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 22:59:57,303 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 114 [2019-11-06 22:59:57,304 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:57,616 WARN L191 SmtUtils]: Spent 311.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2019-11-06 22:59:57,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:57,637 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:57,671 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:57,672 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 109 treesize of output 136 [2019-11-06 22:59:57,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:57,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:57,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:57,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:57,677 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:58,311 WARN L191 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 146 [2019-11-06 22:59:58,311 INFO L567 ElimStorePlain]: treesize reduction 36, result has 96.6 percent of original size [2019-11-06 22:59:58,331 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:58,331 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 42 [2019-11-06 22:59:58,334 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:58,633 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-11-06 22:59:58,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:58,648 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:58,653 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:58,687 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:58,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 146 treesize of output 171 [2019-11-06 22:59:58,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:58,689 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:58,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:58,691 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:58,692 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:59,297 WARN L191 SmtUtils]: Spent 604.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 124 [2019-11-06 22:59:59,298 INFO L567 ElimStorePlain]: treesize reduction 44, result has 95.3 percent of original size [2019-11-06 22:59:59,305 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:59,311 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:59,311 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 61 [2019-11-06 22:59:59,318 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:59,575 WARN L191 SmtUtils]: Spent 256.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-11-06 22:59:59,575 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:59,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:59,591 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 0 case distinctions, treesize of input 170 treesize of output 137 [2019-11-06 22:59:59,593 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:59,609 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 22:59:59,641 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:59,642 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 146 treesize of output 183 [2019-11-06 22:59:59,645 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:59,656 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:59,663 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 0 case distinctions, treesize of input 170 treesize of output 137 [2019-11-06 22:59:59,664 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:59,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:59,682 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 0 case distinctions, treesize of input 168 treesize of output 135 [2019-11-06 22:59:59,683 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:59,692 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 22:59:59,693 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 0 case distinctions, treesize of input 157 treesize of output 124 [2019-11-06 22:59:59,694 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-11-06 23:00:00,339 WARN L191 SmtUtils]: Spent 644.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 104 [2019-11-06 23:00:00,340 INFO L567 ElimStorePlain]: treesize reduction 86, result has 89.1 percent of original size [2019-11-06 23:00:00,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 23:00:00,408 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 23:00:00,409 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 135 treesize of output 158 [2019-11-06 23:00:00,411 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-11-06 23:00:00,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 23:00:00,462 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 23:00:00,462 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 133 treesize of output 156 [2019-11-06 23:00:00,463 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-11-06 23:00:00,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 23:00:00,520 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 23:00:00,521 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 127 treesize of output 150 [2019-11-06 23:00:00,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 23:00:00,527 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 23:00:00,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 23:00:00,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 23:00:00,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 23:00:00,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 23:00:00,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 23:00:00,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 23:00:00,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 23:00:00,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 23:00:00,542 INFO L496 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 23:00:00,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 23:00:00,606 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 23:00:00,606 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 135 treesize of output 158 [2019-11-06 23:00:00,607 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-11-06 23:00:00,619 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 23:00:00,654 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 23:00:00,654 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 122 treesize of output 149 [2019-11-06 23:00:00,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 23:00:00,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 23:00:00,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 23:00:00,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 23:00:00,662 INFO L496 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 23:00:00,944 WARN L191 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 88 [2019-11-06 23:00:00,945 INFO L567 ElimStorePlain]: treesize reduction 198, result has 66.3 percent of original size [2019-11-06 23:00:00,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 23:00:00,961 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 47 [2019-11-06 23:00:00,962 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-11-06 23:00:00,969 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 23:00:00,978 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 49 [2019-11-06 23:00:00,980 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-11-06 23:00:00,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 23:00:00,995 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 47 [2019-11-06 23:00:00,996 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-11-06 23:00:01,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 23:00:01,012 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 44 [2019-11-06 23:00:01,013 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-11-06 23:00:01,026 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 23:00:01,027 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 57 [2019-11-06 23:00:01,028 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-11-06 23:00:01,125 INFO L567 ElimStorePlain]: treesize reduction 35, result has 78.3 percent of original size [2019-11-06 23:00:01,126 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 9 dim-2 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2019-11-06 23:00:01,127 INFO L221 ElimStorePlain]: Needed 22 recursive calls to eliminate 10 variables, input treesize:1165, output treesize:110 [2019-11-06 23:00:01,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-06 23:00:01,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 23:00:01,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 23:00:01,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 23:00:01,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 23:00:01,234 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 23:00:01,242 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 23:00:01,242 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 23:00:01,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 23:00:01,352 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_24|, |v_#memory_int_25|], 5=[|v_#memory_$Pointer$.base_23|, |v_#memory_$Pointer$.offset_23|], 13=[|v_#memory_int_30|]} [2019-11-06 23:00:01,366 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 23:00:01,438 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 23:00:01,444 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 23:00:01,498 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 23:00:01,503 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 23:00:01,554 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 23:00:01,558 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 23:00:01,595 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 23:00:01,598 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 23:00:01,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 23:00:01,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 5 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-11-06 23:00:01,632 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:456, output treesize:633 [2019-11-06 23:00:01,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 23:00:01,746 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [998374641] [2019-11-06 23:00:01,753 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 19 [2019-11-06 23:00:01,815 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-06 23:00:01,815 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-06 23:00:01,897 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-11-06 23:00:01,899 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 19 root evaluator evaluations with a maximum evaluation depth of 0. Performed 19 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 45 variables. [2019-11-06 23:00:01,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 23:00:01,905 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-11-06 23:00:01,969 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-11-06 23:00:01,969 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-11-06 23:00:01,973 INFO L553 sIntCurrentIteration]: We unified 17 AI predicates to 17 [2019-11-06 23:00:01,974 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-11-06 23:00:01,979 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-06 23:00:01,979 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9, 8, 8] total 18 [2019-11-06 23:00:01,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361891736] [2019-11-06 23:00:01,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-06 23:00:01,981 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 23:00:01,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 23:00:01,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-11-06 23:00:01,985 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 2 states. [2019-11-06 23:00:01,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 23:00:01,987 INFO L93 Difference]: Finished difference Result 26 states and 33 transitions. [2019-11-06 23:00:01,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 23:00:01,988 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-11-06 23:00:01,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 23:00:01,988 INFO L225 Difference]: With dead ends: 26 [2019-11-06 23:00:01,988 INFO L226 Difference]: Without dead ends: 0 [2019-11-06 23:00:01,989 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-11-06 23:00:01,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-06 23:00:01,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-06 23:00:01,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-06 23:00:01,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-06 23:00:01,990 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-11-06 23:00:01,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 23:00:01,990 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-06 23:00:01,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-06 23:00:01,991 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-06 23:00:01,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-06 23:00:02,196 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 23:00:02,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-06 23:00:02,215 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-11-06 23:00:02,216 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-11-06 23:00:02,216 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-06 23:00:02,216 INFO L443 ceAbstractionStarter]: For program point __bswap_32ENTRY(lines 64 68) no Hoare annotation was computed. [2019-11-06 23:00:02,216 INFO L443 ceAbstractionStarter]: For program point __bswap_32FINAL(lines 64 68) no Hoare annotation was computed. [2019-11-06 23:00:02,216 INFO L443 ceAbstractionStarter]: For program point __bswap_32EXIT(lines 64 68) no Hoare annotation was computed. [2019-11-06 23:00:02,216 INFO L443 ceAbstractionStarter]: For program point __bswap_64ENTRY(lines 69 73) no Hoare annotation was computed. [2019-11-06 23:00:02,216 INFO L443 ceAbstractionStarter]: For program point __bswap_64FINAL(lines 69 73) no Hoare annotation was computed. [2019-11-06 23:00:02,217 INFO L443 ceAbstractionStarter]: For program point __bswap_64EXIT(lines 69 73) no Hoare annotation was computed. [2019-11-06 23:00:02,217 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-06 23:00:02,217 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-06 23:00:02,217 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-06 23:00:02,217 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-06 23:00:02,217 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 565 593) no Hoare annotation was computed. [2019-11-06 23:00:02,218 INFO L443 ceAbstractionStarter]: For program point L591(line 591) no Hoare annotation was computed. [2019-11-06 23:00:02,218 INFO L443 ceAbstractionStarter]: For program point L585(lines 585 588) no Hoare annotation was computed. [2019-11-06 23:00:02,218 INFO L443 ceAbstractionStarter]: For program point L585-2(lines 585 588) no Hoare annotation was computed. [2019-11-06 23:00:02,218 INFO L443 ceAbstractionStarter]: For program point L575(lines 575 581) no Hoare annotation was computed. [2019-11-06 23:00:02,218 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 565 593) the Hoare annotation is: true [2019-11-06 23:00:02,218 INFO L439 ceAbstractionStarter]: At program point L575-2(lines 573 582) the Hoare annotation is: false [2019-11-06 23:00:02,218 INFO L443 ceAbstractionStarter]: For program point L573-1(lines 573 582) no Hoare annotation was computed. [2019-11-06 23:00:02,218 INFO L443 ceAbstractionStarter]: For program point L573-3(lines 573 582) no Hoare annotation was computed. [2019-11-06 23:00:02,219 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 591) no Hoare annotation was computed. [2019-11-06 23:00:02,219 INFO L443 ceAbstractionStarter]: For program point L590(line 590) no Hoare annotation was computed. [2019-11-06 23:00:02,219 INFO L443 ceAbstractionStarter]: For program point L590-2(lines 590 591) no Hoare annotation was computed. [2019-11-06 23:00:02,219 INFO L439 ceAbstractionStarter]: At program point L590-4(lines 584 592) the Hoare annotation is: false [2019-11-06 23:00:02,219 INFO L443 ceAbstractionStarter]: For program point L584-2(lines 565 593) no Hoare annotation was computed. [2019-11-06 23:00:02,227 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:00:02 BoogieIcfgContainer [2019-11-06 23:00:02,227 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-06 23:00:02,228 INFO L168 Benchmark]: Toolchain (without parser) took 22144.22 ms. Allocated memory was 136.8 MB in the beginning and 340.8 MB in the end (delta: 203.9 MB). Free memory was 100.5 MB in the beginning and 292.2 MB in the end (delta: -191.7 MB). Peak memory consumption was 12.2 MB. Max. memory is 7.1 GB. [2019-11-06 23:00:02,229 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-11-06 23:00:02,229 INFO L168 Benchmark]: CACSL2BoogieTranslator took 596.63 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 100.3 MB in the beginning and 167.6 MB in the end (delta: -67.3 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-11-06 23:00:02,229 INFO L168 Benchmark]: Boogie Preprocessor took 59.99 ms. Allocated memory is still 201.3 MB. Free memory was 167.6 MB in the beginning and 164.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-11-06 23:00:02,230 INFO L168 Benchmark]: RCFGBuilder took 653.54 ms. Allocated memory is still 201.3 MB. Free memory was 164.8 MB in the beginning and 121.9 MB in the end (delta: 42.9 MB). Peak memory consumption was 42.9 MB. Max. memory is 7.1 GB. [2019-11-06 23:00:02,231 INFO L168 Benchmark]: TraceAbstraction took 20823.56 ms. Allocated memory was 201.3 MB in the beginning and 340.8 MB in the end (delta: 139.5 MB). Free memory was 121.2 MB in the beginning and 292.2 MB in the end (delta: -171.0 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-11-06 23:00:02,233 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.21 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 596.63 ms. Allocated memory was 136.8 MB in the beginning and 201.3 MB in the end (delta: 64.5 MB). Free memory was 100.3 MB in the beginning and 167.6 MB in the end (delta: -67.3 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.99 ms. Allocated memory is still 201.3 MB. Free memory was 167.6 MB in the beginning and 164.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 653.54 ms. Allocated memory is still 201.3 MB. Free memory was 164.8 MB in the beginning and 121.9 MB in the end (delta: 42.9 MB). Peak memory consumption was 42.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 20823.56 ms. Allocated memory was 201.3 MB in the beginning and 340.8 MB in the end (delta: 139.5 MB). Free memory was 121.2 MB in the beginning and 292.2 MB in the end (delta: -171.0 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 591]: 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 Derived loop invariant: 0 - InvariantResult [Line: 584]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 27 locations, 1 error locations. Result: SAFE, OverallTime: 20.7s, OverallIterations: 4, TraceHistogramMax: 2, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 57 SDtfs, 28 SDslu, 122 SDs, 0 SdLazy, 97 SolverSat, 10 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 6 NumberOfFragments, 6 HoareAnnotationTreeSize, 6 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 18.9s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 92 ConstructedInterpolants, 5 QuantifiedInterpolants, 104541 SizeOfPredicates, 22 NumberOfNonLiveVariables, 125 ConjunctsInSsa, 40 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 0/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 151, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.8529411764705882, AVG_VARS_REMOVED_DURING_WEAKENING: 2.0588235294117645, AVG_WEAKENED_CONJUNCTS: 0.35294117647058826, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...