/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-ext3-properties/sll_of_sll_nondet_append-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 21:15:03,000 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:15:03,004 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:15:03,023 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:15:03,023 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:15:03,025 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:15:03,027 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:15:03,037 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:15:03,041 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:15:03,044 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:15:03,046 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:15:03,048 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:15:03,049 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:15:03,051 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:15:03,053 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:15:03,055 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:15:03,056 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:15:03,057 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:15:03,059 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:15:03,064 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:15:03,068 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:15:03,071 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:15:03,074 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:15:03,074 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:15:03,077 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:15:03,077 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:15:03,077 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:15:03,079 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:15:03,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:15:03,081 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:15:03,081 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:15:03,083 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:15:03,084 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:15:03,085 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:15:03,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:15:03,087 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:15:03,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:15:03,088 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:15:03,088 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:15:03,089 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:15:03,089 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:15:03,090 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 21:15:03,119 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:15:03,120 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:15:03,121 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:15:03,121 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:15:03,121 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:15:03,122 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:15:03,122 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:15:03,122 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:15:03,122 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:15:03,122 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:15:03,122 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:15:03,123 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:15:03,123 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:15:03,123 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:15:03,123 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:15:03,123 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:15:03,124 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:15:03,124 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:15:03,124 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:15:03,124 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:15:03,124 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:15:03,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:15:03,125 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:15:03,125 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:15:03,125 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:15:03,125 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:15:03,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:15:03,126 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:15:03,126 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:15:03,413 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:15:03,426 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:15:03,430 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:15:03,431 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:15:03,432 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:15:03,433 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_of_sll_nondet_append-2.i [2019-11-06 21:15:03,511 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fce6b992/5dd3d69a1dc44af48a32940198d950fa/FLAG4de229b76 [2019-11-06 21:15:04,091 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:15:04,093 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_of_sll_nondet_append-2.i [2019-11-06 21:15:04,112 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fce6b992/5dd3d69a1dc44af48a32940198d950fa/FLAG4de229b76 [2019-11-06 21:15:04,364 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9fce6b992/5dd3d69a1dc44af48a32940198d950fa [2019-11-06 21:15:04,375 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:15:04,377 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:15:04,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:15:04,379 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:15:04,383 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:15:04,384 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:15:04" (1/1) ... [2019-11-06 21:15:04,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@498fa5e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:04, skipping insertion in model container [2019-11-06 21:15:04,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:15:04" (1/1) ... [2019-11-06 21:15:04,395 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:15:04,439 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:15:04,872 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:15:04,883 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:15:04,934 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:15:05,016 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:15:05,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:05 WrapperNode [2019-11-06 21:15:05,018 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:15:05,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:15:05,019 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:15:05,019 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:15:05,032 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:05" (1/1) ... [2019-11-06 21:15:05,033 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:05" (1/1) ... [2019-11-06 21:15:05,053 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:05" (1/1) ... [2019-11-06 21:15:05,053 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:05" (1/1) ... [2019-11-06 21:15:05,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:05" (1/1) ... [2019-11-06 21:15:05,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:05" (1/1) ... [2019-11-06 21:15:05,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:05" (1/1) ... [2019-11-06 21:15:05,093 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:15:05,094 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:15:05,094 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:15:05,094 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:15:05,095 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:15:05,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:15:05,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:15:05,160 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-06 21:15:05,160 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-06 21:15:05,160 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-06 21:15:05,161 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-11-06 21:15:05,161 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create_with_sublist [2019-11-06 21:15:05,161 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2019-11-06 21:15:05,161 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2019-11-06 21:15:05,162 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_hierarchical_destroy [2019-11-06 21:15:05,162 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:15:05,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:15:05,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 21:15:05,162 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-06 21:15:05,163 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-06 21:15:05,163 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-06 21:15:05,163 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-06 21:15:05,163 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-06 21:15:05,163 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-06 21:15:05,163 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-06 21:15:05,164 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-06 21:15:05,164 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-06 21:15:05,164 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-06 21:15:05,164 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-06 21:15:05,164 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-06 21:15:05,164 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-06 21:15:05,165 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-06 21:15:05,165 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-06 21:15:05,165 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-06 21:15:05,165 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-06 21:15:05,165 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-06 21:15:05,165 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-06 21:15:05,166 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-06 21:15:05,166 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-06 21:15:05,166 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-06 21:15:05,166 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-06 21:15:05,166 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-06 21:15:05,166 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-06 21:15:05,166 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-06 21:15:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-06 21:15:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-06 21:15:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-06 21:15:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-06 21:15:05,167 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-06 21:15:05,168 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-06 21:15:05,168 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-06 21:15:05,168 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-06 21:15:05,168 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-06 21:15:05,168 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-06 21:15:05,168 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-06 21:15:05,168 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-06 21:15:05,169 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-06 21:15:05,169 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-06 21:15:05,169 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-06 21:15:05,169 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-06 21:15:05,169 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-06 21:15:05,169 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-06 21:15:05,170 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-06 21:15:05,170 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-06 21:15:05,170 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-06 21:15:05,170 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-06 21:15:05,170 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-06 21:15:05,170 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-06 21:15:05,170 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-06 21:15:05,171 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-06 21:15:05,171 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 21:15:05,171 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-06 21:15:05,171 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-06 21:15:05,171 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-06 21:15:05,171 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-06 21:15:05,172 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-06 21:15:05,172 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-06 21:15:05,172 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-06 21:15:05,172 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-06 21:15:05,172 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-06 21:15:05,172 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-06 21:15:05,173 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-06 21:15:05,173 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-06 21:15:05,173 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 21:15:05,173 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-06 21:15:05,173 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-06 21:15:05,173 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-06 21:15:05,173 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-06 21:15:05,174 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-06 21:15:05,174 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-06 21:15:05,174 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-06 21:15:05,174 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-06 21:15:05,174 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-06 21:15:05,174 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-06 21:15:05,175 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-06 21:15:05,175 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-06 21:15:05,175 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-06 21:15:05,175 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-06 21:15:05,175 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-06 21:15:05,175 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-06 21:15:05,175 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-06 21:15:05,176 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-06 21:15:05,176 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-06 21:15:05,176 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-06 21:15:05,176 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-06 21:15:05,176 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-06 21:15:05,176 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-06 21:15:05,177 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-06 21:15:05,177 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-06 21:15:05,177 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-06 21:15:05,177 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-06 21:15:05,177 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-06 21:15:05,177 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-06 21:15:05,177 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-06 21:15:05,178 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-06 21:15:05,178 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-06 21:15:05,178 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-06 21:15:05,178 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-06 21:15:05,178 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-06 21:15:05,178 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-06 21:15:05,178 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-06 21:15:05,179 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-06 21:15:05,179 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-06 21:15:05,179 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-06 21:15:05,179 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-11-06 21:15:05,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 21:15:05,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-06 21:15:05,180 INFO L130 BoogieDeclarations]: Found specification of procedure node_create_with_sublist [2019-11-06 21:15:05,180 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2019-11-06 21:15:05,180 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-06 21:15:05,180 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2019-11-06 21:15:05,180 INFO L130 BoogieDeclarations]: Found specification of procedure sll_hierarchical_destroy [2019-11-06 21:15:05,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 21:15:05,180 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:15:05,181 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-06 21:15:05,181 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-06 21:15:05,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:15:05,181 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:15:05,553 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-06 21:15:05,824 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:15:05,825 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-06 21:15:05,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:15:05 BoogieIcfgContainer [2019-11-06 21:15:05,826 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:15:05,828 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:15:05,828 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:15:05,831 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:15:05,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:15:04" (1/3) ... [2019-11-06 21:15:05,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5edc14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:15:05, skipping insertion in model container [2019-11-06 21:15:05,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:15:05" (2/3) ... [2019-11-06 21:15:05,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f5edc14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:15:05, skipping insertion in model container [2019-11-06 21:15:05,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:15:05" (3/3) ... [2019-11-06 21:15:05,835 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-2.i [2019-11-06 21:15:05,845 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:15:05,854 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 21:15:05,866 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 21:15:05,893 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:15:05,893 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:15:05,893 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:15:05,893 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:15:05,894 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:15:05,894 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:15:05,894 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:15:05,894 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:15:05,915 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states. [2019-11-06 21:15:05,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-06 21:15:05,923 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:05,924 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:05,926 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:05,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:05,933 INFO L82 PathProgramCache]: Analyzing trace with hash 655141366, now seen corresponding path program 1 times [2019-11-06 21:15:05,943 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:05,943 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874937661] [2019-11-06 21:15:05,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:06,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:06,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:06,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:06,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:06,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:06,232 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874937661] [2019-11-06 21:15:06,233 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:15:06,233 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 21:15:06,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416435381] [2019-11-06 21:15:06,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 21:15:06,240 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:06,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 21:15:06,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:15:06,256 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 4 states. [2019-11-06 21:15:06,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:06,558 INFO L93 Difference]: Finished difference Result 143 states and 207 transitions. [2019-11-06 21:15:06,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:15:06,560 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-11-06 21:15:06,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:06,571 INFO L225 Difference]: With dead ends: 143 [2019-11-06 21:15:06,571 INFO L226 Difference]: Without dead ends: 57 [2019-11-06 21:15:06,576 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:15:06,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-06 21:15:06,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 53. [2019-11-06 21:15:06,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-06 21:15:06,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2019-11-06 21:15:06,641 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 29 [2019-11-06 21:15:06,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:06,642 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2019-11-06 21:15:06,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 21:15:06,642 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2019-11-06 21:15:06,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-06 21:15:06,644 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:06,644 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:06,645 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:06,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:06,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1740250704, now seen corresponding path program 1 times [2019-11-06 21:15:06,646 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:06,646 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100894984] [2019-11-06 21:15:06,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:06,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:06,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:06,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:06,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:06,798 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100894984] [2019-11-06 21:15:06,799 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:15:06,799 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:15:06,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952489276] [2019-11-06 21:15:06,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:15:06,802 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:06,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:15:06,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:15:06,803 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand 5 states. [2019-11-06 21:15:07,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:07,002 INFO L93 Difference]: Finished difference Result 104 states and 129 transitions. [2019-11-06 21:15:07,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 21:15:07,003 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-06 21:15:07,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:07,005 INFO L225 Difference]: With dead ends: 104 [2019-11-06 21:15:07,005 INFO L226 Difference]: Without dead ends: 64 [2019-11-06 21:15:07,006 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-11-06 21:15:07,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-06 21:15:07,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2019-11-06 21:15:07,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-06 21:15:07,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2019-11-06 21:15:07,021 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 66 transitions. Word has length 29 [2019-11-06 21:15:07,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:07,022 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 66 transitions. [2019-11-06 21:15:07,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:15:07,022 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 66 transitions. [2019-11-06 21:15:07,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-06 21:15:07,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:07,023 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:07,024 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:07,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:07,024 INFO L82 PathProgramCache]: Analyzing trace with hash 470407865, now seen corresponding path program 1 times [2019-11-06 21:15:07,024 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:07,025 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398323671] [2019-11-06 21:15:07,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:07,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:07,310 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398323671] [2019-11-06 21:15:07,311 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467178067] [2019-11-06 21:15:07,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:07,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:07,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-06 21:15:07,533 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:07,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:07,641 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:07,641 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 4] total 14 [2019-11-06 21:15:07,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172401403] [2019-11-06 21:15:07,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-06 21:15:07,642 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:07,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-06 21:15:07,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-11-06 21:15:07,643 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. Second operand 14 states. [2019-11-06 21:15:08,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:08,271 INFO L93 Difference]: Finished difference Result 136 states and 177 transitions. [2019-11-06 21:15:08,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 21:15:08,271 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2019-11-06 21:15:08,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:08,273 INFO L225 Difference]: With dead ends: 136 [2019-11-06 21:15:08,273 INFO L226 Difference]: Without dead ends: 89 [2019-11-06 21:15:08,275 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-11-06 21:15:08,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-11-06 21:15:08,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 85. [2019-11-06 21:15:08,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-11-06 21:15:08,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 111 transitions. [2019-11-06 21:15:08,300 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 111 transitions. Word has length 34 [2019-11-06 21:15:08,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:08,300 INFO L462 AbstractCegarLoop]: Abstraction has 85 states and 111 transitions. [2019-11-06 21:15:08,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-06 21:15:08,300 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 111 transitions. [2019-11-06 21:15:08,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-06 21:15:08,304 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:08,305 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:08,506 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:08,506 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:08,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:08,507 INFO L82 PathProgramCache]: Analyzing trace with hash -103581828, now seen corresponding path program 1 times [2019-11-06 21:15:08,508 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:08,508 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019359527] [2019-11-06 21:15:08,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:08,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:08,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:08,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:08,820 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:15:08,821 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019359527] [2019-11-06 21:15:08,821 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [379663303] [2019-11-06 21:15:08,821 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-11-06 21:15:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:08,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-06 21:15:08,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:09,034 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 21:15:09,035 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:09,035 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 5] total 20 [2019-11-06 21:15:09,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128363978] [2019-11-06 21:15:09,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-06 21:15:09,036 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:09,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-06 21:15:09,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-11-06 21:15:09,039 INFO L87 Difference]: Start difference. First operand 85 states and 111 transitions. Second operand 20 states. [2019-11-06 21:15:09,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:09,737 INFO L93 Difference]: Finished difference Result 207 states and 288 transitions. [2019-11-06 21:15:09,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-06 21:15:09,738 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 42 [2019-11-06 21:15:09,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:09,746 INFO L225 Difference]: With dead ends: 207 [2019-11-06 21:15:09,746 INFO L226 Difference]: Without dead ends: 129 [2019-11-06 21:15:09,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=611, Unknown=0, NotChecked=0, Total=702 [2019-11-06 21:15:09,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-06 21:15:09,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 108. [2019-11-06 21:15:09,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-06 21:15:09,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 145 transitions. [2019-11-06 21:15:09,782 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 145 transitions. Word has length 42 [2019-11-06 21:15:09,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:09,782 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 145 transitions. [2019-11-06 21:15:09,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-06 21:15:09,782 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 145 transitions. [2019-11-06 21:15:09,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-06 21:15:09,787 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:09,787 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:09,988 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:09,989 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:09,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:09,989 INFO L82 PathProgramCache]: Analyzing trace with hash -2115179085, now seen corresponding path program 2 times [2019-11-06 21:15:09,990 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:09,990 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313052758] [2019-11-06 21:15:09,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:10,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:10,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:10,271 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-06 21:15:10,271 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313052758] [2019-11-06 21:15:10,271 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551374384] [2019-11-06 21:15:10,271 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 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-11-06 21:15:10,378 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-06 21:15:10,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:15:10,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 21:15:10,382 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:10,441 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-06 21:15:10,442 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 21:15:10,442 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [15] total 17 [2019-11-06 21:15:10,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077351495] [2019-11-06 21:15:10,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 21:15:10,443 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:10,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 21:15:10,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2019-11-06 21:15:10,443 INFO L87 Difference]: Start difference. First operand 108 states and 145 transitions. Second operand 4 states. [2019-11-06 21:15:10,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:10,515 INFO L93 Difference]: Finished difference Result 122 states and 163 transitions. [2019-11-06 21:15:10,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 21:15:10,515 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-06 21:15:10,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:10,519 INFO L225 Difference]: With dead ends: 122 [2019-11-06 21:15:10,519 INFO L226 Difference]: Without dead ends: 120 [2019-11-06 21:15:10,522 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-11-06 21:15:10,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-06 21:15:10,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 110. [2019-11-06 21:15:10,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-06 21:15:10,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 147 transitions. [2019-11-06 21:15:10,559 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 147 transitions. Word has length 47 [2019-11-06 21:15:10,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:10,560 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 147 transitions. [2019-11-06 21:15:10,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 21:15:10,560 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 147 transitions. [2019-11-06 21:15:10,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-06 21:15:10,567 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:10,567 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:10,768 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:10,768 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:10,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:10,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1014353226, now seen corresponding path program 1 times [2019-11-06 21:15:10,769 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:10,769 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311983864] [2019-11-06 21:15:10,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:10,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:10,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:10,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:10,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:10,850 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-06 21:15:10,851 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311983864] [2019-11-06 21:15:10,851 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:15:10,851 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:15:10,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918885485] [2019-11-06 21:15:10,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:15:10,852 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:10,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:15:10,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:15:10,853 INFO L87 Difference]: Start difference. First operand 110 states and 147 transitions. Second operand 5 states. [2019-11-06 21:15:10,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:10,985 INFO L93 Difference]: Finished difference Result 129 states and 172 transitions. [2019-11-06 21:15:10,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 21:15:10,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-11-06 21:15:10,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:10,988 INFO L225 Difference]: With dead ends: 129 [2019-11-06 21:15:10,988 INFO L226 Difference]: Without dead ends: 113 [2019-11-06 21:15:10,988 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-11-06 21:15:10,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-06 21:15:11,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2019-11-06 21:15:11,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-06 21:15:11,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 148 transitions. [2019-11-06 21:15:11,007 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 148 transitions. Word has length 51 [2019-11-06 21:15:11,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:11,007 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 148 transitions. [2019-11-06 21:15:11,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:15:11,008 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 148 transitions. [2019-11-06 21:15:11,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-06 21:15:11,011 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:11,011 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:11,012 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:11,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:11,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1112701260, now seen corresponding path program 1 times [2019-11-06 21:15:11,013 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:11,013 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868747247] [2019-11-06 21:15:11,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:11,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:11,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:11,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:11,303 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-06 21:15:11,303 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868747247] [2019-11-06 21:15:11,304 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2076282916] [2019-11-06 21:15:11,304 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-11-06 21:15:11,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:11,453 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-06 21:15:11,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:11,554 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-06 21:15:11,555 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:11,556 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 16 [2019-11-06 21:15:11,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014209650] [2019-11-06 21:15:11,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-06 21:15:11,558 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:11,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-06 21:15:11,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-11-06 21:15:11,559 INFO L87 Difference]: Start difference. First operand 111 states and 148 transitions. Second operand 16 states. [2019-11-06 21:15:11,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:11,983 INFO L93 Difference]: Finished difference Result 134 states and 176 transitions. [2019-11-06 21:15:11,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 21:15:11,983 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2019-11-06 21:15:11,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:11,985 INFO L225 Difference]: With dead ends: 134 [2019-11-06 21:15:11,985 INFO L226 Difference]: Without dead ends: 114 [2019-11-06 21:15:11,986 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2019-11-06 21:15:11,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-06 21:15:11,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 98. [2019-11-06 21:15:11,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-11-06 21:15:11,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 129 transitions. [2019-11-06 21:15:11,995 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 129 transitions. Word has length 58 [2019-11-06 21:15:11,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:11,996 INFO L462 AbstractCegarLoop]: Abstraction has 98 states and 129 transitions. [2019-11-06 21:15:11,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-06 21:15:11,996 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 129 transitions. [2019-11-06 21:15:11,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-06 21:15:11,997 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:11,997 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:12,209 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:12,209 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:12,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:12,209 INFO L82 PathProgramCache]: Analyzing trace with hash -767305266, now seen corresponding path program 2 times [2019-11-06 21:15:12,210 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:12,210 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099703360] [2019-11-06 21:15:12,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:12,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:12,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:12,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:12,434 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-06 21:15:12,434 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099703360] [2019-11-06 21:15:12,434 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180419182] [2019-11-06 21:15:12,435 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 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-11-06 21:15:12,596 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 21:15:12,596 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:15:12,597 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-06 21:15:12,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:12,701 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-06 21:15:12,701 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:12,701 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 17 [2019-11-06 21:15:12,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835379637] [2019-11-06 21:15:12,702 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-11-06 21:15:12,702 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:12,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-11-06 21:15:12,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-11-06 21:15:12,704 INFO L87 Difference]: Start difference. First operand 98 states and 129 transitions. Second operand 17 states. [2019-11-06 21:15:13,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:13,177 INFO L93 Difference]: Finished difference Result 211 states and 281 transitions. [2019-11-06 21:15:13,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-06 21:15:13,179 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2019-11-06 21:15:13,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:13,181 INFO L225 Difference]: With dead ends: 211 [2019-11-06 21:15:13,181 INFO L226 Difference]: Without dead ends: 120 [2019-11-06 21:15:13,182 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2019-11-06 21:15:13,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-06 21:15:13,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 114. [2019-11-06 21:15:13,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-06 21:15:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 151 transitions. [2019-11-06 21:15:13,193 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 151 transitions. Word has length 61 [2019-11-06 21:15:13,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:13,194 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 151 transitions. [2019-11-06 21:15:13,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-11-06 21:15:13,194 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 151 transitions. [2019-11-06 21:15:13,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-06 21:15:13,195 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:13,195 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:13,408 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:13,409 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:13,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:13,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1816889228, now seen corresponding path program 3 times [2019-11-06 21:15:13,410 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:13,410 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088845981] [2019-11-06 21:15:13,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:13,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:13,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:13,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:14,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:14,190 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-06 21:15:14,191 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088845981] [2019-11-06 21:15:14,191 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656600725] [2019-11-06 21:15:14,191 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-11-06 21:15:14,367 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-06 21:15:14,368 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:15:14,370 INFO L256 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 68 conjunts are in the unsatisfiable core [2019-11-06 21:15:14,378 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:14,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:14,577 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:14,592 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 45 treesize of output 45 [2019-11-06 21:15:14,592 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:14,602 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:14,613 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 45 treesize of output 45 [2019-11-06 21:15:14,613 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:14,654 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:14,663 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:14,672 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 45 treesize of output 45 [2019-11-06 21:15:14,673 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:14,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:14,715 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 45 treesize of output 45 [2019-11-06 21:15:14,716 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:14,775 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:14,777 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-06 21:15:14,777 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:91, output treesize:67 [2019-11-06 21:15:14,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:14,952 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 0 case distinctions, treesize of input 61 treesize of output 53 [2019-11-06 21:15:14,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:14,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:14,963 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 56 [2019-11-06 21:15:14,964 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:15,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:15,025 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 0 case distinctions, treesize of input 50 treesize of output 42 [2019-11-06 21:15:15,026 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:15,048 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:15,060 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2019-11-06 21:15:15,061 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:15,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:15,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-06 21:15:15,102 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:123, output treesize:79 [2019-11-06 21:15:15,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:15,195 INFO L392 ElimStorePlain]: Different costs {2=[v_prenex_1, |v_#memory_$Pointer$.offset_34|], 4=[|v_#memory_$Pointer$.base_34|, v_prenex_3]} [2019-11-06 21:15:15,229 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:15,230 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 50 treesize of output 73 [2019-11-06 21:15:15,231 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:15,331 INFO L567 ElimStorePlain]: treesize reduction 16, result has 86.8 percent of original size [2019-11-06 21:15:15,380 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:15,381 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 50 treesize of output 73 [2019-11-06 21:15:15,382 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:15,492 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-11-06 21:15:15,493 INFO L567 ElimStorePlain]: treesize reduction 24, result has 80.8 percent of original size [2019-11-06 21:15:15,549 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:15,550 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 46 treesize of output 96 [2019-11-06 21:15:15,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:15,553 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:15,669 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 56 [2019-11-06 21:15:15,669 INFO L567 ElimStorePlain]: treesize reduction 32, result has 77.9 percent of original size [2019-11-06 21:15:15,705 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:15,706 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 54 treesize of output 104 [2019-11-06 21:15:15,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:15,709 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:15,862 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-11-06 21:15:15,863 INFO L567 ElimStorePlain]: treesize reduction 40, result has 74.5 percent of original size [2019-11-06 21:15:15,865 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-06 21:15:15,865 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:101, output treesize:151 [2019-11-06 21:15:16,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:16,146 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:16,445 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:16,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:16,487 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:16,487 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 85 treesize of output 58 [2019-11-06 21:15:16,488 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:16,489 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:16,490 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:16,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:16,495 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:15:16,502 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:16,502 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 85 treesize of output 57 [2019-11-06 21:15:16,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:16,505 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:16,506 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:16,560 INFO L567 ElimStorePlain]: treesize reduction 16, result has 83.2 percent of original size [2019-11-06 21:15:16,566 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:16,575 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:16,575 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 32 [2019-11-06 21:15:16,576 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:16,581 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:16,590 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:16,591 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 40 [2019-11-06 21:15:16,592 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:16,602 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:16,602 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-06 21:15:16,603 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:171, output treesize:9 [2019-11-06 21:15:16,724 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-06 21:15:16,724 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 21:15:16,724 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [23] total 37 [2019-11-06 21:15:16,725 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734687650] [2019-11-06 21:15:16,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-06 21:15:16,725 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:16,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-06 21:15:16,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=1248, Unknown=0, NotChecked=0, Total=1332 [2019-11-06 21:15:16,726 INFO L87 Difference]: Start difference. First operand 114 states and 151 transitions. Second operand 18 states. [2019-11-06 21:15:18,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:18,123 INFO L93 Difference]: Finished difference Result 210 states and 316 transitions. [2019-11-06 21:15:18,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-06 21:15:18,124 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 64 [2019-11-06 21:15:18,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:18,126 INFO L225 Difference]: With dead ends: 210 [2019-11-06 21:15:18,126 INFO L226 Difference]: Without dead ends: 193 [2019-11-06 21:15:18,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=126, Invalid=1854, Unknown=0, NotChecked=0, Total=1980 [2019-11-06 21:15:18,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-06 21:15:18,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 132. [2019-11-06 21:15:18,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-11-06 21:15:18,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 180 transitions. [2019-11-06 21:15:18,165 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 180 transitions. Word has length 64 [2019-11-06 21:15:18,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:18,165 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 180 transitions. [2019-11-06 21:15:18,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-06 21:15:18,165 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 180 transitions. [2019-11-06 21:15:18,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-06 21:15:18,168 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:18,168 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:18,372 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:18,373 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:18,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:18,373 INFO L82 PathProgramCache]: Analyzing trace with hash 2139714032, now seen corresponding path program 1 times [2019-11-06 21:15:18,374 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:18,374 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536559620] [2019-11-06 21:15:18,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:19,497 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-06 21:15:19,498 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536559620] [2019-11-06 21:15:19,498 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627268147] [2019-11-06 21:15:19,498 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-11-06 21:15:19,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:19,646 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 92 conjunts are in the unsatisfiable core [2019-11-06 21:15:19,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:19,704 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-11-06 21:15:19,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:19,715 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:19,716 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:19,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-06 21:15:19,801 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-06 21:15:19,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:19,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:19,816 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:19,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:3 [2019-11-06 21:15:20,150 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 11 treesize of output 7 [2019-11-06 21:15:20,150 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:20,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:20,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:20,187 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:44 [2019-11-06 21:15:20,382 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:20,383 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 93 [2019-11-06 21:15:20,384 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:20,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:20,405 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:20,405 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:61, output treesize:44 [2019-11-06 21:15:20,481 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_35|], 4=[|v_#memory_$Pointer$.base_36|]} [2019-11-06 21:15:20,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:20,487 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2019-11-06 21:15:20,487 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:20,513 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:20,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:20,519 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-11-06 21:15:20,520 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:20,562 INFO L567 ElimStorePlain]: treesize reduction 4, result has 94.5 percent of original size [2019-11-06 21:15:20,563 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:20,563 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:84 [2019-11-06 21:15:20,759 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_36|], 12=[|v_#memory_$Pointer$.base_37|]} [2019-11-06 21:15:20,764 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:20,766 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 28 treesize of output 23 [2019-11-06 21:15:20,767 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:20,801 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:20,807 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:20,824 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:20,825 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 66 [2019-11-06 21:15:20,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:20,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:20,829 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:20,884 INFO L567 ElimStorePlain]: treesize reduction 24, result has 78.9 percent of original size [2019-11-06 21:15:20,885 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:20,885 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:90 [2019-11-06 21:15:20,988 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.offset_37|], 7=[|v_#memory_$Pointer$.base_38|]} [2019-11-06 21:15:21,029 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:21,029 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 2 case distinctions, treesize of input 26 treesize of output 76 [2019-11-06 21:15:21,030 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:21,095 INFO L567 ElimStorePlain]: treesize reduction 48, result has 65.0 percent of original size [2019-11-06 21:15:21,156 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:21,157 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 59 treesize of output 127 [2019-11-06 21:15:21,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:21,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:21,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:21,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:21,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:21,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:21,161 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:21,162 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:21,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:21,163 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:21,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:21,165 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:21,280 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-11-06 21:15:21,280 INFO L567 ElimStorePlain]: treesize reduction 80, result has 57.7 percent of original size [2019-11-06 21:15:21,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:21,282 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:21,283 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:146 [2019-11-06 21:15:21,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:21,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:21,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:21,898 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2019-11-06 21:15:21,900 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:22,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:22,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:22,056 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:22,056 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 152 treesize of output 135 [2019-11-06 21:15:22,058 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:22,066 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:22,074 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:22,074 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 86 [2019-11-06 21:15:22,075 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:22,111 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:22,113 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 2 xjuncts. [2019-11-06 21:15:22,113 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:256, output treesize:158 [2019-11-06 21:15:22,451 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:22,778 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-06 21:15:22,778 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:22,779 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 45 [2019-11-06 21:15:22,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132503287] [2019-11-06 21:15:22,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-11-06 21:15:22,783 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:22,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-11-06 21:15:22,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1866, Unknown=0, NotChecked=0, Total=1980 [2019-11-06 21:15:22,785 INFO L87 Difference]: Start difference. First operand 132 states and 180 transitions. Second operand 45 states. [2019-11-06 21:15:27,165 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2019-11-06 21:15:27,463 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2019-11-06 21:15:29,642 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 95 [2019-11-06 21:15:30,073 WARN L191 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 107 [2019-11-06 21:15:30,620 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-11-06 21:15:32,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:15:32,212 INFO L93 Difference]: Finished difference Result 335 states and 560 transitions. [2019-11-06 21:15:32,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-11-06 21:15:32,212 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 65 [2019-11-06 21:15:32,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:15:32,218 INFO L225 Difference]: With dead ends: 335 [2019-11-06 21:15:32,218 INFO L226 Difference]: Without dead ends: 305 [2019-11-06 21:15:32,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1399 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=413, Invalid=6393, Unknown=0, NotChecked=0, Total=6806 [2019-11-06 21:15:32,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2019-11-06 21:15:32,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 177. [2019-11-06 21:15:32,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-11-06 21:15:32,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 245 transitions. [2019-11-06 21:15:32,266 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 245 transitions. Word has length 65 [2019-11-06 21:15:32,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:15:32,268 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 245 transitions. [2019-11-06 21:15:32,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-11-06 21:15:32,268 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 245 transitions. [2019-11-06 21:15:32,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-06 21:15:32,271 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:15:32,271 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:15:32,483 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:15:32,483 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:15:32,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:15:32,484 INFO L82 PathProgramCache]: Analyzing trace with hash 240363508, now seen corresponding path program 2 times [2019-11-06 21:15:32,484 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:15:32,484 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107969908] [2019-11-06 21:15:32,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:15:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:32,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:32,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:33,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:15:34,143 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-06 21:15:34,143 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107969908] [2019-11-06 21:15:34,143 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391303786] [2019-11-06 21:15:34,143 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-11-06 21:15:34,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 21:15:34,280 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:15:34,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 116 conjunts are in the unsatisfiable core [2019-11-06 21:15:34,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:15:34,382 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-11-06 21:15:34,382 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:34,386 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:34,387 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:34,387 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-06 21:15:34,412 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-11-06 21:15:34,412 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:34,416 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:34,416 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:34,417 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-11-06 21:15:34,790 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 11 treesize of output 7 [2019-11-06 21:15:34,791 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:34,809 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:34,809 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:34,810 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:48, output treesize:41 [2019-11-06 21:15:34,968 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_38|], 1=[|v_#memory_$Pointer$.base_40|]} [2019-11-06 21:15:34,971 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-11-06 21:15:34,972 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:34,995 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:35,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:35,001 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 20 treesize of output 19 [2019-11-06 21:15:35,002 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:35,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:35,022 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-11-06 21:15:35,023 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:65, output treesize:70 [2019-11-06 21:15:35,256 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:35,257 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 93 [2019-11-06 21:15:35,258 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:35,286 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:35,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:35,288 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:83, output treesize:66 [2019-11-06 21:15:35,398 INFO L392 ElimStorePlain]: Different costs {1=[|v_#memory_$Pointer$.offset_39|], 3=[|v_#memory_$Pointer$.base_41|]} [2019-11-06 21:15:35,403 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2019-11-06 21:15:35,403 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:35,431 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:35,453 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:35,454 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 75 [2019-11-06 21:15:35,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:35,456 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:35,456 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:35,560 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 37 [2019-11-06 21:15:35,561 INFO L567 ElimStorePlain]: treesize reduction 83, result has 48.8 percent of original size [2019-11-06 21:15:35,562 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:35,562 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:91, output treesize:96 [2019-11-06 21:15:35,780 INFO L392 ElimStorePlain]: Different costs {7=[|v_#memory_$Pointer$.offset_40|], 11=[|v_#memory_$Pointer$.base_42|]} [2019-11-06 21:15:35,784 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:35,785 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2019-11-06 21:15:35,786 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:35,824 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:35,926 INFO L341 Elim1Store]: treesize reduction 8, result has 88.7 percent of original size [2019-11-06 21:15:35,926 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 85 treesize of output 108 [2019-11-06 21:15:35,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:35,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:35,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:35,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:35,930 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:35,931 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:35,932 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:35,932 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:36,053 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 47 [2019-11-06 21:15:36,053 INFO L567 ElimStorePlain]: treesize reduction 52, result has 62.9 percent of original size [2019-11-06 21:15:36,054 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:36,055 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:131, output treesize:109 [2019-11-06 21:15:36,180 INFO L392 ElimStorePlain]: Different costs {7=[|v_#memory_$Pointer$.offset_41|], 21=[|v_#memory_$Pointer$.base_43|]} [2019-11-06 21:15:36,185 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:15:36,244 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:15:36,245 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 126 [2019-11-06 21:15:36,246 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:15:36,364 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 45 [2019-11-06 21:15:36,364 INFO L567 ElimStorePlain]: treesize reduction 84, result has 58.4 percent of original size [2019-11-06 21:15:36,580 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-11-06 21:15:36,581 INFO L341 Elim1Store]: treesize reduction 24, result has 87.8 percent of original size [2019-11-06 21:15:36,581 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 13 case distinctions, treesize of input 92 treesize of output 214 [2019-11-06 21:15:36,583 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,585 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,587 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,588 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,589 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,591 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,592 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,595 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,597 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,598 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,603 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,608 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,613 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,617 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,619 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,620 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,638 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,643 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,651 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,652 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,654 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,659 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,660 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,661 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,668 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,670 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,674 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:15:36,675 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,676 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,677 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:36,679 INFO L496 ElimStorePlain]: Start of recursive call 3: 10 dim-0 vars, End of recursive call: 10 dim-0 vars, and 1 xjuncts. [2019-11-06 21:15:37,111 WARN L191 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 326 DAG size of output: 65 [2019-11-06 21:15:37,112 INFO L567 ElimStorePlain]: treesize reduction 1023, result has 14.2 percent of original size [2019-11-06 21:15:37,113 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:15:37,114 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:122, output treesize:211 [2019-11-06 21:15:37,560 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:15:39,041 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-06 21:15:39,042 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:15:39,042 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 28] total 50 [2019-11-06 21:15:39,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511234457] [2019-11-06 21:15:39,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-11-06 21:15:39,044 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:15:39,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-11-06 21:15:39,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=2326, Unknown=0, NotChecked=0, Total=2450 [2019-11-06 21:15:39,046 INFO L87 Difference]: Start difference. First operand 177 states and 245 transitions. Second operand 50 states. [2019-11-06 21:15:41,214 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 58 [2019-11-06 21:15:42,155 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-11-06 21:15:42,571 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 98