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/dll_nullified-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:10:55,176 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:10:55,179 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:10:55,199 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:10:55,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:10:55,202 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:10:55,204 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:10:55,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:10:55,215 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:10:55,216 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:10:55,217 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:10:55,218 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:10:55,219 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:10:55,220 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:10:55,221 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:10:55,222 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:10:55,223 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:10:55,225 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:10:55,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:10:55,229 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:10:55,230 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:10:55,231 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:10:55,232 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:10:55,233 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:10:55,235 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:10:55,235 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:10:55,236 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:10:55,238 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:10:55,238 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:10:55,239 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:10:55,239 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:10:55,244 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:10:55,245 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:10:55,246 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:10:55,246 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:10:55,247 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:10:55,251 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:10:55,251 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:10:55,251 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:10:55,253 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:10:55,253 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:10:55,258 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:10:55,280 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:10:55,281 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:10:55,282 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:10:55,282 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:10:55,282 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:10:55,282 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:10:55,282 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:10:55,283 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:10:55,283 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:10:55,283 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:10:55,283 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:10:55,283 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:10:55,283 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:10:55,284 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:10:55,284 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:10:55,284 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:10:55,284 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:10:55,284 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:10:55,285 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:10:55,285 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:10:55,285 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:10:55,285 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:10:55,285 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:10:55,286 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:10:55,286 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:10:55,286 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:10:55,286 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:10:55,287 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:10:55,287 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:10:55,569 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:10:55,582 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:10:55,585 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:10:55,587 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:10:55,587 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:10:55,588 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/dll_nullified-2.i [2019-10-14 23:10:55,653 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c0fe1451/c5e1cafd22c1462c9f20305ff58ab385/FLAG86fe28e48 [2019-10-14 23:10:56,261 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:10:56,262 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/dll_nullified-2.i [2019-10-14 23:10:56,273 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c0fe1451/c5e1cafd22c1462c9f20305ff58ab385/FLAG86fe28e48 [2019-10-14 23:10:56,467 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c0fe1451/c5e1cafd22c1462c9f20305ff58ab385 [2019-10-14 23:10:56,477 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:10:56,479 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:10:56,480 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:10:56,480 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:10:56,485 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:10:56,486 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:10:56" (1/1) ... [2019-10-14 23:10:56,489 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@354e775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:56, skipping insertion in model container [2019-10-14 23:10:56,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:10:56" (1/1) ... [2019-10-14 23:10:56,498 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:10:56,555 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:10:57,015 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:10:57,034 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:10:57,111 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:10:57,169 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:10:57,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:57 WrapperNode [2019-10-14 23:10:57,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:10:57,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:10:57,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:10:57,171 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:10:57,183 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:57" (1/1) ... [2019-10-14 23:10:57,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:57" (1/1) ... [2019-10-14 23:10:57,197 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:57" (1/1) ... [2019-10-14 23:10:57,197 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:57" (1/1) ... [2019-10-14 23:10:57,213 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:57" (1/1) ... [2019-10-14 23:10:57,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:57" (1/1) ... [2019-10-14 23:10:57,223 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:57" (1/1) ... [2019-10-14 23:10:57,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:10:57,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:10:57,229 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:10:57,229 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:10:57,230 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:57" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:10:57,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:10:57,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:10:57,289 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-14 23:10:57,289 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-14 23:10:57,289 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-14 23:10:57,289 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_create [2019-10-14 23:10:57,290 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:10:57,290 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:10:57,290 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-14 23:10:57,290 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-14 23:10:57,290 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-14 23:10:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-14 23:10:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-14 23:10:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-14 23:10:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-14 23:10:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-14 23:10:57,291 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-14 23:10:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-14 23:10:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-14 23:10:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-14 23:10:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-14 23:10:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-14 23:10:57,292 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-14 23:10:57,293 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-14 23:10:57,293 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-14 23:10:57,293 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-14 23:10:57,293 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-14 23:10:57,293 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-14 23:10:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-14 23:10:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-14 23:10:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-14 23:10:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-14 23:10:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-14 23:10:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-14 23:10:57,294 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-14 23:10:57,295 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-14 23:10:57,295 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-14 23:10:57,295 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-14 23:10:57,295 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-14 23:10:57,295 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-14 23:10:57,295 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-14 23:10:57,296 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-14 23:10:57,296 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-14 23:10:57,296 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-14 23:10:57,296 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-14 23:10:57,296 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-14 23:10:57,296 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-14 23:10:57,296 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-14 23:10:57,297 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-14 23:10:57,297 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-14 23:10:57,297 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-14 23:10:57,297 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-14 23:10:57,297 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-14 23:10:57,297 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-14 23:10:57,297 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-14 23:10:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-14 23:10:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-14 23:10:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-14 23:10:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-14 23:10:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-14 23:10:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 23:10:57,298 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-14 23:10:57,299 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-14 23:10:57,299 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-14 23:10:57,299 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-14 23:10:57,299 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-14 23:10:57,299 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-14 23:10:57,299 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-14 23:10:57,300 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-14 23:10:57,300 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-14 23:10:57,300 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-14 23:10:57,300 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-14 23:10:57,300 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-14 23:10:57,300 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 23:10:57,301 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-14 23:10:57,301 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-14 23:10:57,301 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-14 23:10:57,301 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-14 23:10:57,301 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-14 23:10:57,301 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-14 23:10:57,301 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-14 23:10:57,302 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-14 23:10:57,302 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-14 23:10:57,302 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-14 23:10:57,302 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-14 23:10:57,302 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-14 23:10:57,302 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-14 23:10:57,303 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-14 23:10:57,303 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-14 23:10:57,303 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-14 23:10:57,303 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-14 23:10:57,303 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-14 23:10:57,303 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-14 23:10:57,303 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-14 23:10:57,304 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-14 23:10:57,304 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-14 23:10:57,304 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-14 23:10:57,304 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-14 23:10:57,304 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-14 23:10:57,304 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-14 23:10:57,305 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-14 23:10:57,305 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-14 23:10:57,305 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-14 23:10:57,305 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-14 23:10:57,305 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-14 23:10:57,305 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-14 23:10:57,305 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-14 23:10:57,306 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-14 23:10:57,306 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-14 23:10:57,306 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-14 23:10:57,306 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-14 23:10:57,306 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-14 23:10:57,306 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-14 23:10:57,306 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-14 23:10:57,306 INFO L130 BoogieDeclarations]: Found specification of procedure dll_create [2019-10-14 23:10:57,307 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 23:10:57,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 23:10:57,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-14 23:10:57,307 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:10:57,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-14 23:10:57,307 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 23:10:57,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 23:10:57,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:10:57,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:10:57,682 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-14 23:10:57,880 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:10:57,880 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-14 23:10:57,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:10:57 BoogieIcfgContainer [2019-10-14 23:10:57,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:10:57,883 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:10:57,883 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:10:57,886 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:10:57,887 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:10:56" (1/3) ... [2019-10-14 23:10:57,888 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42915a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:10:57, skipping insertion in model container [2019-10-14 23:10:57,888 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:10:57" (2/3) ... [2019-10-14 23:10:57,889 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42915a96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:10:57, skipping insertion in model container [2019-10-14 23:10:57,889 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:10:57" (3/3) ... [2019-10-14 23:10:57,891 INFO L109 eAbstractionObserver]: Analyzing ICFG dll_nullified-2.i [2019-10-14 23:10:57,901 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:10:57,912 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:10:57,927 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:10:57,954 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:10:57,954 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:10:57,955 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:10:57,955 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:10:57,955 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:10:57,955 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:10:57,955 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:10:57,956 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:10:57,970 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-10-14 23:10:57,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 23:10:57,976 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:57,977 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:57,979 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:57,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:57,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1586150655, now seen corresponding path program 1 times [2019-10-14 23:10:57,992 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:57,992 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486706840] [2019-10-14 23:10:57,992 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:57,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:57,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:58,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:58,256 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486706840] [2019-10-14 23:10:58,257 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:10:58,258 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:10:58,258 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868658571] [2019-10-14 23:10:58,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:10:58,264 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:58,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:10:58,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:10:58,283 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 6 states. [2019-10-14 23:10:58,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:58,752 INFO L93 Difference]: Finished difference Result 89 states and 129 transitions. [2019-10-14 23:10:58,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:10:58,754 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-14 23:10:58,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:58,771 INFO L225 Difference]: With dead ends: 89 [2019-10-14 23:10:58,771 INFO L226 Difference]: Without dead ends: 56 [2019-10-14 23:10:58,778 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:10:58,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-14 23:10:58,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 33. [2019-10-14 23:10:58,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-14 23:10:58,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2019-10-14 23:10:58,832 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 20 [2019-10-14 23:10:58,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:58,833 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2019-10-14 23:10:58,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:10:58,833 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2019-10-14 23:10:58,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 23:10:58,837 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:58,837 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:58,837 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:58,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:58,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1586148733, now seen corresponding path program 1 times [2019-10-14 23:10:58,839 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:58,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655682371] [2019-10-14 23:10:58,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:58,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:58,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:58,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:58,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:59,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:59,046 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655682371] [2019-10-14 23:10:59,046 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:10:59,046 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:10:59,046 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694356952] [2019-10-14 23:10:59,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:10:59,050 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:59,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:10:59,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:10:59,051 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand 7 states. [2019-10-14 23:10:59,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:59,287 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2019-10-14 23:10:59,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:10:59,288 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2019-10-14 23:10:59,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:59,289 INFO L225 Difference]: With dead ends: 58 [2019-10-14 23:10:59,289 INFO L226 Difference]: Without dead ends: 38 [2019-10-14 23:10:59,291 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:10:59,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-14 23:10:59,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2019-10-14 23:10:59,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-10-14 23:10:59,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2019-10-14 23:10:59,304 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 20 [2019-10-14 23:10:59,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:59,305 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2019-10-14 23:10:59,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:10:59,305 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2019-10-14 23:10:59,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:10:59,307 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:59,307 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:59,307 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:59,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:59,308 INFO L82 PathProgramCache]: Analyzing trace with hash -796981742, now seen corresponding path program 1 times [2019-10-14 23:10:59,308 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:59,308 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580904498] [2019-10-14 23:10:59,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:59,309 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:59,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:59,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:59,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580904498] [2019-10-14 23:10:59,479 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:10:59,479 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:10:59,479 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997659241] [2019-10-14 23:10:59,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:10:59,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:59,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:10:59,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:10:59,480 INFO L87 Difference]: Start difference. First operand 34 states and 42 transitions. Second operand 5 states. [2019-10-14 23:10:59,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:10:59,659 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2019-10-14 23:10:59,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:10:59,660 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-10-14 23:10:59,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:10:59,661 INFO L225 Difference]: With dead ends: 63 [2019-10-14 23:10:59,661 INFO L226 Difference]: Without dead ends: 38 [2019-10-14 23:10:59,661 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:10:59,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-14 23:10:59,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-10-14 23:10:59,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-10-14 23:10:59,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2019-10-14 23:10:59,669 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 25 [2019-10-14 23:10:59,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:10:59,670 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2019-10-14 23:10:59,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:10:59,670 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2019-10-14 23:10:59,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:10:59,671 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:10:59,671 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:10:59,672 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:10:59,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:10:59,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1808098992, now seen corresponding path program 1 times [2019-10-14 23:10:59,672 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:10:59,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021300680] [2019-10-14 23:10:59,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:59,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:10:59,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:10:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:59,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:10:59,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:10:59,854 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021300680] [2019-10-14 23:10:59,854 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:10:59,855 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-14 23:10:59,855 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710628455] [2019-10-14 23:10:59,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:10:59,856 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:10:59,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:10:59,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:10:59,856 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 10 states. [2019-10-14 23:11:00,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:00,285 INFO L93 Difference]: Finished difference Result 64 states and 78 transitions. [2019-10-14 23:11:00,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 23:11:00,286 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-10-14 23:11:00,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:00,287 INFO L225 Difference]: With dead ends: 64 [2019-10-14 23:11:00,287 INFO L226 Difference]: Without dead ends: 59 [2019-10-14 23:11:00,288 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:11:00,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-14 23:11:00,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 46. [2019-10-14 23:11:00,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-14 23:11:00,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2019-10-14 23:11:00,296 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 25 [2019-10-14 23:11:00,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:00,297 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2019-10-14 23:11:00,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:11:00,297 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2019-10-14 23:11:00,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-14 23:11:00,298 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:00,299 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:00,299 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:00,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:00,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1806250028, now seen corresponding path program 1 times [2019-10-14 23:11:00,300 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:00,300 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835104210] [2019-10-14 23:11:00,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:00,300 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:00,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:00,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:00,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:00,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:00,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835104210] [2019-10-14 23:11:00,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [101938235] [2019-10-14 23:11:00,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:00,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:00,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-14 23:11:00,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:00,560 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:00,561 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:00,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 9 [2019-10-14 23:11:00,563 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106148017] [2019-10-14 23:11:00,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 23:11:00,564 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:00,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 23:11:00,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-14 23:11:00,564 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand 9 states. [2019-10-14 23:11:00,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:00,792 INFO L93 Difference]: Finished difference Result 76 states and 95 transitions. [2019-10-14 23:11:00,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:11:00,793 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-10-14 23:11:00,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:00,794 INFO L225 Difference]: With dead ends: 76 [2019-10-14 23:11:00,794 INFO L226 Difference]: Without dead ends: 53 [2019-10-14 23:11:00,795 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2019-10-14 23:11:00,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-14 23:11:00,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2019-10-14 23:11:00,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-14 23:11:00,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2019-10-14 23:11:00,802 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 25 [2019-10-14 23:11:00,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:00,802 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2019-10-14 23:11:00,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 23:11:00,803 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2019-10-14 23:11:00,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 23:11:00,804 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:00,804 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:01,017 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:01,017 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:01,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:01,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1806463457, now seen corresponding path program 1 times [2019-10-14 23:11:01,018 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:01,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133966804] [2019-10-14 23:11:01,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:01,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:01,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:01,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:01,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:01,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:01,221 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:01,221 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133966804] [2019-10-14 23:11:01,221 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [565390039] [2019-10-14 23:11:01,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:01,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-14 23:11:01,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:01,353 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:01,353 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:01,353 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 10 [2019-10-14 23:11:01,354 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043539369] [2019-10-14 23:11:01,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-14 23:11:01,354 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:01,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-14 23:11:01,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:11:01,355 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 10 states. [2019-10-14 23:11:01,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:01,555 INFO L93 Difference]: Finished difference Result 87 states and 108 transitions. [2019-10-14 23:11:01,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 23:11:01,556 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 30 [2019-10-14 23:11:01,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:01,557 INFO L225 Difference]: With dead ends: 87 [2019-10-14 23:11:01,557 INFO L226 Difference]: Without dead ends: 60 [2019-10-14 23:11:01,558 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:11:01,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-14 23:11:01,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2019-10-14 23:11:01,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-14 23:11:01,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2019-10-14 23:11:01,566 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 30 [2019-10-14 23:11:01,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:01,566 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2019-10-14 23:11:01,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-14 23:11:01,566 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2019-10-14 23:11:01,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-14 23:11:01,567 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:01,568 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-14 23:11:01,772 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:01,773 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:01,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:01,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1561443664, now seen corresponding path program 2 times [2019-10-14 23:11:01,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:01,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012679361] [2019-10-14 23:11:01,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:01,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:01,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:01,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:01,922 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:01,922 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012679361] [2019-10-14 23:11:01,922 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201225770] [2019-10-14 23:11:01,922 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-10-14 23:11:02,029 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:11:02,029 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:11:02,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-14 23:11:02,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:02,109 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:02,110 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:02,110 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2019-10-14 23:11:02,111 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103156032] [2019-10-14 23:11:02,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-14 23:11:02,112 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:02,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-14 23:11:02,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-10-14 23:11:02,113 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand 11 states. [2019-10-14 23:11:02,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:02,308 INFO L93 Difference]: Finished difference Result 92 states and 114 transitions. [2019-10-14 23:11:02,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:11:02,309 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 35 [2019-10-14 23:11:02,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:02,310 INFO L225 Difference]: With dead ends: 92 [2019-10-14 23:11:02,310 INFO L226 Difference]: Without dead ends: 65 [2019-10-14 23:11:02,311 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-10-14 23:11:02,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-10-14 23:11:02,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2019-10-14 23:11:02,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-10-14 23:11:02,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 70 transitions. [2019-10-14 23:11:02,318 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 70 transitions. Word has length 35 [2019-10-14 23:11:02,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:02,319 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 70 transitions. [2019-10-14 23:11:02,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-14 23:11:02,319 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2019-10-14 23:11:02,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-14 23:11:02,320 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:02,320 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:02,525 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:02,527 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:02,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:02,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1001209665, now seen corresponding path program 3 times [2019-10-14 23:11:02,528 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:02,528 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933988933] [2019-10-14 23:11:02,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:02,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:02,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:02,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:02,708 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:02,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933988933] [2019-10-14 23:11:02,709 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1050857102] [2019-10-14 23:11:02,709 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:04,065 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-14 23:11:04,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:11:04,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-14 23:11:04,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:04,177 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_21|], 2=[|v_#memory_int_20|]} [2019-10-14 23:11:04,190 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:04,191 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:04,192 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:04,194 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:04,195 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:04,196 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:04,218 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2019-10-14 23:11:04,218 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:04,234 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:04,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:04,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:04,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:04,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:04,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:04,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:04,251 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:04,252 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 35 [2019-10-14 23:11:04,254 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:04,267 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:04,268 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:04,268 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:32 [2019-10-14 23:11:04,306 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:04,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:04,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:04,311 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:04,312 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:04,334 INFO L341 Elim1Store]: treesize reduction 29, result has 42.0 percent of original size [2019-10-14 23:11:04,334 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 47 [2019-10-14 23:11:04,335 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:04,358 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:04,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,361 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:04,362 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:35 [2019-10-14 23:11:04,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:04,518 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-14 23:11:04,519 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 23:11:04,519 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [11] total 21 [2019-10-14 23:11:04,519 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115919654] [2019-10-14 23:11:04,520 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-14 23:11:04,520 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:04,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-14 23:11:04,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:11:04,521 INFO L87 Difference]: Start difference. First operand 58 states and 70 transitions. Second operand 12 states. [2019-10-14 23:11:04,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:04,932 INFO L93 Difference]: Finished difference Result 77 states and 94 transitions. [2019-10-14 23:11:04,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-14 23:11:04,933 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2019-10-14 23:11:04,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:04,934 INFO L225 Difference]: With dead ends: 77 [2019-10-14 23:11:04,934 INFO L226 Difference]: Without dead ends: 72 [2019-10-14 23:11:04,935 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=513, Unknown=0, NotChecked=0, Total=600 [2019-10-14 23:11:04,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-14 23:11:04,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 52. [2019-10-14 23:11:04,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-14 23:11:04,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2019-10-14 23:11:04,942 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 40 [2019-10-14 23:11:04,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:04,942 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2019-10-14 23:11:04,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-14 23:11:04,942 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2019-10-14 23:11:04,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-14 23:11:04,943 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:04,943 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:05,148 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:05,149 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:05,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:05,150 INFO L82 PathProgramCache]: Analyzing trace with hash -999360701, now seen corresponding path program 1 times [2019-10-14 23:11:05,150 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:05,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941455973] [2019-10-14 23:11:05,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:05,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:05,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:05,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:05,316 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:05,317 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941455973] [2019-10-14 23:11:05,317 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044623646] [2019-10-14 23:11:05,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:05,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-14 23:11:05,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:05,539 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:11:05,539 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:05,540 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 12 [2019-10-14 23:11:05,540 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586245790] [2019-10-14 23:11:05,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-14 23:11:05,541 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:05,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-14 23:11:05,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-14 23:11:05,542 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand 12 states. [2019-10-14 23:11:05,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:05,801 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2019-10-14 23:11:05,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-14 23:11:05,802 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2019-10-14 23:11:05,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:05,803 INFO L225 Difference]: With dead ends: 84 [2019-10-14 23:11:05,803 INFO L226 Difference]: Without dead ends: 61 [2019-10-14 23:11:05,806 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2019-10-14 23:11:05,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-14 23:11:05,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2019-10-14 23:11:05,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-14 23:11:05,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2019-10-14 23:11:05,822 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 40 [2019-10-14 23:11:05,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:05,822 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2019-10-14 23:11:05,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-14 23:11:05,822 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2019-10-14 23:11:05,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-14 23:11:05,826 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:05,826 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:06,040 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:06,040 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:06,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:06,041 INFO L82 PathProgramCache]: Analyzing trace with hash -37623148, now seen corresponding path program 2 times [2019-10-14 23:11:06,041 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:06,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441646150] [2019-10-14 23:11:06,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:06,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:06,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:06,443 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-14 23:11:06,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441646150] [2019-10-14 23:11:06,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76251252] [2019-10-14 23:11:06,443 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:06,564 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:11:06,564 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:11:06,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 32 conjunts are in the unsatisfiable core [2019-10-14 23:11:06,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:06,586 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:11:06,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:06,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:06,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:06,589 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-14 23:11:06,598 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:06,598 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 23:11:06,599 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:06,601 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:06,601 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:06,601 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:4 [2019-10-14 23:11:06,619 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_24|], 2=[|v_#memory_int_23|]} [2019-10-14 23:11:06,624 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:06,627 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:06,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:06,630 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:06,631 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:06,632 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:06,645 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2019-10-14 23:11:06,646 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:06,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:06,712 INFO L341 Elim1Store]: treesize reduction 122, result has 17.6 percent of original size [2019-10-14 23:11:06,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 35 [2019-10-14 23:11:06,715 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:06,727 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:06,728 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:06,729 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:30 [2019-10-14 23:11:06,773 INFO L341 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2019-10-14 23:11:06,774 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 35 [2019-10-14 23:11:06,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:06,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:06,787 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:06,787 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:49, output treesize:26 [2019-10-14 23:11:06,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:06,960 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-14 23:11:06,961 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:06,961 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 21 [2019-10-14 23:11:06,961 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217991078] [2019-10-14 23:11:06,962 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-14 23:11:06,962 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:06,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-14 23:11:06,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:11:06,963 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 21 states. [2019-10-14 23:11:08,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:08,170 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2019-10-14 23:11:08,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 23:11:08,171 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 45 [2019-10-14 23:11:08,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:08,172 INFO L225 Difference]: With dead ends: 71 [2019-10-14 23:11:08,172 INFO L226 Difference]: Without dead ends: 69 [2019-10-14 23:11:08,173 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=911, Unknown=0, NotChecked=0, Total=1056 [2019-10-14 23:11:08,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-10-14 23:11:08,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2019-10-14 23:11:08,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-14 23:11:08,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2019-10-14 23:11:08,179 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 45 [2019-10-14 23:11:08,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:08,179 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2019-10-14 23:11:08,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-14 23:11:08,180 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2019-10-14 23:11:08,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-14 23:11:08,181 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:08,181 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:08,384 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:08,385 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:08,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:08,386 INFO L82 PathProgramCache]: Analyzing trace with hash -37625070, now seen corresponding path program 1 times [2019-10-14 23:11:08,386 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:08,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073970467] [2019-10-14 23:11:08,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:08,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:08,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:08,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:08,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:08,699 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-14 23:11:08,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073970467] [2019-10-14 23:11:08,699 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587571281] [2019-10-14 23:11:08,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:08,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:08,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 37 conjunts are in the unsatisfiable core [2019-10-14 23:11:08,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:08,856 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:11:08,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:08,859 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:08,859 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:08,859 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-14 23:11:08,870 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:08,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 23:11:08,872 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:08,876 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:08,877 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:08,877 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-10-14 23:11:08,882 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_27|], 2=[|v_#memory_int_26|]} [2019-10-14 23:11:08,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:08,889 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:08,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:08,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:08,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:08,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:08,903 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2019-10-14 23:11:08,904 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:08,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:08,949 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:08,950 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:08,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:08,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:08,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:08,953 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:08,954 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-10-14 23:11:08,955 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:08,967 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:08,967 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:08,967 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:33 [2019-10-14 23:11:09,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:09,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:09,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:09,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-10-14 23:11:09,007 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:09,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:09,015 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:09,016 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:29 [2019-10-14 23:11:09,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:09,162 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-14 23:11:09,162 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:09,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 21 [2019-10-14 23:11:09,162 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216771064] [2019-10-14 23:11:09,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-14 23:11:09,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:09,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-14 23:11:09,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:11:09,164 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. Second operand 21 states. [2019-10-14 23:11:09,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:09,917 INFO L93 Difference]: Finished difference Result 70 states and 84 transitions. [2019-10-14 23:11:09,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 23:11:09,917 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 45 [2019-10-14 23:11:09,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:09,918 INFO L225 Difference]: With dead ends: 70 [2019-10-14 23:11:09,919 INFO L226 Difference]: Without dead ends: 67 [2019-10-14 23:11:09,919 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=133, Invalid=797, Unknown=0, NotChecked=0, Total=930 [2019-10-14 23:11:09,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-10-14 23:11:09,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 60. [2019-10-14 23:11:09,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-14 23:11:09,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2019-10-14 23:11:09,931 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 45 [2019-10-14 23:11:09,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:09,932 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2019-10-14 23:11:09,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-14 23:11:09,935 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2019-10-14 23:11:09,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-14 23:11:09,936 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:09,936 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:10,136 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:10,137 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:10,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:10,137 INFO L82 PathProgramCache]: Analyzing trace with hash 2064566938, now seen corresponding path program 1 times [2019-10-14 23:11:10,138 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:10,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847200109] [2019-10-14 23:11:10,138 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:10,138 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:10,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:10,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:10,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:10,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:10,332 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-14 23:11:10,332 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847200109] [2019-10-14 23:11:10,332 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206389696] [2019-10-14 23:11:10,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:10,478 INFO L256 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 42 conjunts are in the unsatisfiable core [2019-10-14 23:11:10,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:10,505 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:11:10,505 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,510 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:10,510 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,510 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:11:10,558 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:10,558 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-14 23:11:10,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:10,565 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,566 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-10-14 23:11:10,620 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:10,622 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-10-14 23:11:10,623 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:10,634 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,634 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:29 [2019-10-14 23:11:10,676 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:10,677 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:11:10,687 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:10,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 58 [2019-10-14 23:11:10,689 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,722 INFO L567 ElimStorePlain]: treesize reduction 40, result has 47.4 percent of original size [2019-10-14 23:11:10,723 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,723 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:36 [2019-10-14 23:11:10,879 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:10,880 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 3 case distinctions, treesize of input 34 treesize of output 25 [2019-10-14 23:11:10,880 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,890 INFO L567 ElimStorePlain]: treesize reduction 4, result has 69.2 percent of original size [2019-10-14 23:11:10,891 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:10,891 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:34, output treesize:4 [2019-10-14 23:11:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-14 23:11:10,919 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:10,919 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2019-10-14 23:11:10,919 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793938959] [2019-10-14 23:11:10,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-14 23:11:10,920 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:10,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-14 23:11:10,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=500, Unknown=0, NotChecked=0, Total=552 [2019-10-14 23:11:10,921 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 24 states. [2019-10-14 23:11:12,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:12,243 INFO L93 Difference]: Finished difference Result 98 states and 116 transitions. [2019-10-14 23:11:12,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-14 23:11:12,243 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2019-10-14 23:11:12,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:12,244 INFO L225 Difference]: With dead ends: 98 [2019-10-14 23:11:12,245 INFO L226 Difference]: Without dead ends: 91 [2019-10-14 23:11:12,245 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=179, Invalid=1227, Unknown=0, NotChecked=0, Total=1406 [2019-10-14 23:11:12,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-14 23:11:12,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 70. [2019-10-14 23:11:12,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-14 23:11:12,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 83 transitions. [2019-10-14 23:11:12,253 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 83 transitions. Word has length 46 [2019-10-14 23:11:12,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:12,253 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 83 transitions. [2019-10-14 23:11:12,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-14 23:11:12,253 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2019-10-14 23:11:12,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-14 23:11:12,254 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:12,254 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:12,458 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:12,459 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:12,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:12,459 INFO L82 PathProgramCache]: Analyzing trace with hash 786550302, now seen corresponding path program 1 times [2019-10-14 23:11:12,460 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:12,460 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977852658] [2019-10-14 23:11:12,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:12,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:12,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:12,546 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-14 23:11:12,547 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977852658] [2019-10-14 23:11:12,547 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495746758] [2019-10-14 23:11:12,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:12,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:12,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-14 23:11:12,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:12,734 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-14 23:11:12,734 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:12,734 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 6 [2019-10-14 23:11:12,735 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806428204] [2019-10-14 23:11:12,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:11:12,736 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:12,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:11:12,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:11:12,737 INFO L87 Difference]: Start difference. First operand 70 states and 83 transitions. Second operand 6 states. [2019-10-14 23:11:13,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:13,012 INFO L93 Difference]: Finished difference Result 113 states and 136 transitions. [2019-10-14 23:11:13,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:11:13,013 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-10-14 23:11:13,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:13,014 INFO L225 Difference]: With dead ends: 113 [2019-10-14 23:11:13,014 INFO L226 Difference]: Without dead ends: 60 [2019-10-14 23:11:13,015 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:11:13,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-10-14 23:11:13,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-10-14 23:11:13,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-10-14 23:11:13,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 67 transitions. [2019-10-14 23:11:13,032 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 67 transitions. Word has length 46 [2019-10-14 23:11:13,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:13,033 INFO L462 AbstractCegarLoop]: Abstraction has 60 states and 67 transitions. [2019-10-14 23:11:13,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:11:13,035 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 67 transitions. [2019-10-14 23:11:13,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-14 23:11:13,036 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:13,036 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:13,237 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:13,237 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:13,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:13,238 INFO L82 PathProgramCache]: Analyzing trace with hash 502857859, now seen corresponding path program 1 times [2019-10-14 23:11:13,238 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:13,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539870386] [2019-10-14 23:11:13,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:13,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:13,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:13,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:13,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:13,876 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 41 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-14 23:11:13,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539870386] [2019-10-14 23:11:13,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490190249] [2019-10-14 23:11:13,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:14,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:14,031 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-14 23:11:14,034 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:14,042 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:11:14,043 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:14,044 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:14,044 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:14,044 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-14 23:11:14,063 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:14,063 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:11:14,064 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:14,080 INFO L567 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-10-14 23:11:14,080 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:14,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2019-10-14 23:11:14,119 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_31|], 2=[|v_#memory_int_29|]} [2019-10-14 23:11:14,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:14,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:14,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:14,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:14,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:14,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:14,142 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2019-10-14 23:11:14,142 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:14,159 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:14,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:14,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:14,166 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:14,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:14,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:14,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:14,170 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-10-14 23:11:14,170 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:14,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:14,185 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:14,186 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:43 [2019-10-14 23:11:14,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:14,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:14,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:14,252 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-10-14 23:11:14,279 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:14,294 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:14,295 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-10-14 23:11:14,295 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:43 [2019-10-14 23:11:14,425 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:14,425 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-14 23:11:14,426 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:14,441 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:14,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:14,442 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:48, output treesize:33 [2019-10-14 23:11:14,483 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_19|, |v_#memory_$Pointer$.base_21|], 2=[|v_#memory_int_30|], 30=[|v_#memory_int_33|]} [2019-10-14 23:11:14,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:14,493 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-10-14 23:11:14,493 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:14,552 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:14,561 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:14,573 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-10-14 23:11:14,573 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:14,635 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:14,639 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:14,674 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:14,696 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:14,699 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:14,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:14,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:14,701 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:14,702 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:14,703 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:14,704 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:14,706 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:14,707 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:14,708 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:14,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:14,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:14,715 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 69 [2019-10-14 23:11:14,716 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:14,747 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:14,747 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:14,748 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:120, output treesize:94 [2019-10-14 23:11:14,842 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_22|, |v_#memory_$Pointer$.offset_20|], 30=[|v_#memory_int_34|]} [2019-10-14 23:11:14,849 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:14,888 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:14,889 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 138 treesize of output 143 [2019-10-14 23:11:14,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:14,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-14 23:11:14,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:14,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:14,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 5 xjuncts. [2019-10-14 23:11:15,040 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 55 [2019-10-14 23:11:15,041 INFO L567 ElimStorePlain]: treesize reduction 1089, result has 13.6 percent of original size [2019-10-14 23:11:15,047 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:15,049 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 146 treesize of output 142 [2019-10-14 23:11:15,050 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:15,091 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:15,104 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:15,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:15,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:15,110 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 83 [2019-10-14 23:11:15,111 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:15,144 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:15,144 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:15,145 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:181, output treesize:128 [2019-10-14 23:11:15,652 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:15,670 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:15,670 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 94 treesize of output 73 [2019-10-14 23:11:15,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:15,721 INFO L567 ElimStorePlain]: treesize reduction 28, result has 75.2 percent of original size [2019-10-14 23:11:15,733 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:15,734 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 35 treesize of output 13 [2019-10-14 23:11:15,735 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:15,750 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:15,751 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:15,751 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:146, output treesize:54 [2019-10-14 23:11:15,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:15,850 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 41 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-14 23:11:15,850 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:15,850 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 33 [2019-10-14 23:11:15,850 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052948364] [2019-10-14 23:11:15,851 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-14 23:11:15,851 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:15,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-14 23:11:15,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=966, Unknown=0, NotChecked=0, Total=1056 [2019-10-14 23:11:15,852 INFO L87 Difference]: Start difference. First operand 60 states and 67 transitions. Second operand 33 states. [2019-10-14 23:11:17,212 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 70 [2019-10-14 23:11:17,492 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 97 [2019-10-14 23:11:17,658 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 60 [2019-10-14 23:11:18,075 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 68 [2019-10-14 23:11:18,294 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 76 [2019-10-14 23:11:18,835 WARN L191 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 135 [2019-10-14 23:11:19,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:19,718 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2019-10-14 23:11:19,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-14 23:11:19,719 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 51 [2019-10-14 23:11:19,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:19,720 INFO L225 Difference]: With dead ends: 79 [2019-10-14 23:11:19,720 INFO L226 Difference]: Without dead ends: 74 [2019-10-14 23:11:19,722 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=289, Invalid=2063, Unknown=0, NotChecked=0, Total=2352 [2019-10-14 23:11:19,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-14 23:11:19,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 63. [2019-10-14 23:11:19,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-10-14 23:11:19,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2019-10-14 23:11:19,728 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 51 [2019-10-14 23:11:19,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:19,728 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2019-10-14 23:11:19,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-14 23:11:19,728 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2019-10-14 23:11:19,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-14 23:11:19,729 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:19,729 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:19,944 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:19,944 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:19,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:19,945 INFO L82 PathProgramCache]: Analyzing trace with hash 504706823, now seen corresponding path program 1 times [2019-10-14 23:11:19,945 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:19,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421351839] [2019-10-14 23:11:19,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:19,946 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:19,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:20,573 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 38 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-14 23:11:20,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421351839] [2019-10-14 23:11:20,574 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958299993] [2019-10-14 23:11:20,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:20,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:20,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 62 conjunts are in the unsatisfiable core [2019-10-14 23:11:20,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:20,719 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:11:20,719 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:20,720 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:20,721 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:20,721 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-14 23:11:20,740 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:20,740 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:11:20,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:20,787 INFO L567 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-10-14 23:11:20,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:20,788 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2019-10-14 23:11:20,823 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_37|], 2=[|v_#memory_int_35|]} [2019-10-14 23:11:20,827 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:20,828 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:20,829 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:20,830 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:20,832 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:20,833 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:20,843 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2019-10-14 23:11:20,843 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:20,861 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:20,865 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:20,866 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:20,867 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:20,868 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:20,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:20,871 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:20,873 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-10-14 23:11:20,873 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:20,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:20,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:20,889 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:43 [2019-10-14 23:11:20,941 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:20,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:20,942 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:20,943 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-10-14 23:11:20,944 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:20,959 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:20,960 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-10-14 23:11:20,960 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:43 [2019-10-14 23:11:21,067 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:21,068 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-14 23:11:21,068 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:21,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:21,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:21,086 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:36 [2019-10-14 23:11:21,135 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_23|, |v_#memory_$Pointer$.offset_21|], 2=[|v_#memory_int_36|], 30=[|v_#memory_int_39|]} [2019-10-14 23:11:21,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:21,157 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-10-14 23:11:21,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:21,202 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:21,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:21,219 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-10-14 23:11:21,219 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:21,258 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:21,262 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:21,298 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:21,309 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:21,310 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:21,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:21,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:21,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:21,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:21,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:21,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:21,331 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:21,332 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:21,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:21,334 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:21,335 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:21,337 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 69 [2019-10-14 23:11:21,338 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:21,369 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:21,369 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:21,370 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:123, output treesize:97 [2019-10-14 23:11:21,449 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_24|, |v_#memory_$Pointer$.offset_22|], 30=[|v_#memory_int_40|]} [2019-10-14 23:11:21,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:21,456 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:21,458 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:11:21,471 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:21,471 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 101 [2019-10-14 23:11:21,472 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:21,567 INFO L567 ElimStorePlain]: treesize reduction 30, result has 85.3 percent of original size [2019-10-14 23:11:21,575 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:21,577 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 42 treesize of output 38 [2019-10-14 23:11:21,578 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:21,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:21,639 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:21,641 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:21,642 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:21,645 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 83 [2019-10-14 23:11:21,646 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:21,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:21,680 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:21,680 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:184, output treesize:131 [2019-10-14 23:11:22,135 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:22,135 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 78 treesize of output 53 [2019-10-14 23:11:22,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:22,180 INFO L567 ElimStorePlain]: treesize reduction 8, result has 90.4 percent of original size [2019-10-14 23:11:22,184 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 29 treesize of output 13 [2019-10-14 23:11:22,184 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:22,201 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:22,202 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-10-14 23:11:22,203 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:120, output treesize:50 [2019-10-14 23:11:22,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:22,295 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 38 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-14 23:11:22,296 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:22,296 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17] total 32 [2019-10-14 23:11:22,296 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656775101] [2019-10-14 23:11:22,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-14 23:11:22,297 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:22,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-14 23:11:22,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=896, Unknown=0, NotChecked=0, Total=992 [2019-10-14 23:11:22,298 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand 32 states. [2019-10-14 23:11:23,395 WARN L191 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-10-14 23:11:23,687 WARN L191 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 95 [2019-10-14 23:11:24,279 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2019-10-14 23:11:24,702 WARN L191 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 133 [2019-10-14 23:11:25,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:25,123 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2019-10-14 23:11:25,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-14 23:11:25,129 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 51 [2019-10-14 23:11:25,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:25,130 INFO L225 Difference]: With dead ends: 76 [2019-10-14 23:11:25,130 INFO L226 Difference]: Without dead ends: 74 [2019-10-14 23:11:25,131 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=280, Invalid=1790, Unknown=0, NotChecked=0, Total=2070 [2019-10-14 23:11:25,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-14 23:11:25,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 66. [2019-10-14 23:11:25,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-14 23:11:25,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2019-10-14 23:11:25,137 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 51 [2019-10-14 23:11:25,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:25,137 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2019-10-14 23:11:25,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-14 23:11:25,138 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2019-10-14 23:11:25,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-14 23:11:25,138 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:25,138 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:25,342 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:25,342 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:25,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:25,343 INFO L82 PathProgramCache]: Analyzing trace with hash 504704901, now seen corresponding path program 1 times [2019-10-14 23:11:25,343 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:25,344 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355248010] [2019-10-14 23:11:25,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:25,344 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:25,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:25,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:25,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:25,977 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 39 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-14 23:11:25,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355248010] [2019-10-14 23:11:25,977 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21271082] [2019-10-14 23:11:25,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:26,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 63 conjunts are in the unsatisfiable core [2019-10-14 23:11:26,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:26,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:11:26,135 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:26,136 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:26,137 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:26,137 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-10-14 23:11:26,152 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:26,152 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:11:26,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:26,173 INFO L567 ElimStorePlain]: treesize reduction 14, result has 56.3 percent of original size [2019-10-14 23:11:26,174 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:26,174 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:18 [2019-10-14 23:11:26,211 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_int_43|], 2=[|v_#memory_int_41|]} [2019-10-14 23:11:26,214 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,215 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,217 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,218 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,219 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,220 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,231 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 7 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 26 [2019-10-14 23:11:26,232 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:26,257 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:26,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,261 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,262 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,263 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,264 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,265 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,268 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-10-14 23:11:26,269 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:26,281 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:26,281 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:26,282 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:69, output treesize:43 [2019-10-14 23:11:26,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,328 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,330 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 35 [2019-10-14 23:11:26,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:26,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:26,349 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-10-14 23:11:26,350 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:62, output treesize:43 [2019-10-14 23:11:26,454 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:26,454 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 26 [2019-10-14 23:11:26,455 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:26,469 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:26,470 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:26,470 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:36 [2019-10-14 23:11:26,520 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_25|, |v_#memory_$Pointer$.offset_23|], 2=[|v_#memory_int_42|], 30=[|v_#memory_int_45|]} [2019-10-14 23:11:26,528 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,531 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-10-14 23:11:26,532 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:26,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:26,586 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,587 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-10-14 23:11:26,587 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:26,633 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:26,635 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:26,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:26,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,673 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,674 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,675 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,677 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,678 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,680 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,681 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,682 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,683 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,684 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,685 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,686 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 14 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 69 [2019-10-14 23:11:26,689 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:26,724 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:26,725 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:26,725 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:123, output treesize:97 [2019-10-14 23:11:26,840 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.base_26|, |v_#memory_$Pointer$.offset_24|], 30=[|v_#memory_int_46|]} [2019-10-14 23:11:26,844 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,845 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,846 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:11:26,856 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:26,856 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 138 treesize of output 101 [2019-10-14 23:11:26,857 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:26,947 INFO L567 ElimStorePlain]: treesize reduction 30, result has 85.3 percent of original size [2019-10-14 23:11:26,952 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:26,954 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 42 treesize of output 38 [2019-10-14 23:11:26,954 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:26,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:27,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:27,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:27,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:27,006 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 83 [2019-10-14 23:11:27,007 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:27,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:27,058 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:27,058 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:184, output treesize:131 [2019-10-14 23:11:27,467 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:27,468 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 78 treesize of output 53 [2019-10-14 23:11:27,469 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:27,529 INFO L567 ElimStorePlain]: treesize reduction 8, result has 90.4 percent of original size [2019-10-14 23:11:27,532 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 29 treesize of output 13 [2019-10-14 23:11:27,533 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:27,547 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:27,549 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-10-14 23:11:27,549 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:120, output treesize:50 [2019-10-14 23:11:27,621 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:27,647 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 39 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-14 23:11:27,648 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:27,648 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18] total 33 [2019-10-14 23:11:27,648 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076418063] [2019-10-14 23:11:27,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-14 23:11:27,649 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:27,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-14 23:11:27,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=958, Unknown=0, NotChecked=0, Total=1056 [2019-10-14 23:11:27,649 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand 33 states. [2019-10-14 23:11:28,754 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 60 [2019-10-14 23:11:29,011 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 98 [2019-10-14 23:11:29,626 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2019-10-14 23:11:30,077 WARN L191 SmtUtils]: Spent 373.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 136 [2019-10-14 23:11:30,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:30,649 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2019-10-14 23:11:30,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-14 23:11:30,650 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 51 [2019-10-14 23:11:30,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:30,651 INFO L225 Difference]: With dead ends: 76 [2019-10-14 23:11:30,651 INFO L226 Difference]: Without dead ends: 73 [2019-10-14 23:11:30,652 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 467 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=300, Invalid=2052, Unknown=0, NotChecked=0, Total=2352 [2019-10-14 23:11:30,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-10-14 23:11:30,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2019-10-14 23:11:30,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-14 23:11:30,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2019-10-14 23:11:30,657 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 51 [2019-10-14 23:11:30,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:30,658 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2019-10-14 23:11:30,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-14 23:11:30,658 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2019-10-14 23:11:30,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-14 23:11:30,658 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:30,659 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 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] [2019-10-14 23:11:30,862 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:30,863 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:30,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:30,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1696926855, now seen corresponding path program 1 times [2019-10-14 23:11:30,864 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:30,864 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068745785] [2019-10-14 23:11:30,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:30,864 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:30,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:31,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:31,458 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 38 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-14 23:11:31,459 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068745785] [2019-10-14 23:11:31,459 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096639676] [2019-10-14 23:11:31,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:31,606 INFO L256 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 68 conjunts are in the unsatisfiable core [2019-10-14 23:11:31,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:11:31,613 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 23:11:31,613 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:31,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:31,618 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:31,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-14 23:11:31,687 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:31,688 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 39 [2019-10-14 23:11:31,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:31,712 INFO L567 ElimStorePlain]: treesize reduction 14, result has 60.0 percent of original size [2019-10-14 23:11:31,713 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:31,713 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:21 [2019-10-14 23:11:31,749 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:31,751 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-10-14 23:11:31,751 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:31,766 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:31,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:31,766 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:39 [2019-10-14 23:11:31,837 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:31,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:31,840 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:11:31,852 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:31,853 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 63 [2019-10-14 23:11:31,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:31,900 INFO L567 ElimStorePlain]: treesize reduction 40, result has 56.5 percent of original size [2019-10-14 23:11:31,901 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:31,901 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:72, output treesize:52 [2019-10-14 23:11:31,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:32,002 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:32,002 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 32 [2019-10-14 23:11:32,003 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:32,016 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:32,017 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:32,017 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:60, output treesize:53 [2019-10-14 23:11:32,068 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_25|], 2=[|v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.base_29|], 4=[|v_#memory_$Pointer$.base_30|], 12=[|v_#memory_$Pointer$.base_32|]} [2019-10-14 23:11:32,076 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:32,078 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2019-10-14 23:11:32,079 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:32,139 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:32,142 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:32,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:32,193 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:32,233 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:32,236 INFO L496 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:32,268 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:32,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:32,273 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:32,274 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:32,275 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:32,276 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:32,277 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:32,278 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:32,279 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:32,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:32,281 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:32,283 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:32,286 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:32,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:32,287 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:32,288 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:11:32,291 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:32,291 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:11:32,309 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:32,309 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 16 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 74 treesize of output 110 [2019-10-14 23:11:32,310 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:32,387 INFO L567 ElimStorePlain]: treesize reduction 58, result has 65.5 percent of original size [2019-10-14 23:11:32,388 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:32,388 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:142, output treesize:85 [2019-10-14 23:11:32,458 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_26|], 21=[|v_#memory_$Pointer$.base_33|]} [2019-10-14 23:11:32,462 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:32,463 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:32,464 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 42 treesize of output 38 [2019-10-14 23:11:32,465 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:32,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:32,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:32,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:32,497 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:11:32,499 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:11:32,547 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:32,547 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 11 case distinctions, treesize of input 110 treesize of output 136 [2019-10-14 23:11:32,549 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:32,634 INFO L567 ElimStorePlain]: treesize reduction 172, result has 38.6 percent of original size [2019-10-14 23:11:32,635 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:32,635 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:141, output treesize:108 [2019-10-14 23:11:32,951 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 23:11:32,952 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 33 treesize of output 13 [2019-10-14 23:11:32,953 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:32,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:32,969 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 23:11:32,969 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:101, output treesize:72 [2019-10-14 23:11:33,051 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:11:33,052 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 10 case distinctions, treesize of input 73 treesize of output 59 [2019-10-14 23:11:33,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:33,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:33,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:33,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:33,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:33,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:33,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:11:33,056 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:11:33,073 INFO L567 ElimStorePlain]: treesize reduction 56, result has 13.8 percent of original size [2019-10-14 23:11:33,073 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:11:33,074 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:73, output treesize:4 [2019-10-14 23:11:33,115 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 38 proven. 12 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-10-14 23:11:33,115 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:11:33,115 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17] total 36 [2019-10-14 23:11:33,115 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1171008943] [2019-10-14 23:11:33,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-14 23:11:33,116 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:11:33,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-14 23:11:33,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=1159, Unknown=0, NotChecked=0, Total=1260 [2019-10-14 23:11:33,117 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand 36 states. [2019-10-14 23:11:34,366 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-10-14 23:11:34,555 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2019-10-14 23:11:34,811 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 86 [2019-10-14 23:11:35,519 WARN L191 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 118 [2019-10-14 23:11:36,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:11:36,210 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2019-10-14 23:11:36,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-14 23:11:36,211 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 52 [2019-10-14 23:11:36,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:11:36,211 INFO L225 Difference]: With dead ends: 73 [2019-10-14 23:11:36,212 INFO L226 Difference]: Without dead ends: 66 [2019-10-14 23:11:36,213 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=308, Invalid=2448, Unknown=0, NotChecked=0, Total=2756 [2019-10-14 23:11:36,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-14 23:11:36,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-10-14 23:11:36,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-14 23:11:36,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 73 transitions. [2019-10-14 23:11:36,219 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 73 transitions. Word has length 52 [2019-10-14 23:11:36,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:11:36,219 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 73 transitions. [2019-10-14 23:11:36,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-14 23:11:36,219 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 73 transitions. [2019-10-14 23:11:36,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-10-14 23:11:36,219 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:11:36,220 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:11:36,420 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:11:36,420 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:11:36,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:11:36,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1861227850, now seen corresponding path program 2 times [2019-10-14 23:11:36,421 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:11:36,422 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047924130] [2019-10-14 23:11:36,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:36,422 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:11:36,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:11:36,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:11:36,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat