/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --traceabstraction.compute.interpolants.along.a.counterexample FPandBPonlyIfFpWasNotPerfect -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.assert.codeblocks SMT_FEATURE_HEURISTIC --traceabstraction.assert.codeblocks.term.scoring.heuristic BIGGEST_EQUIVALENCE_CLASS --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 4 -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/heap-manipulation/dll_of_dll-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d623d84 [2020-07-21 01:06:06,618 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 01:06:06,624 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 01:06:06,653 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 01:06:06,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 01:06:06,655 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 01:06:06,658 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 01:06:06,661 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 01:06:06,664 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 01:06:06,666 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 01:06:06,667 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 01:06:06,670 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 01:06:06,670 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 01:06:06,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 01:06:06,674 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 01:06:06,677 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 01:06:06,678 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 01:06:06,680 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 01:06:06,682 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 01:06:06,686 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 01:06:06,689 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 01:06:06,691 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 01:06:06,693 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 01:06:06,695 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 01:06:06,699 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 01:06:06,700 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 01:06:06,700 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 01:06:06,702 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 01:06:06,703 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 01:06:06,705 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 01:06:06,705 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 01:06:06,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 01:06:06,708 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 01:06:06,709 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 01:06:06,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 01:06:06,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 01:06:06,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 01:06:06,714 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 01:06:06,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 01:06:06,715 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 01:06:06,717 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 01:06:06,718 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 [2020-07-21 01:06:06,740 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 01:06:06,741 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 01:06:06,747 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 01:06:06,747 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 01:06:06,748 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 01:06:06,748 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 01:06:06,748 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 01:06:06,749 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 01:06:06,749 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 01:06:06,749 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 01:06:06,749 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 01:06:06,750 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 01:06:06,750 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 01:06:06,750 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 01:06:06,750 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 01:06:06,750 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 01:06:06,750 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 01:06:06,751 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 01:06:06,751 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 01:06:06,751 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 01:06:06,751 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 01:06:06,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 01:06:06,752 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 01:06:06,752 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 01:06:06,752 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 01:06:06,753 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 01:06:06,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:06:06,753 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 01:06:06,753 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 01:06:06,754 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> FPandBPonlyIfFpWasNotPerfect Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks -> SMT_FEATURE_HEURISTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic -> BIGGEST_EQUIVALENCE_CLASS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic Partitioning Strategy -> FIXED_NUM_PARTITIONS Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Assert CodeBlocks Term Scoring Heuristic number of partitions -> 4 [2020-07-21 01:06:07,157 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 01:06:07,196 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 01:06:07,203 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 01:06:07,206 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 01:06:07,207 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 01:06:07,209 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-manipulation/dll_of_dll-2.i [2020-07-21 01:06:07,360 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cc5f1b39/3eb5f3a809594713b51363d547137626/FLAG4b37a481b [2020-07-21 01:06:08,378 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 01:06:08,380 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/dll_of_dll-2.i [2020-07-21 01:06:08,402 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cc5f1b39/3eb5f3a809594713b51363d547137626/FLAG4b37a481b [2020-07-21 01:06:08,428 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5cc5f1b39/3eb5f3a809594713b51363d547137626 [2020-07-21 01:06:08,444 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 01:06:08,449 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 01:06:08,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 01:06:08,452 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 01:06:08,459 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 01:06:08,460 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:06:08" (1/1) ... [2020-07-21 01:06:08,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@253ac404 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:06:08, skipping insertion in model container [2020-07-21 01:06:08,467 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 01:06:08" (1/1) ... [2020-07-21 01:06:08,481 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 01:06:08,537 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 01:06:09,418 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 01:06:09,438 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 01:06:09,520 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 01:06:09,605 INFO L208 MainTranslator]: Completed translation [2020-07-21 01:06:09,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:06:09 WrapperNode [2020-07-21 01:06:09,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 01:06:09,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 01:06:09,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 01:06:09,608 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 01:06:09,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:06:09" (1/1) ... [2020-07-21 01:06:09,632 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:06:09" (1/1) ... [2020-07-21 01:06:09,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:06:09" (1/1) ... [2020-07-21 01:06:09,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:06:09" (1/1) ... [2020-07-21 01:06:09,703 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:06:09" (1/1) ... [2020-07-21 01:06:09,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:06:09" (1/1) ... [2020-07-21 01:06:09,736 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:06:09" (1/1) ... [2020-07-21 01:06:09,749 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 01:06:09,750 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 01:06:09,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 01:06:09,750 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 01:06:09,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:06:09" (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 [2020-07-21 01:06:09,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 01:06:09,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 01:06:09,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2020-07-21 01:06:09,860 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-21 01:06:09,860 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-21 01:06:09,861 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2020-07-21 01:06:09,861 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_or_die_slave [2020-07-21 01:06:09,861 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_or_die_master [2020-07-21 01:06:09,861 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_slave [2020-07-21 01:06:09,862 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2020-07-21 01:06:09,862 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2020-07-21 01:06:09,862 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy_slave [2020-07-21 01:06:09,862 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy_nested_lists [2020-07-21 01:06:09,863 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_reinit_nested_lists [2020-07-21 01:06:09,863 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy_master [2020-07-21 01:06:09,863 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2020-07-21 01:06:09,863 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_master [2020-07-21 01:06:09,864 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2020-07-21 01:06:09,864 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_full [2020-07-21 01:06:09,864 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_dangling [2020-07-21 01:06:09,864 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_init [2020-07-21 01:06:09,864 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 01:06:09,865 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 01:06:09,865 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-21 01:06:09,865 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-21 01:06:09,865 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-21 01:06:09,866 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-21 01:06:09,866 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-21 01:06:09,866 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-21 01:06:09,866 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-21 01:06:09,866 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-21 01:06:09,867 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-21 01:06:09,867 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-21 01:06:09,867 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-21 01:06:09,867 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-21 01:06:09,867 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-21 01:06:09,867 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-21 01:06:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-21 01:06:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-21 01:06:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-21 01:06:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-21 01:06:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-21 01:06:09,869 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-21 01:06:09,869 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-21 01:06:09,869 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-21 01:06:09,869 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-21 01:06:09,869 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-21 01:06:09,869 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-21 01:06:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-21 01:06:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-21 01:06:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-21 01:06:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-21 01:06:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-21 01:06:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-21 01:06:09,870 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-21 01:06:09,871 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-21 01:06:09,871 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-21 01:06:09,871 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-21 01:06:09,872 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-21 01:06:09,872 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-21 01:06:09,872 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-21 01:06:09,872 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-21 01:06:09,872 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-21 01:06:09,872 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-21 01:06:09,873 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-21 01:06:09,873 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-21 01:06:09,873 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-21 01:06:09,874 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-21 01:06:09,874 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-21 01:06:09,874 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-21 01:06:09,874 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-21 01:06:09,874 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-21 01:06:09,874 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-21 01:06:09,875 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-21 01:06:09,875 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-21 01:06:09,875 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-21 01:06:09,875 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-21 01:06:09,875 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-21 01:06:09,876 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-21 01:06:09,876 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-21 01:06:09,876 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-21 01:06:09,876 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-21 01:06:09,877 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-21 01:06:09,877 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-21 01:06:09,877 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-21 01:06:09,877 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-21 01:06:09,877 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-21 01:06:09,877 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-21 01:06:09,878 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-21 01:06:09,878 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-21 01:06:09,878 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-21 01:06:09,878 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-21 01:06:09,878 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-21 01:06:09,879 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-21 01:06:09,879 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-21 01:06:09,879 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-21 01:06:09,879 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-21 01:06:09,879 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-21 01:06:09,879 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-21 01:06:09,880 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-21 01:06:09,880 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-21 01:06:09,880 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-21 01:06:09,880 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-21 01:06:09,880 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-21 01:06:09,881 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-21 01:06:09,881 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-21 01:06:09,881 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-21 01:06:09,881 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-21 01:06:09,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-21 01:06:09,881 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-21 01:06:09,882 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-21 01:06:09,882 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-21 01:06:09,882 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-21 01:06:09,882 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-21 01:06:09,882 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-21 01:06:09,882 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-21 01:06:09,882 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-21 01:06:09,883 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-21 01:06:09,883 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-21 01:06:09,883 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-21 01:06:09,883 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-21 01:06:09,883 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-21 01:06:09,884 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-21 01:06:09,884 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-21 01:06:09,884 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-21 01:06:09,884 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-21 01:06:09,884 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-21 01:06:09,885 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-21 01:06:09,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 01:06:09,885 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2020-07-21 01:06:09,885 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_or_die_slave [2020-07-21 01:06:09,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-21 01:06:09,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-21 01:06:09,886 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_or_die_master [2020-07-21 01:06:09,886 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_slave [2020-07-21 01:06:09,886 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-21 01:06:09,887 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2020-07-21 01:06:09,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-21 01:06:09,887 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2020-07-21 01:06:09,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-07-21 01:06:09,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-21 01:06:09,888 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2020-07-21 01:06:09,888 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy_slave [2020-07-21 01:06:09,888 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy_nested_lists [2020-07-21 01:06:09,888 INFO L130 BoogieDeclarations]: Found specification of procedure dll_reinit_nested_lists [2020-07-21 01:06:09,888 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy_master [2020-07-21 01:06:09,888 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2020-07-21 01:06:09,889 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_master [2020-07-21 01:06:09,889 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2020-07-21 01:06:09,889 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_full [2020-07-21 01:06:09,889 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_dangling [2020-07-21 01:06:09,889 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_init [2020-07-21 01:06:09,890 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 01:06:09,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 01:06:09,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 01:06:11,468 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 01:06:11,469 INFO L295 CfgBuilder]: Removed 38 assume(true) statements. [2020-07-21 01:06:11,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:06:11 BoogieIcfgContainer [2020-07-21 01:06:11,480 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 01:06:11,483 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 01:06:11,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 01:06:11,491 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 01:06:11,493 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 01:06:08" (1/3) ... [2020-07-21 01:06:11,494 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@186b3b6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:06:11, skipping insertion in model container [2020-07-21 01:06:11,495 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 01:06:09" (2/3) ... [2020-07-21 01:06:11,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@186b3b6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 01:06:11, skipping insertion in model container [2020-07-21 01:06:11,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 01:06:11" (3/3) ... [2020-07-21 01:06:11,538 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_of_dll-2.i [2020-07-21 01:06:11,559 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 01:06:11,576 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 01:06:11,606 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 01:06:11,646 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 01:06:11,646 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 01:06:11,646 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 01:06:11,646 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 01:06:11,647 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 01:06:11,647 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 01:06:11,647 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 01:06:11,647 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 01:06:11,692 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states. [2020-07-21 01:06:11,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-07-21 01:06:11,709 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 01:06:11,711 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 01:06:11,712 INFO L427 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 01:06:11,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 01:06:11,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1405399524, now seen corresponding path program 1 times [2020-07-21 01:06:11,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 01:06:11,737 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1689274356] [2020-07-21 01:06:11,737 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:06:12,020 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 01:06:12,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 01:06:12,027 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-21 01:06:12,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 01:06:12,178 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-07-21 01:06:12,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 01:06:12,517 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-07-21 01:06:12,519 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1689274356] [2020-07-21 01:06:12,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 01:06:12,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-21 01:06:12,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845345499] [2020-07-21 01:06:12,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 01:06:12,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 01:06:12,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 01:06:12,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 01:06:12,557 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 6 states. [2020-07-21 01:06:12,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 01:06:12,841 INFO L93 Difference]: Finished difference Result 342 states and 541 transitions. [2020-07-21 01:06:12,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 01:06:12,844 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2020-07-21 01:06:12,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 01:06:12,873 INFO L225 Difference]: With dead ends: 342 [2020-07-21 01:06:12,874 INFO L226 Difference]: Without dead ends: 168 [2020-07-21 01:06:12,886 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-07-21 01:06:12,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2020-07-21 01:06:13,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2020-07-21 01:06:13,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-07-21 01:06:13,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 199 transitions. [2020-07-21 01:06:13,018 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 199 transitions. Word has length 59 [2020-07-21 01:06:13,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 01:06:13,020 INFO L479 AbstractCegarLoop]: Abstraction has 168 states and 199 transitions. [2020-07-21 01:06:13,021 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 01:06:13,021 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 199 transitions. [2020-07-21 01:06:13,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-07-21 01:06:13,029 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 01:06:13,030 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 01:06:13,246 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:06:13,247 INFO L427 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 01:06:13,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 01:06:13,248 INFO L82 PathProgramCache]: Analyzing trace with hash 586330229, now seen corresponding path program 1 times [2020-07-21 01:06:13,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 01:06:13,251 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1096487802] [2020-07-21 01:06:13,251 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:06:13,786 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 1 check-sat command(s) [2020-07-21 01:06:13,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 01:06:13,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 56 conjunts are in the unsatisfiable core [2020-07-21 01:06:13,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 01:06:13,938 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2020-07-21 01:06:13,941 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:06:13,957 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:06:13,966 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2020-07-21 01:06:13,967 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 01:06:13,989 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:06:13,993 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 01:06:13,995 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:7 [2020-07-21 01:06:16,313 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_insert_master_~item~1.base Int)) (and (<= (+ dll_insert_master_~item~1.base 1) |c_#StackHeapBarrier|) (= (select (select (store |c_old(#memory_$Pointer$.offset)| dll_insert_master_~item~1.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| dll_insert_master_~item~1.base) 0 0) 4 0) 8 0)) |c_dll_insert_master_#in~dll.base|) |c_dll_insert_master_#in~dll.offset|) c_dll_insert_master_~next~3.offset) (= c_dll_insert_master_~next~3.base (select (select (store |c_old(#memory_$Pointer$.base)| dll_insert_master_~item~1.base (store (store (store (select |c_old(#memory_$Pointer$.base)| dll_insert_master_~item~1.base) 0 0) 4 0) 8 0)) |c_dll_insert_master_#in~dll.base|) |c_dll_insert_master_#in~dll.offset|)))) is different from true [2020-07-21 01:06:16,319 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:06:18,377 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((dll_insert_master_~item~1.base Int)) (and (not (= 0 (select (select (store |c_old(#memory_$Pointer$.offset)| dll_insert_master_~item~1.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| dll_insert_master_~item~1.base) 0 0) 4 0) 8 0)) |c_dll_insert_master_#in~dll.base|) |c_dll_insert_master_#in~dll.offset|))) (<= (+ dll_insert_master_~item~1.base 1) |c_#StackHeapBarrier|))) (exists ((dll_insert_master_~item~1.base Int)) (and (not (= 0 (select (select (store |c_old(#memory_$Pointer$.base)| dll_insert_master_~item~1.base (store (store (store (select |c_old(#memory_$Pointer$.base)| dll_insert_master_~item~1.base) 0 0) 4 0) 8 0)) |c_dll_insert_master_#in~dll.base|) |c_dll_insert_master_#in~dll.offset|))) (<= (+ dll_insert_master_~item~1.base 1) |c_#StackHeapBarrier|)))) is different from true [2020-07-21 01:06:18,420 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2020-07-21 01:06:18,423 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:06:18,574 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2020-07-21 01:06:18,577 INFO L624 ElimStorePlain]: treesize reduction 16, result has 79.5 percent of original size [2020-07-21 01:06:18,594 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 58 [2020-07-21 01:06:18,599 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 01:06:18,736 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2020-07-21 01:06:18,738 INFO L624 ElimStorePlain]: treesize reduction 16, result has 80.7 percent of original size [2020-07-21 01:06:18,742 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 01:06:18,744 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:06:18,745 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:06:18,749 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:06:18,752 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:06:18,756 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 01:06:18,759 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:06:18,761 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:06:18,764 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:06:18,766 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:06:18,768 INFO L544 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 01:06:18,769 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:57, output treesize:1 [2020-07-21 01:06:20,822 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_4 Int)) (and (not (= 0 (select (select (store |c_old(#memory_$Pointer$.base)| v_prenex_4 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_4) 0 0) 4 0) 8 0)) |c_dll_insert_master_#in~dll.base|) |c_dll_insert_master_#in~dll.offset|))) (<= (+ v_prenex_4 1) |c_#StackHeapBarrier|))) (exists ((dll_insert_master_~item~1.base Int)) (and (not (= 0 (select (select (store |c_old(#memory_$Pointer$.offset)| dll_insert_master_~item~1.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| dll_insert_master_~item~1.base) 0 0) 4 0) 8 0)) |c_dll_insert_master_#in~dll.base|) |c_dll_insert_master_#in~dll.offset|))) (<= (+ dll_insert_master_~item~1.base 1) |c_#StackHeapBarrier|)))) is different from true [2020-07-21 01:06:22,882 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_4 Int)) (and (not (= 0 (select (select (store |c_old(#memory_$Pointer$.base)| v_prenex_4 (store (store (store (select |c_old(#memory_$Pointer$.base)| v_prenex_4) 0 0) 4 0) 8 0)) |c_##fun~$Pointer$~TO~VOID_#in~9.base|) |c_##fun~$Pointer$~TO~VOID_#in~9.offset|))) (<= (+ v_prenex_4 1) |c_#StackHeapBarrier|))) (exists ((dll_insert_master_~item~1.base Int)) (and (not (= 0 (select (select (store |c_old(#memory_$Pointer$.offset)| dll_insert_master_~item~1.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| dll_insert_master_~item~1.base) 0 0) 4 0) 8 0)) |c_##fun~$Pointer$~TO~VOID_#in~9.base|) |c_##fun~$Pointer$~TO~VOID_#in~9.offset|))) (<= (+ dll_insert_master_~item~1.base 1) |c_#StackHeapBarrier|)))) is different from true [2020-07-21 01:06:22,895 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:06:22,901 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:06:22,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:06:22,931 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:06:22,958 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-21 01:06:22,959 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 01:06:22,962 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:06:22,963 INFO L512 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_BEFORE_CALL_6| vanished before elimination [2020-07-21 01:06:22,963 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 01:06:22,964 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:91, output treesize:1 [2020-07-21 01:06:23,095 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 126 proven. 5 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2020-07-21 01:06:23,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 01:06:23,484 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2020-07-21 01:06:25,397 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 01:06:27,407 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_dll_insert_master_~item~1.base_35 Int)) (or (= 0 (select (select (store |c_#memory_$Pointer$.offset| v_dll_insert_master_~item~1.base_35 (store (store (store (select |c_#memory_$Pointer$.offset| v_dll_insert_master_~item~1.base_35) 0 0) 4 0) 8 0)) |c_dll_create_generic_~#dll~0.base|) |c_dll_create_generic_~#dll~0.offset|)) (< |c_#StackHeapBarrier| (+ v_dll_insert_master_~item~1.base_35 1)))) (forall ((v_dll_insert_master_~item~1.base_35 Int)) (or (< |c_#StackHeapBarrier| (+ v_dll_insert_master_~item~1.base_35 1)) (= 0 (select (select (store |c_#memory_$Pointer$.base| v_dll_insert_master_~item~1.base_35 (store (store (store (select |c_#memory_$Pointer$.base| v_dll_insert_master_~item~1.base_35) 0 0) 4 0) 8 0)) |c_dll_create_generic_~#dll~0.base|) |c_dll_create_generic_~#dll~0.offset|))))) is different from false [2020-07-21 01:06:27,414 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1096487802] [2020-07-21 01:06:27,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-21 01:06:27,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-21 01:06:27,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457191531] [2020-07-21 01:06:27,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-21 01:06:27,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 01:06:27,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-21 01:06:27,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=59, Unknown=5, NotChecked=90, Total=182 [2020-07-21 01:06:27,421 INFO L87 Difference]: Start difference. First operand 168 states and 199 transitions. Second operand 13 states. [2020-07-21 01:06:29,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 01:06:29,544 INFO L93 Difference]: Finished difference Result 337 states and 403 transitions. [2020-07-21 01:06:29,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-21 01:06:29,546 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 154 [2020-07-21 01:06:29,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 01:06:29,555 INFO L225 Difference]: With dead ends: 337 [2020-07-21 01:06:29,556 INFO L226 Difference]: Without dead ends: 178 [2020-07-21 01:06:29,564 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=32, Invalid=73, Unknown=5, NotChecked=100, Total=210 [2020-07-21 01:06:29,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2020-07-21 01:06:29,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2020-07-21 01:06:29,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2020-07-21 01:06:29,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 207 transitions. [2020-07-21 01:06:29,639 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 207 transitions. Word has length 154 [2020-07-21 01:06:29,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 01:06:29,643 INFO L479 AbstractCegarLoop]: Abstraction has 174 states and 207 transitions. [2020-07-21 01:06:29,643 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-21 01:06:29,643 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 207 transitions. [2020-07-21 01:06:29,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-07-21 01:06:29,654 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 01:06:29,654 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 01:06:29,855 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:06:29,856 INFO L427 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 01:06:29,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 01:06:29,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1523736395, now seen corresponding path program 1 times [2020-07-21 01:06:29,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 01:06:29,857 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [330534539] [2020-07-21 01:06:29,858 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:06:30,184 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 2 check-sat command(s) [2020-07-21 01:06:30,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 01:06:30,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 64 conjunts are in the unsatisfiable core [2020-07-21 01:06:30,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 01:06:30,374 INFO L384 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 11 treesize of output 7 [2020-07-21 01:06:30,375 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:06:30,379 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:06:30,381 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 01:06:30,382 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2020-07-21 01:06:30,462 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2020-07-21 01:06:30,463 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:06:30,469 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:06:30,470 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 01:06:30,472 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-07-21 01:06:31,456 WARN L193 SmtUtils]: Spent 826.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2020-07-21 01:06:32,541 WARN L193 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 21 [2020-07-21 01:06:34,568 WARN L860 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_slave_~ptr~0.offset Int) (dll_insert_slave_~item~0.base Int)) (and (<= (+ dll_insert_slave_~item~0.base 1) |c_#StackHeapBarrier|) (= (select (select (store |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base (store (select |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base) alloc_or_die_slave_~ptr~0.offset 0)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|) c_dll_insert_slave_~next~0.base))) is different from true [2020-07-21 01:06:36,596 WARN L860 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_slave_~ptr~0.offset Int) (dll_insert_slave_~item~0.base Int)) (and (= 0 (select (select (store |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base (store (select |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base) alloc_or_die_slave_~ptr~0.offset 0)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|)) (<= (+ dll_insert_slave_~item~0.base 1) |c_#StackHeapBarrier|))) is different from true [2020-07-21 01:06:38,612 WARN L860 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_slave_~ptr~0.offset Int) (dll_insert_slave_~item~0.base Int)) (and (<= (+ dll_insert_slave_~item~0.base 1) |c_#StackHeapBarrier|) (= 0 (select (select (store |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base (store (select |c_old(#memory_$Pointer$.base)| dll_insert_slave_~item~0.base) alloc_or_die_slave_~ptr~0.offset 0)) |c_##fun~$Pointer$~TO~VOID_#in~9.base|) |c_##fun~$Pointer$~TO~VOID_#in~9.offset|)))) is different from true [2020-07-21 01:06:38,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:06:38,645 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:06:38,647 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:06:38,648 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 01:06:38,648 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:1 [2020-07-21 01:06:38,735 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 114 proven. 5 refuted. 0 times theorem prover too weak. 55 trivial. 6 not checked. [2020-07-21 01:06:38,735 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 01:06:44,169 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_dll_insert_slave_~item~0.base_231 Int) (v_alloc_or_die_slave_~ptr~0.offset_253 Int)) (or (< |c_#StackHeapBarrier| (+ v_dll_insert_slave_~item~0.base_231 1)) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| v_dll_insert_slave_~item~0.base_231 (store (select |c_#memory_$Pointer$.base| v_dll_insert_slave_~item~0.base_231) v_alloc_or_die_slave_~ptr~0.offset_253 0)) |c_dll_create_generic_~#dll~0.base|) |c_dll_create_generic_~#dll~0.offset|))))) is different from false [2020-07-21 01:06:44,171 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [330534539] [2020-07-21 01:06:44,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-21 01:06:44,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2020-07-21 01:06:44,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142038658] [2020-07-21 01:06:44,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-21 01:06:44,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 01:06:44,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-21 01:06:44,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=302, Unknown=4, NotChecked=148, Total=506 [2020-07-21 01:06:44,177 INFO L87 Difference]: Start difference. First operand 174 states and 207 transitions. Second operand 22 states. [2020-07-21 01:06:45,594 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification that was a NOOP. DAG size: 21 [2020-07-21 01:06:46,588 WARN L193 SmtUtils]: Spent 945.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2020-07-21 01:06:50,668 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2020-07-21 01:06:58,765 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 25 [2020-07-21 01:07:02,894 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 30 [2020-07-21 01:07:10,878 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2020-07-21 01:07:17,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 01:07:17,244 INFO L93 Difference]: Finished difference Result 352 states and 433 transitions. [2020-07-21 01:07:17,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-21 01:07:17,245 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 154 [2020-07-21 01:07:17,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 01:07:17,250 INFO L225 Difference]: With dead ends: 352 [2020-07-21 01:07:17,251 INFO L226 Difference]: Without dead ends: 187 [2020-07-21 01:07:17,254 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 40.6s TimeCoverageRelationStatistics Valid=125, Invalid=933, Unknown=14, NotChecked=260, Total=1332 [2020-07-21 01:07:17,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2020-07-21 01:07:17,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 182. [2020-07-21 01:07:17,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-07-21 01:07:17,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 216 transitions. [2020-07-21 01:07:17,281 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 216 transitions. Word has length 154 [2020-07-21 01:07:17,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 01:07:17,282 INFO L479 AbstractCegarLoop]: Abstraction has 182 states and 216 transitions. [2020-07-21 01:07:17,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-21 01:07:17,282 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 216 transitions. [2020-07-21 01:07:17,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-07-21 01:07:17,286 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 01:07:17,286 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 01:07:17,501 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:07:17,503 INFO L427 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 01:07:17,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 01:07:17,505 INFO L82 PathProgramCache]: Analyzing trace with hash -2084601485, now seen corresponding path program 1 times [2020-07-21 01:07:17,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 01:07:17,507 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [482373912] [2020-07-21 01:07:17,507 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:07:20,021 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 01:07:20,021 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 01:07:20,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 785 conjuncts, 48 conjunts are in the unsatisfiable core [2020-07-21 01:07:20,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 01:07:20,213 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:07:20,214 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 47 [2020-07-21 01:07:20,215 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:07:20,254 INFO L624 ElimStorePlain]: treesize reduction 20, result has 60.8 percent of original size [2020-07-21 01:07:20,256 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 01:07:20,258 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:8 [2020-07-21 01:07:20,317 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2020-07-21 01:07:20,320 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:07:20,322 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:07:20,323 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 01:07:20,324 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2020-07-21 01:07:20,541 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2020-07-21 01:07:20,542 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 01:07:21,834 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 74 [2020-07-21 01:07:21,836 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-21 01:07:21,908 INFO L624 ElimStorePlain]: treesize reduction 38, result has 47.2 percent of original size [2020-07-21 01:07:21,912 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-21 01:07:21,913 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:7 [2020-07-21 01:07:21,924 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 182 treesize of output 174 [2020-07-21 01:07:21,927 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-21 01:07:22,077 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 25 [2020-07-21 01:07:22,078 INFO L624 ElimStorePlain]: treesize reduction 127, result has 21.6 percent of original size [2020-07-21 01:07:22,080 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-07-21 01:07:22,081 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:20 [2020-07-21 01:07:22,287 INFO L501 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-07-21 01:07:22,608 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 143 trivial. 0 not checked. [2020-07-21 01:07:22,609 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [482373912] [2020-07-21 01:07:22,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 01:07:22,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2020-07-21 01:07:22,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220965141] [2020-07-21 01:07:22,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-21 01:07:22,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 01:07:22,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-21 01:07:22,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=379, Unknown=0, NotChecked=0, Total=420 [2020-07-21 01:07:22,619 INFO L87 Difference]: Start difference. First operand 182 states and 216 transitions. Second operand 21 states. [2020-07-21 01:07:23,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 01:07:23,902 INFO L93 Difference]: Finished difference Result 313 states and 380 transitions. [2020-07-21 01:07:23,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-21 01:07:23,903 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 154 [2020-07-21 01:07:23,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 01:07:23,919 INFO L225 Difference]: With dead ends: 313 [2020-07-21 01:07:23,920 INFO L226 Difference]: Without dead ends: 243 [2020-07-21 01:07:23,926 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 287 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=73, Invalid=683, Unknown=0, NotChecked=0, Total=756 [2020-07-21 01:07:23,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2020-07-21 01:07:24,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 209. [2020-07-21 01:07:24,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-07-21 01:07:24,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 249 transitions. [2020-07-21 01:07:24,022 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 249 transitions. Word has length 154 [2020-07-21 01:07:24,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 01:07:24,023 INFO L479 AbstractCegarLoop]: Abstraction has 209 states and 249 transitions. [2020-07-21 01:07:24,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-21 01:07:24,024 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 249 transitions. [2020-07-21 01:07:24,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-07-21 01:07:24,038 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 01:07:24,039 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-21 01:07:24,253 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:07:24,254 INFO L427 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 01:07:24,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 01:07:24,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1709746076, now seen corresponding path program 1 times [2020-07-21 01:07:24,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 01:07:24,257 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1922846247] [2020-07-21 01:07:24,258 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 01:07:27,355 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 4 partitions) issued 4 check-sat command(s) [2020-07-21 01:07:27,356 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 01:07:27,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 360 conjunts are in the unsatisfiable core [2020-07-21 01:07:27,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 01:07:27,424 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2020-07-21 01:07:27,425 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:07:27,434 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:07:27,434 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 01:07:27,435 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:7 [2020-07-21 01:07:27,501 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-21 01:07:27,501 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:07:27,519 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:07:27,520 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-21 01:07:27,520 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2020-07-21 01:07:27,688 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2020-07-21 01:07:27,690 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:07:27,702 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:07:27,704 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-21 01:07:27,705 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:3 [2020-07-21 01:07:27,777 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2020-07-21 01:07:27,779 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:07:27,794 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:07:27,796 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-21 01:07:27,797 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:3 [2020-07-21 01:07:28,071 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:07:28,072 INFO L384 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 15 treesize of output 19 [2020-07-21 01:07:28,074 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:07:28,080 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:07:28,081 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-21 01:07:28,082 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:3 [2020-07-21 01:07:28,457 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-21 01:07:28,458 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:07:28,470 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:07:28,473 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-21 01:07:28,474 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2020-07-21 01:07:29,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:07:29,506 WARN L193 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2020-07-21 01:07:29,507 INFO L350 Elim1Store]: treesize reduction 19, result has 85.4 percent of original size [2020-07-21 01:07:29,507 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 48 treesize of output 140 [2020-07-21 01:07:29,510 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 01:07:29,511 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 01:07:29,512 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:07:29,514 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:07:29,742 WARN L193 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2020-07-21 01:07:29,744 INFO L624 ElimStorePlain]: treesize reduction 63, result has 51.2 percent of original size [2020-07-21 01:07:29,747 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-21 01:07:29,748 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:78, output treesize:66 [2020-07-21 01:07:29,939 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_1794|], 4=[|v_#memory_$Pointer$.offset_1687|]} [2020-07-21 01:07:29,980 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:07:29,982 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 39 [2020-07-21 01:07:29,983 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:07:30,109 WARN L193 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2020-07-21 01:07:30,112 INFO L624 ElimStorePlain]: treesize reduction 16, result has 87.0 percent of original size [2020-07-21 01:07:30,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:07:30,195 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:07:30,198 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 73 [2020-07-21 01:07:30,200 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 01:07:30,334 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2020-07-21 01:07:30,336 INFO L624 ElimStorePlain]: treesize reduction 48, result has 64.2 percent of original size [2020-07-21 01:07:30,340 INFO L544 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-21 01:07:30,341 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:112, output treesize:88 [2020-07-21 01:07:31,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:07:31,046 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:07:31,049 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 29 [2020-07-21 01:07:31,050 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:07:31,112 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:07:31,116 INFO L440 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_BEFORE_CALL_13|], 4=[|v_#memory_$Pointer$.offset_BEFORE_CALL_7|]} [2020-07-21 01:07:31,131 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2020-07-21 01:07:31,132 INFO L544 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-21 01:07:31,189 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:07:31,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:07:31,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:07:31,218 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:07:31,219 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 22 [2020-07-21 01:07:31,220 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-21 01:07:31,252 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:07:31,254 INFO L544 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 01:07:31,254 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:100, output treesize:10 [2020-07-21 01:07:36,715 WARN L193 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 40 [2020-07-21 01:07:36,728 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2020-07-21 01:07:36,729 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:07:36,740 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:07:36,741 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-21 01:07:36,742 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2020-07-21 01:07:38,658 WARN L193 SmtUtils]: Spent 866.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2020-07-21 01:07:38,676 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-21 01:07:38,677 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:07:38,695 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:07:38,697 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-21 01:07:38,697 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:53, output treesize:49 [2020-07-21 01:07:39,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:07:39,336 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2020-07-21 01:07:39,337 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:07:39,354 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:07:39,362 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2020-07-21 01:07:39,364 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 01:07:39,375 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:07:39,377 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 01:07:39,378 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:31, output treesize:10 [2020-07-21 01:07:42,086 WARN L193 SmtUtils]: Spent 1.82 s on a formula simplification that was a NOOP. DAG size: 36 [2020-07-21 01:07:46,435 WARN L193 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 37 [2020-07-21 01:08:32,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:08:32,080 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 763 treesize of output 751 [2020-07-21 01:08:32,081 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:08:32,148 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:08:32,153 INFO L544 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2020-07-21 01:08:32,154 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:807, output treesize:772 [2020-07-21 01:08:44,514 WARN L193 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2020-07-21 01:08:44,680 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:08:44,682 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 39 [2020-07-21 01:08:44,683 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:08:45,848 WARN L193 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 88 DAG size of output: 84 [2020-07-21 01:08:45,850 INFO L624 ElimStorePlain]: treesize reduction 16, result has 100.0 percent of original size [2020-07-21 01:08:45,869 INFO L544 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2020-07-21 01:08:45,869 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 11 variables, input treesize:47601, output treesize:47581 [2020-07-21 01:09:53,898 WARN L193 SmtUtils]: Spent 30.09 s on a formula simplification that was a NOOP. DAG size: 78 [2020-07-21 01:11:39,694 WARN L193 SmtUtils]: Spent 22.87 s on a formula simplification that was a NOOP. DAG size: 78 [2020-07-21 01:11:39,816 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:11:39,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:11:40,074 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:11:40,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:11:40,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:11:40,406 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:11:40,462 INFO L244 Elim1Store]: Index analysis took 505 ms [2020-07-21 01:11:40,537 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:11:40,538 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 8 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 14 case distinctions, treesize of input 52 treesize of output 158 [2020-07-21 01:11:40,540 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-21 01:11:40,540 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 01:11:40,541 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 01:11:40,541 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 01:11:40,541 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:11:40,542 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:11:41,385 WARN L193 SmtUtils]: Spent 842.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2020-07-21 01:11:41,386 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:11:41,389 INFO L440 ElimStorePlain]: Different costs {6=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_104|], 77=[|v_#memory_$Pointer$.base_BEFORE_CALL_34|]} [2020-07-21 01:11:41,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:11:41,440 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:11:41,467 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:11:41,468 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 22 [2020-07-21 01:11:41,469 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 01:11:42,214 WARN L193 SmtUtils]: Spent 744.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2020-07-21 01:11:42,214 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:11:42,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:11:42,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:11:42,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:11:42,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:11:42,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:11:42,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:11:42,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:11:42,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:11:42,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:11:42,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:11:42,749 WARN L193 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 91 [2020-07-21 01:11:42,750 INFO L350 Elim1Store]: treesize reduction 240, result has 60.1 percent of original size [2020-07-21 01:11:42,751 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 18 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 8803 treesize of output 426 [2020-07-21 01:11:42,758 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[17, 7, 2, 1] term [2020-07-21 01:11:42,759 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 17 disjuncts [2020-07-21 01:11:42,761 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-21 01:11:43,269 WARN L193 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 98 [2020-07-21 01:11:43,270 INFO L624 ElimStorePlain]: treesize reduction 391, result has 34.8 percent of original size [2020-07-21 01:11:43,275 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:11:43,277 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:11:43,279 INFO L544 ElimStorePlain]: Start of recursive call 1: 13 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-07-21 01:11:43,279 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 16 variables, input treesize:47674, output treesize:194 [2020-07-21 01:11:43,282 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:11:43,283 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:11:44,033 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:11:44,035 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:11:44,707 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:11:44,707 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:11:45,256 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:11:45,257 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:11:45,294 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:11:45,297 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:11:45,316 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-21 01:11:45,317 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:11:45,327 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-21 01:11:45,328 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 01:11:45,340 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-21 01:11:45,341 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-21 01:11:45,351 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-21 01:11:45,352 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-21 01:11:45,740 WARN L193 SmtUtils]: Spent 386.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2020-07-21 01:11:45,741 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:11:45,749 INFO L544 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 18 dim-0 vars, and 4 xjuncts. [2020-07-21 01:11:45,750 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:723, output treesize:679 [2020-07-21 01:11:46,714 WARN L193 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 89 [2020-07-21 01:11:47,532 WARN L193 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2020-07-21 01:11:51,769 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 2, 1] term [2020-07-21 01:11:51,770 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 01:11:51,782 INFO L440 ElimStorePlain]: Different costs {14=[|#memory_$Pointer$.base|], 26=[v_prenex_21]} [2020-07-21 01:11:51,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:11:51,845 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:11:51,846 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 9 new quantified variables, introduced 14 case distinctions, treesize of input 158 treesize of output 163 [2020-07-21 01:11:51,849 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-21 01:11:51,850 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-21 01:11:51,851 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-21 01:11:51,852 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-21 01:11:51,852 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-21 01:11:51,853 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 01:11:51,855 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-21 01:11:51,856 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-21 01:11:51,857 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 01:11:51,857 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 01:11:51,858 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 01:11:51,860 INFO L501 QuantifierPusher]: Distributing 5 conjuncts over 6 disjuncts [2020-07-21 01:11:51,861 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-21 01:11:51,861 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 01:11:51,862 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-21 01:11:51,863 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-21 01:11:51,863 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-21 01:11:51,864 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-21 01:11:51,865 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-21 01:11:51,865 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-21 01:11:51,866 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-21 01:11:51,867 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-21 01:11:51,868 INFO L501 QuantifierPusher]: Distributing 5 conjuncts over 6 disjuncts [2020-07-21 01:11:51,868 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-21 01:11:51,869 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-21 01:11:51,869 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-21 01:11:51,870 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-21 01:11:51,870 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 01:11:51,871 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-21 01:11:51,871 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-21 01:11:51,872 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-21 01:11:51,873 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 01:11:51,873 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-21 01:11:51,874 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-21 01:11:51,875 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-21 01:11:51,875 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-21 01:11:51,876 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 01:11:51,877 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:11:51,946 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:11:51,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 01:11:52,161 WARN L193 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2020-07-21 01:11:52,162 INFO L350 Elim1Store]: treesize reduction 24, result has 86.1 percent of original size [2020-07-21 01:11:52,163 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 2 disjoint index pairs (out of 21 index pairs), introduced 10 new quantified variables, introduced 20 case distinctions, treesize of input 169 treesize of output 212 [2020-07-21 01:11:52,166 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 12 disjuncts [2020-07-21 01:11:52,167 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 11 disjuncts [2020-07-21 01:11:52,167 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-21 01:11:52,168 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-21 01:11:52,169 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-21 01:11:52,169 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-21 01:11:52,170 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-21 01:11:52,170 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-21 01:11:52,171 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-21 01:11:52,175 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-21 01:11:52,176 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-21 01:11:52,177 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-21 01:11:52,177 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-21 01:11:52,179 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-21 01:11:52,180 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-21 01:11:52,181 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-21 01:11:52,182 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-21 01:11:52,182 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-21 01:11:52,183 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-21 01:11:52,185 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-21 01:11:52,186 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 10 disjuncts [2020-07-21 01:11:52,187 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 10 disjuncts [2020-07-21 01:11:52,187 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-21 01:11:52,188 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-21 01:11:52,189 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-21 01:11:52,190 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-21 01:11:52,192 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-21 01:11:52,193 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 9 disjuncts [2020-07-21 01:11:52,194 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 8 disjuncts [2020-07-21 01:11:52,195 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-21 01:11:52,195 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-21 01:11:52,196 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-21 01:11:52,198 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 9 disjuncts [2020-07-21 01:11:52,199 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-21 01:11:52,200 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 7 disjuncts [2020-07-21 01:11:52,201 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-21 01:11:52,203 INFO L501 QuantifierPusher]: Distributing 8 conjuncts over 4 disjuncts [2020-07-21 01:11:52,204 INFO L501 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-07-21 01:11:52,205 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-21 01:11:52,206 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-21 01:11:52,207 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 01:11:52,207 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 01:11:52,208 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-21 01:11:52,209 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-21 01:11:52,211 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-21 01:11:52,212 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-21 01:11:52,213 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-21 01:11:52,214 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 01:11:52,214 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 01:11:52,215 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-21 01:11:52,216 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 8 disjuncts [2020-07-21 01:11:52,217 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-21 01:11:52,217 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-07-21 01:11:52,218 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-21 01:11:52,219 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-21 01:11:52,220 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-21 01:11:52,221 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-07-21 01:11:52,221 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-21 01:11:52,222 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-21 01:11:52,223 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 01:11:52,224 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-21 01:11:52,225 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-21 01:11:52,225 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 01:11:52,226 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 01:11:52,227 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-21 01:11:52,228 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-21 01:11:52,229 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-21 01:11:52,229 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 01:11:52,230 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 01:11:52,231 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-21 01:11:52,232 INFO L501 QuantifierPusher]: Distributing 6 conjuncts over 4 disjuncts [2020-07-21 01:11:52,233 INFO L501 QuantifierPusher]: Distributing 4 conjuncts over 4 disjuncts [2020-07-21 01:11:52,233 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-21 01:11:52,234 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-21 01:11:52,235 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 01:11:52,236 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 01:11:52,237 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-21 01:11:52,237 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-21 01:11:52,239 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-21 01:11:52,240 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-21 01:11:52,241 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 4 disjuncts [2020-07-21 01:11:52,242 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 01:11:52,243 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 01:11:52,243 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-21 01:11:52,245 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-07-21 01:11:52,245 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-21 01:11:52,246 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-21 01:11:52,247 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 01:11:52,248 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 01:11:52,249 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-21 01:11:52,250 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 6 disjuncts [2020-07-21 01:11:52,251 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-21 01:11:52,252 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 01:11:52,253 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-07-21 01:11:52,254 INFO L501 QuantifierPusher]: Distributing 3 conjuncts over 5 disjuncts [2020-07-21 01:11:52,258 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 01:11:52,409 WARN L193 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 28 [2020-07-21 01:11:52,410 INFO L624 ElimStorePlain]: treesize reduction 2256, result has 2.0 percent of original size [2020-07-21 01:11:52,411 INFO L544 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 01:11:52,411 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 9 variables, input treesize:338, output treesize:4 [2020-07-21 01:11:53,177 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 65 proven. 106 refuted. 4 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-21 01:11:53,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 01:11:55,338 WARN L193 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-07-21 01:11:57,223 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-07-21 01:12:01,408 WARN L193 SmtUtils]: Spent 3.64 s on a formula simplification that was a NOOP. DAG size: 148 [2020-07-21 01:12:02,072 WARN L193 SmtUtils]: Spent 659.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-07-21 01:12:03,207 WARN L193 SmtUtils]: Spent 1.13 s on a formula simplification that was a NOOP. DAG size: 118 [2020-07-21 01:12:04,271 WARN L193 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 112 [2020-07-21 01:12:05,482 WARN L193 SmtUtils]: Spent 1.21 s on a formula simplification that was a NOOP. DAG size: 116 [2020-07-21 01:12:05,979 WARN L193 SmtUtils]: Spent 494.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-07-21 01:12:07,095 WARN L193 SmtUtils]: Spent 1.11 s on a formula simplification that was a NOOP. DAG size: 113 [2020-07-21 01:12:07,704 WARN L193 SmtUtils]: Spent 607.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-07-21 01:12:13,193 WARN L193 SmtUtils]: Spent 5.49 s on a formula simplification that was a NOOP. DAG size: 171 [2020-07-21 01:12:14,806 WARN L193 SmtUtils]: Spent 1.61 s on a formula simplification that was a NOOP. DAG size: 130 [2020-07-21 01:12:16,501 WARN L193 SmtUtils]: Spent 1.69 s on a formula simplification that was a NOOP. DAG size: 134 [2020-07-21 01:12:18,224 WARN L193 SmtUtils]: Spent 1.72 s on a formula simplification that was a NOOP. DAG size: 134 [2020-07-21 01:12:20,312 WARN L193 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 138 [2020-07-21 01:12:22,017 WARN L193 SmtUtils]: Spent 1.70 s on a formula simplification that was a NOOP. DAG size: 130 [2020-07-21 01:12:23,721 WARN L193 SmtUtils]: Spent 1.70 s on a formula simplification that was a NOOP. DAG size: 134 [2020-07-21 01:12:25,226 WARN L193 SmtUtils]: Spent 1.50 s on a formula simplification that was a NOOP. DAG size: 134 [2020-07-21 01:12:26,721 WARN L193 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-07-21 01:12:28,174 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-07-21 01:12:28,831 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-07-21 01:12:33,144 WARN L193 SmtUtils]: Spent 3.78 s on a formula simplification that was a NOOP. DAG size: 148 [2020-07-21 01:12:34,036 WARN L193 SmtUtils]: Spent 887.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-07-21 01:12:35,420 WARN L193 SmtUtils]: Spent 1.38 s on a formula simplification that was a NOOP. DAG size: 118 [2020-07-21 01:12:37,082 WARN L193 SmtUtils]: Spent 1.66 s on a formula simplification that was a NOOP. DAG size: 112 [2020-07-21 01:12:38,058 WARN L193 SmtUtils]: Spent 973.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2020-07-21 01:12:38,890 WARN L193 SmtUtils]: Spent 828.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-07-21 01:12:39,986 WARN L193 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 113 [2020-07-21 01:12:40,710 WARN L193 SmtUtils]: Spent 722.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-07-21 01:12:45,788 WARN L193 SmtUtils]: Spent 5.08 s on a formula simplification that was a NOOP. DAG size: 171 [2020-07-21 01:12:47,748 WARN L193 SmtUtils]: Spent 1.96 s on a formula simplification that was a NOOP. DAG size: 130 [2020-07-21 01:12:49,869 WARN L193 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 134 [2020-07-21 01:12:52,112 WARN L193 SmtUtils]: Spent 2.24 s on a formula simplification that was a NOOP. DAG size: 134 [2020-07-21 01:12:53,637 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2020-07-21 01:12:54,382 WARN L193 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2020-07-21 01:12:54,585 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-07-21 01:12:54,928 WARN L193 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2020-07-21 01:13:00,399 WARN L193 SmtUtils]: Spent 5.39 s on a formula simplification that was a NOOP. DAG size: 148 [2020-07-21 01:13:01,135 WARN L193 SmtUtils]: Spent 731.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-07-21 01:13:02,542 WARN L193 SmtUtils]: Spent 1.41 s on a formula simplification that was a NOOP. DAG size: 118 [2020-07-21 01:13:03,765 WARN L193 SmtUtils]: Spent 1.22 s on a formula simplification that was a NOOP. DAG size: 112 [2020-07-21 01:13:05,029 WARN L193 SmtUtils]: Spent 1.26 s on a formula simplification that was a NOOP. DAG size: 116 [2020-07-21 01:13:05,531 WARN L193 SmtUtils]: Spent 499.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2020-07-21 01:13:06,545 WARN L193 SmtUtils]: Spent 1.01 s on a formula simplification that was a NOOP. DAG size: 113 [2020-07-21 01:13:07,261 WARN L193 SmtUtils]: Spent 714.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-07-21 01:13:07,290 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 01:13:07,292 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 01:13:07,656 WARN L193 SmtUtils]: Spent 363.00 ms on a formula simplification that was a NOOP. DAG size: 80 [2020-07-21 01:13:07,658 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 01:13:07,664 INFO L544 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 1 xjuncts. [2020-07-21 01:13:07,664 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 10 variables, input treesize:47825, output treesize:47585 [2020-07-21 01:13:32,654 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_dll_insert_slave_~item~0.offset_365 Int) (|v_dll_insert_master_#t~ret19.base_225| Int) (|v_dll_create_generic_~#dll~0.offset_254| Int) (v_dll_insert_slave_~next~0.base_370 Int) (v_dll_insert_slave_~item~0.base_542 Int) (v_dll_insert_slave_~item~0.base_543 Int) (v_dll_insert_master_~item~1.base_150 Int) (|v_##fun~$Pointer$~TO~VOID_#in~9.base_342| Int) (v_dll_insert_master_~next~3.offset_109 Int)) (let ((.cse0 (store (store |c_#valid| v_dll_insert_master_~item~1.base_150 1) |v_##fun~$Pointer$~TO~VOID_#in~9.base_342| 1))) (or (< 0 (select .cse0 v_dll_insert_slave_~item~0.base_542)) (<= |c_#StackHeapBarrier| v_dll_insert_slave_~item~0.base_543) (<= |c_#StackHeapBarrier| v_dll_insert_slave_~item~0.base_542) (<= |c_#StackHeapBarrier| v_dll_insert_master_~item~1.base_150) (<= |v_##fun~$Pointer$~TO~VOID_#in~9.base_342| |c_#StackHeapBarrier|) (not (= 0 (select (store .cse0 v_dll_insert_slave_~item~0.base_542 1) v_dll_insert_slave_~item~0.base_543))) (not (= 0 (select (select (let ((.cse1 (let ((.cse2 (let ((.cse3 (let ((.cse6 (let ((.cse8 (let ((.cse9 (let ((.cse12 (store (store (store (select |c_#memory_$Pointer$.base| v_dll_insert_master_~item~1.base_150) 0 0) 4 0) 8 0))) (let ((.cse11 (select (select (store |c_#memory_$Pointer$.base| v_dll_insert_master_~item~1.base_150 .cse12) |c_dll_create_generic_~#dll~0.base|) |c_dll_create_generic_~#dll~0.offset|))) (let ((.cse10 (store |c_#memory_$Pointer$.base| v_dll_insert_master_~item~1.base_150 (store .cse12 0 .cse11)))) (store .cse10 .cse11 (store (select .cse10 .cse11) (+ v_dll_insert_master_~next~3.offset_109 4) v_dll_insert_master_~item~1.base_150))))))) (store .cse9 v_dll_insert_slave_~item~0.base_542 (store (select .cse9 v_dll_insert_slave_~item~0.base_542) 0 v_dll_insert_slave_~next~0.base_370))))) (store .cse8 |v_##fun~$Pointer$~TO~VOID_#in~9.base_342| (store (select .cse8 |v_##fun~$Pointer$~TO~VOID_#in~9.base_342|) |v_dll_create_generic_~#dll~0.offset_254| v_dll_insert_slave_~item~0.base_542))))) (let ((.cse7 (store (select .cse6 v_dll_insert_slave_~item~0.base_543) 0 0))) (let ((.cse5 (select (select (store .cse6 v_dll_insert_slave_~item~0.base_543 .cse7) |v_##fun~$Pointer$~TO~VOID_#in~9.base_342|) |v_dll_create_generic_~#dll~0.offset_254|))) (let ((.cse4 (store .cse6 v_dll_insert_slave_~item~0.base_543 (store .cse7 v_dll_insert_slave_~item~0.offset_365 .cse5)))) (store .cse4 .cse5 (store (select .cse4 .cse5) 4 v_dll_insert_slave_~item~0.base_543)))))))) (store .cse3 |v_##fun~$Pointer$~TO~VOID_#in~9.base_342| (store (select .cse3 |v_##fun~$Pointer$~TO~VOID_#in~9.base_342|) |v_dll_create_generic_~#dll~0.offset_254| v_dll_insert_slave_~item~0.base_543))))) (store .cse2 v_dll_insert_master_~item~1.base_150 (store (select .cse2 v_dll_insert_master_~item~1.base_150) 8 |v_dll_insert_master_#t~ret19.base_225|))))) (store .cse1 |c_dll_create_generic_~#dll~0.base| (store (select .cse1 |c_dll_create_generic_~#dll~0.base|) |c_dll_create_generic_~#dll~0.offset| v_dll_insert_master_~item~1.base_150))) v_dll_insert_master_~item~1.base_150) 0))) (not (= (select |c_#valid| v_dll_insert_master_~item~1.base_150) 0))))) is different from false [2020-07-21 01:13:32,673 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1922846247] [2020-07-21 01:13:32,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-21 01:13:32,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2020-07-21 01:13:32,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255518793] [2020-07-21 01:13:32,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2020-07-21 01:13:32,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 01:13:32,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2020-07-21 01:13:32,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=6867, Unknown=41, NotChecked=166, Total=7310 [2020-07-21 01:13:32,680 INFO L87 Difference]: Start difference. First operand 209 states and 249 transitions. Second operand 75 states. [2020-07-21 01:14:07,624 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2020-07-21 01:15:09,490 WARN L193 SmtUtils]: Spent 4.33 s on a formula simplification. DAG size of input: 45 DAG size of output: 44 [2020-07-21 01:15:23,620 WARN L193 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2020-07-21 01:15:53,509 WARN L193 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 47 DAG size of output: 44