java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-ext3-properties/sll_of_sll_nondet_append-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:12:05,386 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:12:05,391 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:12:05,403 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:12:05,403 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:12:05,404 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:12:05,406 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:12:05,408 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:12:05,410 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:12:05,410 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:12:05,411 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:12:05,413 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:12:05,413 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:12:05,414 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:12:05,415 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:12:05,416 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:12:05,417 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:12:05,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:12:05,420 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:12:05,422 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:12:05,423 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:12:05,424 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:12:05,426 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:12:05,426 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:12:05,429 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:12:05,429 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:12:05,430 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:12:05,431 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:12:05,431 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:12:05,432 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:12:05,433 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:12:05,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:12:05,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:12:05,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:12:05,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:12:05,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:12:05,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:12:05,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:12:05,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:12:05,438 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:12:05,439 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:12:05,440 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-13 19:12:05,466 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:12:05,467 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:12:05,468 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:12:05,468 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:12:05,469 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:12:05,469 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:12:05,469 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:12:05,470 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:12:05,470 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:12:05,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:12:05,471 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:12:05,471 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:12:05,472 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:12:05,472 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:12:05,472 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:12:05,472 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:12:05,473 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:12:05,473 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:12:05,473 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:12:05,473 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:12:05,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:12:05,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:12:05,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:12:05,475 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:12:05,475 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:12:05,475 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:12:05,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:12:05,475 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:12:05,476 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:12:05,799 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:12:05,816 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:12:05,819 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:12:05,821 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:12:05,822 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:12:05,823 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/sll_of_sll_nondet_append-1.i [2019-10-13 19:12:05,894 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a3b1d62b/20132b6b8081476cb1b87edb635be534/FLAG57c562612 [2019-10-13 19:12:06,482 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:12:06,483 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/sll_of_sll_nondet_append-1.i [2019-10-13 19:12:06,507 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a3b1d62b/20132b6b8081476cb1b87edb635be534/FLAG57c562612 [2019-10-13 19:12:06,730 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a3b1d62b/20132b6b8081476cb1b87edb635be534 [2019-10-13 19:12:06,739 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:12:06,740 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:12:06,741 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:12:06,741 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:12:06,744 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:12:06,745 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:12:06" (1/1) ... [2019-10-13 19:12:06,747 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9aa9a2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:06, skipping insertion in model container [2019-10-13 19:12:06,748 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:12:06" (1/1) ... [2019-10-13 19:12:06,755 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:12:06,800 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:12:07,259 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:12:07,273 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:12:07,325 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:12:07,395 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:12:07,396 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:07 WrapperNode [2019-10-13 19:12:07,396 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:12:07,397 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:12:07,397 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:12:07,397 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:12:07,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:07" (1/1) ... [2019-10-13 19:12:07,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:07" (1/1) ... [2019-10-13 19:12:07,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:07" (1/1) ... [2019-10-13 19:12:07,429 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:07" (1/1) ... [2019-10-13 19:12:07,450 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:07" (1/1) ... [2019-10-13 19:12:07,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:07" (1/1) ... [2019-10-13 19:12:07,461 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:07" (1/1) ... [2019-10-13 19:12:07,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:12:07,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:12:07,470 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:12:07,470 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:12:07,471 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:07" (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-13 19:12:07,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:12:07,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:12:07,528 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-13 19:12:07,528 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-13 19:12:07,529 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-10-13 19:12:07,529 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-10-13 19:12:07,529 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create_with_sublist [2019-10-13 19:12:07,529 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_length [2019-10-13 19:12:07,529 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_append [2019-10-13 19:12:07,529 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_hierarchical_destroy [2019-10-13 19:12:07,530 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:12:07,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:12:07,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 19:12:07,530 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-13 19:12:07,530 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-13 19:12:07,531 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 19:12:07,531 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 19:12:07,531 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 19:12:07,531 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 19:12:07,531 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 19:12:07,531 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 19:12:07,532 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 19:12:07,532 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 19:12:07,532 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 19:12:07,532 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 19:12:07,532 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 19:12:07,533 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 19:12:07,533 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 19:12:07,533 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 19:12:07,533 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 19:12:07,533 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 19:12:07,533 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 19:12:07,534 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 19:12:07,534 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 19:12:07,534 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 19:12:07,534 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 19:12:07,534 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 19:12:07,534 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 19:12:07,535 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 19:12:07,535 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 19:12:07,535 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 19:12:07,535 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 19:12:07,535 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 19:12:07,535 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 19:12:07,536 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 19:12:07,536 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 19:12:07,536 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 19:12:07,536 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 19:12:07,536 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 19:12:07,537 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 19:12:07,537 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 19:12:07,537 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 19:12:07,537 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 19:12:07,537 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 19:12:07,537 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 19:12:07,537 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 19:12:07,538 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 19:12:07,538 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 19:12:07,538 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 19:12:07,538 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 19:12:07,538 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 19:12:07,538 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 19:12:07,539 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 19:12:07,539 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 19:12:07,539 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 19:12:07,539 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 19:12:07,539 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 19:12:07,539 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 19:12:07,540 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 19:12:07,540 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-13 19:12:07,540 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 19:12:07,540 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 19:12:07,540 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 19:12:07,540 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-13 19:12:07,541 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 19:12:07,541 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 19:12:07,541 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-13 19:12:07,541 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 19:12:07,541 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 19:12:07,542 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-13 19:12:07,542 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 19:12:07,542 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 19:12:07,542 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 19:12:07,542 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 19:12:07,542 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 19:12:07,543 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 19:12:07,543 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 19:12:07,543 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 19:12:07,543 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 19:12:07,543 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 19:12:07,543 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 19:12:07,543 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 19:12:07,544 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 19:12:07,544 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 19:12:07,544 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 19:12:07,544 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 19:12:07,544 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 19:12:07,544 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 19:12:07,545 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 19:12:07,545 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 19:12:07,545 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 19:12:07,545 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 19:12:07,545 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 19:12:07,545 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 19:12:07,545 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 19:12:07,546 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 19:12:07,546 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 19:12:07,546 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 19:12:07,546 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 19:12:07,546 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 19:12:07,546 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 19:12:07,546 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 19:12:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 19:12:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 19:12:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 19:12:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 19:12:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 19:12:07,547 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 19:12:07,548 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-10-13 19:12:07,548 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-10-13 19:12:07,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 19:12:07,548 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 19:12:07,548 INFO L130 BoogieDeclarations]: Found specification of procedure node_create_with_sublist [2019-10-13 19:12:07,548 INFO L130 BoogieDeclarations]: Found specification of procedure sll_length [2019-10-13 19:12:07,548 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 19:12:07,549 INFO L130 BoogieDeclarations]: Found specification of procedure sll_append [2019-10-13 19:12:07,549 INFO L130 BoogieDeclarations]: Found specification of procedure sll_hierarchical_destroy [2019-10-13 19:12:07,549 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 19:12:07,549 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:12:07,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 19:12:07,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-13 19:12:07,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:12:07,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:12:07,917 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-10-13 19:12:08,207 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:12:08,208 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-13 19:12:08,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:12:08 BoogieIcfgContainer [2019-10-13 19:12:08,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:12:08,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:12:08,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:12:08,218 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:12:08,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:12:06" (1/3) ... [2019-10-13 19:12:08,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5942288a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:12:08, skipping insertion in model container [2019-10-13 19:12:08,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:12:07" (2/3) ... [2019-10-13 19:12:08,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5942288a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:12:08, skipping insertion in model container [2019-10-13 19:12:08,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:12:08" (3/3) ... [2019-10-13 19:12:08,231 INFO L109 eAbstractionObserver]: Analyzing ICFG sll_of_sll_nondet_append-1.i [2019-10-13 19:12:08,242 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:12:08,252 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:12:08,265 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:12:08,305 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:12:08,305 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:12:08,305 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:12:08,306 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:12:08,306 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:12:08,306 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:12:08,306 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:12:08,306 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:12:08,328 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states. [2019-10-13 19:12:08,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-13 19:12:08,334 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:08,335 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:08,338 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:08,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:08,344 INFO L82 PathProgramCache]: Analyzing trace with hash 881770505, now seen corresponding path program 1 times [2019-10-13 19:12:08,354 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:08,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760256594] [2019-10-13 19:12:08,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:08,355 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:08,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:08,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:08,523 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-13 19:12:08,524 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760256594] [2019-10-13 19:12:08,525 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:12:08,525 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 19:12:08,526 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780023243] [2019-10-13 19:12:08,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 19:12:08,533 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:08,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 19:12:08,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:12:08,550 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 3 states. [2019-10-13 19:12:08,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:08,815 INFO L93 Difference]: Finished difference Result 141 states and 202 transitions. [2019-10-13 19:12:08,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 19:12:08,816 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-10-13 19:12:08,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:08,827 INFO L225 Difference]: With dead ends: 141 [2019-10-13 19:12:08,828 INFO L226 Difference]: Without dead ends: 56 [2019-10-13 19:12:08,832 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 19:12:08,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-13 19:12:08,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2019-10-13 19:12:08,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-10-13 19:12:08,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2019-10-13 19:12:08,896 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 11 [2019-10-13 19:12:08,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:08,896 INFO L462 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2019-10-13 19:12:08,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 19:12:08,897 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2019-10-13 19:12:08,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-13 19:12:08,899 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:08,900 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:08,900 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:08,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:08,901 INFO L82 PathProgramCache]: Analyzing trace with hash 857758959, now seen corresponding path program 1 times [2019-10-13 19:12:08,901 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:08,902 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911663567] [2019-10-13 19:12:08,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:08,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:08,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:09,049 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-13 19:12:09,052 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911663567] [2019-10-13 19:12:09,052 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:12:09,052 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:12:09,052 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315472485] [2019-10-13 19:12:09,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:12:09,056 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:09,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:12:09,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:12:09,057 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand 4 states. [2019-10-13 19:12:09,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:09,211 INFO L93 Difference]: Finished difference Result 80 states and 101 transitions. [2019-10-13 19:12:09,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:12:09,212 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-13 19:12:09,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:09,213 INFO L225 Difference]: With dead ends: 80 [2019-10-13 19:12:09,214 INFO L226 Difference]: Without dead ends: 63 [2019-10-13 19:12:09,215 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:12:09,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-13 19:12:09,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2019-10-13 19:12:09,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-13 19:12:09,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 64 transitions. [2019-10-13 19:12:09,244 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 64 transitions. Word has length 11 [2019-10-13 19:12:09,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:09,245 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 64 transitions. [2019-10-13 19:12:09,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:12:09,245 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 64 transitions. [2019-10-13 19:12:09,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 19:12:09,249 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:09,249 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:09,249 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:09,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:09,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1045120254, now seen corresponding path program 1 times [2019-10-13 19:12:09,250 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:09,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887881250] [2019-10-13 19:12:09,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:09,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:09,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:09,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:09,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-13 19:12:09,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887881250] [2019-10-13 19:12:09,390 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:12:09,391 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:12:09,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342557590] [2019-10-13 19:12:09,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:12:09,394 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:09,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:12:09,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:12:09,394 INFO L87 Difference]: Start difference. First operand 53 states and 64 transitions. Second operand 5 states. [2019-10-13 19:12:09,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:09,584 INFO L93 Difference]: Finished difference Result 83 states and 104 transitions. [2019-10-13 19:12:09,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:12:09,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-10-13 19:12:09,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:09,586 INFO L225 Difference]: With dead ends: 83 [2019-10-13 19:12:09,587 INFO L226 Difference]: Without dead ends: 63 [2019-10-13 19:12:09,587 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:12:09,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-13 19:12:09,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 57. [2019-10-13 19:12:09,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-10-13 19:12:09,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 69 transitions. [2019-10-13 19:12:09,596 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 69 transitions. Word has length 16 [2019-10-13 19:12:09,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:09,597 INFO L462 AbstractCegarLoop]: Abstraction has 57 states and 69 transitions. [2019-10-13 19:12:09,597 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:12:09,597 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 69 transitions. [2019-10-13 19:12:09,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-13 19:12:09,598 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:09,599 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:09,599 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:09,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:09,599 INFO L82 PathProgramCache]: Analyzing trace with hash 685223862, now seen corresponding path program 1 times [2019-10-13 19:12:09,599 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:09,600 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040460004] [2019-10-13 19:12:09,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:09,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:09,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:09,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:09,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:09,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:12:09,845 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040460004] [2019-10-13 19:12:09,846 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:12:09,847 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-10-13 19:12:09,847 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137070551] [2019-10-13 19:12:09,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-13 19:12:09,848 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:09,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-13 19:12:09,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-13 19:12:09,849 INFO L87 Difference]: Start difference. First operand 57 states and 69 transitions. Second operand 11 states. [2019-10-13 19:12:10,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:10,251 INFO L93 Difference]: Finished difference Result 130 states and 161 transitions. [2019-10-13 19:12:10,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 19:12:10,252 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2019-10-13 19:12:10,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:10,253 INFO L225 Difference]: With dead ends: 130 [2019-10-13 19:12:10,254 INFO L226 Difference]: Without dead ends: 84 [2019-10-13 19:12:10,255 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2019-10-13 19:12:10,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-13 19:12:10,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2019-10-13 19:12:10,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-10-13 19:12:10,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 100 transitions. [2019-10-13 19:12:10,281 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 100 transitions. Word has length 38 [2019-10-13 19:12:10,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:10,281 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 100 transitions. [2019-10-13 19:12:10,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-13 19:12:10,282 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 100 transitions. [2019-10-13 19:12:10,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-13 19:12:10,288 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:10,288 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:10,289 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:10,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:10,289 INFO L82 PathProgramCache]: Analyzing trace with hash -27576761, now seen corresponding path program 2 times [2019-10-13 19:12:10,290 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:10,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827565620] [2019-10-13 19:12:10,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:10,291 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:10,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:10,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:10,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:10,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:10,696 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:12:10,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827565620] [2019-10-13 19:12:10,697 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1673692170] [2019-10-13 19:12:10,697 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 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-13 19:12:10,826 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-13 19:12:10,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:12:10,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 19:12:10,838 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:10,944 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-13 19:12:10,945 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:12:10,945 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [16] total 18 [2019-10-13 19:12:10,945 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688535648] [2019-10-13 19:12:10,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:12:10,946 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:10,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:12:10,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2019-10-13 19:12:10,949 INFO L87 Difference]: Start difference. First operand 80 states and 100 transitions. Second operand 4 states. [2019-10-13 19:12:11,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:11,023 INFO L93 Difference]: Finished difference Result 95 states and 118 transitions. [2019-10-13 19:12:11,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:12:11,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2019-10-13 19:12:11,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:11,025 INFO L225 Difference]: With dead ends: 95 [2019-10-13 19:12:11,025 INFO L226 Difference]: Without dead ends: 93 [2019-10-13 19:12:11,026 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-10-13 19:12:11,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-10-13 19:12:11,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 82. [2019-10-13 19:12:11,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-13 19:12:11,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 102 transitions. [2019-10-13 19:12:11,049 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 102 transitions. Word has length 43 [2019-10-13 19:12:11,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:11,050 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 102 transitions. [2019-10-13 19:12:11,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:12:11,050 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 102 transitions. [2019-10-13 19:12:11,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 19:12:11,052 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:11,052 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:11,257 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:11,258 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:11,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:11,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1977264063, now seen corresponding path program 1 times [2019-10-13 19:12:11,258 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:11,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657251118] [2019-10-13 19:12:11,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:11,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:11,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:11,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:11,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:11,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:11,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:11,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:11,527 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 19:12:11,528 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657251118] [2019-10-13 19:12:11,529 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1321341344] [2019-10-13 19:12:11,531 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-13 19:12:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:11,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-13 19:12:11,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:11,790 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:12:11,791 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-13 19:12:11,791 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 18 [2019-10-13 19:12:11,793 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120792496] [2019-10-13 19:12:11,794 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 19:12:11,795 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:11,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 19:12:11,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2019-10-13 19:12:11,795 INFO L87 Difference]: Start difference. First operand 82 states and 102 transitions. Second operand 10 states. [2019-10-13 19:12:12,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:12,019 INFO L93 Difference]: Finished difference Result 159 states and 196 transitions. [2019-10-13 19:12:12,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 19:12:12,020 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-10-13 19:12:12,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:12,021 INFO L225 Difference]: With dead ends: 159 [2019-10-13 19:12:12,021 INFO L226 Difference]: Without dead ends: 84 [2019-10-13 19:12:12,022 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=370, Unknown=0, NotChecked=0, Total=420 [2019-10-13 19:12:12,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-13 19:12:12,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 69. [2019-10-13 19:12:12,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-10-13 19:12:12,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 85 transitions. [2019-10-13 19:12:12,031 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 85 transitions. Word has length 54 [2019-10-13 19:12:12,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:12,032 INFO L462 AbstractCegarLoop]: Abstraction has 69 states and 85 transitions. [2019-10-13 19:12:12,032 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 19:12:12,032 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 85 transitions. [2019-10-13 19:12:12,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-13 19:12:12,033 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:12,033 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 19:12:12,236 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:12,237 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:12,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:12,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1552707912, now seen corresponding path program 1 times [2019-10-13 19:12:12,238 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:12,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110772900] [2019-10-13 19:12:12,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:12,239 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:12,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:12,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:12,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:12,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:12,460 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:12:12,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110772900] [2019-10-13 19:12:12,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007521507] [2019-10-13 19:12:12,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:12,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:12,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-13 19:12:12,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:12,692 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:12:12,693 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:12:12,693 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 18 [2019-10-13 19:12:12,693 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331171063] [2019-10-13 19:12:12,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-13 19:12:12,694 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:12,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-13 19:12:12,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2019-10-13 19:12:12,695 INFO L87 Difference]: Start difference. First operand 69 states and 85 transitions. Second operand 18 states. [2019-10-13 19:12:13,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:13,244 INFO L93 Difference]: Finished difference Result 147 states and 179 transitions. [2019-10-13 19:12:13,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 19:12:13,244 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 52 [2019-10-13 19:12:13,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:13,246 INFO L225 Difference]: With dead ends: 147 [2019-10-13 19:12:13,247 INFO L226 Difference]: Without dead ends: 76 [2019-10-13 19:12:13,248 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=524, Unknown=0, NotChecked=0, Total=600 [2019-10-13 19:12:13,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-13 19:12:13,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2019-10-13 19:12:13,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-13 19:12:13,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 88 transitions. [2019-10-13 19:12:13,257 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 88 transitions. Word has length 52 [2019-10-13 19:12:13,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:13,257 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 88 transitions. [2019-10-13 19:12:13,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-13 19:12:13,258 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2019-10-13 19:12:13,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 19:12:13,259 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:13,259 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:13,462 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:13,463 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:13,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:13,463 INFO L82 PathProgramCache]: Analyzing trace with hash 184700400, now seen corresponding path program 2 times [2019-10-13 19:12:13,464 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:13,464 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055672818] [2019-10-13 19:12:13,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:13,465 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:13,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:13,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:13,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:13,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:13,756 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:12:13,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055672818] [2019-10-13 19:12:13,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690583793] [2019-10-13 19:12:13,757 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 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-13 19:12:13,881 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-13 19:12:13,882 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:12:13,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-13 19:12:13,886 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:13,982 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:12:13,982 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:12:13,982 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 19 [2019-10-13 19:12:13,983 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721047445] [2019-10-13 19:12:13,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-13 19:12:13,984 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:13,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-13 19:12:13,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-10-13 19:12:13,984 INFO L87 Difference]: Start difference. First operand 72 states and 88 transitions. Second operand 19 states. [2019-10-13 19:12:14,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:14,613 INFO L93 Difference]: Finished difference Result 164 states and 202 transitions. [2019-10-13 19:12:14,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-13 19:12:14,617 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 55 [2019-10-13 19:12:14,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:14,618 INFO L225 Difference]: With dead ends: 164 [2019-10-13 19:12:14,618 INFO L226 Difference]: Without dead ends: 90 [2019-10-13 19:12:14,620 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=88, Invalid=614, Unknown=0, NotChecked=0, Total=702 [2019-10-13 19:12:14,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2019-10-13 19:12:14,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 75. [2019-10-13 19:12:14,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-13 19:12:14,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 91 transitions. [2019-10-13 19:12:14,628 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 91 transitions. Word has length 55 [2019-10-13 19:12:14,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:14,628 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 91 transitions. [2019-10-13 19:12:14,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-13 19:12:14,628 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 91 transitions. [2019-10-13 19:12:14,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 19:12:14,629 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:14,630 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:14,834 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:14,834 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:14,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:14,835 INFO L82 PathProgramCache]: Analyzing trace with hash 664839096, now seen corresponding path program 3 times [2019-10-13 19:12:14,835 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:14,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746158652] [2019-10-13 19:12:14,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:14,837 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:14,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:14,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:14,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:14,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:14,972 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-13 19:12:14,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746158652] [2019-10-13 19:12:14,974 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [177287341] [2019-10-13 19:12:14,974 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 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-13 19:12:15,071 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 19:12:15,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:12:15,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-13 19:12:15,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:15,120 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-10-13 19:12:15,120 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:12:15,121 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-10-13 19:12:15,121 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896060990] [2019-10-13 19:12:15,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-13 19:12:15,122 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:15,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-13 19:12:15,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-13 19:12:15,122 INFO L87 Difference]: Start difference. First operand 75 states and 91 transitions. Second operand 8 states. [2019-10-13 19:12:15,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:15,316 INFO L93 Difference]: Finished difference Result 127 states and 162 transitions. [2019-10-13 19:12:15,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:12:15,317 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-10-13 19:12:15,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:15,319 INFO L225 Difference]: With dead ends: 127 [2019-10-13 19:12:15,319 INFO L226 Difference]: Without dead ends: 99 [2019-10-13 19:12:15,320 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-10-13 19:12:15,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2019-10-13 19:12:15,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 86. [2019-10-13 19:12:15,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-10-13 19:12:15,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. [2019-10-13 19:12:15,329 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 107 transitions. Word has length 58 [2019-10-13 19:12:15,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:15,330 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 107 transitions. [2019-10-13 19:12:15,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-13 19:12:15,330 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2019-10-13 19:12:15,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-13 19:12:15,331 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:15,332 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:15,536 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:15,537 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:15,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:15,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1355298761, now seen corresponding path program 4 times [2019-10-13 19:12:15,538 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:15,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352450173] [2019-10-13 19:12:15,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:15,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:15,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:15,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:15,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:15,829 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 19:12:15,829 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352450173] [2019-10-13 19:12:15,830 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950388213] [2019-10-13 19:12:15,830 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST 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-13 19:12:16,017 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 19:12:16,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:12:16,019 INFO L256 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-13 19:12:16,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:16,187 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:12:16,187 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:12:16,187 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13] total 21 [2019-10-13 19:12:16,188 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362310124] [2019-10-13 19:12:16,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-13 19:12:16,191 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:16,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-13 19:12:16,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-10-13 19:12:16,192 INFO L87 Difference]: Start difference. First operand 86 states and 107 transitions. Second operand 21 states. [2019-10-13 19:12:16,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:16,854 INFO L93 Difference]: Finished difference Result 182 states and 226 transitions. [2019-10-13 19:12:16,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 19:12:16,855 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 63 [2019-10-13 19:12:16,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:16,858 INFO L225 Difference]: With dead ends: 182 [2019-10-13 19:12:16,859 INFO L226 Difference]: Without dead ends: 118 [2019-10-13 19:12:16,860 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2019-10-13 19:12:16,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-13 19:12:16,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 102. [2019-10-13 19:12:16,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-13 19:12:16,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 126 transitions. [2019-10-13 19:12:16,880 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 126 transitions. Word has length 63 [2019-10-13 19:12:16,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:16,881 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 126 transitions. [2019-10-13 19:12:16,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-13 19:12:16,881 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 126 transitions. [2019-10-13 19:12:16,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-10-13 19:12:16,883 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:16,883 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:17,092 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:17,093 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:17,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:17,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1173831873, now seen corresponding path program 5 times [2019-10-13 19:12:17,094 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:17,094 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657142617] [2019-10-13 19:12:17,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:17,094 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:17,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:17,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:17,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:17,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:17,206 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 19:12:17,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657142617] [2019-10-13 19:12:17,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976889158] [2019-10-13 19:12:17,207 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 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-13 19:12:17,445 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-10-13 19:12:17,446 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:12:17,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 14 conjunts are in the unsatisfiable core [2019-10-13 19:12:17,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:17,652 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 22 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-13 19:12:17,652 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:12:17,652 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 15] total 20 [2019-10-13 19:12:17,652 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400554516] [2019-10-13 19:12:17,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-13 19:12:17,655 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:17,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-13 19:12:17,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-10-13 19:12:17,656 INFO L87 Difference]: Start difference. First operand 102 states and 126 transitions. Second operand 20 states. [2019-10-13 19:12:18,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:18,356 INFO L93 Difference]: Finished difference Result 186 states and 239 transitions. [2019-10-13 19:12:18,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-13 19:12:18,357 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2019-10-13 19:12:18,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:18,359 INFO L225 Difference]: With dead ends: 186 [2019-10-13 19:12:18,359 INFO L226 Difference]: Without dead ends: 158 [2019-10-13 19:12:18,360 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=138, Invalid=854, Unknown=0, NotChecked=0, Total=992 [2019-10-13 19:12:18,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-13 19:12:18,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 130. [2019-10-13 19:12:18,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-10-13 19:12:18,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 162 transitions. [2019-10-13 19:12:18,373 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 162 transitions. Word has length 66 [2019-10-13 19:12:18,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:18,373 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 162 transitions. [2019-10-13 19:12:18,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-13 19:12:18,374 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 162 transitions. [2019-10-13 19:12:18,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-13 19:12:18,375 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:18,375 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:18,580 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:18,580 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:18,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:18,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1522769064, now seen corresponding path program 6 times [2019-10-13 19:12:18,581 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:18,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774146208] [2019-10-13 19:12:18,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:18,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:18,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:18,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:18,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:19,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:19,358 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 13 proven. 23 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 19:12:19,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774146208] [2019-10-13 19:12:19,359 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19290861] [2019-10-13 19:12:19,359 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE 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-13 19:12:19,530 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2019-10-13 19:12:19,530 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 19:12:19,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 74 conjunts are in the unsatisfiable core [2019-10-13 19:12:19,536 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:19,570 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-13 19:12:19,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:19,576 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:19,576 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:19,577 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-10-13 19:12:19,831 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:19,847 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:19,853 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2019-10-13 19:12:19,854 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:19,863 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:19,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2019-10-13 19:12:19,872 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:19,911 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:19,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:19,930 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2019-10-13 19:12:19,931 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:19,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:19,939 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 45 [2019-10-13 19:12:19,940 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:19,980 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:19,982 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-13 19:12:19,982 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:91, output treesize:67 [2019-10-13 19:12:20,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:20,183 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:20,193 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 56 [2019-10-13 19:12:20,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:20,207 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 53 [2019-10-13 19:12:20,208 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:20,253 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:20,259 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:20,267 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 45 [2019-10-13 19:12:20,267 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:20,276 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 42 [2019-10-13 19:12:20,277 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:20,317 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:20,318 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-13 19:12:20,318 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:123, output treesize:79 [2019-10-13 19:12:20,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:20,418 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_32|, v_prenex_3], 4=[v_prenex_2, |v_#memory_$Pointer$.base_32|]} [2019-10-13 19:12:20,448 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:20,449 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 73 [2019-10-13 19:12:20,450 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:20,558 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-10-13 19:12:20,558 INFO L567 ElimStorePlain]: treesize reduction 24, result has 80.2 percent of original size [2019-10-13 19:12:20,589 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:20,590 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 73 [2019-10-13 19:12:20,591 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:20,672 INFO L567 ElimStorePlain]: treesize reduction 16, result has 86.3 percent of original size [2019-10-13 19:12:20,734 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:20,735 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 104 [2019-10-13 19:12:20,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:20,737 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:20,846 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2019-10-13 19:12:20,846 INFO L567 ElimStorePlain]: treesize reduction 40, result has 72.4 percent of original size [2019-10-13 19:12:20,895 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:20,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 96 [2019-10-13 19:12:20,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:20,899 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:21,023 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2019-10-13 19:12:21,024 INFO L567 ElimStorePlain]: treesize reduction 32, result has 78.5 percent of original size [2019-10-13 19:12:21,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 4 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-13 19:12:21,026 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:101, output treesize:151 [2019-10-13 19:12:21,168 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:21,192 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:21,193 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 59 treesize of output 63 [2019-10-13 19:12:21,194 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:21,199 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 19:12:21,200 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2019-10-13 19:12:21,200 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:21,204 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 19:12:21,205 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2019-10-13 19:12:21,205 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:21,209 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 19:12:21,209 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:21,218 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:21,219 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 59 treesize of output 63 [2019-10-13 19:12:21,220 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:21,225 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-13 19:12:21,225 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:21,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:21,259 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-10-13 19:12:21,260 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 1 variables, input treesize:332, output treesize:107 [2019-10-13 19:12:21,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:21,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:21,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:21,491 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:21,492 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 84 treesize of output 57 [2019-10-13 19:12:21,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:21,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:21,495 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:21,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:21,507 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-13 19:12:21,513 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:21,514 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 56 [2019-10-13 19:12:21,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:21,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:21,517 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-13 19:12:21,562 INFO L567 ElimStorePlain]: treesize reduction 16, result has 82.8 percent of original size [2019-10-13 19:12:21,582 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:21,583 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 39 [2019-10-13 19:12:21,584 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:21,591 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:21,591 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 31 [2019-10-13 19:12:21,592 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:21,600 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:21,601 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-13 19:12:21,601 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:169, output treesize:9 [2019-10-13 19:12:21,746 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-13 19:12:21,746 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:12:21,746 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19] total 40 [2019-10-13 19:12:21,747 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403308342] [2019-10-13 19:12:21,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-13 19:12:21,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:21,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-13 19:12:21,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1467, Unknown=0, NotChecked=0, Total=1560 [2019-10-13 19:12:21,749 INFO L87 Difference]: Start difference. First operand 130 states and 162 transitions. Second operand 40 states. [2019-10-13 19:12:22,926 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-10-13 19:12:23,207 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-10-13 19:12:24,035 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 59 [2019-10-13 19:12:24,345 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 62 [2019-10-13 19:12:25,185 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 62 [2019-10-13 19:12:25,415 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2019-10-13 19:12:26,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:26,808 INFO L93 Difference]: Finished difference Result 327 states and 462 transitions. [2019-10-13 19:12:26,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-10-13 19:12:26,809 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 74 [2019-10-13 19:12:26,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:26,814 INFO L225 Difference]: With dead ends: 327 [2019-10-13 19:12:26,814 INFO L226 Difference]: Without dead ends: 302 [2019-10-13 19:12:26,816 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 66 SyntacticMatches, 2 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=356, Invalid=4614, Unknown=0, NotChecked=0, Total=4970 [2019-10-13 19:12:26,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-10-13 19:12:26,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 203. [2019-10-13 19:12:26,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-10-13 19:12:26,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 271 transitions. [2019-10-13 19:12:26,851 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 271 transitions. Word has length 74 [2019-10-13 19:12:26,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:26,852 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 271 transitions. [2019-10-13 19:12:26,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-13 19:12:26,852 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 271 transitions. [2019-10-13 19:12:26,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-13 19:12:26,854 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:26,854 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:12:27,067 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 19:12:27,067 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:12:27,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:12:27,067 INFO L82 PathProgramCache]: Analyzing trace with hash 977789968, now seen corresponding path program 1 times [2019-10-13 19:12:27,068 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:12:27,068 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857983379] [2019-10-13 19:12:27,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:27,068 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:12:27,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:12:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:27,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:29,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:29,212 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-13 19:12:29,212 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857983379] [2019-10-13 19:12:29,213 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125451253] [2019-10-13 19:12:29,213 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-13 19:12:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:12:29,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 98 conjunts are in the unsatisfiable core [2019-10-13 19:12:29,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 19:12:29,430 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-13 19:12:29,431 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:29,442 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:29,442 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:29,443 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-13 19:12:29,529 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-10-13 19:12:29,530 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:29,536 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:29,537 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-13 19:12:29,537 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:3 [2019-10-13 19:12:30,005 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-10-13 19:12:30,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:30,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:30,024 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-10-13 19:12:30,025 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:74, output treesize:75 [2019-10-13 19:12:30,282 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:30,283 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 91 treesize of output 215 [2019-10-13 19:12:30,285 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:30,348 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:30,348 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:30,349 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:92, output treesize:44 [2019-10-13 19:12:30,429 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_33|], 4=[|v_#memory_$Pointer$.base_34|]} [2019-10-13 19:12:30,435 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:30,435 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2019-10-13 19:12:30,436 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:30,460 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:30,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:30,472 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2019-10-13 19:12:30,473 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:30,518 INFO L567 ElimStorePlain]: treesize reduction 4, result has 94.5 percent of original size [2019-10-13 19:12:30,519 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:30,519 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:84 [2019-10-13 19:12:30,724 INFO L392 ElimStorePlain]: Different costs {6=[|v_#memory_$Pointer$.offset_34|], 12=[|v_#memory_$Pointer$.base_35|]} [2019-10-13 19:12:30,740 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:30,742 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2019-10-13 19:12:30,742 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:30,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:30,783 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:30,798 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:30,798 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 66 [2019-10-13 19:12:30,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:30,801 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:30,802 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:30,860 INFO L567 ElimStorePlain]: treesize reduction 24, result has 78.9 percent of original size [2019-10-13 19:12:30,861 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 19:12:30,861 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:112, output treesize:90 [2019-10-13 19:12:30,980 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.offset_35|], 7=[|v_#memory_$Pointer$.base_36|]} [2019-10-13 19:12:31,047 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:31,047 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 76 [2019-10-13 19:12:31,048 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:31,114 INFO L567 ElimStorePlain]: treesize reduction 48, result has 65.0 percent of original size [2019-10-13 19:12:31,175 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:31,176 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 59 treesize of output 127 [2019-10-13 19:12:31,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:31,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:31,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:31,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:31,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:31,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:31,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:31,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:31,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:31,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:31,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:31,184 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:31,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 19:12:31,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:31,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:31,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:31,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:31,188 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-13 19:12:31,306 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-10-13 19:12:31,307 INFO L567 ElimStorePlain]: treesize reduction 80, result has 57.7 percent of original size [2019-10-13 19:12:31,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:31,309 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-13 19:12:31,309 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:146 [2019-10-13 19:12:31,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:31,446 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:31,594 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:31,855 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 38 [2019-10-13 19:12:31,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:31,990 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:32,025 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:32,044 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:32,045 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 152 treesize of output 135 [2019-10-13 19:12:32,046 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:32,050 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 19:12:32,066 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:32,066 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 103 treesize of output 86 [2019-10-13 19:12:32,067 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 19:12:32,099 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 19:12:32,100 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-10-13 19:12:32,101 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:256, output treesize:158 [2019-10-13 19:12:32,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 19:12:32,771 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-13 19:12:32,771 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-13 19:12:32,771 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 49 [2019-10-13 19:12:32,771 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500105301] [2019-10-13 19:12:32,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-10-13 19:12:32,772 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:12:32,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-10-13 19:12:32,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2216, Unknown=0, NotChecked=0, Total=2352 [2019-10-13 19:12:32,774 INFO L87 Difference]: Start difference. First operand 203 states and 271 transitions. Second operand 49 states. [2019-10-13 19:12:36,717 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 53 [2019-10-13 19:12:39,699 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-10-13 19:12:40,599 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-10-13 19:12:42,040 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 78 [2019-10-13 19:12:42,587 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 41 [2019-10-13 19:12:44,529 WARN L191 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 95 [2019-10-13 19:12:45,301 WARN L191 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 107 [2019-10-13 19:12:47,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:12:47,578 INFO L93 Difference]: Finished difference Result 518 states and 759 transitions. [2019-10-13 19:12:47,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-10-13 19:12:47,578 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 75 [2019-10-13 19:12:47,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:12:47,582 INFO L225 Difference]: With dead ends: 518 [2019-10-13 19:12:47,582 INFO L226 Difference]: Without dead ends: 471 [2019-10-13 19:12:47,585 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1802 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=524, Invalid=7848, Unknown=0, NotChecked=0, Total=8372 [2019-10-13 19:12:47,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-10-13 19:12:47,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 413. [2019-10-13 19:12:47,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-10-13 19:12:47,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 571 transitions. [2019-10-13 19:12:47,638 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 571 transitions. Word has length 75 [2019-10-13 19:12:47,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:12:47,638 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 571 transitions. [2019-10-13 19:12:47,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-10-13 19:12:47,639 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 571 transitions. [2019-10-13 19:12:47,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-10-13 19:12:47,640 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:12:47,641 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]