java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/heap-data/process_queue.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:03:06,507 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:03:06,510 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:03:06,528 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:03:06,528 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:03:06,530 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:03:06,532 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:03:06,542 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:03:06,545 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:03:06,548 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:03:06,550 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:03:06,552 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:03:06,552 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:03:06,554 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:03:06,556 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:03:06,557 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:03:06,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:03:06,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:03:06,561 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:03:06,566 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:03:06,569 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:03:06,571 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:03:06,573 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:03:06,574 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:03:06,577 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:03:06,577 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:03:06,577 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:03:06,579 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:03:06,580 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:03:06,581 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:03:06,581 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:03:06,582 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:03:06,583 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:03:06,583 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:03:06,585 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:03:06,585 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:03:06,586 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:03:06,586 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:03:06,586 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:03:06,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:03:06,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:03:06,589 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-09-20 13:03:06,624 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:03:06,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:03:06,626 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-20 13:03:06,626 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-20 13:03:06,626 INFO L138 SettingsManager]: * Use SBE=true [2019-09-20 13:03:06,627 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:03:06,627 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:03:06,627 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-20 13:03:06,627 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:03:06,627 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:03:06,627 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:03:06,628 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:03:06,628 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:03:06,628 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:03:06,628 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:03:06,628 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-20 13:03:06,628 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:03:06,629 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:03:06,629 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:03:06,629 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-20 13:03:06,629 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-20 13:03:06,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:03:06,630 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:03:06,630 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:03:06,630 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-20 13:03:06,630 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-20 13:03:06,630 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:03:06,631 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-20 13:03:06,631 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:03:06,658 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:03:06,670 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:03:06,673 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:03:06,674 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:03:06,675 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:03:06,675 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/heap-data/process_queue.i [2019-09-20 13:03:06,734 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45dff1f0c/a83d8d4658a34f4f8c5d5913bf63aebe/FLAG3ad77e60e [2019-09-20 13:03:07,167 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:03:07,168 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/process_queue.i [2019-09-20 13:03:07,185 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45dff1f0c/a83d8d4658a34f4f8c5d5913bf63aebe/FLAG3ad77e60e [2019-09-20 13:03:07,489 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/45dff1f0c/a83d8d4658a34f4f8c5d5913bf63aebe [2019-09-20 13:03:07,498 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:03:07,500 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:03:07,501 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:03:07,501 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:03:07,505 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:03:07,505 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:03:07" (1/1) ... [2019-09-20 13:03:07,508 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@210b63b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:07, skipping insertion in model container [2019-09-20 13:03:07,508 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:03:07" (1/1) ... [2019-09-20 13:03:07,516 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:03:07,561 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:03:08,017 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:03:08,029 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:03:08,101 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:03:08,152 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:03:08,152 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:08 WrapperNode [2019-09-20 13:03:08,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:03:08,153 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:03:08,153 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:03:08,154 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:03:08,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:08" (1/1) ... [2019-09-20 13:03:08,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:08" (1/1) ... [2019-09-20 13:03:08,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:08" (1/1) ... [2019-09-20 13:03:08,184 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:08" (1/1) ... [2019-09-20 13:03:08,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:08" (1/1) ... [2019-09-20 13:03:08,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:08" (1/1) ... [2019-09-20 13:03:08,208 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:08" (1/1) ... [2019-09-20 13:03:08,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:03:08,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:03:08,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:03:08,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:03:08,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:08" (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-09-20 13:03:08,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:03:08,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:03:08,275 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-09-20 13:03:08,275 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-09-20 13:03:08,275 INFO L138 BoogieDeclarations]: Found implementation of procedure run_process [2019-09-20 13:03:08,275 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2019-09-20 13:03:08,276 INFO L138 BoogieDeclarations]: Found implementation of procedure choose_next [2019-09-20 13:03:08,276 INFO L138 BoogieDeclarations]: Found implementation of procedure check_queue [2019-09-20 13:03:08,276 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:03:08,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:03:08,276 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:03:08,277 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-09-20 13:03:08,277 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-09-20 13:03:08,277 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-20 13:03:08,277 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-20 13:03:08,277 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-20 13:03:08,277 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-20 13:03:08,278 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-20 13:03:08,278 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-20 13:03:08,278 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-20 13:03:08,278 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-20 13:03:08,278 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-20 13:03:08,278 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-20 13:03:08,279 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-20 13:03:08,279 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-20 13:03:08,279 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-20 13:03:08,279 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-20 13:03:08,279 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-20 13:03:08,280 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-20 13:03:08,280 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-20 13:03:08,280 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-20 13:03:08,280 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-20 13:03:08,280 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-20 13:03:08,280 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-20 13:03:08,280 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-20 13:03:08,281 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-20 13:03:08,281 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-20 13:03:08,281 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-20 13:03:08,281 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-20 13:03:08,281 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-20 13:03:08,281 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-20 13:03:08,282 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-20 13:03:08,282 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-20 13:03:08,282 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-20 13:03:08,282 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-20 13:03:08,282 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-20 13:03:08,282 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-20 13:03:08,283 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-20 13:03:08,283 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-20 13:03:08,283 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-20 13:03:08,283 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-20 13:03:08,283 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-20 13:03:08,283 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-20 13:03:08,283 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-20 13:03:08,284 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-20 13:03:08,284 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-20 13:03:08,284 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-20 13:03:08,284 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-20 13:03:08,284 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-20 13:03:08,284 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-20 13:03:08,284 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-20 13:03:08,285 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-20 13:03:08,285 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-20 13:03:08,285 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:03:08,285 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-20 13:03:08,285 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-20 13:03:08,285 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-20 13:03:08,285 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-20 13:03:08,286 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-20 13:03:08,286 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-20 13:03:08,286 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-20 13:03:08,286 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-20 13:03:08,286 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-20 13:03:08,286 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-20 13:03:08,287 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-20 13:03:08,287 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-20 13:03:08,287 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-20 13:03:08,287 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-20 13:03:08,287 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-20 13:03:08,287 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-20 13:03:08,288 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-20 13:03:08,288 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-20 13:03:08,288 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-20 13:03:08,288 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-20 13:03:08,288 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-20 13:03:08,288 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-20 13:03:08,289 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-20 13:03:08,289 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-20 13:03:08,289 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-20 13:03:08,289 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-20 13:03:08,289 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-20 13:03:08,289 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-20 13:03:08,289 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-20 13:03:08,290 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-20 13:03:08,290 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-20 13:03:08,290 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-20 13:03:08,290 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-20 13:03:08,290 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-20 13:03:08,290 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-20 13:03:08,291 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-20 13:03:08,291 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-20 13:03:08,291 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-20 13:03:08,291 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-20 13:03:08,291 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-20 13:03:08,291 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-20 13:03:08,291 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-20 13:03:08,292 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-20 13:03:08,292 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-20 13:03:08,292 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-20 13:03:08,292 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-20 13:03:08,292 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-20 13:03:08,292 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-20 13:03:08,292 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-20 13:03:08,292 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-20 13:03:08,293 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-20 13:03:08,293 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-20 13:03:08,293 INFO L130 BoogieDeclarations]: Found specification of procedure run_process [2019-09-20 13:03:08,293 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2019-09-20 13:03:08,293 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:03:08,293 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:03:08,293 INFO L130 BoogieDeclarations]: Found specification of procedure choose_next [2019-09-20 13:03:08,294 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:03:08,294 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:03:08,294 INFO L130 BoogieDeclarations]: Found specification of procedure check_queue [2019-09-20 13:03:08,294 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:03:08,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:03:08,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:03:08,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:03:08,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:03:08,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:03:08,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:03:08,835 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:03:08,835 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-20 13:03:08,836 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:03:08 BoogieIcfgContainer [2019-09-20 13:03:08,836 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:03:08,838 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:03:08,838 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:03:08,841 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:03:08,841 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:03:07" (1/3) ... [2019-09-20 13:03:08,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3671e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:03:08, skipping insertion in model container [2019-09-20 13:03:08,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:03:08" (2/3) ... [2019-09-20 13:03:08,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3671e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:03:08, skipping insertion in model container [2019-09-20 13:03:08,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:03:08" (3/3) ... [2019-09-20 13:03:08,844 INFO L109 eAbstractionObserver]: Analyzing ICFG process_queue.i [2019-09-20 13:03:08,853 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:03:08,861 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:03:08,877 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:03:08,906 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-20 13:03:08,907 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:03:08,907 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-20 13:03:08,908 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:03:08,908 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:03:08,908 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:03:08,908 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:03:08,908 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:03:08,909 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:03:08,926 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2019-09-20 13:03:08,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-09-20 13:03:08,932 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:08,933 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:08,935 INFO L418 AbstractCegarLoop]: === Iteration 1 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:08,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:08,941 INFO L82 PathProgramCache]: Analyzing trace with hash -699499398, now seen corresponding path program 1 times [2019-09-20 13:03:08,943 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:08,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:09,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:09,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:09,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:09,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:09,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:03:09,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:03:09,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:03:09,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:03:09,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:03:09,219 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 6 states. [2019-09-20 13:03:09,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:03:09,396 INFO L93 Difference]: Finished difference Result 100 states and 134 transitions. [2019-09-20 13:03:09,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 13:03:09,399 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-09-20 13:03:09,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:03:09,412 INFO L225 Difference]: With dead ends: 100 [2019-09-20 13:03:09,412 INFO L226 Difference]: Without dead ends: 54 [2019-09-20 13:03:09,419 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:03:09,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-09-20 13:03:09,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-09-20 13:03:09,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-09-20 13:03:09,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2019-09-20 13:03:09,483 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 17 [2019-09-20 13:03:09,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:03:09,484 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2019-09-20 13:03:09,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:03:09,484 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2019-09-20 13:03:09,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-20 13:03:09,486 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:09,486 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:09,486 INFO L418 AbstractCegarLoop]: === Iteration 2 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:09,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:09,487 INFO L82 PathProgramCache]: Analyzing trace with hash -436646864, now seen corresponding path program 1 times [2019-09-20 13:03:09,487 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:09,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:09,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:09,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:09,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:09,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:09,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:09,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:03:09,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-20 13:03:09,871 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 13:03:09,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 13:03:09,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:03:09,872 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 11 states. [2019-09-20 13:03:10,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:03:10,690 INFO L93 Difference]: Finished difference Result 100 states and 131 transitions. [2019-09-20 13:03:10,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-20 13:03:10,691 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2019-09-20 13:03:10,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:03:10,695 INFO L225 Difference]: With dead ends: 100 [2019-09-20 13:03:10,695 INFO L226 Difference]: Without dead ends: 98 [2019-09-20 13:03:10,696 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2019-09-20 13:03:10,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-09-20 13:03:10,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 70. [2019-09-20 13:03:10,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-09-20 13:03:10,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2019-09-20 13:03:10,723 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 20 [2019-09-20 13:03:10,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:03:10,723 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2019-09-20 13:03:10,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 13:03:10,724 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2019-09-20 13:03:10,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-09-20 13:03:10,727 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:10,728 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:10,728 INFO L418 AbstractCegarLoop]: === Iteration 3 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:10,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:10,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1313067226, now seen corresponding path program 1 times [2019-09-20 13:03:10,729 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:10,729 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:10,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:10,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:10,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:10,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:11,139 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:11,140 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:03:11,140 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:03:11,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:11,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 58 conjunts are in the unsatisfiable core [2019-09-20 13:03:11,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:03:11,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:11,360 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-09-20 13:03:11,361 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:11,387 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:11,393 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:11,394 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-09-20 13:03:11,395 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:11,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:11,420 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:11,423 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-09-20 13:03:11,423 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:11,436 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:11,441 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:11,443 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-09-20 13:03:11,443 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:11,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:11,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:11,466 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:94, output treesize:26 [2019-09-20 13:03:13,538 WARN L860 $PredicateComparison]: unable to prove that (exists ((append_to_queue_~n.base Int)) (let ((.cse1 (+ |c_append_to_queue_#in~n.offset| 8))) (and (<= |c_append_to_queue_#in~n.base| append_to_queue_~n.base) (= (let ((.cse0 (store |c_old(#memory_$Pointer$.offset)| append_to_queue_~n.base (store (select |c_old(#memory_$Pointer$.offset)| append_to_queue_~n.base) .cse1 (select (select |c_old(#memory_$Pointer$.offset)| |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset|))))) (store .cse0 |c_append_to_queue_#in~q.base| (store (select .cse0 |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset| |c_append_to_queue_#in~n.offset|))) |c_#memory_$Pointer$.offset|) (= (let ((.cse2 (store |c_old(#memory_$Pointer$.base)| append_to_queue_~n.base (store (select |c_old(#memory_$Pointer$.base)| append_to_queue_~n.base) .cse1 (select (select |c_old(#memory_$Pointer$.base)| |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset|))))) (store .cse2 |c_append_to_queue_#in~q.base| (store (select .cse2 |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset| append_to_queue_~n.base))) |c_#memory_$Pointer$.base|)))) is different from true [2019-09-20 13:03:13,568 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:13,571 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2019-09-20 13:03:13,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:13,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:13,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:13,602 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2019-09-20 13:03:13,602 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:13,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:13,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:13,618 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:42 [2019-09-20 13:03:13,812 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:03:13,814 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:13,815 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 38 [2019-09-20 13:03:13,817 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:13,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:13,839 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:13,844 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:13,844 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 28 treesize of output 23 [2019-09-20 13:03:13,845 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:13,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:13,852 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:13,852 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:7 [2019-09-20 13:03:13,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:03:13,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:03:13,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 19 [2019-09-20 13:03:13,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-20 13:03:13,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-20 13:03:13,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=266, Unknown=1, NotChecked=32, Total=342 [2019-09-20 13:03:13,869 INFO L87 Difference]: Start difference. First operand 70 states and 87 transitions. Second operand 19 states. [2019-09-20 13:03:16,119 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((append_to_queue_~n.base Int)) (let ((.cse1 (+ |c_append_to_queue_#in~n.offset| 8))) (and (<= |c_append_to_queue_#in~n.base| append_to_queue_~n.base) (= (let ((.cse0 (store |c_old(#memory_$Pointer$.offset)| append_to_queue_~n.base (store (select |c_old(#memory_$Pointer$.offset)| append_to_queue_~n.base) .cse1 (select (select |c_old(#memory_$Pointer$.offset)| |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset|))))) (store .cse0 |c_append_to_queue_#in~q.base| (store (select .cse0 |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset| |c_append_to_queue_#in~n.offset|))) |c_#memory_$Pointer$.offset|) (= (let ((.cse2 (store |c_old(#memory_$Pointer$.base)| append_to_queue_~n.base (store (select |c_old(#memory_$Pointer$.base)| append_to_queue_~n.base) .cse1 (select (select |c_old(#memory_$Pointer$.base)| |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset|))))) (store .cse2 |c_append_to_queue_#in~q.base| (store (select .cse2 |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset| append_to_queue_~n.base))) |c_#memory_$Pointer$.base|)))) (or (not (= 0 |c_append_to_queue_#in~n.offset|)) (let ((.cse4 (= |c_append_to_queue_#in~n.base| |c_append_to_queue_#in~q.base|)) (.cse3 (select (select |c_#memory_$Pointer$.base| |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset|))) (and (= (select (select |c_#memory_$Pointer$.offset| |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset|) |c_append_to_queue_#in~n.offset|) (or (= (select (select |c_#memory_$Pointer$.base| .cse3) 8) (select (select |c_old(#memory_$Pointer$.base)| |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset|)) .cse4) (or .cse4 (= (select (select |c_#memory_$Pointer$.offset| .cse3) 8) (select (select |c_old(#memory_$Pointer$.offset)| |c_append_to_queue_#in~q.base|) |c_append_to_queue_#in~q.offset|))))))) is different from true [2019-09-20 13:03:17,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:03:17,103 INFO L93 Difference]: Finished difference Result 182 states and 240 transitions. [2019-09-20 13:03:17,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-20 13:03:17,103 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 23 [2019-09-20 13:03:17,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:03:17,107 INFO L225 Difference]: With dead ends: 182 [2019-09-20 13:03:17,107 INFO L226 Difference]: Without dead ends: 130 [2019-09-20 13:03:17,108 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=101, Invalid=555, Unknown=2, NotChecked=98, Total=756 [2019-09-20 13:03:17,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-20 13:03:17,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 122. [2019-09-20 13:03:17,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2019-09-20 13:03:17,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 161 transitions. [2019-09-20 13:03:17,131 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 161 transitions. Word has length 23 [2019-09-20 13:03:17,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:03:17,132 INFO L475 AbstractCegarLoop]: Abstraction has 122 states and 161 transitions. [2019-09-20 13:03:17,132 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-20 13:03:17,132 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 161 transitions. [2019-09-20 13:03:17,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-09-20 13:03:17,133 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:17,133 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:17,134 INFO L418 AbstractCegarLoop]: === Iteration 4 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:17,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:17,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1566014097, now seen corresponding path program 1 times [2019-09-20 13:03:17,134 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:17,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:17,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:17,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:17,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:17,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:17,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:17,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:03:17,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:03:17,168 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:03:17,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:03:17,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:03:17,169 INFO L87 Difference]: Start difference. First operand 122 states and 161 transitions. Second operand 3 states. [2019-09-20 13:03:17,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:03:17,194 INFO L93 Difference]: Finished difference Result 212 states and 283 transitions. [2019-09-20 13:03:17,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:03:17,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-09-20 13:03:17,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:03:17,196 INFO L225 Difference]: With dead ends: 212 [2019-09-20 13:03:17,196 INFO L226 Difference]: Without dead ends: 141 [2019-09-20 13:03:17,197 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-09-20 13:03:17,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-09-20 13:03:17,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2019-09-20 13:03:17,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2019-09-20 13:03:17,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 183 transitions. [2019-09-20 13:03:17,218 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 183 transitions. Word has length 29 [2019-09-20 13:03:17,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:03:17,219 INFO L475 AbstractCegarLoop]: Abstraction has 141 states and 183 transitions. [2019-09-20 13:03:17,219 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:03:17,219 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 183 transitions. [2019-09-20 13:03:17,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-20 13:03:17,221 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:17,221 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:17,221 INFO L418 AbstractCegarLoop]: === Iteration 5 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:17,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:17,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1445249493, now seen corresponding path program 1 times [2019-09-20 13:03:17,222 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:17,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:17,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:17,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:17,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:17,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:17,283 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-20 13:03:17,284 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:03:17,284 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:03:17,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:17,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:17,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 28 conjunts are in the unsatisfiable core [2019-09-20 13:03:17,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:03:17,463 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:17,464 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 39 treesize of output 47 [2019-09-20 13:03:17,465 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:17,471 INFO L567 ElimStorePlain]: treesize reduction 21, result has 25.0 percent of original size [2019-09-20 13:03:17,471 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:17,471 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:7 [2019-09-20 13:03:17,490 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2019-09-20 13:03:17,491 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:17,492 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:17,492 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:17,492 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-09-20 13:03:17,497 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-20 13:03:17,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:03:17,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [8] total 11 [2019-09-20 13:03:17,502 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-20 13:03:17,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-20 13:03:17,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:03:17,503 INFO L87 Difference]: Start difference. First operand 141 states and 183 transitions. Second operand 11 states. [2019-09-20 13:03:17,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:03:17,719 INFO L93 Difference]: Finished difference Result 293 states and 391 transitions. [2019-09-20 13:03:17,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:03:17,720 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2019-09-20 13:03:17,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:03:17,722 INFO L225 Difference]: With dead ends: 293 [2019-09-20 13:03:17,722 INFO L226 Difference]: Without dead ends: 169 [2019-09-20 13:03:17,724 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-09-20 13:03:17,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-20 13:03:17,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 160. [2019-09-20 13:03:17,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2019-09-20 13:03:17,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 209 transitions. [2019-09-20 13:03:17,750 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 209 transitions. Word has length 38 [2019-09-20 13:03:17,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:03:17,750 INFO L475 AbstractCegarLoop]: Abstraction has 160 states and 209 transitions. [2019-09-20 13:03:17,750 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-20 13:03:17,750 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 209 transitions. [2019-09-20 13:03:17,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-20 13:03:17,752 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:17,752 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:17,753 INFO L418 AbstractCegarLoop]: === Iteration 6 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:17,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:17,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1053709227, now seen corresponding path program 2 times [2019-09-20 13:03:17,753 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:17,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:17,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:17,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:17,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:18,467 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-20 13:03:18,722 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:18,723 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:03:18,723 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:03:18,812 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-20 13:03:18,861 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-20 13:03:18,861 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:03:18,865 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 109 conjunts are in the unsatisfiable core [2019-09-20 13:03:18,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:03:18,923 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-09-20 13:03:18,923 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:18,932 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:18,933 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:18,933 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-09-20 13:03:19,067 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:19,068 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 39 treesize of output 47 [2019-09-20 13:03:19,069 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:19,095 INFO L567 ElimStorePlain]: treesize reduction 20, result has 73.3 percent of original size [2019-09-20 13:03:19,121 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:19,122 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 39 treesize of output 47 [2019-09-20 13:03:19,123 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:19,145 INFO L567 ElimStorePlain]: treesize reduction 20, result has 53.5 percent of original size [2019-09-20 13:03:19,146 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-09-20 13:03:19,146 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:87, output treesize:23 [2019-09-20 13:03:19,810 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:19,810 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 15 treesize of output 19 [2019-09-20 13:03:19,811 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:19,860 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:19,862 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.offset_28|, |v_#memory_$Pointer$.base_29|, |v_#memory_$Pointer$.base_31|, |v_#memory_$Pointer$.offset_30|], 4=[|v_#memory_int_24|]} [2019-09-20 13:03:19,868 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:19,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:19,940 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:19,976 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:19,981 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:19,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:19,984 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 37 [2019-09-20 13:03:19,985 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:20,022 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:20,031 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:20,032 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:20,035 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 47 treesize of output 31 [2019-09-20 13:03:20,035 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:20,074 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:20,083 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:20,086 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2019-09-20 13:03:20,087 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:20,114 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:20,115 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:20,116 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:143, output treesize:47 [2019-09-20 13:03:20,197 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:20,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:20,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:20,217 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:113, output treesize:114 [2019-09-20 13:03:22,340 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 42 [2019-09-20 13:03:22,371 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_BEFORE_CALL_2|], 4=[|v_#memory_$Pointer$.offset_BEFORE_CALL_4|, |v_old(#memory_$Pointer$.base)_AFTER_CALL_5|]} [2019-09-20 13:03:22,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:22,381 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:22,382 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 43 treesize of output 22 [2019-09-20 13:03:22,383 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:22,417 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:22,422 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:22,424 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2019-09-20 13:03:22,424 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:22,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:22,455 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:22,457 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 31 [2019-09-20 13:03:22,458 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:22,486 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:22,487 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:22,488 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:145, output treesize:75 [2019-09-20 13:03:22,771 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:03:22,774 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:22,774 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 51 [2019-09-20 13:03:22,776 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:22,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:22,795 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:22,800 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:22,800 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 23 [2019-09-20 13:03:22,800 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:22,811 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:22,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:22,812 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:106, output treesize:11 [2019-09-20 13:03:22,837 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-20 13:03:22,837 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:22,838 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:22,839 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:22,839 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-20 13:03:22,851 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:22,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:03:22,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 39 [2019-09-20 13:03:22,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-09-20 13:03:22,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-09-20 13:03:22,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1354, Unknown=0, NotChecked=0, Total=1482 [2019-09-20 13:03:22,858 INFO L87 Difference]: Start difference. First operand 160 states and 209 transitions. Second operand 39 states. [2019-09-20 13:03:27,136 WARN L191 SmtUtils]: Spent 4.00 s on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-09-20 13:03:31,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:03:31,468 INFO L93 Difference]: Finished difference Result 295 states and 389 transitions. [2019-09-20 13:03:31,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-20 13:03:31,469 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 41 [2019-09-20 13:03:31,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:03:31,472 INFO L225 Difference]: With dead ends: 295 [2019-09-20 13:03:31,472 INFO L226 Difference]: Without dead ends: 289 [2019-09-20 13:03:31,475 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1283 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=595, Invalid=4375, Unknown=0, NotChecked=0, Total=4970 [2019-09-20 13:03:31,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-09-20 13:03:31,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 253. [2019-09-20 13:03:31,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-09-20 13:03:31,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 335 transitions. [2019-09-20 13:03:31,509 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 335 transitions. Word has length 41 [2019-09-20 13:03:31,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:03:31,510 INFO L475 AbstractCegarLoop]: Abstraction has 253 states and 335 transitions. [2019-09-20 13:03:31,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-09-20 13:03:31,510 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 335 transitions. [2019-09-20 13:03:31,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-20 13:03:31,512 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:31,512 INFO L407 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:31,512 INFO L418 AbstractCegarLoop]: === Iteration 7 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:31,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:31,513 INFO L82 PathProgramCache]: Analyzing trace with hash 868237973, now seen corresponding path program 3 times [2019-09-20 13:03:31,513 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:31,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:31,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:31,516 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:03:31,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:31,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:32,136 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-20 13:03:32,435 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 22 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:03:32,435 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:03:32,435 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:03:32,511 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-20 13:03:32,627 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-20 13:03:32,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-20 13:03:32,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 109 conjunts are in the unsatisfiable core [2019-09-20 13:03:32,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:03:32,708 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-09-20 13:03:32,708 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:32,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:32,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:32,757 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-09-20 13:03:32,758 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:32,786 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:32,790 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:32,815 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:32,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:32,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:32,823 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2019-09-20 13:03:32,824 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:32,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:32,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:32,856 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2019-09-20 13:03:32,857 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:32,872 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:32,873 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:32,873 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:101, output treesize:32 [2019-09-20 13:03:32,925 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-09-20 13:03:32,925 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:32,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:32,942 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-09-20 13:03:32,943 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:32,952 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:32,953 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:32,953 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:15 [2019-09-20 13:03:33,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:33,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2019-09-20 13:03:33,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:33,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:33,200 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:33,201 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 18 [2019-09-20 13:03:33,201 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:33,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:33,224 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:33,224 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:107, output treesize:60 [2019-09-20 13:03:33,585 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:33,586 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 15 treesize of output 19 [2019-09-20 13:03:33,586 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:33,631 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:33,633 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_$Pointer$.base_34|, |v_#memory_$Pointer$.offset_33|], 6=[|v_#memory_$Pointer$.base_37|, |v_#memory_$Pointer$.offset_36|]} [2019-09-20 13:03:33,636 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:33,671 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:33,675 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:33,703 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:33,709 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:33,710 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:33,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:33,713 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:33,713 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 44 [2019-09-20 13:03:33,714 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:33,740 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:33,746 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:33,747 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:33,748 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:33,750 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2019-09-20 13:03:33,750 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:33,777 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:33,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:33,778 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:132, output treesize:58 [2019-09-20 13:03:33,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:33,936 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:33,938 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 32 [2019-09-20 13:03:33,939 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:33,968 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:33,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:33,986 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:33,986 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 75 treesize of output 60 [2019-09-20 13:03:33,987 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:34,035 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.3 percent of original size [2019-09-20 13:03:34,036 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:34,036 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:125, output treesize:90 [2019-09-20 13:03:34,420 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-20 13:03:34,505 INFO L341 Elim1Store]: treesize reduction 8, result has 89.2 percent of original size [2019-09-20 13:03:34,506 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 9 new quantified variables, introduced 10 case distinctions, treesize of input 154 treesize of output 143 [2019-09-20 13:03:34,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:34,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:34,510 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:34,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:34,514 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:34,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:34,515 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:34,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:34,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:34,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:34,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:34,521 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:34,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:34,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:34,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:34,525 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:34,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:34,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:34,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:34,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:34,528 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:34,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:34,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:34,531 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:34,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:34,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:34,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:34,535 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:34,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:34,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:03:34,538 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:34,591 INFO L567 ElimStorePlain]: treesize reduction 103, result has 36.0 percent of original size [2019-09-20 13:03:34,595 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:34,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:34,605 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:34,606 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 39 [2019-09-20 13:03:34,607 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:34,616 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:34,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:34,617 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:161, output treesize:7 [2019-09-20 13:03:34,635 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:03:34,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:03:34,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 32 [2019-09-20 13:03:34,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-09-20 13:03:34,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-09-20 13:03:34,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=905, Unknown=0, NotChecked=0, Total=992 [2019-09-20 13:03:34,649 INFO L87 Difference]: Start difference. First operand 253 states and 335 transitions. Second operand 32 states. [2019-09-20 13:03:41,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:03:41,066 INFO L93 Difference]: Finished difference Result 638 states and 869 transitions. [2019-09-20 13:03:41,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-20 13:03:41,068 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 44 [2019-09-20 13:03:41,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:03:41,073 INFO L225 Difference]: With dead ends: 638 [2019-09-20 13:03:41,073 INFO L226 Difference]: Without dead ends: 452 [2019-09-20 13:03:41,076 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1094 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=476, Invalid=3946, Unknown=0, NotChecked=0, Total=4422 [2019-09-20 13:03:41,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-09-20 13:03:41,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 408. [2019-09-20 13:03:41,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2019-09-20 13:03:41,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 541 transitions. [2019-09-20 13:03:41,122 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 541 transitions. Word has length 44 [2019-09-20 13:03:41,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:03:41,122 INFO L475 AbstractCegarLoop]: Abstraction has 408 states and 541 transitions. [2019-09-20 13:03:41,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-09-20 13:03:41,123 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 541 transitions. [2019-09-20 13:03:41,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-20 13:03:41,125 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:41,125 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:41,126 INFO L418 AbstractCegarLoop]: === Iteration 8 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:41,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:41,126 INFO L82 PathProgramCache]: Analyzing trace with hash -775608654, now seen corresponding path program 1 times [2019-09-20 13:03:41,126 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:41,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:41,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:41,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-20 13:03:41,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:41,772 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:41,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:03:41,773 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:03:41,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:41,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 85 conjunts are in the unsatisfiable core [2019-09-20 13:03:41,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:03:41,984 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:41,985 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 39 treesize of output 47 [2019-09-20 13:03:41,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:42,004 INFO L567 ElimStorePlain]: treesize reduction 20, result has 71.4 percent of original size [2019-09-20 13:03:42,027 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:42,027 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 39 treesize of output 47 [2019-09-20 13:03:42,028 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:42,041 INFO L567 ElimStorePlain]: treesize reduction 20, result has 47.4 percent of original size [2019-09-20 13:03:42,041 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:42,042 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:15 [2019-09-20 13:03:42,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:42,712 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 162 treesize of output 128 [2019-09-20 13:03:42,712 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:42,734 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:42,737 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:42,738 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 125 treesize of output 95 [2019-09-20 13:03:42,739 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:42,755 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:42,759 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 77 treesize of output 27 [2019-09-20 13:03:42,760 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:42,770 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:42,770 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:42,771 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:174, output treesize:55 [2019-09-20 13:03:42,938 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2019-09-20 13:03:42,939 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:42,947 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:42,950 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2019-09-20 13:03:42,950 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:42,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:42,957 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:42,957 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:11 [2019-09-20 13:03:42,989 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-20 13:03:42,990 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:42,991 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:42,991 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:42,991 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-20 13:03:43,003 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:43,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:03:43,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 36 [2019-09-20 13:03:43,008 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-09-20 13:03:43,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-09-20 13:03:43,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1155, Unknown=0, NotChecked=0, Total=1260 [2019-09-20 13:03:43,009 INFO L87 Difference]: Start difference. First operand 408 states and 541 transitions. Second operand 36 states. [2019-09-20 13:03:44,705 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-20 13:03:45,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:03:45,961 INFO L93 Difference]: Finished difference Result 536 states and 701 transitions. [2019-09-20 13:03:45,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-20 13:03:45,962 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 50 [2019-09-20 13:03:45,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:03:45,970 INFO L225 Difference]: With dead ends: 536 [2019-09-20 13:03:45,970 INFO L226 Difference]: Without dead ends: 534 [2019-09-20 13:03:45,972 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=356, Invalid=3184, Unknown=0, NotChecked=0, Total=3540 [2019-09-20 13:03:45,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-09-20 13:03:46,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 505. [2019-09-20 13:03:46,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-09-20 13:03:46,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 662 transitions. [2019-09-20 13:03:46,043 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 662 transitions. Word has length 50 [2019-09-20 13:03:46,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:03:46,043 INFO L475 AbstractCegarLoop]: Abstraction has 505 states and 662 transitions. [2019-09-20 13:03:46,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-09-20 13:03:46,044 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 662 transitions. [2019-09-20 13:03:46,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-09-20 13:03:46,051 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:03:46,051 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:03:46,051 INFO L418 AbstractCegarLoop]: === Iteration 9 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:03:46,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:03:46,052 INFO L82 PathProgramCache]: Analyzing trace with hash -2006943180, now seen corresponding path program 1 times [2019-09-20 13:03:46,052 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-20 13:03:46,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-20 13:03:46,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:46,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:46,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:03:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:46,335 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:03:46,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:03:46,336 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:03:46,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:03:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:03:46,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 78 conjunts are in the unsatisfiable core [2019-09-20 13:03:46,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:03:46,539 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:46,540 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 39 treesize of output 47 [2019-09-20 13:03:46,540 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:46,544 INFO L567 ElimStorePlain]: treesize reduction 21, result has 25.0 percent of original size [2019-09-20 13:03:46,544 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:46,544 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:7 [2019-09-20 13:03:46,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-20 13:03:46,911 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:46,911 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 61 [2019-09-20 13:03:46,912 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:46,935 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:46,964 INFO L341 Elim1Store]: treesize reduction 24, result has 45.5 percent of original size [2019-09-20 13:03:46,965 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 51 [2019-09-20 13:03:46,966 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:46,988 INFO L567 ElimStorePlain]: treesize reduction 16, result has 71.4 percent of original size [2019-09-20 13:03:46,989 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-20 13:03:46,990 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:40 [2019-09-20 13:03:47,157 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:47,157 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-20 13:03:47,158 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:47,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:47,168 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:47,168 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2019-09-20 13:03:47,169 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-20 13:03:47,181 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-20 13:03:47,182 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-20 13:03:47,182 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:51, output treesize:7 [2019-09-20 13:03:47,194 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:03:47,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:03:47,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 30 [2019-09-20 13:03:47,198 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-20 13:03:47,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-20 13:03:47,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=790, Unknown=0, NotChecked=0, Total=870 [2019-09-20 13:03:47,198 INFO L87 Difference]: Start difference. First operand 505 states and 662 transitions. Second operand 30 states.