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/list-properties/splice-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:11:15,788 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:11:15,790 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:11:15,808 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:11:15,809 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:11:15,811 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:11:15,813 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:11:15,825 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:11:15,827 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:11:15,828 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:11:15,829 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:11:15,830 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:11:15,830 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:11:15,831 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:11:15,832 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:11:15,833 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:11:15,834 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:11:15,835 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:11:15,837 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:11:15,838 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:11:15,840 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:11:15,841 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:11:15,842 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:11:15,843 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:11:15,845 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:11:15,845 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:11:15,845 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:11:15,846 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:11:15,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:11:15,847 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:11:15,848 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:11:15,848 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:11:15,849 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:11:15,850 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:11:15,851 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:11:15,851 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:11:15,852 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:11:15,852 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:11:15,852 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:11:15,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:11:15,854 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:11:15,855 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 23:11:15,869 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:11:15,869 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:11:15,870 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:11:15,871 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:11:15,871 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:11:15,871 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:11:15,871 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:11:15,871 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:11:15,872 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:11:15,872 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:11:15,872 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:11:15,872 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:11:15,872 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:11:15,873 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:11:15,873 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:11:15,873 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:11:15,873 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:11:15,873 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:11:15,874 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:11:15,874 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:11:15,874 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:11:15,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:11:15,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:11:15,875 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:11:15,875 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:11:15,875 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:11:15,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:11:15,875 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:11:15,876 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:11:16,152 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:11:16,164 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:11:16,167 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:11:16,169 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:11:16,169 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:11:16,170 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/splice-2.i [2019-10-14 23:11:16,246 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65a7bfc24/78a8ed97ca16415291e9364dc96075ab/FLAGecbfaef53 [2019-10-14 23:11:16,814 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:11:16,815 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/splice-2.i [2019-10-14 23:11:16,826 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65a7bfc24/78a8ed97ca16415291e9364dc96075ab/FLAGecbfaef53 [2019-10-14 23:11:17,102 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65a7bfc24/78a8ed97ca16415291e9364dc96075ab [2019-10-14 23:11:17,112 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:11:17,114 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:11:17,115 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:11:17,115 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:11:17,118 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:11:17,119 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:11:17" (1/1) ... [2019-10-14 23:11:17,122 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7183b207 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:17, skipping insertion in model container [2019-10-14 23:11:17,122 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:11:17" (1/1) ... [2019-10-14 23:11:17,128 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:11:17,181 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:11:17,579 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:11:17,600 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:11:17,681 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:11:17,737 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:11:17,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:17 WrapperNode [2019-10-14 23:11:17,738 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:11:17,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:11:17,740 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:11:17,740 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:11:17,754 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:17" (1/1) ... [2019-10-14 23:11:17,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:17" (1/1) ... [2019-10-14 23:11:17,768 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:17" (1/1) ... [2019-10-14 23:11:17,768 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:17" (1/1) ... [2019-10-14 23:11:17,786 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:17" (1/1) ... [2019-10-14 23:11:17,793 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:17" (1/1) ... [2019-10-14 23:11:17,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:17" (1/1) ... [2019-10-14 23:11:17,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:11:17,805 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:11:17,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:11:17,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:11:17,806 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:17" (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 23:11:17,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:11:17,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:11:17,862 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-14 23:11:17,862 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-14 23:11:17,862 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-10-14 23:11:17,862 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-10-14 23:11:17,862 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-10-14 23:11:17,862 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-14 23:11:17,863 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:11:17,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:11:17,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:11:17,863 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-14 23:11:17,864 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-14 23:11:17,864 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-14 23:11:17,864 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-14 23:11:17,864 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-14 23:11:17,864 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-14 23:11:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-14 23:11:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-14 23:11:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-14 23:11:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-14 23:11:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-14 23:11:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-14 23:11:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-14 23:11:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-14 23:11:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-14 23:11:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-14 23:11:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-14 23:11:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-14 23:11:17,867 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-10-14 23:11:17,867 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-10-14 23:11:17,867 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-10-14 23:11:17,867 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-14 23:11:17,867 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-14 23:11:17,867 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-14 23:11:17,868 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-14 23:11:17,868 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-14 23:11:17,868 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-14 23:11:17,868 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-14 23:11:17,868 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-14 23:11:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-14 23:11:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-14 23:11:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-14 23:11:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-14 23:11:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-14 23:11:17,870 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-14 23:11:17,870 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-14 23:11:17,870 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-14 23:11:17,870 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-14 23:11:17,870 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-14 23:11:17,870 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-14 23:11:17,870 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-14 23:11:17,871 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-14 23:11:17,871 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-14 23:11:17,871 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-14 23:11:17,871 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-14 23:11:17,871 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-14 23:11:17,871 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-14 23:11:17,872 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-14 23:11:17,872 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-14 23:11:17,872 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-14 23:11:17,872 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-14 23:11:17,872 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-14 23:11:17,872 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-14 23:11:17,873 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-14 23:11:17,873 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-14 23:11:17,873 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 23:11:17,873 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-14 23:11:17,873 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-14 23:11:17,873 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-14 23:11:17,874 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-14 23:11:17,874 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-14 23:11:17,874 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-14 23:11:17,874 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-14 23:11:17,874 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-14 23:11:17,874 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-14 23:11:17,875 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-14 23:11:17,875 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-14 23:11:17,875 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 23:11:17,875 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-14 23:11:17,875 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-14 23:11:17,875 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-14 23:11:17,876 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-14 23:11:17,876 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-14 23:11:17,876 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-14 23:11:17,876 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-14 23:11:17,876 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-14 23:11:17,876 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-14 23:11:17,877 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-14 23:11:17,877 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-14 23:11:17,877 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-14 23:11:17,877 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-14 23:11:17,877 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-14 23:11:17,877 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-14 23:11:17,878 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-14 23:11:17,878 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-14 23:11:17,878 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-14 23:11:17,878 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-14 23:11:17,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-14 23:11:17,878 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-14 23:11:17,878 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-14 23:11:17,879 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-14 23:11:17,879 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-14 23:11:17,879 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-14 23:11:17,879 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-14 23:11:17,879 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-14 23:11:17,879 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-14 23:11:17,879 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-14 23:11:17,880 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-14 23:11:17,880 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-14 23:11:17,880 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-14 23:11:17,880 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-14 23:11:17,880 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-14 23:11:17,880 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-14 23:11:17,881 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-14 23:11:17,881 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-14 23:11:17,881 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-14 23:11:17,881 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-14 23:11:17,881 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-14 23:11:17,881 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:11:17,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 23:11:17,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 23:11:17,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-14 23:11:17,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-14 23:11:17,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 23:11:17,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:11:17,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:11:17,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 23:11:18,287 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-14 23:11:18,475 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:11:18,475 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-10-14 23:11:18,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:11:18 BoogieIcfgContainer [2019-10-14 23:11:18,477 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:11:18,478 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:11:18,478 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:11:18,481 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:11:18,482 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:11:17" (1/3) ... [2019-10-14 23:11:18,482 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b53016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:11:18, skipping insertion in model container [2019-10-14 23:11:18,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:11:17" (2/3) ... [2019-10-14 23:11:18,483 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b53016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:11:18, skipping insertion in model container [2019-10-14 23:11:18,483 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:11:18" (3/3) ... [2019-10-14 23:11:18,485 INFO L109 eAbstractionObserver]: Analyzing ICFG splice-2.i [2019-10-14 23:11:18,495 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:11:18,503 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:11:18,515 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:11:18,541 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:11:18,541 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:11:18,541 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:11:18,542 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:11:18,542 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:11:18,542 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:11:18,543 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:11:18,543 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:11:18,560 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-10-14 23:11:18,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-14 23:11:18,566 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:18,567 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:18,569 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:18,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:18,574 INFO L82 PathProgramCache]: Analyzing trace with hash 661731879, now seen corresponding path program 1 times [2019-10-14 23:11:18,582 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:18,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589385239] [2019-10-14 23:11:18,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:18,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:18,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:18,757 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 23:11:18,758 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589385239] [2019-10-14 23:11:18,759 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:11:18,759 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:11:18,759 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505783178] [2019-10-14 23:11:18,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:11:18,765 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:18,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:11:18,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:11:18,783 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2019-10-14 23:11:18,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:18,948 INFO L93 Difference]: Finished difference Result 54 states and 77 transitions. [2019-10-14 23:11:18,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:11:18,950 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-10-14 23:11:18,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:18,961 INFO L225 Difference]: With dead ends: 54 [2019-10-14 23:11:18,961 INFO L226 Difference]: Without dead ends: 27 [2019-10-14 23:11:18,969 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 23:11:18,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-14 23:11:19,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-14 23:11:19,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-14 23:11:19,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2019-10-14 23:11:19,027 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 16 [2019-10-14 23:11:19,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:19,028 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2019-10-14 23:11:19,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:11:19,028 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2019-10-14 23:11:19,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 23:11:19,030 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:19,031 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:19,032 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:19,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:19,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1973627133, now seen corresponding path program 1 times [2019-10-14 23:11:19,034 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:19,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968883988] [2019-10-14 23:11:19,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:19,035 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:19,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:19,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:19,197 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 23:11:19,197 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968883988] [2019-10-14 23:11:19,198 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:11:19,198 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:11:19,205 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727602063] [2019-10-14 23:11:19,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:11:19,207 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:19,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:11:19,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:11:19,208 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand 5 states. [2019-10-14 23:11:19,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:19,309 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2019-10-14 23:11:19,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:11:19,309 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-10-14 23:11:19,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:19,311 INFO L225 Difference]: With dead ends: 44 [2019-10-14 23:11:19,311 INFO L226 Difference]: Without dead ends: 37 [2019-10-14 23:11:19,312 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:11:19,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-14 23:11:19,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2019-10-14 23:11:19,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-14 23:11:19,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2019-10-14 23:11:19,319 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 18 [2019-10-14 23:11:19,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:19,320 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2019-10-14 23:11:19,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:11:19,320 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2019-10-14 23:11:19,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 23:11:19,321 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:19,321 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:19,321 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:19,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:19,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1721544590, now seen corresponding path program 1 times [2019-10-14 23:11:19,325 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:19,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783070047] [2019-10-14 23:11:19,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:19,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:19,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:19,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:19,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:19,459 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 23:11:19,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783070047] [2019-10-14 23:11:19,460 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:11:19,460 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:11:19,460 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870767987] [2019-10-14 23:11:19,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:11:19,462 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:19,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:11:19,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:11:19,463 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand 5 states. [2019-10-14 23:11:19,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:19,568 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2019-10-14 23:11:19,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:11:19,568 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-10-14 23:11:19,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:19,571 INFO L225 Difference]: With dead ends: 51 [2019-10-14 23:11:19,571 INFO L226 Difference]: Without dead ends: 43 [2019-10-14 23:11:19,571 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:11:19,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-14 23:11:19,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2019-10-14 23:11:19,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-14 23:11:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 53 transitions. [2019-10-14 23:11:19,579 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 53 transitions. Word has length 20 [2019-10-14 23:11:19,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:19,580 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 53 transitions. [2019-10-14 23:11:19,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:11:19,580 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 53 transitions. [2019-10-14 23:11:19,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-14 23:11:19,581 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:19,581 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:19,581 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:19,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:19,582 INFO L82 PathProgramCache]: Analyzing trace with hash -918584693, now seen corresponding path program 1 times [2019-10-14 23:11:19,582 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:19,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871578460] [2019-10-14 23:11:19,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:19,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:19,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:19,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:19,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:19,685 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871578460] [2019-10-14 23:11:19,685 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:11:19,685 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:11:19,686 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918588555] [2019-10-14 23:11:19,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:11:19,686 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:19,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:11:19,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:11:19,687 INFO L87 Difference]: Start difference. First operand 41 states and 53 transitions. Second operand 7 states. [2019-10-14 23:11:19,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:19,864 INFO L93 Difference]: Finished difference Result 74 states and 98 transitions. [2019-10-14 23:11:19,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:11:19,865 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-10-14 23:11:19,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:19,866 INFO L225 Difference]: With dead ends: 74 [2019-10-14 23:11:19,866 INFO L226 Difference]: Without dead ends: 47 [2019-10-14 23:11:19,867 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:11:19,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-14 23:11:19,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2019-10-14 23:11:19,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-14 23:11:19,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 55 transitions. [2019-10-14 23:11:19,878 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 55 transitions. Word has length 21 [2019-10-14 23:11:19,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:19,878 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 55 transitions. [2019-10-14 23:11:19,878 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:11:19,878 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 55 transitions. [2019-10-14 23:11:19,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-14 23:11:19,879 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:19,879 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:19,880 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:19,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:19,880 INFO L82 PathProgramCache]: Analyzing trace with hash -743556192, now seen corresponding path program 1 times [2019-10-14 23:11:19,880 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:19,881 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393245379] [2019-10-14 23:11:19,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:19,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:19,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:20,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:20,201 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:20,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393245379] [2019-10-14 23:11:20,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1620488259] [2019-10-14 23:11:20,203 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 23:11:20,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:20,352 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-14 23:11:20,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:20,444 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 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:11:20,445 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:20,454 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:20,455 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:20,455 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:11:20,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:11:20,514 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:20,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:20,525 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:20,525 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-14 23:11:20,572 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:20,572 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 11 treesize of output 15 [2019-10-14 23:11:20,573 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:20,585 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:20,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:20,586 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-10-14 23:11:20,622 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:20,625 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-14 23:11:20,625 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:20,632 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:20,632 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:20,633 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-10-14 23:11:20,667 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 23:11:20,668 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:20,683 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:20,685 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:20,685 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:22 [2019-10-14 23:11:20,826 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:20,827 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 23:11:20,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:20,837 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:20,838 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:20,838 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:41, output treesize:22 [2019-10-14 23:11:20,888 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 22 treesize of output 10 [2019-10-14 23:11:20,889 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:20,893 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:20,894 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:20,894 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-10-14 23:11:20,899 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:20,900 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:20,900 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 22 [2019-10-14 23:11:20,900 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453472196] [2019-10-14 23:11:20,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-10-14 23:11:20,901 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:20,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-10-14 23:11:20,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2019-10-14 23:11:20,902 INFO L87 Difference]: Start difference. First operand 43 states and 55 transitions. Second operand 22 states. [2019-10-14 23:11:22,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:22,040 INFO L93 Difference]: Finished difference Result 129 states and 168 transitions. [2019-10-14 23:11:22,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-14 23:11:22,041 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 27 [2019-10-14 23:11:22,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:22,043 INFO L225 Difference]: With dead ends: 129 [2019-10-14 23:11:22,043 INFO L226 Difference]: Without dead ends: 96 [2019-10-14 23:11:22,045 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=232, Invalid=1250, Unknown=0, NotChecked=0, Total=1482 [2019-10-14 23:11:22,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-14 23:11:22,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 63. [2019-10-14 23:11:22,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-14 23:11:22,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2019-10-14 23:11:22,055 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 27 [2019-10-14 23:11:22,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:22,056 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2019-10-14 23:11:22,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-10-14 23:11:22,056 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2019-10-14 23:11:22,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 23:11:22,057 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:22,057 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:22,260 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:22,261 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:22,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:22,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1592893925, now seen corresponding path program 1 times [2019-10-14 23:11:22,263 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:22,263 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811765327] [2019-10-14 23:11:22,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:22,263 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:22,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:22,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:22,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:22,511 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:22,511 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811765327] [2019-10-14 23:11:22,511 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810629167] [2019-10-14 23:11:22,511 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 23:11:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:22,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-14 23:11:22,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:22,650 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 23:11:22,650 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:22,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:22,661 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 23:11:22,662 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:22,667 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:22,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:22,667 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:22 [2019-10-14 23:11:22,691 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 15 treesize of output 7 [2019-10-14 23:11:22,692 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:22,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:22,703 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 15 treesize of output 7 [2019-10-14 23:11:22,703 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:22,707 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:22,708 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:22,708 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-10-14 23:11:22,711 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 23:11:22,711 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:22,711 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 10 [2019-10-14 23:11:22,712 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583039077] [2019-10-14 23:11:22,712 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:11:22,712 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:22,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:11:22,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:11:22,713 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand 10 states. [2019-10-14 23:11:23,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:23,037 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2019-10-14 23:11:23,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:11:23,037 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 29 [2019-10-14 23:11:23,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:23,038 INFO L225 Difference]: With dead ends: 76 [2019-10-14 23:11:23,038 INFO L226 Difference]: Without dead ends: 68 [2019-10-14 23:11:23,039 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2019-10-14 23:11:23,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-14 23:11:23,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2019-10-14 23:11:23,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-14 23:11:23,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2019-10-14 23:11:23,048 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 29 [2019-10-14 23:11:23,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:23,049 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2019-10-14 23:11:23,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:11:23,049 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2019-10-14 23:11:23,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 23:11:23,050 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:23,050 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:23,253 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:23,254 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:23,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:23,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1278392056, now seen corresponding path program 2 times [2019-10-14 23:11:23,255 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:23,255 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422083826] [2019-10-14 23:11:23,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:23,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:23,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:23,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:23,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:23,317 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 23:11:23,318 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422083826] [2019-10-14 23:11:23,318 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:11:23,318 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:11:23,318 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098014374] [2019-10-14 23:11:23,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:11:23,319 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:23,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:11:23,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:11:23,320 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 4 states. [2019-10-14 23:11:23,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:23,437 INFO L93 Difference]: Finished difference Result 112 states and 137 transitions. [2019-10-14 23:11:23,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:11:23,437 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2019-10-14 23:11:23,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:23,438 INFO L225 Difference]: With dead ends: 112 [2019-10-14 23:11:23,438 INFO L226 Difference]: Without dead ends: 70 [2019-10-14 23:11:23,439 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:11:23,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-14 23:11:23,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2019-10-14 23:11:23,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-10-14 23:11:23,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2019-10-14 23:11:23,447 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 30 [2019-10-14 23:11:23,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:23,448 INFO L462 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2019-10-14 23:11:23,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:11:23,448 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2019-10-14 23:11:23,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 23:11:23,449 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:23,449 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:23,450 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:23,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:23,450 INFO L82 PathProgramCache]: Analyzing trace with hash 496615306, now seen corresponding path program 1 times [2019-10-14 23:11:23,450 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:23,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94317176] [2019-10-14 23:11:23,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:23,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:23,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:23,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:23,815 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:23,815 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94317176] [2019-10-14 23:11:23,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [45780838] [2019-10-14 23:11:23,816 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 23:11:23,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:23,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-14 23:11:23,934 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:23,958 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 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:11:23,958 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:23,960 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:23,960 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:23,960 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-14 23:11:24,013 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:24,014 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 11 treesize of output 15 [2019-10-14 23:11:24,015 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:24,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:24,027 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:24,027 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-10-14 23:11:24,064 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 13 treesize of output 9 [2019-10-14 23:11:24,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:24,075 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:24,081 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 13 treesize of output 9 [2019-10-14 23:11:24,081 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:24,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:24,092 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:24,092 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:49, output treesize:29 [2019-10-14 23:11:24,132 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_22|], 2=[|v_#memory_$Pointer$.offset_20|, |v_#memory_$Pointer$.base_21|]} [2019-10-14 23:11:24,139 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 29 treesize of output 19 [2019-10-14 23:11:24,139 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:24,151 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:24,159 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 82 [2019-10-14 23:11:24,160 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:24,168 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:24,189 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:24,190 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 105 [2019-10-14 23:11:24,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:24,194 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:24,206 INFO L567 ElimStorePlain]: treesize reduction 48, result has 38.5 percent of original size [2019-10-14 23:11:24,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:24,207 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:130, output treesize:30 [2019-10-14 23:11:24,293 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 39 treesize of output 21 [2019-10-14 23:11:24,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:24,318 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:24,320 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-10-14 23:11:24,321 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:24,325 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:24,325 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:24,325 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:12 [2019-10-14 23:11:24,357 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-14 23:11:24,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:24,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:24,362 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:24,362 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:7 [2019-10-14 23:11:24,387 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 15 treesize of output 7 [2019-10-14 23:11:24,387 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:24,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:24,389 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:24,389 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2019-10-14 23:11:24,432 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:24,433 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:24,433 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 25 [2019-10-14 23:11:24,433 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930486356] [2019-10-14 23:11:24,433 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-14 23:11:24,434 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:24,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-14 23:11:24,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=543, Unknown=0, NotChecked=0, Total=600 [2019-10-14 23:11:24,435 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand 25 states. [2019-10-14 23:11:25,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:25,614 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2019-10-14 23:11:25,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-14 23:11:25,615 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 30 [2019-10-14 23:11:25,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:25,616 INFO L225 Difference]: With dead ends: 85 [2019-10-14 23:11:25,617 INFO L226 Difference]: Without dead ends: 64 [2019-10-14 23:11:25,618 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=187, Invalid=1373, Unknown=0, NotChecked=0, Total=1560 [2019-10-14 23:11:25,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-14 23:11:25,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 52. [2019-10-14 23:11:25,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-14 23:11:25,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2019-10-14 23:11:25,644 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 30 [2019-10-14 23:11:25,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:25,645 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2019-10-14 23:11:25,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-14 23:11:25,645 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2019-10-14 23:11:25,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-14 23:11:25,646 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:25,646 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:25,849 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:25,850 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:25,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:25,851 INFO L82 PathProgramCache]: Analyzing trace with hash 748997879, now seen corresponding path program 1 times [2019-10-14 23:11:25,851 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:25,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602928788] [2019-10-14 23:11:25,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:25,852 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:25,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:25,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:26,215 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:26,215 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602928788] [2019-10-14 23:11:26,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270811646] [2019-10-14 23:11:26,216 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 23:11:26,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:26,336 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 53 conjunts are in the unsatisfiable core [2019-10-14 23:11:26,338 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:26,355 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 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:11:26,355 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:26,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:26,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:26,369 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:11:26,425 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:11:26,425 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:26,437 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:26,438 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:26,438 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-14 23:11:26,478 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:26,478 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 11 treesize of output 15 [2019-10-14 23:11:26,479 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:26,489 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:26,490 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:26,490 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:21 [2019-10-14 23:11:26,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,505 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-14 23:11:26,505 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:26,511 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:26,512 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:26,512 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2019-10-14 23:11:26,540 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,543 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 23:11:26,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:26,550 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:26,550 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:26,550 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:22 [2019-10-14 23:11:26,609 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-10-14 23:11:26,610 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-10-14 23:11:26,610 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:26,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:26,619 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:26,619 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-10-14 23:11:26,684 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:26,685 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 26 treesize of output 68 [2019-10-14 23:11:26,686 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:26,728 INFO L567 ElimStorePlain]: treesize reduction 28, result has 59.4 percent of original size [2019-10-14 23:11:26,729 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:26,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:26,731 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:26,732 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:26,732 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:41 [2019-10-14 23:11:26,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:26,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:26,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:26,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:26,769 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:26,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:26,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:27,014 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:27,015 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 23:11:27,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:27,029 INFO L567 ElimStorePlain]: treesize reduction 4, result has 81.8 percent of original size [2019-10-14 23:11:27,030 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:27,030 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:41, output treesize:18 [2019-10-14 23:11:27,125 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:27,125 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2019-10-14 23:11:27,126 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:27,140 INFO L567 ElimStorePlain]: treesize reduction 4, result has 66.7 percent of original size [2019-10-14 23:11:27,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:27,140 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:3 [2019-10-14 23:11:27,145 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:27,145 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:27,146 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 29 [2019-10-14 23:11:27,146 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788495407] [2019-10-14 23:11:27,146 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-14 23:11:27,146 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:27,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-14 23:11:27,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=709, Unknown=0, NotChecked=0, Total=812 [2019-10-14 23:11:27,147 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand 29 states. [2019-10-14 23:11:29,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:29,343 INFO L93 Difference]: Finished difference Result 102 states and 114 transitions. [2019-10-14 23:11:29,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-14 23:11:29,344 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 33 [2019-10-14 23:11:29,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:29,345 INFO L225 Difference]: With dead ends: 102 [2019-10-14 23:11:29,345 INFO L226 Difference]: Without dead ends: 94 [2019-10-14 23:11:29,347 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 19 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 896 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=434, Invalid=2872, Unknown=0, NotChecked=0, Total=3306 [2019-10-14 23:11:29,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-14 23:11:29,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 71. [2019-10-14 23:11:29,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2019-10-14 23:11:29,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2019-10-14 23:11:29,356 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 33 [2019-10-14 23:11:29,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:29,356 INFO L462 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2019-10-14 23:11:29,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-14 23:11:29,357 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2019-10-14 23:11:29,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-14 23:11:29,358 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:29,358 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:29,561 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:29,562 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:29,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:29,563 INFO L82 PathProgramCache]: Analyzing trace with hash -621471021, now seen corresponding path program 1 times [2019-10-14 23:11:29,563 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:29,563 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670994850] [2019-10-14 23:11:29,563 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:29,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:29,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:29,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:29,965 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:29,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670994850] [2019-10-14 23:11:29,965 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [893743666] [2019-10-14 23:11:29,965 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 23:11:30,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:30,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-14 23:11:30,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:30,089 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 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:11:30,090 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:30,092 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:30,093 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:30,093 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:11:30,159 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:11:30,159 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:30,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:30,169 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:30,170 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2019-10-14 23:11:30,222 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:30,223 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:11:30,224 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:30,257 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.9 percent of original size [2019-10-14 23:11:30,257 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:30,258 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:31 [2019-10-14 23:11:30,298 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_23|], 2=[|v_#memory_int_31|]} [2019-10-14 23:11:30,304 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 23:11:30,304 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:30,322 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:30,327 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:30,329 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-14 23:11:30,329 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:30,345 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:30,346 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:30,346 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:46 [2019-10-14 23:11:30,430 INFO L341 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-10-14 23:11:30,430 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 46 treesize of output 32 [2019-10-14 23:11:30,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:30,465 INFO L567 ElimStorePlain]: treesize reduction 10, result has 81.8 percent of original size [2019-10-14 23:11:30,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2019-10-14 23:11:30,470 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:30,484 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:30,484 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:30,484 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:41 [2019-10-14 23:11:30,569 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:30,569 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 23:11:30,570 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:30,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:30,583 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:30,583 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:39 [2019-10-14 23:11:30,625 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_25|], 6=[|v_#memory_int_33|]} [2019-10-14 23:11:30,646 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:30,647 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 99 [2019-10-14 23:11:30,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:30,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:30,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-14 23:11:30,713 INFO L567 ElimStorePlain]: treesize reduction 110, result has 51.3 percent of original size [2019-10-14 23:11:30,718 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:30,719 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 108 treesize of output 77 [2019-10-14 23:11:30,720 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:30,739 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:30,741 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:30,741 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:125, output treesize:87 [2019-10-14 23:11:30,865 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:30,866 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 150 [2019-10-14 23:11:30,867 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:30,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:30,869 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:30,912 INFO L567 ElimStorePlain]: treesize reduction 148, result has 42.0 percent of original size [2019-10-14 23:11:30,919 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 56 treesize of output 46 [2019-10-14 23:11:30,920 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:30,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:30,933 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:30,933 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:158, output treesize:91 [2019-10-14 23:11:31,060 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:11:31,067 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:31,067 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 49 [2019-10-14 23:11:31,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:31,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:31,070 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 23:11:31,099 INFO L567 ElimStorePlain]: treesize reduction 16, result has 69.8 percent of original size [2019-10-14 23:11:31,100 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:31,100 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:88, output treesize:37 [2019-10-14 23:11:31,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:31,158 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2019-10-14 23:11:31,159 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:31,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:31,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:31,172 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:56, output treesize:37 [2019-10-14 23:11:31,291 INFO L341 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2019-10-14 23:11:31,292 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 1 case distinctions, treesize of input 41 treesize of output 37 [2019-10-14 23:11:31,293 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:31,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:31,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:31,309 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 6 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:31,309 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:56, output treesize:51 [2019-10-14 23:11:31,423 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 22 treesize of output 10 [2019-10-14 23:11:31,424 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:31,428 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:31,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:31,428 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-10-14 23:11:31,437 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:31,437 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:31,437 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2019-10-14 23:11:31,438 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777595445] [2019-10-14 23:11:31,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-14 23:11:31,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:31,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-14 23:11:31,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1001, Unknown=0, NotChecked=0, Total=1122 [2019-10-14 23:11:31,439 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 34 states. [2019-10-14 23:11:33,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:33,983 INFO L93 Difference]: Finished difference Result 124 states and 144 transitions. [2019-10-14 23:11:33,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-14 23:11:33,983 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 36 [2019-10-14 23:11:33,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:33,985 INFO L225 Difference]: With dead ends: 124 [2019-10-14 23:11:33,985 INFO L226 Difference]: Without dead ends: 122 [2019-10-14 23:11:33,987 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1017 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=454, Invalid=3578, Unknown=0, NotChecked=0, Total=4032 [2019-10-14 23:11:33,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-10-14 23:11:33,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 77. [2019-10-14 23:11:33,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-10-14 23:11:33,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 88 transitions. [2019-10-14 23:11:33,996 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 88 transitions. Word has length 36 [2019-10-14 23:11:33,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:33,996 INFO L462 AbstractCegarLoop]: Abstraction has 77 states and 88 transitions. [2019-10-14 23:11:33,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-10-14 23:11:33,997 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 88 transitions. [2019-10-14 23:11:33,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-14 23:11:33,998 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:33,998 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:34,206 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:34,207 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:34,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:34,208 INFO L82 PathProgramCache]: Analyzing trace with hash -234871608, now seen corresponding path program 1 times [2019-10-14 23:11:34,208 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:34,209 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635993246] [2019-10-14 23:11:34,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:34,209 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:34,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:34,285 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 23:11:34,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635993246] [2019-10-14 23:11:34,285 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972028529] [2019-10-14 23:11:34,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:34,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:34,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-14 23:11:34,453 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:34,471 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 23:11:34,471 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:34,471 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-14 23:11:34,471 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645692230] [2019-10-14 23:11:34,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 23:11:34,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:34,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 23:11:34,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:11:34,475 INFO L87 Difference]: Start difference. First operand 77 states and 88 transitions. Second operand 8 states. [2019-10-14 23:11:34,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:34,703 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2019-10-14 23:11:34,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:11:34,704 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2019-10-14 23:11:34,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:34,705 INFO L225 Difference]: With dead ends: 100 [2019-10-14 23:11:34,706 INFO L226 Difference]: Without dead ends: 95 [2019-10-14 23:11:34,707 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-10-14 23:11:34,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-14 23:11:34,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 82. [2019-10-14 23:11:34,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-14 23:11:34,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 93 transitions. [2019-10-14 23:11:34,723 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 93 transitions. Word has length 38 [2019-10-14 23:11:34,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:34,724 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 93 transitions. [2019-10-14 23:11:34,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 23:11:34,724 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 93 transitions. [2019-10-14 23:11:34,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-14 23:11:34,728 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:34,728 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:34,941 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:34,942 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:34,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:34,942 INFO L82 PathProgramCache]: Analyzing trace with hash -233161586, now seen corresponding path program 1 times [2019-10-14 23:11:34,942 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:34,942 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592893935] [2019-10-14 23:11:34,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:34,942 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:34,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:35,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:35,230 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 23:11:35,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592893935] [2019-10-14 23:11:35,230 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139394012] [2019-10-14 23:11:35,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:35,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:35,343 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 35 conjunts are in the unsatisfiable core [2019-10-14 23:11:35,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:35,353 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 23:11:35,354 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:35,363 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:35,365 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-10-14 23:11:35,365 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:35,375 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:35,375 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:35,376 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2019-10-14 23:11:35,410 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:35,410 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 48 [2019-10-14 23:11:35,411 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:35,439 INFO L567 ElimStorePlain]: treesize reduction 28, result has 58.8 percent of original size [2019-10-14 23:11:35,462 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:35,462 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 21 treesize of output 48 [2019-10-14 23:11:35,463 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:35,492 INFO L567 ElimStorePlain]: treesize reduction 28, result has 56.3 percent of original size [2019-10-14 23:11:35,493 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:35,494 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:36 [2019-10-14 23:11:35,521 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 15 treesize of output 7 [2019-10-14 23:11:35,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:35,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:35,530 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 15 treesize of output 7 [2019-10-14 23:11:35,530 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:35,533 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:35,534 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:35,534 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2019-10-14 23:11:35,538 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-14 23:11:35,539 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:35,539 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 12 [2019-10-14 23:11:35,539 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052565944] [2019-10-14 23:11:35,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-14 23:11:35,540 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:35,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-14 23:11:35,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-10-14 23:11:35,540 INFO L87 Difference]: Start difference. First operand 82 states and 93 transitions. Second operand 12 states. [2019-10-14 23:11:35,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:35,971 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2019-10-14 23:11:35,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-14 23:11:35,971 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2019-10-14 23:11:35,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:35,973 INFO L225 Difference]: With dead ends: 101 [2019-10-14 23:11:35,973 INFO L226 Difference]: Without dead ends: 94 [2019-10-14 23:11:35,973 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2019-10-14 23:11:35,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-14 23:11:35,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 84. [2019-10-14 23:11:35,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-10-14 23:11:35,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 96 transitions. [2019-10-14 23:11:35,983 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 96 transitions. Word has length 38 [2019-10-14 23:11:35,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:35,983 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 96 transitions. [2019-10-14 23:11:35,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-14 23:11:35,983 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2019-10-14 23:11:35,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-14 23:11:35,984 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:35,984 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:36,199 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:36,200 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:36,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:36,201 INFO L82 PathProgramCache]: Analyzing trace with hash -2076362507, now seen corresponding path program 2 times [2019-10-14 23:11:36,201 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:36,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765403699] [2019-10-14 23:11:36,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:36,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:36,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:36,961 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:36,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765403699] [2019-10-14 23:11:36,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933530832] [2019-10-14 23:11:36,962 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:37,084 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:11:37,084 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:11:37,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 69 conjunts are in the unsatisfiable core [2019-10-14 23:11:37,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:37,102 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 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:11:37,103 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:37,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:37,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:37,108 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:11:37,179 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:37,180 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:11:37,181 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:37,208 INFO L567 ElimStorePlain]: treesize reduction 14, result has 63.2 percent of original size [2019-10-14 23:11:37,209 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:37,209 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:24 [2019-10-14 23:11:37,254 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 13 treesize of output 9 [2019-10-14 23:11:37,255 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:37,272 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:37,276 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 13 treesize of output 9 [2019-10-14 23:11:37,277 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:37,293 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:37,294 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:37,294 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:62, output treesize:48 [2019-10-14 23:11:37,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:37,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-10-14 23:11:37,341 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:37,355 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:37,375 INFO L341 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-10-14 23:11:37,376 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 46 treesize of output 32 [2019-10-14 23:11:37,376 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:37,401 INFO L567 ElimStorePlain]: treesize reduction 10, result has 78.3 percent of original size [2019-10-14 23:11:37,402 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:37,402 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:78, output treesize:36 [2019-10-14 23:11:37,443 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:37,444 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 22 treesize of output 32 [2019-10-14 23:11:37,444 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:37,458 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:37,459 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:37,459 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:49 [2019-10-14 23:11:37,503 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 83 [2019-10-14 23:11:37,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:37,524 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:37,546 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:37,547 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 115 treesize of output 127 [2019-10-14 23:11:37,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:37,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:37,550 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-10-14 23:11:37,605 INFO L567 ElimStorePlain]: treesize reduction 120, result has 48.5 percent of original size [2019-10-14 23:11:37,606 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:37,606 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:132, output treesize:127 [2019-10-14 23:11:37,654 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_37|], 6=[|v_#memory_$Pointer$.offset_27|, |v_#memory_$Pointer$.base_32|]} [2019-10-14 23:11:37,664 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 65 treesize of output 43 [2019-10-14 23:11:37,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:37,694 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:37,740 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:37,741 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 5 new quantified variables, introduced 2 case distinctions, treesize of input 325 treesize of output 284 [2019-10-14 23:11:37,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:37,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:37,744 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:37,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:37,746 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-10-14 23:11:37,838 INFO L567 ElimStorePlain]: treesize reduction 688, result has 21.4 percent of original size [2019-10-14 23:11:37,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:37,878 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:37,878 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 176 treesize of output 150 [2019-10-14 23:11:37,880 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:37,881 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:37,921 INFO L567 ElimStorePlain]: treesize reduction 136, result has 46.2 percent of original size [2019-10-14 23:11:37,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:37,922 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:367, output treesize:117 [2019-10-14 23:11:38,095 INFO L392 ElimStorePlain]: Different costs {5=[|v_#memory_int_38|], 6=[|v_#memory_$Pointer$.offset_28|, |v_#memory_$Pointer$.base_33|]} [2019-10-14 23:11:38,146 INFO L341 Elim1Store]: treesize reduction 78, result has 49.0 percent of original size [2019-10-14 23:11:38,146 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 3 case distinctions, treesize of input 49 treesize of output 82 [2019-10-14 23:11:38,147 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:38,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:38,149 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:38,227 INFO L567 ElimStorePlain]: treesize reduction 18, result has 88.7 percent of original size [2019-10-14 23:11:38,259 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:38,260 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 108 [2019-10-14 23:11:38,261 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:38,357 INFO L567 ElimStorePlain]: treesize reduction 14, result has 90.1 percent of original size [2019-10-14 23:11:38,426 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:38,427 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 128 [2019-10-14 23:11:38,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:38,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:38,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:38,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:38,432 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 23:11:38,516 INFO L567 ElimStorePlain]: treesize reduction 62, result has 60.8 percent of original size [2019-10-14 23:11:38,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:38,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:38,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:38,523 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:38,523 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:136, output treesize:153 [2019-10-14 23:11:38,740 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:38,756 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 96 treesize of output 52 [2019-10-14 23:11:38,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:38,761 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 49 [2019-10-14 23:11:38,761 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:38,820 INFO L567 ElimStorePlain]: treesize reduction 4, result has 95.7 percent of original size [2019-10-14 23:11:38,824 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2019-10-14 23:11:38,824 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:38,827 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 31 [2019-10-14 23:11:38,828 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:38,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:38,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-10-14 23:11:38,855 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:170, output treesize:43 [2019-10-14 23:11:38,888 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-10-14 23:11:38,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:38,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:38,895 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:38,895 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:11 [2019-10-14 23:11:38,900 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 15 treesize of output 7 [2019-10-14 23:11:38,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:38,902 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:38,903 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:38,903 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:3 [2019-10-14 23:11:38,951 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:38,951 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:38,952 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 29 [2019-10-14 23:11:38,952 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065044646] [2019-10-14 23:11:38,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-14 23:11:38,952 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:38,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-14 23:11:38,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=735, Unknown=0, NotChecked=0, Total=812 [2019-10-14 23:11:38,953 INFO L87 Difference]: Start difference. First operand 84 states and 96 transitions. Second operand 29 states. [2019-10-14 23:11:56,278 WARN L191 SmtUtils]: Spent 16.10 s on a formula simplification. DAG size of input: 76 DAG size of output: 74 [2019-10-14 23:11:56,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:56,748 INFO L93 Difference]: Finished difference Result 119 states and 138 transitions. [2019-10-14 23:11:56,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-14 23:11:56,748 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 39 [2019-10-14 23:11:56,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:56,749 INFO L225 Difference]: With dead ends: 119 [2019-10-14 23:11:56,749 INFO L226 Difference]: Without dead ends: 105 [2019-10-14 23:11:56,751 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=186, Invalid=1536, Unknown=0, NotChecked=0, Total=1722 [2019-10-14 23:11:56,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-10-14 23:11:56,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 94. [2019-10-14 23:11:56,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-14 23:11:56,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 106 transitions. [2019-10-14 23:11:56,758 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 106 transitions. Word has length 39 [2019-10-14 23:11:56,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:56,758 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 106 transitions. [2019-10-14 23:11:56,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-14 23:11:56,758 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 106 transitions. [2019-10-14 23:11:56,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-14 23:11:56,760 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:56,760 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:56,963 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:56,964 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:56,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:56,965 INFO L82 PathProgramCache]: Analyzing trace with hash -731659325, now seen corresponding path program 1 times [2019-10-14 23:11:56,965 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:56,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752775918] [2019-10-14 23:11:56,965 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:56,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:56,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:57,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:57,607 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:11:57,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752775918] [2019-10-14 23:11:57,607 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887408779] [2019-10-14 23:11:57,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:57,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:57,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 74 conjunts are in the unsatisfiable core [2019-10-14 23:11:57,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:57,748 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 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:11:57,748 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:57,752 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:57,753 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:57,753 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:11:57,830 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:57,830 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:11:57,831 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:57,861 INFO L567 ElimStorePlain]: treesize reduction 14, result has 65.9 percent of original size [2019-10-14 23:11:57,861 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:57,861 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:27 [2019-10-14 23:11:57,906 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 13 treesize of output 9 [2019-10-14 23:11:57,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:57,924 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:57,929 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 13 treesize of output 9 [2019-10-14 23:11:57,929 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:57,945 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:57,946 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:57,946 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:62, output treesize:57 [2019-10-14 23:11:57,995 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_40|], 2=[|v_#memory_$Pointer$.base_35|, |v_#memory_$Pointer$.offset_30|]} [2019-10-14 23:11:58,001 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-14 23:11:58,001 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:58,028 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:58,035 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:58,036 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 22 [2019-10-14 23:11:58,036 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:58,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:58,063 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:58,064 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 16 [2019-10-14 23:11:58,064 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:58,084 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:58,084 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:58,084 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:98, output treesize:58 [2019-10-14 23:11:58,147 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:58,147 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 22 treesize of output 32 [2019-10-14 23:11:58,148 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:58,162 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:58,162 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:58,163 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:63, output treesize:56 [2019-10-14 23:11:58,213 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:11:58,224 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:58,225 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 132 [2019-10-14 23:11:58,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:58,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:58,282 INFO L567 ElimStorePlain]: treesize reduction 30, result has 84.8 percent of original size [2019-10-14 23:11:58,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:58,288 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 23 [2019-10-14 23:11:58,289 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:58,312 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:58,338 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:58,339 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 102 treesize of output 116 [2019-10-14 23:11:58,339 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:58,388 INFO L567 ElimStorePlain]: treesize reduction 42, result has 65.3 percent of original size [2019-10-14 23:11:58,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:58,389 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:188, output treesize:73 [2019-10-14 23:11:58,440 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_32|, |v_#memory_int_42|], 6=[|v_#memory_$Pointer$.base_37|]} [2019-10-14 23:11:58,446 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 13 [2019-10-14 23:11:58,446 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:58,467 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:58,470 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2019-10-14 23:11:58,471 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:58,490 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:58,496 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:11:58,536 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:58,537 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 126 [2019-10-14 23:11:58,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:58,539 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:58,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:58,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:58,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:58,541 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:58,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:58,542 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:58,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:58,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:58,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:58,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:58,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:58,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:58,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:58,547 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:58,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:58,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:58,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:58,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:58,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:58,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:58,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:58,552 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 7 xjuncts. [2019-10-14 23:11:58,632 INFO L567 ElimStorePlain]: treesize reduction 781, result has 9.1 percent of original size [2019-10-14 23:11:58,633 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 23:11:58,633 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:181, output treesize:77 [2019-10-14 23:11:58,739 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|], 5=[|#memory_$Pointer$.base|]} [2019-10-14 23:11:58,756 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:11:58,757 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2019-10-14 23:11:58,757 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:58,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:58,779 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:11:58,792 INFO L341 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2019-10-14 23:11:58,793 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 40 [2019-10-14 23:11:58,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:58,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:58,795 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 23:11:58,825 INFO L567 ElimStorePlain]: treesize reduction 4, result has 89.2 percent of original size [2019-10-14 23:11:58,826 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:58,826 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:83, output treesize:33 [2019-10-14 23:11:58,889 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 34 treesize of output 21 [2019-10-14 23:11:58,890 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:58,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:58,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:58,930 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:52, output treesize:25 [2019-10-14 23:11:59,041 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:59,043 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 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 23:11:59,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:59,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:59,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:59,055 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:44, output treesize:25 [2019-10-14 23:11:59,356 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 22 treesize of output 10 [2019-10-14 23:11:59,357 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:59,361 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:59,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:59,361 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2019-10-14 23:11:59,375 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:11:59,375 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:59,375 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18] total 34 [2019-10-14 23:11:59,376 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7829713] [2019-10-14 23:11:59,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-14 23:11:59,376 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:59,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-14 23:11:59,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1008, Unknown=0, NotChecked=0, Total=1122 [2019-10-14 23:11:59,377 INFO L87 Difference]: Start difference. First operand 94 states and 106 transitions. Second operand 34 states.