java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/heap-data/shared_mem1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 22:08:02,553 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 22:08:02,557 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 22:08:02,575 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 22:08:02,575 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 22:08:02,577 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 22:08:02,579 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 22:08:02,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 22:08:02,593 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 22:08:02,595 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 22:08:02,596 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 22:08:02,598 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 22:08:02,599 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 22:08:02,600 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 22:08:02,603 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 22:08:02,604 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 22:08:02,606 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 22:08:02,607 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 22:08:02,609 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 22:08:02,615 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 22:08:02,620 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 22:08:02,623 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 22:08:02,626 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 22:08:02,626 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 22:08:02,629 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 22:08:02,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 22:08:02,629 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 22:08:02,631 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 22:08:02,632 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 22:08:02,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 22:08:02,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 22:08:02,635 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 22:08:02,636 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 22:08:02,636 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 22:08:02,638 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 22:08:02,638 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 22:08:02,639 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 22:08:02,639 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 22:08:02,639 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 22:08:02,640 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 22:08:02,641 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 22:08:02,642 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 22:08:02,677 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 22:08:02,678 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 22:08:02,679 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 22:08:02,679 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 22:08:02,679 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 22:08:02,679 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 22:08:02,680 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 22:08:02,680 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 22:08:02,680 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 22:08:02,680 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 22:08:02,680 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 22:08:02,680 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 22:08:02,681 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 22:08:02,681 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 22:08:02,681 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 22:08:02,685 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 22:08:02,685 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 22:08:02,685 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 22:08:02,685 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 22:08:02,686 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 22:08:02,686 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 22:08:02,686 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 22:08:02,686 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 22:08:02,687 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 22:08:02,687 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 22:08:02,687 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 22:08:02,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 22:08:02,687 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 22:08:02,688 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 22:08:02,961 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 22:08:02,975 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 22:08:02,978 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 22:08:02,980 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 22:08:02,980 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 22:08:02,981 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/shared_mem1.i [2019-10-14 22:08:03,051 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29b61c068/470f524bf9a442b49605fbe71f4b09c5/FLAG8a1dff606 [2019-10-14 22:08:03,589 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 22:08:03,593 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/shared_mem1.i [2019-10-14 22:08:03,605 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29b61c068/470f524bf9a442b49605fbe71f4b09c5/FLAG8a1dff606 [2019-10-14 22:08:03,916 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29b61c068/470f524bf9a442b49605fbe71f4b09c5 [2019-10-14 22:08:03,927 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 22:08:03,929 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 22:08:03,930 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 22:08:03,930 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 22:08:03,933 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 22:08:03,934 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:08:03" (1/1) ... [2019-10-14 22:08:03,937 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@411349f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:03, skipping insertion in model container [2019-10-14 22:08:03,938 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:08:03" (1/1) ... [2019-10-14 22:08:03,945 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 22:08:03,989 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 22:08:04,454 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 22:08:04,466 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 22:08:04,518 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 22:08:04,574 INFO L192 MainTranslator]: Completed translation [2019-10-14 22:08:04,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:04 WrapperNode [2019-10-14 22:08:04,574 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 22:08:04,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 22:08:04,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 22:08:04,575 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 22:08:04,590 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:04" (1/1) ... [2019-10-14 22:08:04,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:04" (1/1) ... [2019-10-14 22:08:04,615 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:04" (1/1) ... [2019-10-14 22:08:04,616 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:04" (1/1) ... [2019-10-14 22:08:04,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:04" (1/1) ... [2019-10-14 22:08:04,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:04" (1/1) ... [2019-10-14 22:08:04,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:04" (1/1) ... [2019-10-14 22:08:04,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 22:08:04,648 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 22:08:04,648 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 22:08:04,648 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 22:08:04,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:04" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 22:08:04,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 22:08:04,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 22:08:04,716 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-14 22:08:04,717 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-14 22:08:04,717 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 22:08:04,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 22:08:04,717 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 22:08:04,717 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-14 22:08:04,720 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-14 22:08:04,720 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-14 22:08:04,720 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-14 22:08:04,721 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-14 22:08:04,721 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-14 22:08:04,722 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-14 22:08:04,722 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-14 22:08:04,723 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-14 22:08:04,725 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-14 22:08:04,725 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-14 22:08:04,725 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-14 22:08:04,726 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-14 22:08:04,726 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-14 22:08:04,727 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-14 22:08:04,727 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-14 22:08:04,727 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-14 22:08:04,727 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-14 22:08:04,729 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-14 22:08:04,729 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-14 22:08:04,729 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-14 22:08:04,729 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-14 22:08:04,729 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-14 22:08:04,730 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-14 22:08:04,730 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-14 22:08:04,730 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-14 22:08:04,730 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-14 22:08:04,730 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-14 22:08:04,730 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-14 22:08:04,730 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-14 22:08:04,731 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-14 22:08:04,731 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-14 22:08:04,731 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-14 22:08:04,731 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-14 22:08:04,732 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-14 22:08:04,732 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-14 22:08:04,732 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-14 22:08:04,732 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-14 22:08:04,732 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-14 22:08:04,732 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-14 22:08:04,732 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-14 22:08:04,733 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-14 22:08:04,733 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-14 22:08:04,733 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-14 22:08:04,733 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-14 22:08:04,733 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-14 22:08:04,733 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-14 22:08:04,734 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-14 22:08:04,734 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-14 22:08:04,734 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-14 22:08:04,734 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-14 22:08:04,734 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-14 22:08:04,734 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 22:08:04,734 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-14 22:08:04,735 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-14 22:08:04,735 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-14 22:08:04,735 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-14 22:08:04,735 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-14 22:08:04,735 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-14 22:08:04,735 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-14 22:08:04,735 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-14 22:08:04,737 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-14 22:08:04,737 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-14 22:08:04,737 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-14 22:08:04,737 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-14 22:08:04,737 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 22:08:04,737 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-14 22:08:04,738 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-14 22:08:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-14 22:08:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-14 22:08:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-14 22:08:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-14 22:08:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-14 22:08:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-14 22:08:04,739 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-14 22:08:04,740 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-14 22:08:04,740 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-14 22:08:04,740 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-14 22:08:04,741 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-14 22:08:04,741 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-14 22:08:04,742 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-14 22:08:04,742 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-14 22:08:04,742 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-14 22:08:04,743 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-14 22:08:04,743 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-14 22:08:04,743 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-14 22:08:04,743 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-14 22:08:04,743 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-14 22:08:04,744 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-14 22:08:04,744 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-14 22:08:04,744 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-14 22:08:04,744 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-14 22:08:04,744 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-14 22:08:04,744 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-14 22:08:04,744 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-14 22:08:04,745 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-14 22:08:04,745 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-14 22:08:04,745 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-14 22:08:04,745 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-14 22:08:04,745 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-14 22:08:04,745 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-14 22:08:04,745 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-14 22:08:04,746 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-14 22:08:04,746 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-14 22:08:04,746 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-14 22:08:04,746 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 22:08:04,746 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 22:08:04,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 22:08:04,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-14 22:08:04,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-14 22:08:04,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 22:08:04,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 22:08:04,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 22:08:04,748 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 22:08:05,309 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 22:08:05,310 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-14 22:08:05,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:08:05 BoogieIcfgContainer [2019-10-14 22:08:05,311 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 22:08:05,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 22:08:05,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 22:08:05,316 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 22:08:05,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:08:03" (1/3) ... [2019-10-14 22:08:05,317 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646d24f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:08:05, skipping insertion in model container [2019-10-14 22:08:05,317 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:08:04" (2/3) ... [2019-10-14 22:08:05,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@646d24f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:08:05, skipping insertion in model container [2019-10-14 22:08:05,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:08:05" (3/3) ... [2019-10-14 22:08:05,320 INFO L109 eAbstractionObserver]: Analyzing ICFG shared_mem1.i [2019-10-14 22:08:05,329 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 22:08:05,336 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 22:08:05,344 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 22:08:05,367 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 22:08:05,367 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 22:08:05,367 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 22:08:05,367 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 22:08:05,368 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 22:08:05,368 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 22:08:05,368 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 22:08:05,368 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 22:08:05,385 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-10-14 22:08:05,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-14 22:08:05,392 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:05,393 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:05,396 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:05,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:05,403 INFO L82 PathProgramCache]: Analyzing trace with hash -53964180, now seen corresponding path program 1 times [2019-10-14 22:08:05,412 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:05,412 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165801234] [2019-10-14 22:08:05,412 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:05,412 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:05,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:05,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:05,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:05,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:05,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165801234] [2019-10-14 22:08:05,612 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:08:05,613 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 22:08:05,613 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833829522] [2019-10-14 22:08:05,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 22:08:05,618 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:05,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 22:08:05,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 22:08:05,635 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2019-10-14 22:08:05,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:05,733 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2019-10-14 22:08:05,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 22:08:05,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-14 22:08:05,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:05,746 INFO L225 Difference]: With dead ends: 33 [2019-10-14 22:08:05,746 INFO L226 Difference]: Without dead ends: 17 [2019-10-14 22:08:05,750 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 22:08:05,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-14 22:08:05,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-14 22:08:05,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-14 22:08:05,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-10-14 22:08:05,791 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 14 [2019-10-14 22:08:05,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:05,792 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-10-14 22:08:05,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 22:08:05,792 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-10-14 22:08:05,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-14 22:08:05,793 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:05,793 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:05,793 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:05,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:05,794 INFO L82 PathProgramCache]: Analyzing trace with hash 1423019225, now seen corresponding path program 1 times [2019-10-14 22:08:05,794 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:05,794 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381353879] [2019-10-14 22:08:05,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:05,795 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:05,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:05,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:06,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:06,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:06,176 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381353879] [2019-10-14 22:08:06,177 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:08:06,177 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-14 22:08:06,177 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371306308] [2019-10-14 22:08:06,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 22:08:06,179 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:06,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 22:08:06,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-14 22:08:06,180 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 9 states. [2019-10-14 22:08:06,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:06,514 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2019-10-14 22:08:06,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 22:08:06,515 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 15 [2019-10-14 22:08:06,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:06,518 INFO L225 Difference]: With dead ends: 33 [2019-10-14 22:08:06,519 INFO L226 Difference]: Without dead ends: 31 [2019-10-14 22:08:06,521 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-10-14 22:08:06,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-10-14 22:08:06,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2019-10-14 22:08:06,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-14 22:08:06,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2019-10-14 22:08:06,534 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 15 [2019-10-14 22:08:06,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:06,535 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-10-14 22:08:06,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 22:08:06,535 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2019-10-14 22:08:06,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-14 22:08:06,537 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:06,538 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:06,538 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:06,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:06,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1423021147, now seen corresponding path program 1 times [2019-10-14 22:08:06,538 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:06,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836434546] [2019-10-14 22:08:06,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:06,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:06,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:06,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:06,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836434546] [2019-10-14 22:08:06,831 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:08:06,831 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 22:08:06,831 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443355415] [2019-10-14 22:08:06,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 22:08:06,832 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:06,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 22:08:06,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-14 22:08:06,833 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand 8 states. [2019-10-14 22:08:07,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:07,138 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2019-10-14 22:08:07,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 22:08:07,139 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 15 [2019-10-14 22:08:07,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:07,140 INFO L225 Difference]: With dead ends: 35 [2019-10-14 22:08:07,140 INFO L226 Difference]: Without dead ends: 28 [2019-10-14 22:08:07,141 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-10-14 22:08:07,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-14 22:08:07,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-10-14 22:08:07,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-10-14 22:08:07,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-10-14 22:08:07,152 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 15 [2019-10-14 22:08:07,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:07,152 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-10-14 22:08:07,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 22:08:07,152 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-10-14 22:08:07,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 22:08:07,154 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:07,157 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:07,158 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:07,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:07,158 INFO L82 PathProgramCache]: Analyzing trace with hash -442037965, now seen corresponding path program 1 times [2019-10-14 22:08:07,159 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:07,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758444594] [2019-10-14 22:08:07,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:07,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:07,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:07,600 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:07,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758444594] [2019-10-14 22:08:07,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [107195367] [2019-10-14 22:08:07,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:07,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 40 conjunts are in the unsatisfiable core [2019-10-14 22:08:07,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:07,824 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-14 22:08:07,825 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-10-14 22:08:07,825 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:07,880 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:07,888 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_26|, |v_#memory_$Pointer$.offset_22|, |v_#memory_$Pointer$.base_22|], 2=[|v_#memory_int_23|]} [2019-10-14 22:08:07,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:07,965 INFO L341 Elim1Store]: treesize reduction 33, result has 55.4 percent of original size [2019-10-14 22:08:07,966 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 48 [2019-10-14 22:08:07,966 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:08,071 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-10-14 22:08:08,072 INFO L567 ElimStorePlain]: treesize reduction 16, result has 86.9 percent of original size [2019-10-14 22:08:08,080 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:08,084 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-10-14 22:08:08,085 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:08,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:08,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:08,161 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-10-14 22:08:08,161 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:08,219 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:08,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:08,271 INFO L341 Elim1Store]: treesize reduction 24, result has 55.6 percent of original size [2019-10-14 22:08:08,272 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 60 [2019-10-14 22:08:08,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:08,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:08,278 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:08,396 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2019-10-14 22:08:08,397 INFO L567 ElimStorePlain]: treesize reduction 55, result has 63.8 percent of original size [2019-10-14 22:08:08,398 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:08,398 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 6 variables, input treesize:112, output treesize:96 [2019-10-14 22:08:08,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-14 22:08:08,601 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:08,602 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 239 treesize of output 243 [2019-10-14 22:08:08,604 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:08,663 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:08,663 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 241 treesize of output 245 [2019-10-14 22:08:08,665 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:08,711 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:08,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 241 treesize of output 245 [2019-10-14 22:08:08,713 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:08,757 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:08,757 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 240 treesize of output 244 [2019-10-14 22:08:08,758 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:09,908 WARN L191 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 98 [2019-10-14 22:08:09,908 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:09,912 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_24|, |v_#memory_int_25|], 6=[|v_#memory_$Pointer$.base_24|, |v_#memory_$Pointer$.base_23|, |v_#memory_$Pointer$.offset_24|, |v_#memory_$Pointer$.offset_23|], 10=[|v_#memory_int_27|]} [2019-10-14 22:08:09,931 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:09,948 INFO L496 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:09,960 INFO L496 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:09,971 INFO L496 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:11,603 WARN L191 SmtUtils]: Spent 1.63 s on a formula simplification that was a NOOP. DAG size: 116 [2019-10-14 22:08:11,603 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:11,615 INFO L496 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:11,639 INFO L496 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:11,649 INFO L496 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:11,661 INFO L496 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:12,976 WARN L191 SmtUtils]: Spent 1.31 s on a formula simplification that was a NOOP. DAG size: 118 [2019-10-14 22:08:12,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:13,016 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:13,093 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 229 treesize of output 220 [2019-10-14 22:08:13,095 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:13,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:13,194 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 221 [2019-10-14 22:08:13,195 INFO L496 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:13,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:13,274 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 230 treesize of output 221 [2019-10-14 22:08:13,275 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:13,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:13,343 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 228 treesize of output 219 [2019-10-14 22:08:13,344 INFO L496 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:14,671 WARN L191 SmtUtils]: Spent 1.33 s on a formula simplification that was a NOOP. DAG size: 112 [2019-10-14 22:08:14,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:14,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:14,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:14,842 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 213 treesize of output 194 [2019-10-14 22:08:14,843 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:14,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:14,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:15,050 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 196 [2019-10-14 22:08:15,051 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:15,079 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:15,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:15,207 INFO L235 Elim1Store]: Index analysis took 133 ms [2019-10-14 22:08:15,329 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 195 [2019-10-14 22:08:15,330 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:15,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:15,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:15,392 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 196 [2019-10-14 22:08:15,393 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:16,292 WARN L191 SmtUtils]: Spent 897.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2019-10-14 22:08:16,292 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:16,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:16,340 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 181 [2019-10-14 22:08:16,341 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:16,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:16,407 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 181 [2019-10-14 22:08:16,408 INFO L496 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:16,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:16,477 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 179 [2019-10-14 22:08:16,478 INFO L496 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:16,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:16,520 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 189 treesize of output 180 [2019-10-14 22:08:16,521 INFO L496 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:17,291 WARN L191 SmtUtils]: Spent 769.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2019-10-14 22:08:17,291 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:17,313 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:17,317 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:17,373 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:17,461 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 156 [2019-10-14 22:08:17,462 INFO L496 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:17,483 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:17,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:17,637 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 155 [2019-10-14 22:08:17,638 INFO L496 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:17,660 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:17,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:17,705 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:17,759 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 156 [2019-10-14 22:08:17,761 INFO L496 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:17,775 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:17,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:17,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 154 [2019-10-14 22:08:17,816 INFO L496 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:18,298 WARN L191 SmtUtils]: Spent 481.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2019-10-14 22:08:18,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:18,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:18,323 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:18,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:18,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:18,365 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 123 [2019-10-14 22:08:18,366 INFO L496 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:18,383 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:18,390 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:18,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:18,395 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:18,629 WARN L191 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-10-14 22:08:18,630 INFO L341 Elim1Store]: treesize reduction 51, result has 72.4 percent of original size [2019-10-14 22:08:18,630 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 149 treesize of output 251 [2019-10-14 22:08:18,632 INFO L496 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:18,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:18,644 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:18,645 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:18,646 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:18,659 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 123 [2019-10-14 22:08:18,660 INFO L496 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:18,670 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:18,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:18,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:18,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:18,684 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 148 treesize of output 121 [2019-10-14 22:08:18,685 INFO L496 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:19,166 WARN L191 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2019-10-14 22:08:19,167 INFO L567 ElimStorePlain]: treesize reduction 95, result has 84.4 percent of original size [2019-10-14 22:08:19,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 7 dim-2 vars, End of recursive call: and 4 xjuncts. [2019-10-14 22:08:19,172 INFO L221 ElimStorePlain]: Needed 33 recursive calls to eliminate 11 variables, input treesize:962, output treesize:593 [2019-10-14 22:08:19,482 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-10-14 22:08:19,660 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-10-14 22:08:19,855 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-10-14 22:08:19,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:19,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-14 22:08:19,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-14 22:08:19,900 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_int_28|, v_prenex_3], 10=[v_prenex_1, v_prenex_2], 12=[|v_#memory_$Pointer$.base_25|, |v_#memory_$Pointer$.offset_25|], 39=[v_prenex_6], 46=[v_prenex_4, v_prenex_5]} [2019-10-14 22:08:19,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:19,911 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 181 treesize of output 146 [2019-10-14 22:08:19,912 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:20,697 WARN L191 SmtUtils]: Spent 784.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 162 [2019-10-14 22:08:20,698 INFO L567 ElimStorePlain]: treesize reduction 30, result has 97.3 percent of original size [2019-10-14 22:08:20,711 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:08:20,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 114 [2019-10-14 22:08:20,714 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:21,023 WARN L191 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2019-10-14 22:08:21,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:21,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:21,070 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:21,071 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 109 treesize of output 136 [2019-10-14 22:08:21,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:21,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:21,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:21,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:21,077 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:21,710 WARN L191 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 146 [2019-10-14 22:08:21,710 INFO L567 ElimStorePlain]: treesize reduction 36, result has 96.6 percent of original size [2019-10-14 22:08:21,724 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:21,725 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 42 [2019-10-14 22:08:21,727 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:22,028 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 134 [2019-10-14 22:08:22,029 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:22,037 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:22,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:22,082 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:22,083 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 146 treesize of output 171 [2019-10-14 22:08:22,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:22,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:22,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:22,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:22,089 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:22,681 WARN L191 SmtUtils]: Spent 591.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 124 [2019-10-14 22:08:22,681 INFO L567 ElimStorePlain]: treesize reduction 44, result has 95.3 percent of original size [2019-10-14 22:08:22,688 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:22,694 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:22,694 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 61 [2019-10-14 22:08:22,696 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:22,967 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification that was a NOOP. DAG size: 109 [2019-10-14 22:08:22,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:22,977 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:22,986 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 137 [2019-10-14 22:08:22,988 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:23,004 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:08:23,038 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:23,038 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 146 treesize of output 183 [2019-10-14 22:08:23,041 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:23,052 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:23,059 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 137 [2019-10-14 22:08:23,060 INFO L496 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:23,072 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:23,084 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 168 treesize of output 135 [2019-10-14 22:08:23,085 INFO L496 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:23,094 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:23,095 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 124 [2019-10-14 22:08:23,096 INFO L496 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:23,754 WARN L191 SmtUtils]: Spent 657.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 104 [2019-10-14 22:08:23,754 INFO L567 ElimStorePlain]: treesize reduction 86, result has 89.1 percent of original size [2019-10-14 22:08:23,762 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:23,819 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:23,820 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 135 treesize of output 158 [2019-10-14 22:08:23,822 INFO L496 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:23,836 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:23,885 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:23,885 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 133 treesize of output 156 [2019-10-14 22:08:23,886 INFO L496 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:23,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:23,953 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:23,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 127 treesize of output 150 [2019-10-14 22:08:23,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:23,961 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:23,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:23,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:23,965 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:23,967 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:23,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:23,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:23,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:23,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:23,977 INFO L496 ElimStorePlain]: Start of recursive call 15: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:23,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:24,056 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:24,056 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 135 treesize of output 158 [2019-10-14 22:08:24,059 INFO L496 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:24,073 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:24,115 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:24,115 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 122 treesize of output 149 [2019-10-14 22:08:24,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:24,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:24,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:24,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:24,120 INFO L496 ElimStorePlain]: Start of recursive call 17: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:24,399 WARN L191 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 88 [2019-10-14 22:08:24,400 INFO L567 ElimStorePlain]: treesize reduction 198, result has 66.3 percent of original size [2019-10-14 22:08:24,406 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:24,417 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 47 [2019-10-14 22:08:24,418 INFO L496 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:24,424 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:24,432 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 49 [2019-10-14 22:08:24,433 INFO L496 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:24,440 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:24,450 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 47 [2019-10-14 22:08:24,451 INFO L496 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:24,457 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:24,467 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 44 [2019-10-14 22:08:24,468 INFO L496 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:24,478 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:24,478 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 57 [2019-10-14 22:08:24,479 INFO L496 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:24,573 INFO L567 ElimStorePlain]: treesize reduction 35, result has 78.3 percent of original size [2019-10-14 22:08:24,575 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 9 dim-2 vars, End of recursive call: 2 dim-0 vars, and 5 xjuncts. [2019-10-14 22:08:24,575 INFO L221 ElimStorePlain]: Needed 22 recursive calls to eliminate 10 variables, input treesize:1165, output treesize:110 [2019-10-14 22:08:24,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-14 22:08:24,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:24,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:24,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:24,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:24,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:24,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:24,677 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:24,677 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2019-10-14 22:08:24,677 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056848943] [2019-10-14 22:08:24,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-14 22:08:24,678 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:24,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-14 22:08:24,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-10-14 22:08:24,679 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 15 states. [2019-10-14 22:08:25,106 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 56 [2019-10-14 22:08:25,251 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 53 [2019-10-14 22:08:25,779 WARN L191 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 60 [2019-10-14 22:08:25,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:25,861 INFO L93 Difference]: Finished difference Result 46 states and 59 transitions. [2019-10-14 22:08:25,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 22:08:25,863 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-10-14 22:08:25,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:25,864 INFO L225 Difference]: With dead ends: 46 [2019-10-14 22:08:25,864 INFO L226 Difference]: Without dead ends: 36 [2019-10-14 22:08:25,865 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=99, Invalid=321, Unknown=0, NotChecked=0, Total=420 [2019-10-14 22:08:25,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-14 22:08:25,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2019-10-14 22:08:25,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-14 22:08:25,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-10-14 22:08:25,871 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 18 [2019-10-14 22:08:25,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:25,871 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-10-14 22:08:25,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-14 22:08:25,871 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-10-14 22:08:25,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 22:08:25,872 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:25,872 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:26,073 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:26,074 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:26,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:26,074 INFO L82 PathProgramCache]: Analyzing trace with hash -442036043, now seen corresponding path program 1 times [2019-10-14 22:08:26,075 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:26,075 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345713431] [2019-10-14 22:08:26,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:26,075 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:26,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:26,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:26,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:26,330 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345713431] [2019-10-14 22:08:26,330 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1905867045] [2019-10-14 22:08:26,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:26,455 INFO L256 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-14 22:08:26,458 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:26,486 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-14 22:08:26,487 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 22:08:26,488 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:26,540 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:26,543 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_26|, |v_#memory_$Pointer$.offset_26|, |v_#memory_int_32|], 2=[|v_#memory_int_29|]} [2019-10-14 22:08:26,574 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:26,575 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-10-14 22:08:26,575 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:26,621 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:26,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:26,630 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-10-14 22:08:26,631 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:26,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:26,672 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:26,681 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2019-10-14 22:08:26,681 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:26,710 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:26,719 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:26,720 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-14 22:08:26,721 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:26,744 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:26,744 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:26,745 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:120, output treesize:74 [2019-10-14 22:08:26,838 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:26,839 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-14 22:08:26,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:27,152 WARN L191 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-10-14 22:08:27,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:27,156 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_30|, |v_#memory_int_31|], 6=[|v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.base_27|, |v_#memory_$Pointer$.offset_28|, |v_#memory_$Pointer$.offset_27|], 10=[|v_#memory_int_33|]} [2019-10-14 22:08:27,164 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:27,485 WARN L191 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-10-14 22:08:27,485 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:27,492 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:27,640 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-10-14 22:08:27,641 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:27,654 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:27,670 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2019-10-14 22:08:27,671 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:27,810 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-10-14 22:08:27,810 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:27,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:27,824 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:27,825 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 43 [2019-10-14 22:08:27,826 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:27,926 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-10-14 22:08:27,927 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:27,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:27,946 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2019-10-14 22:08:27,947 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:28,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:28,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:28,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:28,051 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 43 [2019-10-14 22:08:28,052 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:28,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:28,121 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:28,123 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:28,124 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:28,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:28,127 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 46 [2019-10-14 22:08:28,128 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:28,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:28,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 7 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:28,174 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 11 variables, input treesize:249, output treesize:144 [2019-10-14 22:08:28,284 INFO L392 ElimStorePlain]: Different costs {10=[|v_#memory_$Pointer$.offset_29|, |v_#memory_$Pointer$.base_29|], 12=[|v_#memory_int_34|]} [2019-10-14 22:08:28,292 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:28,293 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 117 treesize of output 87 [2019-10-14 22:08:28,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:28,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:28,295 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:28,342 INFO L567 ElimStorePlain]: treesize reduction 10, result has 90.8 percent of original size [2019-10-14 22:08:28,401 INFO L341 Elim1Store]: treesize reduction 10, result has 84.1 percent of original size [2019-10-14 22:08:28,401 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 81 treesize of output 94 [2019-10-14 22:08:28,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:28,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:28,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:28,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:28,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:28,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:28,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:28,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:28,407 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:28,445 INFO L567 ElimStorePlain]: treesize reduction 38, result has 55.8 percent of original size [2019-10-14 22:08:28,449 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-10-14 22:08:28,449 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:28,459 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:28,460 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:28,460 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:158, output treesize:19 [2019-10-14 22:08:28,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:28,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:28,491 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:28,491 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 13 [2019-10-14 22:08:28,491 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705028387] [2019-10-14 22:08:28,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-14 22:08:28,492 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:28,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-14 22:08:28,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-10-14 22:08:28,492 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 13 states. [2019-10-14 22:08:28,769 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 63 [2019-10-14 22:08:29,147 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 65 [2019-10-14 22:08:29,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:29,214 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2019-10-14 22:08:29,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 22:08:29,215 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2019-10-14 22:08:29,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:29,215 INFO L225 Difference]: With dead ends: 39 [2019-10-14 22:08:29,216 INFO L226 Difference]: Without dead ends: 32 [2019-10-14 22:08:29,216 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2019-10-14 22:08:29,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-14 22:08:29,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 22. [2019-10-14 22:08:29,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-14 22:08:29,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2019-10-14 22:08:29,221 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 18 [2019-10-14 22:08:29,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:29,221 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2019-10-14 22:08:29,222 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-14 22:08:29,222 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2019-10-14 22:08:29,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 22:08:29,222 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:29,222 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:29,425 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:29,426 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:29,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:29,427 INFO L82 PathProgramCache]: Analyzing trace with hash 389431748, now seen corresponding path program 1 times [2019-10-14 22:08:29,427 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:29,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652660540] [2019-10-14 22:08:29,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:29,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:29,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:29,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:29,716 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:29,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652660540] [2019-10-14 22:08:29,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1069872720] [2019-10-14 22:08:29,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:29,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-14 22:08:29,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:29,849 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-14 22:08:29,849 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:29,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:29,893 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_36|, |v_#memory_$Pointer$.base_30|, |v_#memory_$Pointer$.offset_30|], 2=[|v_#memory_int_35|]} [2019-10-14 22:08:29,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:29,911 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2019-10-14 22:08:29,911 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:29,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:29,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:29,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-10-14 22:08:29,943 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:29,966 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:29,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:29,977 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-10-14 22:08:29,978 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:29,997 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:30,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:30,002 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-14 22:08:30,003 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:30,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:30,022 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:30,023 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:105, output treesize:58 [2019-10-14 22:08:30,078 INFO L392 ElimStorePlain]: Different costs {10=[|v_#memory_$Pointer$.base_31|, |v_#memory_$Pointer$.offset_31|], 20=[|v_#memory_int_37|]} [2019-10-14 22:08:30,081 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:08:30,122 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:30,123 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 172 treesize of output 219 [2019-10-14 22:08:30,124 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:30,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:30,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:30,126 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:30,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:30,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:30,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:30,130 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 7 xjuncts. [2019-10-14 22:08:30,321 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-10-14 22:08:30,321 INFO L567 ElimStorePlain]: treesize reduction 1421, result has 9.5 percent of original size [2019-10-14 22:08:30,325 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:08:30,326 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 115 [2019-10-14 22:08:30,327 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:30,344 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:30,349 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 35 [2019-10-14 22:08:30,350 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:30,367 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:30,368 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:30,368 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:189, output treesize:60 [2019-10-14 22:08:30,468 INFO L392 ElimStorePlain]: Different costs {0=[|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|], 2=[|#memory_int|]} [2019-10-14 22:08:30,471 INFO L375 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 52 treesize of output 36 [2019-10-14 22:08:30,472 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:30,482 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:30,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2019-10-14 22:08:30,486 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:30,493 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:30,496 INFO L375 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 28 treesize of output 12 [2019-10-14 22:08:30,497 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:30,501 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:30,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:30,502 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:66, output treesize:3 [2019-10-14 22:08:30,526 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:30,527 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:30,527 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6] total 15 [2019-10-14 22:08:30,527 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193783853] [2019-10-14 22:08:30,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-14 22:08:30,528 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:30,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-14 22:08:30,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-10-14 22:08:30,528 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 15 states. [2019-10-14 22:08:31,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:31,798 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2019-10-14 22:08:31,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-14 22:08:31,798 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 20 [2019-10-14 22:08:31,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:31,799 INFO L225 Difference]: With dead ends: 64 [2019-10-14 22:08:31,799 INFO L226 Difference]: Without dead ends: 57 [2019-10-14 22:08:31,800 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=142, Invalid=560, Unknown=0, NotChecked=0, Total=702 [2019-10-14 22:08:31,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-14 22:08:31,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 44. [2019-10-14 22:08:31,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-14 22:08:31,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2019-10-14 22:08:31,808 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 20 [2019-10-14 22:08:31,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:31,809 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2019-10-14 22:08:31,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-14 22:08:31,809 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2019-10-14 22:08:31,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 22:08:31,809 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:31,809 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:32,010 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:32,011 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:32,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:32,011 INFO L82 PathProgramCache]: Analyzing trace with hash 391280712, now seen corresponding path program 1 times [2019-10-14 22:08:32,012 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:32,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133395623] [2019-10-14 22:08:32,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:32,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:32,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:32,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:32,501 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 48 [2019-10-14 22:08:32,762 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2019-10-14 22:08:32,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:32,826 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:32,826 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133395623] [2019-10-14 22:08:32,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [214361936] [2019-10-14 22:08:32,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:32,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 38 conjunts are in the unsatisfiable core [2019-10-14 22:08:32,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:32,960 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-14 22:08:32,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:32,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:32,995 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_39|, |v_#memory_$Pointer$.offset_32|, |v_#memory_$Pointer$.base_32|], 2=[|v_#memory_int_38|]} [2019-10-14 22:08:33,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:33,023 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2019-10-14 22:08:33,023 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:33,049 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:33,055 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:33,057 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-10-14 22:08:33,058 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:33,082 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:33,087 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:33,088 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-10-14 22:08:33,088 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:33,110 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:33,115 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:33,117 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-14 22:08:33,117 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:33,132 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:33,133 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:33,133 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:105, output treesize:58 [2019-10-14 22:08:33,201 INFO L392 ElimStorePlain]: Different costs {10=[|v_#memory_$Pointer$.offset_33|, |v_#memory_$Pointer$.base_33|], 20=[|v_#memory_int_40|]} [2019-10-14 22:08:33,204 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:08:33,206 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:33,208 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 156 treesize of output 121 [2019-10-14 22:08:33,209 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:33,236 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:33,239 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:08:33,280 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:33,281 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 111 treesize of output 180 [2019-10-14 22:08:33,282 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:33,339 INFO L567 ElimStorePlain]: treesize reduction 98, result has 47.0 percent of original size [2019-10-14 22:08:33,344 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 29 [2019-10-14 22:08:33,345 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:33,366 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:33,366 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:33,366 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:191, output treesize:66 [2019-10-14 22:08:33,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:33,518 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_34|, |v_#memory_$Pointer$.offset_34|], 12=[|v_#memory_int_41|]} [2019-10-14 22:08:33,521 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 49 [2019-10-14 22:08:33,522 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:33,551 INFO L567 ElimStorePlain]: treesize reduction 11, result has 87.1 percent of original size [2019-10-14 22:08:33,554 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 43 [2019-10-14 22:08:33,555 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:33,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:33,567 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 27 [2019-10-14 22:08:33,568 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:33,574 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:33,575 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:33,575 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:115, output treesize:19 [2019-10-14 22:08:33,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:33,613 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:33,613 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:33,613 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 17 [2019-10-14 22:08:33,613 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55655759] [2019-10-14 22:08:33,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-14 22:08:33,614 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:33,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-14 22:08:33,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2019-10-14 22:08:33,615 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 17 states. [2019-10-14 22:08:33,947 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 63 [2019-10-14 22:08:34,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:34,266 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2019-10-14 22:08:34,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 22:08:34,267 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 20 [2019-10-14 22:08:34,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:34,268 INFO L225 Difference]: With dead ends: 66 [2019-10-14 22:08:34,268 INFO L226 Difference]: Without dead ends: 29 [2019-10-14 22:08:34,269 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=128, Invalid=334, Unknown=0, NotChecked=0, Total=462 [2019-10-14 22:08:34,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-14 22:08:34,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2019-10-14 22:08:34,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-10-14 22:08:34,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2019-10-14 22:08:34,274 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 20 [2019-10-14 22:08:34,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:34,274 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2019-10-14 22:08:34,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-14 22:08:34,274 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2019-10-14 22:08:34,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-14 22:08:34,275 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:34,275 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:34,476 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:34,477 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:34,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:34,478 INFO L82 PathProgramCache]: Analyzing trace with hash -167613014, now seen corresponding path program 1 times [2019-10-14 22:08:34,478 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:34,478 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811282352] [2019-10-14 22:08:34,478 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:34,479 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:34,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:34,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:34,939 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:34,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811282352] [2019-10-14 22:08:34,940 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1195635476] [2019-10-14 22:08:34,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:35,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:35,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 48 conjunts are in the unsatisfiable core [2019-10-14 22:08:35,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:35,079 INFO L341 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-10-14 22:08:35,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 22:08:35,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:35,137 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:35,138 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_35|, |v_#memory_int_45|, |v_#memory_$Pointer$.offset_35|], 2=[|v_#memory_int_42|]} [2019-10-14 22:08:35,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:35,146 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-10-14 22:08:35,146 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:35,187 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:35,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:35,204 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2019-10-14 22:08:35,205 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:35,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:35,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:35,245 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-10-14 22:08:35,246 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:35,278 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:35,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:35,283 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2019-10-14 22:08:35,284 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:35,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:35,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:35,312 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:120, output treesize:74 [2019-10-14 22:08:35,401 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:35,401 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-14 22:08:35,402 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:35,619 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2019-10-14 22:08:35,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:35,621 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_44|, |v_#memory_int_43|], 6=[|v_#memory_$Pointer$.base_37|, |v_#memory_$Pointer$.base_36|, |v_#memory_$Pointer$.offset_37|, |v_#memory_$Pointer$.offset_36|], 10=[|v_#memory_int_46|]} [2019-10-14 22:08:35,627 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:35,775 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-10-14 22:08:35,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:35,780 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:35,934 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-10-14 22:08:35,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:35,948 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:35,969 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2019-10-14 22:08:35,970 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:36,122 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-10-14 22:08:36,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:36,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:36,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:36,141 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 43 [2019-10-14 22:08:36,142 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:36,241 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:36,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:36,269 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2019-10-14 22:08:36,270 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:36,338 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:36,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:36,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:36,355 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 43 [2019-10-14 22:08:36,355 INFO L496 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:36,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:36,419 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:36,421 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:36,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:36,423 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:36,425 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 46 [2019-10-14 22:08:36,425 INFO L496 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:36,471 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:36,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 7 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:36,473 INFO L221 ElimStorePlain]: Needed 9 recursive calls to eliminate 11 variables, input treesize:249, output treesize:144 [2019-10-14 22:08:36,581 INFO L392 ElimStorePlain]: Different costs {10=[|v_#memory_$Pointer$.base_38|, |v_#memory_$Pointer$.offset_38|], 12=[|v_#memory_int_47|]} [2019-10-14 22:08:36,585 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:36,620 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:36,621 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 133 treesize of output 148 [2019-10-14 22:08:36,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:36,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:36,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:36,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:36,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:36,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:36,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:36,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:36,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:36,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:36,628 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:36,722 INFO L567 ElimStorePlain]: treesize reduction 54, result has 62.2 percent of original size [2019-10-14 22:08:36,730 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:36,731 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 49 [2019-10-14 22:08:36,733 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:36,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:36,749 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 23 [2019-10-14 22:08:36,750 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:36,760 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:36,761 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:36,761 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:158, output treesize:25 [2019-10-14 22:08:36,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:36,900 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_39|, |v_#memory_$Pointer$.offset_39|], 20=[|v_#memory_int_48|]} [2019-10-14 22:08:36,903 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 47 [2019-10-14 22:08:36,904 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:36,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:36,920 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 29 [2019-10-14 22:08:36,921 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:36,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:37,085 WARN L191 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-10-14 22:08:37,085 INFO L341 Elim1Store]: treesize reduction 24, result has 85.0 percent of original size [2019-10-14 22:08:37,086 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 49 treesize of output 156 [2019-10-14 22:08:37,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:37,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:37,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:37,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:37,093 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:37,304 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 57 [2019-10-14 22:08:37,305 INFO L567 ElimStorePlain]: treesize reduction 126, result has 51.9 percent of original size [2019-10-14 22:08:37,305 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:37,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:37,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:37,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:37,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:37,310 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:37,311 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:95, output treesize:135 [2019-10-14 22:08:37,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:37,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:37,311 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:37,312 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:37,313 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:41,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:41,530 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:41,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:41,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:41,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:41,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:41,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:41,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:41,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:41,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:41,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:41,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:41,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:41,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:41,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:41,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:41,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:41,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 22:08:42,399 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:42,409 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:42,409 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:42,410 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2019-10-14 22:08:42,410 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334884204] [2019-10-14 22:08:42,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-14 22:08:42,410 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:42,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-14 22:08:42,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=251, Unknown=2, NotChecked=0, Total=306 [2019-10-14 22:08:42,411 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand 18 states. [2019-10-14 22:08:42,767 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 67 [2019-10-14 22:08:43,083 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 72