/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 DAGSIZE --traceabstraction.assert.codeblocks.term.scoring.heuristic.partitioning.strategy FIXED_NUM_PARTITIONS --traceabstraction.assert.codeblocks.term.scoring.heuristic.number.of.partitions 2 -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 19:53:52,557 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-21 19:53:52,560 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-21 19:53:52,576 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-21 19:53:52,577 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-21 19:53:52,578 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-21 19:53:52,581 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-21 19:53:52,586 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-21 19:53:52,589 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-21 19:53:52,590 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-21 19:53:52,598 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-21 19:53:52,599 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-21 19:53:52,600 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-21 19:53:52,603 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-21 19:53:52,605 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-21 19:53:52,609 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-21 19:53:52,613 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-21 19:53:52,618 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-21 19:53:52,621 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-21 19:53:52,629 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-21 19:53:52,636 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-21 19:53:52,640 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-21 19:53:52,643 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-21 19:53:52,643 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-21 19:53:52,649 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-21 19:53:52,649 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-21 19:53:52,649 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-21 19:53:52,654 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-21 19:53:52,655 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-21 19:53:52,658 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-21 19:53:52,660 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-21 19:53:52,662 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-21 19:53:52,663 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-21 19:53:52,665 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-21 19:53:52,670 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-21 19:53:52,670 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-21 19:53:52,671 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-21 19:53:52,672 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-21 19:53:52,672 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-21 19:53:52,673 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-21 19:53:52,675 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-21 19:53:52,677 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 19:53:52,724 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-21 19:53:52,724 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-21 19:53:52,726 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-21 19:53:52,726 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-21 19:53:52,727 INFO L138 SettingsManager]: * Use SBE=true [2020-07-21 19:53:52,727 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-21 19:53:52,729 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-21 19:53:52,730 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-21 19:53:52,730 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-21 19:53:52,730 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-21 19:53:52,731 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-21 19:53:52,731 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-21 19:53:52,731 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-21 19:53:52,731 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-21 19:53:52,732 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-21 19:53:52,732 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-21 19:53:52,732 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-21 19:53:52,736 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-21 19:53:52,736 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-21 19:53:52,736 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-21 19:53:52,736 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-21 19:53:52,737 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-21 19:53:52,737 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-21 19:53:52,738 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-21 19:53:52,739 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-21 19:53:52,739 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-21 19:53:52,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:53:52,739 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-21 19:53:52,740 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-21 19:53:52,740 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 -> DAGSIZE 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 -> 2 [2020-07-21 19:53:53,088 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-21 19:53:53,116 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-21 19:53:53,122 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-21 19:53:53,124 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-21 19:53:53,125 INFO L275 PluginConnector]: CDTParser initialized [2020-07-21 19:53:53,128 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 19:53:53,248 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd7c6e65c/e3152594c3c446b7b799069ac23e1985/FLAG8eba54ce5 [2020-07-21 19:53:54,052 INFO L306 CDTParser]: Found 1 translation units. [2020-07-21 19:53:54,054 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-manipulation/dll_of_dll-2.i [2020-07-21 19:53:54,074 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd7c6e65c/e3152594c3c446b7b799069ac23e1985/FLAG8eba54ce5 [2020-07-21 19:53:54,195 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd7c6e65c/e3152594c3c446b7b799069ac23e1985 [2020-07-21 19:53:54,210 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-21 19:53:54,214 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-21 19:53:54,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-21 19:53:54,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-21 19:53:54,221 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-21 19:53:54,223 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 07:53:54" (1/1) ... [2020-07-21 19:53:54,227 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6993c84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:53:54, skipping insertion in model container [2020-07-21 19:53:54,227 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 07:53:54" (1/1) ... [2020-07-21 19:53:54,238 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-21 19:53:54,313 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-21 19:53:54,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 19:53:54,960 INFO L203 MainTranslator]: Completed pre-run [2020-07-21 19:53:55,031 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-21 19:53:55,107 INFO L208 MainTranslator]: Completed translation [2020-07-21 19:53:55,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:53:55 WrapperNode [2020-07-21 19:53:55,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-21 19:53:55,110 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-21 19:53:55,110 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-21 19:53:55,111 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-21 19:53:55,127 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:53:55" (1/1) ... [2020-07-21 19:53:55,130 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:53:55" (1/1) ... [2020-07-21 19:53:55,161 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:53:55" (1/1) ... [2020-07-21 19:53:55,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:53:55" (1/1) ... [2020-07-21 19:53:55,195 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:53:55" (1/1) ... [2020-07-21 19:53:55,222 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:53:55" (1/1) ... [2020-07-21 19:53:55,238 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:53:55" (1/1) ... [2020-07-21 19:53:55,249 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-21 19:53:55,250 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-21 19:53:55,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-21 19:53:55,251 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-21 19:53:55,253 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:53:55" (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 19:53:55,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-21 19:53:55,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-21 19:53:55,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2020-07-21 19:53:55,337 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-07-21 19:53:55,338 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-07-21 19:53:55,339 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2020-07-21 19:53:55,340 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_or_die_slave [2020-07-21 19:53:55,341 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_or_die_master [2020-07-21 19:53:55,341 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_slave [2020-07-21 19:53:55,341 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_generic [2020-07-21 19:53:55,342 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_slave [2020-07-21 19:53:55,343 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy_slave [2020-07-21 19:53:55,343 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy_nested_lists [2020-07-21 19:53:55,343 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_reinit_nested_lists [2020-07-21 19:53:55,343 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_destroy_master [2020-07-21 19:53:55,345 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_insert_master [2020-07-21 19:53:55,345 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create_master [2020-07-21 19:53:55,346 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_base [2020-07-21 19:53:55,346 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_full [2020-07-21 19:53:55,347 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_dangling [2020-07-21 19:53:55,348 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_init [2020-07-21 19:53:55,348 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-21 19:53:55,349 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-21 19:53:55,349 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-07-21 19:53:55,352 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-07-21 19:53:55,353 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-07-21 19:53:55,353 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-07-21 19:53:55,353 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-07-21 19:53:55,354 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-07-21 19:53:55,354 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-07-21 19:53:55,354 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-07-21 19:53:55,355 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-07-21 19:53:55,355 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-07-21 19:53:55,355 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-07-21 19:53:55,355 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-07-21 19:53:55,355 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-07-21 19:53:55,355 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-07-21 19:53:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-07-21 19:53:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-07-21 19:53:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-07-21 19:53:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-07-21 19:53:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-07-21 19:53:55,356 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-07-21 19:53:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-07-21 19:53:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-07-21 19:53:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-07-21 19:53:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-07-21 19:53:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-07-21 19:53:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-07-21 19:53:55,357 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-07-21 19:53:55,358 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-07-21 19:53:55,359 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-07-21 19:53:55,360 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-07-21 19:53:55,360 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-07-21 19:53:55,360 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-07-21 19:53:55,360 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-07-21 19:53:55,361 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-07-21 19:53:55,361 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-07-21 19:53:55,362 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-07-21 19:53:55,362 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-07-21 19:53:55,362 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-07-21 19:53:55,362 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-07-21 19:53:55,362 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-07-21 19:53:55,362 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-07-21 19:53:55,362 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-07-21 19:53:55,363 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-07-21 19:53:55,363 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-07-21 19:53:55,363 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-07-21 19:53:55,363 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-07-21 19:53:55,363 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-07-21 19:53:55,363 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-07-21 19:53:55,363 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-07-21 19:53:55,364 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-07-21 19:53:55,364 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-07-21 19:53:55,364 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-07-21 19:53:55,364 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-21 19:53:55,364 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-07-21 19:53:55,365 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-07-21 19:53:55,365 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-07-21 19:53:55,365 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2020-07-21 19:53:55,365 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-07-21 19:53:55,365 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-07-21 19:53:55,365 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-07-21 19:53:55,366 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-07-21 19:53:55,366 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-21 19:53:55,366 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-07-21 19:53:55,366 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-07-21 19:53:55,366 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-07-21 19:53:55,366 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-07-21 19:53:55,367 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-07-21 19:53:55,367 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-07-21 19:53:55,367 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-07-21 19:53:55,367 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-07-21 19:53:55,367 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-07-21 19:53:55,367 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-07-21 19:53:55,367 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-07-21 19:53:55,367 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-07-21 19:53:55,368 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-07-21 19:53:55,368 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-07-21 19:53:55,368 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-07-21 19:53:55,368 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-07-21 19:53:55,368 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-07-21 19:53:55,368 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-07-21 19:53:55,368 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-07-21 19:53:55,368 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-07-21 19:53:55,368 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-07-21 19:53:55,368 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-07-21 19:53:55,369 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-07-21 19:53:55,369 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-07-21 19:53:55,369 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-07-21 19:53:55,369 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-07-21 19:53:55,369 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-07-21 19:53:55,369 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-07-21 19:53:55,369 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-07-21 19:53:55,369 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-07-21 19:53:55,369 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-07-21 19:53:55,370 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-07-21 19:53:55,370 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-07-21 19:53:55,370 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-07-21 19:53:55,370 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-07-21 19:53:55,370 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-07-21 19:53:55,370 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-07-21 19:53:55,371 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-07-21 19:53:55,371 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-07-21 19:53:55,371 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-07-21 19:53:55,371 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-07-21 19:53:55,371 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-07-21 19:53:55,371 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-07-21 19:53:55,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-21 19:53:55,372 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2020-07-21 19:53:55,372 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_or_die_slave [2020-07-21 19:53:55,372 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-21 19:53:55,373 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-21 19:53:55,373 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_or_die_master [2020-07-21 19:53:55,373 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_slave [2020-07-21 19:53:55,373 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-21 19:53:55,373 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_generic [2020-07-21 19:53:55,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-21 19:53:55,374 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2020-07-21 19:53:55,374 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2020-07-21 19:53:55,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-21 19:53:55,374 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_slave [2020-07-21 19:53:55,374 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy_slave [2020-07-21 19:53:55,374 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy_nested_lists [2020-07-21 19:53:55,375 INFO L130 BoogieDeclarations]: Found specification of procedure dll_reinit_nested_lists [2020-07-21 19:53:55,375 INFO L130 BoogieDeclarations]: Found specification of procedure dll_destroy_master [2020-07-21 19:53:55,375 INFO L130 BoogieDeclarations]: Found specification of procedure dll_insert_master [2020-07-21 19:53:55,375 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create_master [2020-07-21 19:53:55,375 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_base [2020-07-21 19:53:55,375 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_full [2020-07-21 19:53:55,376 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_dangling [2020-07-21 19:53:55,376 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_init [2020-07-21 19:53:55,376 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-21 19:53:55,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-21 19:53:55,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-21 19:53:56,621 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-21 19:53:56,622 INFO L295 CfgBuilder]: Removed 38 assume(true) statements. [2020-07-21 19:53:56,632 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 07:53:56 BoogieIcfgContainer [2020-07-21 19:53:56,632 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-21 19:53:56,634 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-21 19:53:56,634 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-21 19:53:56,639 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-21 19:53:56,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 07:53:54" (1/3) ... [2020-07-21 19:53:56,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb9b013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 07:53:56, skipping insertion in model container [2020-07-21 19:53:56,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 07:53:55" (2/3) ... [2020-07-21 19:53:56,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cb9b013 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 07:53:56, skipping insertion in model container [2020-07-21 19:53:56,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 07:53:56" (3/3) ... [2020-07-21 19:53:56,644 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_of_dll-2.i [2020-07-21 19:53:56,659 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBPonlyIfFpWasNotPerfect Determinization: PREDICATE_ABSTRACTION [2020-07-21 19:53:56,672 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-21 19:53:56,692 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-21 19:53:56,728 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-21 19:53:56,728 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-21 19:53:56,728 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBPonlyIfFpWasNotPerfect [2020-07-21 19:53:56,729 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-21 19:53:56,729 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-21 19:53:56,729 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-21 19:53:56,729 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-21 19:53:56,729 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-21 19:53:56,762 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states. [2020-07-21 19:53:56,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-07-21 19:53:56,774 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:53:56,776 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 19:53:56,777 INFO L427 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:53:56,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:53:56,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1405399524, now seen corresponding path program 1 times [2020-07-21 19:53:56,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:53:56,796 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1676487271] [2020-07-21 19:53:56,797 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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 19:53:57,028 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 1 check-sat command(s) [2020-07-21 19:53:57,028 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:53:57,033 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-21 19:53:57,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:53:57,160 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 19:53:57,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:53:57,496 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 19:53:57,498 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1676487271] [2020-07-21 19:53:57,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 19:53:57,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-21 19:53:57,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947044255] [2020-07-21 19:53:57,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-21 19:53:57,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:53:57,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-21 19:53:57,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-21 19:53:57,542 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 6 states. [2020-07-21 19:53:57,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:53:57,789 INFO L93 Difference]: Finished difference Result 342 states and 541 transitions. [2020-07-21 19:53:57,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-21 19:53:57,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2020-07-21 19:53:57,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:53:57,814 INFO L225 Difference]: With dead ends: 342 [2020-07-21 19:53:57,815 INFO L226 Difference]: Without dead ends: 168 [2020-07-21 19:53:57,824 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 111 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-07-21 19:53:57,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2020-07-21 19:53:57,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2020-07-21 19:53:57,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2020-07-21 19:53:57,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 199 transitions. [2020-07-21 19:53:57,942 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 199 transitions. Word has length 59 [2020-07-21 19:53:57,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:53:57,943 INFO L479 AbstractCegarLoop]: Abstraction has 168 states and 199 transitions. [2020-07-21 19:53:57,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-21 19:53:57,943 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 199 transitions. [2020-07-21 19:53:57,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2020-07-21 19:53:57,949 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:53:57,949 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 19:53:58,166 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:53:58,167 INFO L427 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:53:58,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:53:58,169 INFO L82 PathProgramCache]: Analyzing trace with hash 586330229, now seen corresponding path program 1 times [2020-07-21 19:53:58,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:53:58,170 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [840412993] [2020-07-21 19:53:58,170 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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 19:54:04,327 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:54:04,328 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:54:04,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 46 conjunts are in the unsatisfiable core [2020-07-21 19:54:04,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:54:04,541 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 19:54:04,542 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 19:54:04,543 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 19:54:04,584 INFO L624 ElimStorePlain]: treesize reduction 20, result has 60.8 percent of original size [2020-07-21 19:54:04,587 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 19:54:04,588 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:8 [2020-07-21 19:54:04,635 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 19:54:04,637 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 19:54:04,639 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 19:54:04,640 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 19:54:04,641 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:16, output treesize:4 [2020-07-21 19:54:04,879 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 19:54:04,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:54:05,954 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 19:54:05,955 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-21 19:54:06,016 INFO L624 ElimStorePlain]: treesize reduction 38, result has 47.2 percent of original size [2020-07-21 19:54:06,019 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 19:54:06,020 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:40, output treesize:7 [2020-07-21 19:54:06,031 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 19:54:06,034 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-21 19:54:06,180 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 25 [2020-07-21 19:54:06,183 INFO L624 ElimStorePlain]: treesize reduction 127, result has 21.6 percent of original size [2020-07-21 19:54:06,185 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 19:54:06,185 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:20 [2020-07-21 19:54:06,324 INFO L501 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-07-21 19:54:06,580 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 19:54:06,581 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [840412993] [2020-07-21 19:54:06,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-21 19:54:06,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2020-07-21 19:54:06,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181126778] [2020-07-21 19:54:06,586 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-21 19:54:06,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:54:06,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-21 19:54:06,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2020-07-21 19:54:06,589 INFO L87 Difference]: Start difference. First operand 168 states and 199 transitions. Second operand 20 states. [2020-07-21 19:54:07,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:54:07,534 INFO L93 Difference]: Finished difference Result 299 states and 361 transitions. [2020-07-21 19:54:07,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-21 19:54:07,535 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 154 [2020-07-21 19:54:07,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:54:07,543 INFO L225 Difference]: With dead ends: 299 [2020-07-21 19:54:07,545 INFO L226 Difference]: Without dead ends: 229 [2020-07-21 19:54:07,550 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 288 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=585, Unknown=0, NotChecked=0, Total=650 [2020-07-21 19:54:07,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2020-07-21 19:54:07,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 194. [2020-07-21 19:54:07,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-07-21 19:54:07,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 230 transitions. [2020-07-21 19:54:07,603 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 230 transitions. Word has length 154 [2020-07-21 19:54:07,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:54:07,604 INFO L479 AbstractCegarLoop]: Abstraction has 194 states and 230 transitions. [2020-07-21 19:54:07,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-21 19:54:07,604 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 230 transitions. [2020-07-21 19:54:07,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-07-21 19:54:07,607 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:54:07,607 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, 1, 1, 1] [2020-07-21 19:54:07,813 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:54:07,814 INFO L427 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:54:07,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:54:07,815 INFO L82 PathProgramCache]: Analyzing trace with hash -547179998, now seen corresponding path program 1 times [2020-07-21 19:54:07,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:54:07,816 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2124043057] [2020-07-21 19:54:07,816 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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 19:54:14,145 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:54:14,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:54:14,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 74 conjunts are in the unsatisfiable core [2020-07-21 19:54:14,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:54:14,291 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 19:54:14,291 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 19:54:14,296 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 19:54:14,297 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 19:54:14,298 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:8 [2020-07-21 19:54:14,375 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 19:54:14,376 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 19:54:14,381 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 19:54:14,382 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 19:54:14,383 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2020-07-21 19:54:15,914 WARN L860 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_slave_~ptr~0.offset Int) (alloc_or_die_slave_~ptr~0.base Int)) (and (<= (+ alloc_or_die_slave_~ptr~0.base 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| alloc_or_die_slave_~ptr~0.base (store (select |c_old(#memory_$Pointer$.base)| alloc_or_die_slave_~ptr~0.base) alloc_or_die_slave_~ptr~0.offset 0))))) is different from true [2020-07-21 19:54:24,362 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 22 [2020-07-21 19:54:26,378 WARN L860 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_slave_~ptr~0.offset Int) (alloc_or_die_slave_~ptr~0.base Int)) (and (<= (+ alloc_or_die_slave_~ptr~0.base 1) |c_#StackHeapBarrier|) (= (select (select (store |c_old(#memory_$Pointer$.base)| alloc_or_die_slave_~ptr~0.base (store (select |c_old(#memory_$Pointer$.base)| alloc_or_die_slave_~ptr~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 19:54:28,251 WARN L860 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_slave_~ptr~0.offset Int) (alloc_or_die_slave_~ptr~0.base Int)) (and (<= (+ alloc_or_die_slave_~ptr~0.base 1) |c_#StackHeapBarrier|) (= 0 (select (select (store |c_old(#memory_$Pointer$.base)| alloc_or_die_slave_~ptr~0.base (store (select |c_old(#memory_$Pointer$.base)| alloc_or_die_slave_~ptr~0.base) alloc_or_die_slave_~ptr~0.offset 0)) |c_dll_insert_slave_#in~dll.base|) |c_dll_insert_slave_#in~dll.offset|)))) is different from true [2020-07-21 19:54:30,268 WARN L860 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_slave_~ptr~0.offset Int) (alloc_or_die_slave_~ptr~0.base Int)) (and (<= (+ alloc_or_die_slave_~ptr~0.base 1) |c_#StackHeapBarrier|) (= 0 (select (select (store |c_old(#memory_$Pointer$.base)| alloc_or_die_slave_~ptr~0.base (store (select |c_old(#memory_$Pointer$.base)| alloc_or_die_slave_~ptr~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 19:54:30,284 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 19:54:30,285 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 19:54:30,287 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 19:54:30,287 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 19:54:30,287 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:32, output treesize:1 [2020-07-21 19:54:30,359 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 114 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 8 not checked. [2020-07-21 19:54:30,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:54:35,204 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_alloc_or_die_slave_~ptr~0.offset_291 Int) (v_alloc_or_die_slave_~ptr~0.base_289 Int)) (or (< |c_#StackHeapBarrier| (+ v_alloc_or_die_slave_~ptr~0.base_289 1)) (not (= 0 (select (select (store |c_#memory_$Pointer$.base| v_alloc_or_die_slave_~ptr~0.base_289 (store (select |c_#memory_$Pointer$.base| v_alloc_or_die_slave_~ptr~0.base_289) v_alloc_or_die_slave_~ptr~0.offset_291 0)) |c_dll_create_generic_~#dll~0.base|) |c_dll_create_generic_~#dll~0.offset|))))) is different from false [2020-07-21 19:54:35,207 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2124043057] [2020-07-21 19:54:35,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-21 19:54:35,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2020-07-21 19:54:35,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327961093] [2020-07-21 19:54:35,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2020-07-21 19:54:35,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:54:35,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2020-07-21 19:54:35,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=295, Unknown=9, NotChecked=190, Total=552 [2020-07-21 19:54:35,212 INFO L87 Difference]: Start difference. First operand 194 states and 230 transitions. Second operand 23 states. [2020-07-21 19:54:38,707 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 21 [2020-07-21 19:54:40,459 WARN L193 SmtUtils]: Spent 1.71 s on a formula simplification that was a NOOP. DAG size: 25 [2020-07-21 19:54:48,533 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2020-07-21 19:55:00,580 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 26 [2020-07-21 19:55:10,665 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 31 [2020-07-21 19:55:24,749 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2020-07-21 19:55:31,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:55:31,861 INFO L93 Difference]: Finished difference Result 390 states and 472 transitions. [2020-07-21 19:55:31,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-21 19:55:31,863 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 157 [2020-07-21 19:55:31,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:55:31,870 INFO L225 Difference]: With dead ends: 390 [2020-07-21 19:55:31,870 INFO L226 Difference]: Without dead ends: 207 [2020-07-21 19:55:31,878 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 59.3s TimeCoverageRelationStatistics Valid=132, Invalid=920, Unknown=24, NotChecked=330, Total=1406 [2020-07-21 19:55:31,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-07-21 19:55:31,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 202. [2020-07-21 19:55:31,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2020-07-21 19:55:31,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 239 transitions. [2020-07-21 19:55:31,937 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 239 transitions. Word has length 157 [2020-07-21 19:55:31,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:55:31,940 INFO L479 AbstractCegarLoop]: Abstraction has 202 states and 239 transitions. [2020-07-21 19:55:31,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 23 states. [2020-07-21 19:55:31,941 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 239 transitions. [2020-07-21 19:55:31,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-07-21 19:55:31,947 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:55:31,947 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, 2, 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 19:55:32,165 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:55:32,166 INFO L427 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:55:32,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:55:32,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1779393950, now seen corresponding path program 1 times [2020-07-21 19:55:32,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:55:32,168 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [909070648] [2020-07-21 19:55:32,168 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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 19:55:37,019 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:55:37,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:55:37,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 70 conjunts are in the unsatisfiable core [2020-07-21 19:55:37,046 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:55:37,113 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 19:55:37,113 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 19:55:37,133 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 19:55:37,139 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 19:55:37,140 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 19:55:37,150 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 19:55:37,154 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 19:55:37,154 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:24, output treesize:7 [2020-07-21 19:55:39,230 WARN L860 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_master_~ptr~1.base Int) (alloc_or_die_master_~ptr~1.offset Int)) (let ((.cse0 (+ alloc_or_die_master_~ptr~1.offset 4)) (.cse1 (+ alloc_or_die_master_~ptr~1.offset 8))) (and (<= (+ alloc_or_die_master_~ptr~1.base 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base (store (store (store (select |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base) alloc_or_die_master_~ptr~1.offset 0) .cse0 0) .cse1 0))) (= (store |c_old(#memory_$Pointer$.offset)| alloc_or_die_master_~ptr~1.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| alloc_or_die_master_~ptr~1.base) alloc_or_die_master_~ptr~1.offset 0) .cse0 0) .cse1 0)) |c_#memory_$Pointer$.offset|)))) is different from true [2020-07-21 19:55:43,306 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 36 [2020-07-21 19:55:45,335 WARN L860 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_master_~ptr~1.base Int) (alloc_or_die_master_~ptr~1.offset Int)) (let ((.cse0 (+ alloc_or_die_master_~ptr~1.offset 4)) (.cse1 (+ alloc_or_die_master_~ptr~1.offset 8))) (and (<= (+ alloc_or_die_master_~ptr~1.base 1) |c_#StackHeapBarrier|) (= (select (select (store |c_old(#memory_$Pointer$.offset)| alloc_or_die_master_~ptr~1.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| alloc_or_die_master_~ptr~1.base) alloc_or_die_master_~ptr~1.offset 0) .cse0 0) .cse1 0)) |c_dll_insert_master_#in~dll.base|) |c_dll_insert_master_#in~dll.offset|) c_dll_insert_master_~next~3.offset) (= (select (select (store |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base (store (store (store (select |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base) alloc_or_die_master_~ptr~1.offset 0) .cse0 0) .cse1 0)) |c_dll_insert_master_#in~dll.base|) |c_dll_insert_master_#in~dll.offset|) c_dll_insert_master_~next~3.base)))) is different from true [2020-07-21 19:55:45,338 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:55:47,360 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((alloc_or_die_master_~ptr~1.base Int) (alloc_or_die_master_~ptr~1.offset Int)) (and (<= (+ alloc_or_die_master_~ptr~1.base 1) |c_#StackHeapBarrier|) (not (= 0 (select (select (store |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base (store (store (store (select |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base) alloc_or_die_master_~ptr~1.offset 0) (+ alloc_or_die_master_~ptr~1.offset 4) 0) (+ alloc_or_die_master_~ptr~1.offset 8) 0)) |c_dll_insert_master_#in~dll.base|) |c_dll_insert_master_#in~dll.offset|))))) (exists ((alloc_or_die_master_~ptr~1.base Int) (alloc_or_die_master_~ptr~1.offset Int)) (and (<= (+ alloc_or_die_master_~ptr~1.base 1) |c_#StackHeapBarrier|) (not (= 0 (select (select (store |c_old(#memory_$Pointer$.offset)| alloc_or_die_master_~ptr~1.base (store (store (store (select |c_old(#memory_$Pointer$.offset)| alloc_or_die_master_~ptr~1.base) alloc_or_die_master_~ptr~1.offset 0) (+ alloc_or_die_master_~ptr~1.offset 4) 0) (+ alloc_or_die_master_~ptr~1.offset 8) 0)) |c_dll_insert_master_#in~dll.base|) |c_dll_insert_master_#in~dll.offset|)))))) is different from true [2020-07-21 19:55:47,378 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 70 treesize of output 66 [2020-07-21 19:55:47,381 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 19:55:47,495 WARN L193 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2020-07-21 19:55:47,497 INFO L624 ElimStorePlain]: treesize reduction 18, result has 79.5 percent of original size [2020-07-21 19:55:47,503 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 70 treesize of output 66 [2020-07-21 19:55:47,505 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 19:55:47,615 WARN L193 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2020-07-21 19:55:47,616 INFO L624 ElimStorePlain]: treesize reduction 20, result has 78.9 percent of original size [2020-07-21 19:55:47,620 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 19:55:47,623 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:55:47,625 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:55:47,627 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:55:47,628 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:55:47,632 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 19:55:47,633 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:55:47,634 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:55:47,637 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:55:47,638 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:55:47,640 INFO L544 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 19:55:47,641 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 10 variables, input treesize:65, output treesize:1 [2020-07-21 19:55:49,689 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((alloc_or_die_master_~ptr~1.base Int) (alloc_or_die_master_~ptr~1.offset Int)) (and (<= (+ alloc_or_die_master_~ptr~1.base 1) |c_#StackHeapBarrier|) (not (= 0 (select (select (store |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base (store (store (store (select |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base) alloc_or_die_master_~ptr~1.offset 0) (+ alloc_or_die_master_~ptr~1.offset 4) 0) (+ alloc_or_die_master_~ptr~1.offset 8) 0)) |c_dll_insert_master_#in~dll.base|) |c_dll_insert_master_#in~dll.offset|))))) (exists ((v_prenex_6 Int) (v_prenex_5 Int)) (and (<= (+ v_prenex_5 1) |c_#StackHeapBarrier|) (not (= 0 (select (select (store |c_old(#memory_$Pointer$.offset)| v_prenex_5 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_5) v_prenex_6 0) (+ v_prenex_6 4) 0) (+ v_prenex_6 8) 0)) |c_dll_insert_master_#in~dll.base|) |c_dll_insert_master_#in~dll.offset|)))))) is different from true [2020-07-21 19:55:51,718 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_6 Int) (v_prenex_5 Int)) (and (<= (+ v_prenex_5 1) |c_#StackHeapBarrier|) (not (= 0 (select (select (store |c_old(#memory_$Pointer$.offset)| v_prenex_5 (store (store (store (select |c_old(#memory_$Pointer$.offset)| v_prenex_5) v_prenex_6 0) (+ v_prenex_6 4) 0) (+ v_prenex_6 8) 0)) |c_##fun~$Pointer$~TO~VOID_#in~9.base|) |c_##fun~$Pointer$~TO~VOID_#in~9.offset|))))) (exists ((alloc_or_die_master_~ptr~1.base Int) (alloc_or_die_master_~ptr~1.offset Int)) (and (<= (+ alloc_or_die_master_~ptr~1.base 1) |c_#StackHeapBarrier|) (not (= 0 (select (select (store |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base (store (store (store (select |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base) alloc_or_die_master_~ptr~1.offset 0) (+ alloc_or_die_master_~ptr~1.offset 4) 0) (+ alloc_or_die_master_~ptr~1.offset 8) 0)) |c_##fun~$Pointer$~TO~VOID_#in~9.base|) |c_##fun~$Pointer$~TO~VOID_#in~9.offset|)))))) is different from true [2020-07-21 19:55:51,726 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:55:51,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 19:55:51,747 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 19:55:51,752 WARN L234 Elim1Store]: Array PQE input equivalent to false [2020-07-21 19:55:51,753 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 19:55:51,754 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 19:55:51,754 INFO L512 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_BEFORE_CALL_6| vanished before elimination [2020-07-21 19:55:51,755 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 19:55:51,755 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:105, output treesize:1 [2020-07-21 19:55:51,810 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 19:55:51,810 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:55:52,154 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-21 19:55:52,356 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2020-07-21 19:55:52,507 WARN L193 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2020-07-21 19:55:54,765 INFO L501 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-07-21 19:55:56,810 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_alloc_or_die_master_~ptr~1.base_110 Int) (v_alloc_or_die_master_~ptr~1.offset_106 Int)) (or (< |c_#StackHeapBarrier| (+ v_alloc_or_die_master_~ptr~1.base_110 1)) (= 0 (select (select (store |c_#memory_$Pointer$.base| v_alloc_or_die_master_~ptr~1.base_110 (store (store (store (select |c_#memory_$Pointer$.base| v_alloc_or_die_master_~ptr~1.base_110) v_alloc_or_die_master_~ptr~1.offset_106 0) (+ v_alloc_or_die_master_~ptr~1.offset_106 4) 0) (+ v_alloc_or_die_master_~ptr~1.offset_106 8) 0)) |c_dll_create_generic_~#dll~0.base|) |c_dll_create_generic_~#dll~0.offset|)))) (forall ((v_alloc_or_die_master_~ptr~1.base_110 Int) (v_alloc_or_die_master_~ptr~1.offset_106 Int)) (or (< |c_#StackHeapBarrier| (+ v_alloc_or_die_master_~ptr~1.base_110 1)) (= 0 (select (select (store |c_#memory_$Pointer$.offset| v_alloc_or_die_master_~ptr~1.base_110 (store (store (store (select |c_#memory_$Pointer$.offset| v_alloc_or_die_master_~ptr~1.base_110) v_alloc_or_die_master_~ptr~1.offset_106 0) (+ v_alloc_or_die_master_~ptr~1.offset_106 4) 0) (+ v_alloc_or_die_master_~ptr~1.offset_106 8) 0)) |c_dll_create_generic_~#dll~0.base|) |c_dll_create_generic_~#dll~0.offset|))))) is different from false [2020-07-21 19:55:56,816 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [909070648] [2020-07-21 19:55:56,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-21 19:55:56,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2020-07-21 19:55:56,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988770983] [2020-07-21 19:55:56,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-21 19:55:56,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:55:56,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-21 19:55:56,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=45, Unknown=7, NotChecked=102, Total=182 [2020-07-21 19:55:56,819 INFO L87 Difference]: Start difference. First operand 202 states and 239 transitions. Second operand 13 states. [2020-07-21 19:56:02,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:56:02,423 INFO L93 Difference]: Finished difference Result 403 states and 480 transitions. [2020-07-21 19:56:02,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-21 19:56:02,424 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 157 [2020-07-21 19:56:02,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:56:02,434 INFO L225 Difference]: With dead ends: 403 [2020-07-21 19:56:02,434 INFO L226 Difference]: Without dead ends: 212 [2020-07-21 19:56:02,436 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=32, Invalid=57, Unknown=7, NotChecked=114, Total=210 [2020-07-21 19:56:02,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2020-07-21 19:56:02,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 208. [2020-07-21 19:56:02,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-07-21 19:56:02,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 247 transitions. [2020-07-21 19:56:02,477 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 247 transitions. Word has length 157 [2020-07-21 19:56:02,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:56:02,482 INFO L479 AbstractCegarLoop]: Abstraction has 208 states and 247 transitions. [2020-07-21 19:56:02,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-21 19:56:02,482 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 247 transitions. [2020-07-21 19:56:02,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-07-21 19:56:02,492 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:56:02,492 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, 2, 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 19:56:02,709 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:56:02,710 INFO L427 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:56:02,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:56:02,711 INFO L82 PathProgramCache]: Analyzing trace with hash -1632845278, now seen corresponding path program 1 times [2020-07-21 19:56:02,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:56:02,712 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1107283922] [2020-07-21 19:56:02,712 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 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 19:56:08,038 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:56:08,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:56:08,052 INFO L263 TraceCheckSpWp]: Trace formula consists of 792 conjuncts, 64 conjunts are in the unsatisfiable core [2020-07-21 19:56:08,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:56:08,173 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 19:56:08,174 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 19:56:08,175 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 19:56:08,210 INFO L624 ElimStorePlain]: treesize reduction 20, result has 60.8 percent of original size [2020-07-21 19:56:08,213 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 19:56:08,214 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:8 [2020-07-21 19:56:08,280 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 19:56:08,282 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 19:56:08,286 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 19:56:08,287 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 19:56:08,287 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2020-07-21 19:56:10,385 WARN L860 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_master_~ptr~1.base Int) (alloc_or_die_master_~ptr~1.offset Int)) (and (<= (+ alloc_or_die_master_~ptr~1.base 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base (store (store (store (select |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base) alloc_or_die_master_~ptr~1.offset 0) (+ alloc_or_die_master_~ptr~1.offset 4) 0) (+ alloc_or_die_master_~ptr~1.offset 8) 0))))) is different from true [2020-07-21 19:56:20,449 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2020-07-21 19:56:22,469 WARN L860 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_master_~ptr~1.base Int) (alloc_or_die_master_~ptr~1.offset Int)) (and (<= (+ alloc_or_die_master_~ptr~1.base 1) |c_#StackHeapBarrier|) (= (select (select (store |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base (store (store (store (select |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base) alloc_or_die_master_~ptr~1.offset 0) (+ alloc_or_die_master_~ptr~1.offset 4) 0) (+ alloc_or_die_master_~ptr~1.offset 8) 0)) |c_dll_insert_master_#in~dll.base|) |c_dll_insert_master_#in~dll.offset|) c_dll_insert_master_~next~3.base))) is different from true [2020-07-21 19:56:24,475 WARN L860 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_master_~ptr~1.base Int) (alloc_or_die_master_~ptr~1.offset Int)) (and (<= (+ alloc_or_die_master_~ptr~1.base 1) |c_#StackHeapBarrier|) (= 0 (select (select (store |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base (store (store (store (select |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base) alloc_or_die_master_~ptr~1.offset 0) (+ alloc_or_die_master_~ptr~1.offset 4) 0) (+ alloc_or_die_master_~ptr~1.offset 8) 0)) |c_dll_insert_master_#in~dll.base|) |c_dll_insert_master_#in~dll.offset|)))) is different from true [2020-07-21 19:56:24,484 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 69 treesize of output 65 [2020-07-21 19:56:24,486 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-21 19:56:24,504 INFO L624 ElimStorePlain]: treesize reduction 61, result has 7.6 percent of original size [2020-07-21 19:56:24,505 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 19:56:24,506 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:31, output treesize:1 [2020-07-21 19:56:26,532 WARN L860 $PredicateComparison]: unable to prove that (exists ((alloc_or_die_master_~ptr~1.base Int) (alloc_or_die_master_~ptr~1.offset Int)) (and (<= (+ alloc_or_die_master_~ptr~1.base 1) |c_#StackHeapBarrier|) (= 0 (select (select (store |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base (store (store (store (select |c_old(#memory_$Pointer$.base)| alloc_or_die_master_~ptr~1.base) alloc_or_die_master_~ptr~1.offset 0) (+ alloc_or_die_master_~ptr~1.offset 4) 0) (+ alloc_or_die_master_~ptr~1.offset 8) 0)) |c_##fun~$Pointer$~TO~VOID_#in~9.base|) |c_##fun~$Pointer$~TO~VOID_#in~9.offset|)))) is different from true [2020-07-21 19:56:26,551 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 19:56:26,552 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 19:56:26,554 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 19:56:26,554 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 19:56:26,555 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:1 [2020-07-21 19:56:26,603 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 33 proven. 18 refuted. 0 times theorem prover too weak. 120 trivial. 9 not checked. [2020-07-21 19:56:26,603 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-21 19:56:30,409 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_alloc_or_die_master_~ptr~1.offset_141 Int) (v_alloc_or_die_master_~ptr~1.base_147 Int)) (or (< |c_#StackHeapBarrier| (+ v_alloc_or_die_master_~ptr~1.base_147 1)) (not (= (select (select (store |c_#memory_$Pointer$.base| v_alloc_or_die_master_~ptr~1.base_147 (store (store (store (select |c_#memory_$Pointer$.base| v_alloc_or_die_master_~ptr~1.base_147) v_alloc_or_die_master_~ptr~1.offset_141 0) (+ v_alloc_or_die_master_~ptr~1.offset_141 4) 0) (+ v_alloc_or_die_master_~ptr~1.offset_141 8) 0)) |c_dll_create_generic_~#dll~0.base|) |c_dll_create_generic_~#dll~0.offset|) 0)))) is different from false [2020-07-21 19:56:30,412 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1107283922] [2020-07-21 19:56:30,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-21 19:56:30,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2020-07-21 19:56:30,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030355497] [2020-07-21 19:56:30,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-21 19:56:30,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-21 19:56:30,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-21 19:56:30,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=233, Unknown=9, NotChecked=170, Total=462 [2020-07-21 19:56:30,415 INFO L87 Difference]: Start difference. First operand 208 states and 247 transitions. Second operand 21 states. [2020-07-21 19:56:34,604 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2020-07-21 19:56:36,676 WARN L193 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 31 [2020-07-21 19:56:44,773 WARN L193 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 33 [2020-07-21 19:56:58,904 WARN L193 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 32 [2020-07-21 19:57:11,176 WARN L193 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 37 [2020-07-21 19:57:27,278 WARN L193 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 34 [2020-07-21 19:57:36,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-21 19:57:36,721 INFO L93 Difference]: Finished difference Result 410 states and 488 transitions. [2020-07-21 19:57:36,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2020-07-21 19:57:36,722 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 157 [2020-07-21 19:57:36,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-21 19:57:36,725 INFO L225 Difference]: With dead ends: 410 [2020-07-21 19:57:36,725 INFO L226 Difference]: Without dead ends: 214 [2020-07-21 19:57:36,728 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 62.8s TimeCoverageRelationStatistics Valid=120, Invalid=806, Unknown=24, NotChecked=310, Total=1260 [2020-07-21 19:57:36,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2020-07-21 19:57:36,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 209. [2020-07-21 19:57:36,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-07-21 19:57:36,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 246 transitions. [2020-07-21 19:57:36,746 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 246 transitions. Word has length 157 [2020-07-21 19:57:36,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-21 19:57:36,747 INFO L479 AbstractCegarLoop]: Abstraction has 209 states and 246 transitions. [2020-07-21 19:57:36,747 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-21 19:57:36,748 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 246 transitions. [2020-07-21 19:57:36,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-07-21 19:57:36,750 INFO L414 BasicCegarLoop]: Found error trace [2020-07-21 19:57:36,751 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 19:57:36,952 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:57:36,952 INFO L427 AbstractCegarLoop]: === Iteration 6 === [failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-21 19:57:36,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-21 19:57:36,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1709746076, now seen corresponding path program 1 times [2020-07-21 19:57:36,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-21 19:57:36,955 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1870310177] [2020-07-21 19:57:36,956 INFO L95 rtionOrderModulation]: Keeping assertion order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-21 19:57:42,153 INFO L228 tOrderPrioritization]: Assert order SMT_FEATURE_HEURISTIC (partitioning type FIXED_NUM_PARTITIONS, 2 partitions) issued 2 check-sat command(s) [2020-07-21 19:57:42,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-21 19:57:42,169 INFO L263 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 219 conjunts are in the unsatisfiable core [2020-07-21 19:57:42,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-21 19:57:42,323 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 19:57:42,324 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 19:57:42,325 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 19:57:42,359 INFO L624 ElimStorePlain]: treesize reduction 20, result has 60.8 percent of original size [2020-07-21 19:57:42,361 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 19:57:42,361 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:8 [2020-07-21 19:57:42,422 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 19:57:42,423 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 19:57:42,436 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 19:57:42,437 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 19:57:42,437 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2020-07-21 19:57:42,522 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-21 19:57:42,523 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 19:57:42,530 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 19:57:42,531 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-21 19:57:42,532 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-07-21 19:57:44,620 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2020-07-21 19:57:46,694 WARN L193 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 29 [2020-07-21 19:57:50,937 WARN L193 SmtUtils]: Spent 2.05 s on a formula simplification that was a NOOP. DAG size: 39 [2020-07-21 19:57:50,945 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 19:57:50,946 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 19:57:50,954 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 19:57:50,955 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 19:57:50,956 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:7 [2020-07-21 19:57:51,077 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 19:57:51,078 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 19:57:51,091 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 19:57:51,101 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 19:57:51,102 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 19:57:51,110 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 19:57:51,110 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 19:57:51,111 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:27, output treesize:10 [2020-07-21 19:57:53,412 WARN L193 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 27 [2020-07-21 19:57:55,508 WARN L193 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 30 [2020-07-21 19:57:57,620 WARN L193 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 35 [2020-07-21 19:58:18,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 19:58:18,247 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 19:58:18,248 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 64 [2020-07-21 19:58:18,249 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 19:58:18,352 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2020-07-21 19:58:18,354 INFO L624 ElimStorePlain]: treesize reduction 24, result has 80.6 percent of original size [2020-07-21 19:58:18,356 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:58:18,359 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:58:18,360 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:58:18,362 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:58:18,364 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:58:18,366 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:58:18,368 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:58:18,370 INFO L544 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-21 19:58:18,371 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:104, output treesize:98 [2020-07-21 19:58:18,373 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:58:18,374 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:58:18,375 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:58:18,375 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:58:18,377 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:58:18,577 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:58:18,579 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:58:18,580 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:58:18,581 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:58:18,582 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:58:18,587 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:58:18,588 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:58:18,590 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:58:18,591 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:58:18,593 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:58:18,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 19:58:18,612 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 19:58:18,613 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 19:58:18,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 19:58:18,629 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 19:58:18,630 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 19:58:18,680 INFO L173 IndexEqualityManager]: detected equality via solver [2020-07-21 19:58:18,683 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-21 19:58:18,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 19:58:18,694 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 19:58:18,695 INFO L544 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-07-21 19:58:18,746 INFO L624 ElimStorePlain]: treesize reduction 61, result has 27.4 percent of original size [2020-07-21 19:58:18,749 INFO L440 ElimStorePlain]: Different costs {0=[|v_old(#memory_$Pointer$.base)_BEFORE_CALL_16|], 2=[|v_#memory_$Pointer$.offset_BEFORE_CALL_13|]} [2020-07-21 19:58:18,754 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 19:58:18,755 INFO L544 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2020-07-21 19:58:18,766 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 19:58:18,767 INFO L512 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_BEFORE_CALL_13| vanished before elimination [2020-07-21 19:58:18,768 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-21 19:58:18,768 INFO L244 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:153, output treesize:10 [2020-07-21 19:58:25,341 WARN L193 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 23 [2020-07-21 19:58:27,760 WARN L193 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 29 [2020-07-21 19:58:27,968 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:58:41,562 WARN L193 SmtUtils]: Spent 10.19 s on a formula simplification that was a NOOP. DAG size: 47 [2020-07-21 19:58:41,566 INFO L320 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 5, 1] term [2020-07-21 19:58:41,566 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:10,021 WARN L193 SmtUtils]: Spent 2.12 s on a formula simplification that was a NOOP. DAG size: 70 [2020-07-21 19:59:43,158 WARN L193 SmtUtils]: Spent 3.45 s on a formula simplification that was a NOOP. DAG size: 70 [2020-07-21 19:59:43,170 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,171 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,172 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,174 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,176 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,179 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,180 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,181 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,182 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,184 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,186 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,190 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,191 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,192 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,193 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,195 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,200 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,201 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,202 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,204 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,205 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,209 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,210 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,211 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,212 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,214 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,216 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,218 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,219 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,220 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,221 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,225 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,227 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,228 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,230 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,230 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,232 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,234 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,235 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,236 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,238 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,240 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,245 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,246 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,246 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,247 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,248 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,252 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,254 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,255 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,257 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,259 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,261 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,262 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,262 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,264 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,265 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,267 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,269 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,270 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,272 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,273 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,277 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,280 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,281 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,282 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,284 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,286 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,288 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,290 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,291 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,293 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,295 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,299 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,301 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,302 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,304 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,306 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,310 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,312 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,313 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,315 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,316 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,321 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,323 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,324 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,325 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,327 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,330 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,332 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,333 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,335 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,336 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,341 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,342 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,343 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,345 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,346 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,348 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,351 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,352 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,352 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,354 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,356 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,360 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,361 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,363 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,364 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,366 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,370 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,371 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,372 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,374 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,375 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,378 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,379 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,380 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,381 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,383 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,386 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,387 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,388 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,389 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,390 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 19:59:43,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 19:59:43,849 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 956 treesize of output 752 [2020-07-21 19:59:43,850 INFO L544 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-21 19:59:44,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 19:59:45,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 19:59:47,621 INFO L244 Elim1Store]: Index analysis took 2820 ms [2020-07-21 19:59:47,628 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 19:59:47,629 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 1198 treesize of output 982 [2020-07-21 19:59:47,631 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 19:59:47,633 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 19:59:47,634 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 19:59:48,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 19:59:49,001 INFO L544 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-07-21 19:59:49,906 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 19:59:52,129 INFO L244 Elim1Store]: Index analysis took 1713 ms [2020-07-21 19:59:52,138 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 19:59:52,139 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1035 treesize of output 823 [2020-07-21 19:59:52,140 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 19:59:52,142 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 19:59:52,143 INFO L544 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-21 19:59:52,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 19:59:53,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 19:59:54,131 INFO L244 Elim1Store]: Index analysis took 948 ms [2020-07-21 19:59:54,134 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1191 treesize of output 971 [2020-07-21 19:59:54,135 INFO L544 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-21 19:59:55,225 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 19:59:55,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 19:59:57,026 INFO L244 Elim1Store]: Index analysis took 1490 ms [2020-07-21 19:59:57,029 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 1107 treesize of output 899 [2020-07-21 19:59:57,031 INFO L544 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-21 19:59:58,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 19:59:59,220 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 1028 treesize of output 812 [2020-07-21 19:59:59,222 INFO L544 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-21 20:00:01,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 20:00:01,146 INFO L544 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2020-07-21 20:02:52,809 WARN L193 SmtUtils]: Spent 2.86 m on a formula simplification. DAG size of input: 187 DAG size of output: 183 [2020-07-21 20:02:52,810 INFO L624 ElimStorePlain]: treesize reduction 10, result has 99.8 percent of original size [2020-07-21 20:02:52,847 INFO L544 ElimStorePlain]: Start of recursive call 1: 12 dim-0 vars, 1 dim-2 vars, End of recursive call: 51 dim-0 vars, and 6 xjuncts. [2020-07-21 20:02:52,847 INFO L244 ElimStorePlain]: Needed 9 recursive calls to eliminate 13 variables, input treesize:9033, output treesize:5411 [2020-07-21 20:03:59,767 WARN L193 SmtUtils]: Spent 17.15 s on a formula simplification. DAG size of input: 282 DAG size of output: 191 [2020-07-21 20:07:24,943 INFO L501 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2020-07-21 20:07:26,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 20:07:26,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 20:07:34,244 WARN L177 IndexEqualityManager]: solver failed to check if following not equals relation is implied: (= dll_insert_master_~item~1.base v_prenex_37) [2020-07-21 20:07:43,531 INFO L244 Elim1Store]: Index analysis took 12095 ms [2020-07-21 20:07:43,553 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 20:07:43,554 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 38 [2020-07-21 20:07:43,555 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 20:07:43,556 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 20:07:43,556 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 20:07:43,557 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 20:07:43,557 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 20:07:43,557 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 20:07:43,558 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-21 20:07:45,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 20:07:48,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 20:08:03,329 INFO L244 Elim1Store]: Index analysis took 13234 ms [2020-07-21 20:08:03,356 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-21 20:08:03,356 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 38 [2020-07-21 20:08:03,358 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 20:08:03,358 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 20:08:03,359 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-21 20:08:03,360 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-21 20:08:03,360 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-21 20:08:06,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 20:08:07,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-21 20:08:09,192 WARN L161 IndexEqualityManager]: solver failed to check if following equality is implied: (= v_prenex_18 v_prenex_21)