/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/heap-data/process_queue.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 19:24:20,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 19:24:20,463 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 19:24:20,475 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 19:24:20,476 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 19:24:20,477 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 19:24:20,478 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 19:24:20,480 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 19:24:20,482 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 19:24:20,483 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 19:24:20,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 19:24:20,485 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 19:24:20,485 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 19:24:20,486 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 19:24:20,487 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 19:24:20,488 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 19:24:20,489 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 19:24:20,490 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 19:24:20,491 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 19:24:20,493 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 19:24:20,494 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 19:24:20,495 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 19:24:20,497 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 19:24:20,497 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 19:24:20,500 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 19:24:20,500 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 19:24:20,500 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 19:24:20,501 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 19:24:20,501 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 19:24:20,502 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 19:24:20,502 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 19:24:20,503 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 19:24:20,504 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 19:24:20,505 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 19:24:20,506 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 19:24:20,506 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 19:24:20,507 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 19:24:20,507 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 19:24:20,507 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 19:24:20,508 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 19:24:20,509 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 19:24:20,510 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 19:24:20,524 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 19:24:20,524 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 19:24:20,525 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 19:24:20,525 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 19:24:20,525 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 19:24:20,526 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 19:24:20,526 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 19:24:20,526 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 19:24:20,526 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 19:24:20,527 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 19:24:20,527 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 19:24:20,527 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 19:24:20,527 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 19:24:20,527 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 19:24:20,528 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 19:24:20,528 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 19:24:20,528 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 19:24:20,528 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 19:24:20,528 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 19:24:20,529 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 19:24:20,529 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 19:24:20,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 19:24:20,529 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 19:24:20,529 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 19:24:20,530 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 19:24:20,530 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 19:24:20,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 19:24:20,530 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 19:24:20,530 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 19:24:20,844 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 19:24:20,864 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 19:24:20,867 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 19:24:20,869 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 19:24:20,869 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 19:24:20,870 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-11-06 19:24:20,940 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a1c6fab9/6d3b278bab744983973d93617adfac9a/FLAG6392987fd [2019-11-06 19:24:21,461 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 19:24:21,467 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/process_queue.i [2019-11-06 19:24:21,494 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a1c6fab9/6d3b278bab744983973d93617adfac9a/FLAG6392987fd [2019-11-06 19:24:21,802 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a1c6fab9/6d3b278bab744983973d93617adfac9a [2019-11-06 19:24:21,811 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 19:24:21,812 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 19:24:21,813 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 19:24:21,813 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 19:24:21,817 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 19:24:21,818 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:24:21" (1/1) ... [2019-11-06 19:24:21,820 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a7682e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:24:21, skipping insertion in model container [2019-11-06 19:24:21,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:24:21" (1/1) ... [2019-11-06 19:24:21,830 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 19:24:21,886 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 19:24:22,391 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 19:24:22,401 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 19:24:22,467 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 19:24:22,526 INFO L192 MainTranslator]: Completed translation [2019-11-06 19:24:22,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:24:22 WrapperNode [2019-11-06 19:24:22,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 19:24:22,529 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 19:24:22,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 19:24:22,529 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 19:24:22,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:24:22" (1/1) ... [2019-11-06 19:24:22,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:24:22" (1/1) ... [2019-11-06 19:24:22,564 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:24:22" (1/1) ... [2019-11-06 19:24:22,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:24:22" (1/1) ... [2019-11-06 19:24:22,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:24:22" (1/1) ... [2019-11-06 19:24:22,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:24:22" (1/1) ... [2019-11-06 19:24:22,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:24:22" (1/1) ... [2019-11-06 19:24:22,620 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 19:24:22,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 19:24:22,620 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 19:24:22,621 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 19:24:22,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:24:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 19:24:22,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 19:24:22,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 19:24:22,688 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-06 19:24:22,688 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-06 19:24:22,689 INFO L138 BoogieDeclarations]: Found implementation of procedure run_process [2019-11-06 19:24:22,689 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2019-11-06 19:24:22,690 INFO L138 BoogieDeclarations]: Found implementation of procedure choose_next [2019-11-06 19:24:22,690 INFO L138 BoogieDeclarations]: Found implementation of procedure check_queue [2019-11-06 19:24:22,690 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 19:24:22,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 19:24:22,691 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 19:24:22,691 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-06 19:24:22,691 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-06 19:24:22,692 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-06 19:24:22,692 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-06 19:24:22,692 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-06 19:24:22,692 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-06 19:24:22,692 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-06 19:24:22,693 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-06 19:24:22,693 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-06 19:24:22,693 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-06 19:24:22,693 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-06 19:24:22,693 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-06 19:24:22,693 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-06 19:24:22,693 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-06 19:24:22,694 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-06 19:24:22,694 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-06 19:24:22,694 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-06 19:24:22,694 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-06 19:24:22,694 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-06 19:24:22,695 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-06 19:24:22,695 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-06 19:24:22,695 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-06 19:24:22,695 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-06 19:24:22,695 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-06 19:24:22,695 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-06 19:24:22,695 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-06 19:24:22,696 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-06 19:24:22,696 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-06 19:24:22,696 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-06 19:24:22,696 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-06 19:24:22,696 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-06 19:24:22,696 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-06 19:24:22,697 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-06 19:24:22,697 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-06 19:24:22,697 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-06 19:24:22,697 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-06 19:24:22,697 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-06 19:24:22,697 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-06 19:24:22,697 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-06 19:24:22,697 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-06 19:24:22,697 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-06 19:24:22,698 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-06 19:24:22,698 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-06 19:24:22,698 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-06 19:24:22,698 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-06 19:24:22,698 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-06 19:24:22,698 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-06 19:24:22,698 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-06 19:24:22,698 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-06 19:24:22,698 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-06 19:24:22,698 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-06 19:24:22,699 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-06 19:24:22,699 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 19:24:22,699 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-06 19:24:22,699 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-06 19:24:22,699 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-06 19:24:22,699 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-06 19:24:22,699 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-06 19:24:22,699 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-06 19:24:22,700 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-06 19:24:22,700 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-06 19:24:22,700 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-06 19:24:22,700 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-06 19:24:22,700 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-06 19:24:22,700 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-06 19:24:22,701 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 19:24:22,701 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-06 19:24:22,701 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-06 19:24:22,701 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-06 19:24:22,701 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-06 19:24:22,701 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-06 19:24:22,701 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-06 19:24:22,701 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-06 19:24:22,702 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-06 19:24:22,702 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-06 19:24:22,702 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-06 19:24:22,702 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-06 19:24:22,702 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-06 19:24:22,702 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-06 19:24:22,702 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-06 19:24:22,703 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-06 19:24:22,703 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-06 19:24:22,703 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-06 19:24:22,703 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-06 19:24:22,703 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-06 19:24:22,703 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-06 19:24:22,703 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-06 19:24:22,704 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-06 19:24:22,704 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-06 19:24:22,704 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-06 19:24:22,704 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-06 19:24:22,704 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-06 19:24:22,704 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-06 19:24:22,705 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-06 19:24:22,705 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-06 19:24:22,705 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-06 19:24:22,705 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-06 19:24:22,705 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-06 19:24:22,705 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-06 19:24:22,705 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-06 19:24:22,706 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-06 19:24:22,706 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-06 19:24:22,706 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-06 19:24:22,706 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-06 19:24:22,706 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-06 19:24:22,706 INFO L130 BoogieDeclarations]: Found specification of procedure run_process [2019-11-06 19:24:22,706 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2019-11-06 19:24:22,706 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-06 19:24:22,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-06 19:24:22,707 INFO L130 BoogieDeclarations]: Found specification of procedure choose_next [2019-11-06 19:24:22,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 19:24:22,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 19:24:22,707 INFO L130 BoogieDeclarations]: Found specification of procedure check_queue [2019-11-06 19:24:22,707 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 19:24:22,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-06 19:24:22,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 19:24:22,708 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-06 19:24:22,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 19:24:22,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 19:24:22,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 19:24:23,370 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 19:24:23,370 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-06 19:24:23,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:24:23 BoogieIcfgContainer [2019-11-06 19:24:23,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 19:24:23,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 19:24:23,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 19:24:23,376 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 19:24:23,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:24:21" (1/3) ... [2019-11-06 19:24:23,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd80f43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:24:23, skipping insertion in model container [2019-11-06 19:24:23,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:24:22" (2/3) ... [2019-11-06 19:24:23,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cd80f43 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:24:23, skipping insertion in model container [2019-11-06 19:24:23,378 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:24:23" (3/3) ... [2019-11-06 19:24:23,379 INFO L109 eAbstractionObserver]: Analyzing ICFG process_queue.i [2019-11-06 19:24:23,388 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 19:24:23,397 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 19:24:23,409 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 19:24:23,435 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 19:24:23,435 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 19:24:23,436 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 19:24:23,436 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 19:24:23,436 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 19:24:23,436 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 19:24:23,436 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 19:24:23,436 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 19:24:23,453 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2019-11-06 19:24:23,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-06 19:24:23,459 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:24:23,460 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:24:23,462 INFO L410 AbstractCegarLoop]: === Iteration 1 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:24:23,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:24:23,467 INFO L82 PathProgramCache]: Analyzing trace with hash -699499398, now seen corresponding path program 1 times [2019-11-06 19:24:23,476 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:24:23,476 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248567925] [2019-11-06 19:24:23,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:24:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:23,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:24:23,782 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248567925] [2019-11-06 19:24:23,783 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:24:23,783 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 19:24:23,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844880272] [2019-11-06 19:24:23,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 19:24:23,789 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:24:23,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 19:24:23,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-06 19:24:23,806 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 7 states. [2019-11-06 19:24:24,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:24:24,263 INFO L93 Difference]: Finished difference Result 100 states and 134 transitions. [2019-11-06 19:24:24,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 19:24:24,264 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-11-06 19:24:24,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:24:24,275 INFO L225 Difference]: With dead ends: 100 [2019-11-06 19:24:24,275 INFO L226 Difference]: Without dead ends: 54 [2019-11-06 19:24:24,279 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-06 19:24:24,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-06 19:24:24,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-11-06 19:24:24,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-06 19:24:24,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2019-11-06 19:24:24,325 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 17 [2019-11-06 19:24:24,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:24:24,325 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2019-11-06 19:24:24,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 19:24:24,326 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2019-11-06 19:24:24,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 19:24:24,327 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:24:24,327 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:24:24,327 INFO L410 AbstractCegarLoop]: === Iteration 2 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:24:24,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:24:24,328 INFO L82 PathProgramCache]: Analyzing trace with hash -436646864, now seen corresponding path program 1 times [2019-11-06 19:24:24,328 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:24:24,328 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043351552] [2019-11-06 19:24:24,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:24:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:24,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:24,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:24:24,737 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043351552] [2019-11-06 19:24:24,737 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:24:24,737 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-06 19:24:24,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737743666] [2019-11-06 19:24:24,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-06 19:24:24,739 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:24:24,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-06 19:24:24,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-11-06 19:24:24,740 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 12 states. [2019-11-06 19:24:25,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:24:25,853 INFO L93 Difference]: Finished difference Result 113 states and 152 transitions. [2019-11-06 19:24:25,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-06 19:24:25,853 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-11-06 19:24:25,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:24:25,857 INFO L225 Difference]: With dead ends: 113 [2019-11-06 19:24:25,857 INFO L226 Difference]: Without dead ends: 111 [2019-11-06 19:24:25,858 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2019-11-06 19:24:25,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-06 19:24:25,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 86. [2019-11-06 19:24:25,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-11-06 19:24:25,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 111 transitions. [2019-11-06 19:24:25,895 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 111 transitions. Word has length 20 [2019-11-06 19:24:25,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:24:25,898 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 111 transitions. [2019-11-06 19:24:25,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-06 19:24:25,898 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 111 transitions. [2019-11-06 19:24:25,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-06 19:24:25,900 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:24:25,901 INFO L410 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-11-06 19:24:25,902 INFO L410 AbstractCegarLoop]: === Iteration 3 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:24:25,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:24:25,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1313067226, now seen corresponding path program 1 times [2019-11-06 19:24:25,902 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:24:25,902 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413367558] [2019-11-06 19:24:25,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:24:25,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:26,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:26,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:24:26,284 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413367558] [2019-11-06 19:24:26,285 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563016213] [2019-11-06 19:24:26,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:24:26,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:26,431 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 58 conjunts are in the unsatisfiable core [2019-11-06 19:24:26,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:24:26,545 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:26,558 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-11-06 19:24:26,559 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:26,588 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:26,594 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:26,596 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-11-06 19:24:26,597 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:26,618 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:26,623 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:26,626 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-11-06 19:24:26,627 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:26,640 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:26,645 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:26,648 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-11-06 19:24:26,649 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:26,664 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:26,666 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:26,666 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:94, output treesize:26 [2019-11-06 19:24:28,750 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-11-06 19:24:28,779 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:28,781 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-11-06 19:24:28,781 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:28,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:28,809 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:28,812 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-11-06 19:24:28,813 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:28,833 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:28,834 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:28,835 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:42 [2019-11-06 19:24:29,044 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:24:29,046 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:29,047 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-11-06 19:24:29,049 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:24:29,060 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:29,074 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:29,078 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:29,079 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-11-06 19:24:29,079 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:29,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:29,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:29,086 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:7 [2019-11-06 19:24:29,092 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:24:29,092 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:24:29,093 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2019-11-06 19:24:29,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775108787] [2019-11-06 19:24:29,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-06 19:24:29,094 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:24:29,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-06 19:24:29,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=335, Unknown=1, NotChecked=36, Total=420 [2019-11-06 19:24:29,095 INFO L87 Difference]: Start difference. First operand 86 states and 111 transitions. Second operand 21 states. [2019-11-06 19:24:33,540 WARN L191 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-11-06 19:24:34,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:24:34,791 INFO L93 Difference]: Finished difference Result 222 states and 304 transitions. [2019-11-06 19:24:34,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-06 19:24:34,794 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 23 [2019-11-06 19:24:34,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:24:34,801 INFO L225 Difference]: With dead ends: 222 [2019-11-06 19:24:34,802 INFO L226 Difference]: Without dead ends: 154 [2019-11-06 19:24:34,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=129, Invalid=744, Unknown=1, NotChecked=56, Total=930 [2019-11-06 19:24:34,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-06 19:24:34,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 146. [2019-11-06 19:24:34,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-06 19:24:34,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 199 transitions. [2019-11-06 19:24:34,845 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 199 transitions. Word has length 23 [2019-11-06 19:24:34,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:24:34,845 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 199 transitions. [2019-11-06 19:24:34,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-06 19:24:34,846 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 199 transitions. [2019-11-06 19:24:34,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-06 19:24:34,847 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:24:34,847 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 19:24:35,050 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:24:35,051 INFO L410 AbstractCegarLoop]: === Iteration 4 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:24:35,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:24:35,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1566014097, now seen corresponding path program 1 times [2019-11-06 19:24:35,052 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:24:35,052 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101929759] [2019-11-06 19:24:35,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:24:35,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:35,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:35,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:35,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:35,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:24:35,138 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101929759] [2019-11-06 19:24:35,138 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 19:24:35,138 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 19:24:35,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858536412] [2019-11-06 19:24:35,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 19:24:35,139 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:24:35,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 19:24:35,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 19:24:35,139 INFO L87 Difference]: Start difference. First operand 146 states and 199 transitions. Second operand 5 states. [2019-11-06 19:24:35,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:24:35,339 INFO L93 Difference]: Finished difference Result 266 states and 365 transitions. [2019-11-06 19:24:35,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 19:24:35,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-11-06 19:24:35,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:24:35,341 INFO L225 Difference]: With dead ends: 266 [2019-11-06 19:24:35,341 INFO L226 Difference]: Without dead ends: 156 [2019-11-06 19:24:35,343 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-06 19:24:35,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-06 19:24:35,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2019-11-06 19:24:35,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-06 19:24:35,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 205 transitions. [2019-11-06 19:24:35,364 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 205 transitions. Word has length 29 [2019-11-06 19:24:35,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:24:35,365 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 205 transitions. [2019-11-06 19:24:35,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 19:24:35,365 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 205 transitions. [2019-11-06 19:24:35,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-06 19:24:35,367 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:24:35,367 INFO L410 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-11-06 19:24:35,367 INFO L410 AbstractCegarLoop]: === Iteration 5 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:24:35,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:24:35,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1445249493, now seen corresponding path program 1 times [2019-11-06 19:24:35,368 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:24:35,368 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012300540] [2019-11-06 19:24:35,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:24:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:35,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:35,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:35,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:35,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:35,536 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-06 19:24:35,537 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012300540] [2019-11-06 19:24:35,538 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99473329] [2019-11-06 19:24:35,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:24:35,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:35,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-06 19:24:35,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:24:35,741 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:35,741 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-11-06 19:24:35,742 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:35,748 INFO L567 ElimStorePlain]: treesize reduction 21, result has 25.0 percent of original size [2019-11-06 19:24:35,748 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:35,748 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:7 [2019-11-06 19:24:35,772 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-11-06 19:24:35,773 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:35,778 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:35,778 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:35,779 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-11-06 19:24:35,783 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-06 19:24:35,784 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 19:24:35,784 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 13 [2019-11-06 19:24:35,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175290683] [2019-11-06 19:24:35,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-06 19:24:35,785 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:24:35,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-06 19:24:35,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-11-06 19:24:35,787 INFO L87 Difference]: Start difference. First operand 154 states and 205 transitions. Second operand 9 states. [2019-11-06 19:24:35,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:24:35,965 INFO L93 Difference]: Finished difference Result 318 states and 439 transitions. [2019-11-06 19:24:35,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 19:24:35,966 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-11-06 19:24:35,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:24:35,971 INFO L225 Difference]: With dead ends: 318 [2019-11-06 19:24:35,971 INFO L226 Difference]: Without dead ends: 185 [2019-11-06 19:24:35,973 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2019-11-06 19:24:35,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-11-06 19:24:36,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 177. [2019-11-06 19:24:36,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-11-06 19:24:36,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 239 transitions. [2019-11-06 19:24:36,018 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 239 transitions. Word has length 38 [2019-11-06 19:24:36,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:24:36,018 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 239 transitions. [2019-11-06 19:24:36,018 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-06 19:24:36,019 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 239 transitions. [2019-11-06 19:24:36,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-06 19:24:36,022 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:24:36,022 INFO L410 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-11-06 19:24:36,223 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:24:36,223 INFO L410 AbstractCegarLoop]: === Iteration 6 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:24:36,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:24:36,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1053709227, now seen corresponding path program 2 times [2019-11-06 19:24:36,224 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:24:36,225 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728648778] [2019-11-06 19:24:36,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:24:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:36,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:36,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:36,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:37,235 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 19:24:37,236 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728648778] [2019-11-06 19:24:37,236 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881483943] [2019-11-06 19:24:37,236 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:24:37,362 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 19:24:37,362 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 19:24:37,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 109 conjunts are in the unsatisfiable core [2019-11-06 19:24:37,371 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:24:37,427 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 19:24:37,427 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:37,436 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:37,437 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:37,437 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-11-06 19:24:37,562 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:37,563 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-11-06 19:24:37,563 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:37,592 INFO L567 ElimStorePlain]: treesize reduction 20, result has 73.3 percent of original size [2019-11-06 19:24:37,615 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:37,616 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-11-06 19:24:37,616 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:37,647 INFO L567 ElimStorePlain]: treesize reduction 20, result has 53.5 percent of original size [2019-11-06 19:24:37,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:24:37,649 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:87, output treesize:23 [2019-11-06 19:24:38,303 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:38,304 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-11-06 19:24:38,305 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:38,355 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:38,358 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-11-06 19:24:38,365 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:24:38,413 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:38,415 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:24:38,450 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:38,464 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:38,465 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:38,467 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-11-06 19:24:38,468 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:38,499 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:38,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:38,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:38,511 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-11-06 19:24:38,512 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:38,542 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:38,550 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:38,551 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-11-06 19:24:38,552 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:38,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:38,583 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-11-06 19:24:38,583 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:143, output treesize:47 [2019-11-06 19:24:38,671 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:24:38,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:38,694 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:24:38,694 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:113, output treesize:114 [2019-11-06 19:24:40,498 WARN L191 SmtUtils]: Spent 1.69 s on a formula simplification that was a NOOP. DAG size: 42 [2019-11-06 19:24:40,509 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-11-06 19:24:40,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:40,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:40,518 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-11-06 19:24:40,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:40,555 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:40,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:40,561 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-11-06 19:24:40,562 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:40,592 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:40,596 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:40,597 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-11-06 19:24:40,599 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:40,619 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:40,620 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:40,621 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:145, output treesize:75 [2019-11-06 19:24:40,932 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:24:40,933 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:40,934 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-11-06 19:24:40,935 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:24:40,974 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:40,978 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:40,984 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:40,984 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-11-06 19:24:40,985 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:40,996 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:40,996 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:40,996 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:106, output treesize:11 [2019-11-06 19:24:41,015 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-11-06 19:24:41,016 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:41,018 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:41,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:41,018 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-06 19:24:41,032 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:24:41,032 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:24:41,032 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 40 [2019-11-06 19:24:41,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293442230] [2019-11-06 19:24:41,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-11-06 19:24:41,034 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:24:41,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-11-06 19:24:41,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1430, Unknown=0, NotChecked=0, Total=1560 [2019-11-06 19:24:41,035 INFO L87 Difference]: Start difference. First operand 177 states and 239 transitions. Second operand 40 states. [2019-11-06 19:24:45,075 WARN L191 SmtUtils]: Spent 3.67 s on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-11-06 19:24:50,103 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2019-11-06 19:24:50,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:24:50,593 INFO L93 Difference]: Finished difference Result 314 states and 422 transitions. [2019-11-06 19:24:50,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-06 19:24:50,604 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 41 [2019-11-06 19:24:50,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:24:50,612 INFO L225 Difference]: With dead ends: 314 [2019-11-06 19:24:50,612 INFO L226 Difference]: Without dead ends: 304 [2019-11-06 19:24:50,615 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1357 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=669, Invalid=4733, Unknown=0, NotChecked=0, Total=5402 [2019-11-06 19:24:50,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-11-06 19:24:50,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 274. [2019-11-06 19:24:50,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-11-06 19:24:50,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 370 transitions. [2019-11-06 19:24:50,662 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 370 transitions. Word has length 41 [2019-11-06 19:24:50,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:24:50,665 INFO L462 AbstractCegarLoop]: Abstraction has 274 states and 370 transitions. [2019-11-06 19:24:50,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-11-06 19:24:50,665 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 370 transitions. [2019-11-06 19:24:50,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-06 19:24:50,674 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:24:50,675 INFO L410 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-11-06 19:24:50,888 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:24:50,888 INFO L410 AbstractCegarLoop]: === Iteration 7 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:24:50,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:24:50,889 INFO L82 PathProgramCache]: Analyzing trace with hash 868237973, now seen corresponding path program 3 times [2019-11-06 19:24:50,890 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:24:50,890 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289933422] [2019-11-06 19:24:50,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:24:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:51,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:51,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:51,698 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-06 19:24:51,718 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-06 19:24:51,718 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289933422] [2019-11-06 19:24:51,718 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700478159] [2019-11-06 19:24:51,719 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:24:52,002 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-11-06 19:24:52,003 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 19:24:52,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 109 conjunts are in the unsatisfiable core [2019-11-06 19:24:52,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:24:52,076 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 19:24:52,076 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:52,127 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:52,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:52,139 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-11-06 19:24:52,139 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:52,172 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:52,175 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:24:52,205 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:52,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:52,213 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:52,215 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-11-06 19:24:52,215 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:52,238 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:52,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:52,245 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-11-06 19:24:52,246 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:52,263 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:52,263 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:52,264 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:101, output treesize:32 [2019-11-06 19:24:52,336 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-11-06 19:24:52,336 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:52,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:52,362 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-11-06 19:24:52,362 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:52,379 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:52,380 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:24:52,380 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:15 [2019-11-06 19:24:52,583 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:52,584 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-11-06 19:24:52,585 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:52,611 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:52,617 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:52,618 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-11-06 19:24:52,618 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:52,640 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:52,641 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:24:52,641 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:107, output treesize:60 [2019-11-06 19:24:53,006 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:53,006 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-11-06 19:24:53,007 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:53,056 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:53,057 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-11-06 19:24:53,060 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:24:53,097 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:53,100 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 19:24:53,132 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:53,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:53,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:53,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:53,141 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:53,142 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-11-06 19:24:53,143 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:53,169 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:53,177 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:53,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:53,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:53,184 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-11-06 19:24:53,185 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:53,221 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:53,222 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:53,222 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:132, output treesize:58 [2019-11-06 19:24:53,436 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:53,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:53,438 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-11-06 19:24:53,439 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:53,470 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:53,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:53,488 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:53,489 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-11-06 19:24:53,490 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:53,536 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.3 percent of original size [2019-11-06 19:24:53,537 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:53,538 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:125, output treesize:90 [2019-11-06 19:24:53,949 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 19:24:54,028 INFO L341 Elim1Store]: treesize reduction 8, result has 89.2 percent of original size [2019-11-06 19:24:54,029 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-11-06 19:24:54,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:54,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:54,033 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:54,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:54,037 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:54,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:54,038 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:54,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:54,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:54,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:54,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:54,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:54,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:54,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:54,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:54,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:54,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:54,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:54,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:54,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:54,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:54,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:54,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:54,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:54,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:54,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:54,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:54,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:54,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:54,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 19:24:54,062 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 19:24:54,115 INFO L567 ElimStorePlain]: treesize reduction 103, result has 36.0 percent of original size [2019-11-06 19:24:54,119 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:54,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:54,130 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:54,130 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-11-06 19:24:54,131 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:54,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:54,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:54,141 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:161, output treesize:7 [2019-11-06 19:24:54,159 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-06 19:24:54,160 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:24:54,160 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2019-11-06 19:24:54,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171933478] [2019-11-06 19:24:54,161 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-11-06 19:24:54,161 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:24:54,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-11-06 19:24:54,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=966, Unknown=0, NotChecked=0, Total=1056 [2019-11-06 19:24:54,162 INFO L87 Difference]: Start difference. First operand 274 states and 370 transitions. Second operand 33 states. [2019-11-06 19:24:57,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:24:57,821 INFO L93 Difference]: Finished difference Result 607 states and 836 transitions. [2019-11-06 19:24:57,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-06 19:24:57,823 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 44 [2019-11-06 19:24:57,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:24:57,826 INFO L225 Difference]: With dead ends: 607 [2019-11-06 19:24:57,826 INFO L226 Difference]: Without dead ends: 399 [2019-11-06 19:24:57,828 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=238, Invalid=2114, Unknown=0, NotChecked=0, Total=2352 [2019-11-06 19:24:57,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-11-06 19:24:57,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 388. [2019-11-06 19:24:57,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-11-06 19:24:57,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 523 transitions. [2019-11-06 19:24:57,868 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 523 transitions. Word has length 44 [2019-11-06 19:24:57,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:24:57,869 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 523 transitions. [2019-11-06 19:24:57,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-11-06 19:24:57,869 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 523 transitions. [2019-11-06 19:24:57,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-06 19:24:57,870 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:24:57,871 INFO L410 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-11-06 19:24:58,075 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:24:58,076 INFO L410 AbstractCegarLoop]: === Iteration 8 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:24:58,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:24:58,076 INFO L82 PathProgramCache]: Analyzing trace with hash -775608654, now seen corresponding path program 1 times [2019-11-06 19:24:58,076 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:24:58,076 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354313737] [2019-11-06 19:24:58,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:24:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:58,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:58,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:58,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:58,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:58,883 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:24:58,883 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354313737] [2019-11-06 19:24:58,883 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380091900] [2019-11-06 19:24:58,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:24:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 19:24:59,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 85 conjunts are in the unsatisfiable core [2019-11-06 19:24:59,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 19:24:59,151 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:59,151 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-11-06 19:24:59,153 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:59,172 INFO L567 ElimStorePlain]: treesize reduction 20, result has 71.4 percent of original size [2019-11-06 19:24:59,200 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:59,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, 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-11-06 19:24:59,202 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:59,215 INFO L567 ElimStorePlain]: treesize reduction 20, result has 47.4 percent of original size [2019-11-06 19:24:59,215 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:59,216 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:15 [2019-11-06 19:24:59,780 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:59,781 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-11-06 19:24:59,782 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:59,804 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:59,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 19:24:59,813 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-11-06 19:24:59,814 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:59,829 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:59,832 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-11-06 19:24:59,832 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 19:24:59,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:24:59,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:24:59,844 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:174, output treesize:55 [2019-11-06 19:24:59,999 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-11-06 19:25:00,000 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:25:00,010 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:25:00,013 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-11-06 19:25:00,013 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 19:25:00,020 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:25:00,021 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:25:00,021 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:11 [2019-11-06 19:25:00,035 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-11-06 19:25:00,035 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 19:25:00,036 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 19:25:00,037 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 19:25:00,037 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-11-06 19:25:00,048 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 19:25:00,049 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 19:25:00,049 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 37 [2019-11-06 19:25:00,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198284581] [2019-11-06 19:25:00,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-06 19:25:00,050 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 19:25:00,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-06 19:25:00,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1224, Unknown=0, NotChecked=0, Total=1332 [2019-11-06 19:25:00,051 INFO L87 Difference]: Start difference. First operand 388 states and 523 transitions. Second operand 37 states. [2019-11-06 19:25:03,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 19:25:03,808 INFO L93 Difference]: Finished difference Result 501 states and 667 transitions. [2019-11-06 19:25:03,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-11-06 19:25:03,809 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 50 [2019-11-06 19:25:03,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 19:25:03,812 INFO L225 Difference]: With dead ends: 501 [2019-11-06 19:25:03,812 INFO L226 Difference]: Without dead ends: 499 [2019-11-06 19:25:03,814 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=425, Invalid=3865, Unknown=0, NotChecked=0, Total=4290 [2019-11-06 19:25:03,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-11-06 19:25:03,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 472. [2019-11-06 19:25:03,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-11-06 19:25:03,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 631 transitions. [2019-11-06 19:25:03,865 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 631 transitions. Word has length 50 [2019-11-06 19:25:03,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 19:25:03,866 INFO L462 AbstractCegarLoop]: Abstraction has 472 states and 631 transitions. [2019-11-06 19:25:03,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-06 19:25:03,866 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 631 transitions. [2019-11-06 19:25:03,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-06 19:25:03,867 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 19:25:03,867 INFO L410 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-11-06 19:25:04,071 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 19:25:04,072 INFO L410 AbstractCegarLoop]: === Iteration 9 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 19:25:04,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 19:25:04,072 INFO L82 PathProgramCache]: Analyzing trace with hash -2006943180, now seen corresponding path program 1 times [2019-11-06 19:25:04,072 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 19:25:04,073 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117749241] [2019-11-06 19:25:04,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 19:25:04,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat