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-13a467a-m [2019-10-14 22:07:52,802 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 22:07:52,805 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 22:07:52,817 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 22:07:52,817 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 22:07:52,818 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 22:07:52,820 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 22:07:52,821 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 22:07:52,823 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 22:07:52,829 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 22:07:52,830 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 22:07:52,831 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 22:07:52,834 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 22:07:52,835 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 22:07:52,836 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 22:07:52,840 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 22:07:52,841 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 22:07:52,842 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 22:07:52,844 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 22:07:52,845 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 22:07:52,847 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 22:07:52,848 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 22:07:52,849 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 22:07:52,850 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 22:07:52,852 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 22:07:52,852 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 22:07:52,852 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 22:07:52,853 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 22:07:52,854 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 22:07:52,854 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 22:07:52,855 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 22:07:52,856 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 22:07:52,856 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 22:07:52,857 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 22:07:52,858 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 22:07:52,858 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 22:07:52,859 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 22:07:52,859 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 22:07:52,859 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 22:07:52,860 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 22:07:52,861 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 22:07:52,862 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 22:07:52,881 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 22:07:52,882 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 22:07:52,883 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 22:07:52,883 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 22:07:52,883 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 22:07:52,883 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 22:07:52,884 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 22:07:52,884 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 22:07:52,884 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 22:07:52,884 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 22:07:52,884 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 22:07:52,885 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 22:07:52,885 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 22:07:52,885 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 22:07:52,885 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 22:07:52,885 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 22:07:52,886 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 22:07:52,886 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 22:07:52,886 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 22:07:52,886 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 22:07:52,886 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 22:07:52,887 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 22:07:52,887 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 22:07:52,887 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 22:07:52,887 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 22:07:52,887 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 22:07:52,888 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 22:07:52,888 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 22:07:52,888 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 22:07:53,169 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 22:07:53,188 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 22:07:53,193 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 22:07:53,195 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 22:07:53,195 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 22:07:53,196 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-10-14 22:07:53,264 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e49b0992f/6c75ca7deeb74b878b7cef6a9ad77ee5/FLAG2afa0975d [2019-10-14 22:07:53,844 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 22:07:53,845 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/heap-data/process_queue.i [2019-10-14 22:07:53,858 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e49b0992f/6c75ca7deeb74b878b7cef6a9ad77ee5/FLAG2afa0975d [2019-10-14 22:07:54,262 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e49b0992f/6c75ca7deeb74b878b7cef6a9ad77ee5 [2019-10-14 22:07:54,272 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 22:07:54,273 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 22:07:54,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 22:07:54,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 22:07:54,278 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 22:07:54,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:07:54" (1/1) ... [2019-10-14 22:07:54,281 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19262e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:54, skipping insertion in model container [2019-10-14 22:07:54,281 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:07:54" (1/1) ... [2019-10-14 22:07:54,288 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 22:07:54,336 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 22:07:54,797 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 22:07:54,817 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 22:07:54,881 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 22:07:54,938 INFO L192 MainTranslator]: Completed translation [2019-10-14 22:07:54,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:54 WrapperNode [2019-10-14 22:07:54,939 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 22:07:54,940 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 22:07:54,940 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 22:07:54,941 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 22:07:54,954 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:54" (1/1) ... [2019-10-14 22:07:54,954 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:54" (1/1) ... [2019-10-14 22:07:54,975 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:54" (1/1) ... [2019-10-14 22:07:54,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:54" (1/1) ... [2019-10-14 22:07:54,993 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:54" (1/1) ... [2019-10-14 22:07:54,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:54" (1/1) ... [2019-10-14 22:07:55,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:54" (1/1) ... [2019-10-14 22:07:55,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 22:07:55,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 22:07:55,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 22:07:55,016 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 22:07:55,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:54" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 22:07:55,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 22:07:55,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 22:07:55,069 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-14 22:07:55,069 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-14 22:07:55,069 INFO L138 BoogieDeclarations]: Found implementation of procedure run_process [2019-10-14 22:07:55,070 INFO L138 BoogieDeclarations]: Found implementation of procedure append_to_queue [2019-10-14 22:07:55,070 INFO L138 BoogieDeclarations]: Found implementation of procedure choose_next [2019-10-14 22:07:55,070 INFO L138 BoogieDeclarations]: Found implementation of procedure check_queue [2019-10-14 22:07:55,071 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 22:07:55,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 22:07:55,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 22:07:55,071 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-14 22:07:55,072 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-14 22:07:55,072 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-14 22:07:55,073 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-14 22:07:55,073 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-14 22:07:55,076 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-14 22:07:55,076 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-14 22:07:55,076 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-14 22:07:55,076 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-14 22:07:55,077 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-14 22:07:55,077 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-14 22:07:55,077 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-14 22:07:55,077 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-14 22:07:55,077 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-14 22:07:55,078 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-14 22:07:55,078 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-14 22:07:55,078 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-14 22:07:55,078 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-14 22:07:55,078 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-14 22:07:55,078 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-14 22:07:55,079 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-14 22:07:55,079 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-14 22:07:55,079 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-14 22:07:55,079 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-14 22:07:55,079 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-14 22:07:55,079 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-14 22:07:55,079 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-14 22:07:55,080 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-14 22:07:55,080 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-14 22:07:55,080 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-14 22:07:55,080 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-14 22:07:55,080 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-14 22:07:55,080 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-14 22:07:55,081 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-14 22:07:55,081 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-14 22:07:55,081 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-14 22:07:55,081 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-14 22:07:55,081 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-14 22:07:55,082 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-14 22:07:55,082 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-14 22:07:55,082 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-14 22:07:55,082 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-14 22:07:55,082 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-14 22:07:55,082 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-14 22:07:55,083 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-14 22:07:55,083 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-14 22:07:55,083 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-14 22:07:55,083 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-14 22:07:55,083 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-14 22:07:55,084 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-14 22:07:55,084 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-14 22:07:55,084 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-14 22:07:55,084 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 22:07:55,084 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-14 22:07:55,084 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-14 22:07:55,085 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-14 22:07:55,085 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-14 22:07:55,086 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-14 22:07:55,086 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-14 22:07:55,086 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-14 22:07:55,086 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-14 22:07:55,086 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-14 22:07:55,087 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-14 22:07:55,087 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-14 22:07:55,087 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-14 22:07:55,088 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-14 22:07:55,088 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-14 22:07:55,088 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-14 22:07:55,088 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-14 22:07:55,088 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-14 22:07:55,088 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-14 22:07:55,089 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-14 22:07:55,089 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-14 22:07:55,089 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-14 22:07:55,089 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-14 22:07:55,090 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-14 22:07:55,091 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-14 22:07:55,091 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-14 22:07:55,091 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-14 22:07:55,092 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-14 22:07:55,092 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-14 22:07:55,092 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-14 22:07:55,092 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-14 22:07:55,092 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-14 22:07:55,093 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-14 22:07:55,093 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-14 22:07:55,093 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-14 22:07:55,093 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-14 22:07:55,093 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-14 22:07:55,093 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-14 22:07:55,093 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-14 22:07:55,094 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-14 22:07:55,094 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-14 22:07:55,094 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-14 22:07:55,094 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-14 22:07:55,094 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-14 22:07:55,094 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-14 22:07:55,094 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-14 22:07:55,095 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-14 22:07:55,095 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-14 22:07:55,095 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-14 22:07:55,095 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-14 22:07:55,095 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-14 22:07:55,095 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-14 22:07:55,096 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-14 22:07:55,096 INFO L130 BoogieDeclarations]: Found specification of procedure run_process [2019-10-14 22:07:55,096 INFO L130 BoogieDeclarations]: Found specification of procedure append_to_queue [2019-10-14 22:07:55,096 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-14 22:07:55,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-14 22:07:55,096 INFO L130 BoogieDeclarations]: Found specification of procedure choose_next [2019-10-14 22:07:55,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 22:07:55,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 22:07:55,097 INFO L130 BoogieDeclarations]: Found specification of procedure check_queue [2019-10-14 22:07:55,097 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 22:07:55,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-14 22:07:55,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 22:07:55,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-14 22:07:55,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 22:07:55,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 22:07:55,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 22:07:55,654 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 22:07:55,655 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-14 22:07:55,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:07:55 BoogieIcfgContainer [2019-10-14 22:07:55,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 22:07:55,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 22:07:55,658 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 22:07:55,661 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 22:07:55,661 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:07:54" (1/3) ... [2019-10-14 22:07:55,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e56185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:07:55, skipping insertion in model container [2019-10-14 22:07:55,662 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:07:54" (2/3) ... [2019-10-14 22:07:55,662 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32e56185 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:07:55, skipping insertion in model container [2019-10-14 22:07:55,663 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:07:55" (3/3) ... [2019-10-14 22:07:55,664 INFO L109 eAbstractionObserver]: Analyzing ICFG process_queue.i [2019-10-14 22:07:55,674 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 22:07:55,682 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 22:07:55,693 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 22:07:55,715 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 22:07:55,715 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 22:07:55,716 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 22:07:55,716 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 22:07:55,716 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 22:07:55,716 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 22:07:55,716 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 22:07:55,716 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 22:07:55,731 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2019-10-14 22:07:55,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-14 22:07:55,737 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:55,738 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:55,740 INFO L410 AbstractCegarLoop]: === Iteration 1 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:55,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:55,746 INFO L82 PathProgramCache]: Analyzing trace with hash -699499398, now seen corresponding path program 1 times [2019-10-14 22:07:55,755 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:55,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92217233] [2019-10-14 22:07:55,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:55,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:55,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:55,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:56,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:56,105 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92217233] [2019-10-14 22:07:56,106 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:56,106 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 22:07:56,107 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824212976] [2019-10-14 22:07:56,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 22:07:56,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:56,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 22:07:56,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-14 22:07:56,132 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 7 states. [2019-10-14 22:07:56,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:56,557 INFO L93 Difference]: Finished difference Result 100 states and 134 transitions. [2019-10-14 22:07:56,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 22:07:56,559 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2019-10-14 22:07:56,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:56,570 INFO L225 Difference]: With dead ends: 100 [2019-10-14 22:07:56,570 INFO L226 Difference]: Without dead ends: 54 [2019-10-14 22:07:56,574 INFO L600 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-10-14 22:07:56,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-10-14 22:07:56,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-10-14 22:07:56,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-14 22:07:56,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2019-10-14 22:07:56,625 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 17 [2019-10-14 22:07:56,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:56,625 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2019-10-14 22:07:56,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 22:07:56,626 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2019-10-14 22:07:56,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 22:07:56,627 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:56,627 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:07:56,627 INFO L410 AbstractCegarLoop]: === Iteration 2 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:56,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:56,628 INFO L82 PathProgramCache]: Analyzing trace with hash -436646864, now seen corresponding path program 1 times [2019-10-14 22:07:56,628 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:56,628 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882160163] [2019-10-14 22:07:56,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:56,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:56,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:56,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:56,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:57,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:57,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882160163] [2019-10-14 22:07:57,069 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:07:57,069 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-14 22:07:57,070 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991689989] [2019-10-14 22:07:57,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-14 22:07:57,071 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:07:57,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-14 22:07:57,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-14 22:07:57,072 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand 12 states. [2019-10-14 22:07:58,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:07:58,279 INFO L93 Difference]: Finished difference Result 113 states and 152 transitions. [2019-10-14 22:07:58,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-14 22:07:58,280 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 20 [2019-10-14 22:07:58,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:07:58,283 INFO L225 Difference]: With dead ends: 113 [2019-10-14 22:07:58,283 INFO L226 Difference]: Without dead ends: 111 [2019-10-14 22:07:58,285 INFO L600 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-10-14 22:07:58,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-10-14 22:07:58,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 86. [2019-10-14 22:07:58,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2019-10-14 22:07:58,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 111 transitions. [2019-10-14 22:07:58,306 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 111 transitions. Word has length 20 [2019-10-14 22:07:58,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:07:58,307 INFO L462 AbstractCegarLoop]: Abstraction has 86 states and 111 transitions. [2019-10-14 22:07:58,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-14 22:07:58,307 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 111 transitions. [2019-10-14 22:07:58,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-14 22:07:58,309 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:07:58,309 INFO L380 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-10-14 22:07:58,310 INFO L410 AbstractCegarLoop]: === Iteration 3 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:07:58,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:07:58,310 INFO L82 PathProgramCache]: Analyzing trace with hash 1313067226, now seen corresponding path program 1 times [2019-10-14 22:07:58,310 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:07:58,311 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022498904] [2019-10-14 22:07:58,311 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:58,311 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:07:58,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:07:58,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:58,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:07:58,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022498904] [2019-10-14 22:07:58,634 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1719974432] [2019-10-14 22:07:58,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:07:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:07:58,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 58 conjunts are in the unsatisfiable core [2019-10-14 22:07:58,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:07:58,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:58,891 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-10-14 22:07:58,892 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:58,917 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:58,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:58,928 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-10-14 22:07:58,929 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:58,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:58,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:58,971 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-10-14 22:07:58,972 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:58,987 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:58,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:07:58,995 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-10-14 22:07:58,996 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:07:59,009 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:07:59,010 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:07:59,010 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:94, output treesize:26 [2019-10-14 22:08:01,090 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-10-14 22:08:01,120 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:01,123 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-10-14 22:08:01,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,143 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:01,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, 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-10-14 22:08:01,151 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,165 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,166 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,167 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:93, output treesize:42 [2019-10-14 22:08:01,417 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:08:01,419 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,420 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-10-14 22:08:01,422 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:01,434 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,437 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:01,443 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,443 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-10-14 22:08:01,444 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,451 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:01,452 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:01,452 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:73, output treesize:7 [2019-10-14 22:08:01,457 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:01,457 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:01,457 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 21 [2019-10-14 22:08:01,458 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414049445] [2019-10-14 22:08:01,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-14 22:08:01,459 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:01,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-14 22:08:01,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=335, Unknown=1, NotChecked=36, Total=420 [2019-10-14 22:08:01,459 INFO L87 Difference]: Start difference. First operand 86 states and 111 transitions. Second operand 21 states. [2019-10-14 22:08:05,860 WARN L191 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-10-14 22:08:07,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:07,141 INFO L93 Difference]: Finished difference Result 222 states and 304 transitions. [2019-10-14 22:08:07,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-14 22:08:07,145 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 23 [2019-10-14 22:08:07,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:07,148 INFO L225 Difference]: With dead ends: 222 [2019-10-14 22:08:07,148 INFO L226 Difference]: Without dead ends: 154 [2019-10-14 22:08:07,150 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=129, Invalid=744, Unknown=1, NotChecked=56, Total=930 [2019-10-14 22:08:07,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-10-14 22:08:07,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 146. [2019-10-14 22:08:07,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-10-14 22:08:07,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 199 transitions. [2019-10-14 22:08:07,178 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 199 transitions. Word has length 23 [2019-10-14 22:08:07,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:07,178 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 199 transitions. [2019-10-14 22:08:07,179 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-14 22:08:07,179 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 199 transitions. [2019-10-14 22:08:07,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-14 22:08:07,180 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:07,180 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 22:08:07,385 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:07,386 INFO L410 AbstractCegarLoop]: === Iteration 4 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:07,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:07,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1566014097, now seen corresponding path program 1 times [2019-10-14 22:08:07,386 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:07,387 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573519365] [2019-10-14 22:08:07,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:07,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:07,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:07,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:07,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:07,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:07,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:07,463 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573519365] [2019-10-14 22:08:07,463 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 22:08:07,464 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 22:08:07,464 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79678986] [2019-10-14 22:08:07,464 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 22:08:07,464 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:07,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 22:08:07,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 22:08:07,465 INFO L87 Difference]: Start difference. First operand 146 states and 199 transitions. Second operand 5 states. [2019-10-14 22:08:07,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:07,694 INFO L93 Difference]: Finished difference Result 266 states and 365 transitions. [2019-10-14 22:08:07,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 22:08:07,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2019-10-14 22:08:07,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:07,697 INFO L225 Difference]: With dead ends: 266 [2019-10-14 22:08:07,697 INFO L226 Difference]: Without dead ends: 156 [2019-10-14 22:08:07,698 INFO L600 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-10-14 22:08:07,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-10-14 22:08:07,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2019-10-14 22:08:07,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-10-14 22:08:07,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 205 transitions. [2019-10-14 22:08:07,740 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 205 transitions. Word has length 29 [2019-10-14 22:08:07,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:07,740 INFO L462 AbstractCegarLoop]: Abstraction has 154 states and 205 transitions. [2019-10-14 22:08:07,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 22:08:07,741 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 205 transitions. [2019-10-14 22:08:07,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-14 22:08:07,742 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:07,743 INFO L380 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-10-14 22:08:07,743 INFO L410 AbstractCegarLoop]: === Iteration 5 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:07,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:07,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1445249493, now seen corresponding path program 1 times [2019-10-14 22:08:07,744 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:07,744 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886752427] [2019-10-14 22:08:07,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:07,744 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:07,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:07,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:07,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:07,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:07,881 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-14 22:08:07,881 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886752427] [2019-10-14 22:08:07,881 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725830944] [2019-10-14 22:08:07,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:08,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:08,002 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-14 22:08:08,006 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:08,060 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:08,060 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-10-14 22:08:08,061 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:08,069 INFO L567 ElimStorePlain]: treesize reduction 21, result has 25.0 percent of original size [2019-10-14 22:08:08,069 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:08,069 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:7 [2019-10-14 22:08:08,096 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-10-14 22:08:08,097 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:08,100 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:08,101 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:08,101 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-10-14 22:08:08,111 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 22:08:08,112 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-14 22:08:08,112 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10] total 13 [2019-10-14 22:08:08,112 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962080074] [2019-10-14 22:08:08,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-14 22:08:08,113 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:08,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-14 22:08:08,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-10-14 22:08:08,114 INFO L87 Difference]: Start difference. First operand 154 states and 205 transitions. Second operand 9 states. [2019-10-14 22:08:08,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:08,302 INFO L93 Difference]: Finished difference Result 318 states and 439 transitions. [2019-10-14 22:08:08,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 22:08:08,302 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 38 [2019-10-14 22:08:08,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:08,305 INFO L225 Difference]: With dead ends: 318 [2019-10-14 22:08:08,305 INFO L226 Difference]: Without dead ends: 185 [2019-10-14 22:08:08,307 INFO L600 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-10-14 22:08:08,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2019-10-14 22:08:08,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 177. [2019-10-14 22:08:08,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2019-10-14 22:08:08,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 239 transitions. [2019-10-14 22:08:08,349 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 239 transitions. Word has length 38 [2019-10-14 22:08:08,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:08,349 INFO L462 AbstractCegarLoop]: Abstraction has 177 states and 239 transitions. [2019-10-14 22:08:08,350 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-14 22:08:08,350 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 239 transitions. [2019-10-14 22:08:08,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-14 22:08:08,351 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:08,352 INFO L380 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-10-14 22:08:08,555 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:08,556 INFO L410 AbstractCegarLoop]: === Iteration 6 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:08,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:08,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1053709227, now seen corresponding path program 2 times [2019-10-14 22:08:08,557 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:08,557 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184914152] [2019-10-14 22:08:08,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:08,558 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:08,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:08,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:09,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:09,484 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 22:08:09,485 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184914152] [2019-10-14 22:08:09,486 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13073278] [2019-10-14 22:08:09,486 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:09,613 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 22:08:09,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:08:09,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 109 conjunts are in the unsatisfiable core [2019-10-14 22:08:09,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:09,673 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:08:09,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:09,682 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:09,682 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:09,683 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2019-10-14 22:08:09,821 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:09,821 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-10-14 22:08:09,822 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:09,844 INFO L567 ElimStorePlain]: treesize reduction 20, result has 73.3 percent of original size [2019-10-14 22:08:09,868 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:09,868 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-10-14 22:08:09,869 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:09,891 INFO L567 ElimStorePlain]: treesize reduction 20, result has 53.5 percent of original size [2019-10-14 22:08:09,892 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:09,892 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:87, output treesize:23 [2019-10-14 22:08:10,568 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:10,569 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-10-14 22:08:10,569 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:10,634 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:10,637 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-10-14 22:08:10,643 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:10,688 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:10,692 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:10,733 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:10,754 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:10,755 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:10,756 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-10-14 22:08:10,757 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:10,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:10,799 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:10,801 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:10,804 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-10-14 22:08:10,805 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:10,834 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:10,842 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:10,843 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-10-14 22:08:10,844 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:10,873 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:10,874 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-10-14 22:08:10,874 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:143, output treesize:47 [2019-10-14 22:08:10,941 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:10,962 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:10,963 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:10,963 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:113, output treesize:114 [2019-10-14 22:08:13,087 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 42 [2019-10-14 22:08:13,098 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-10-14 22:08:13,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:13,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:13,109 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-10-14 22:08:13,110 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:13,152 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:13,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:13,158 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-10-14 22:08:13,159 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:13,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:13,193 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:13,195 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-10-14 22:08:13,196 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:13,215 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:13,216 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:13,216 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:145, output treesize:75 [2019-10-14 22:08:13,519 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:08:13,520 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:13,521 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-10-14 22:08:13,522 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:13,544 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:13,549 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:13,554 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:13,554 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-10-14 22:08:13,555 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:13,566 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:13,567 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:13,567 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:106, output treesize:11 [2019-10-14 22:08:13,587 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-10-14 22:08:13,587 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:13,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:13,590 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:13,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-14 22:08:13,605 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:13,605 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:13,605 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 40 [2019-10-14 22:08:13,605 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387014056] [2019-10-14 22:08:13,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 40 states [2019-10-14 22:08:13,606 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:13,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2019-10-14 22:08:13,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1430, Unknown=0, NotChecked=0, Total=1560 [2019-10-14 22:08:13,608 INFO L87 Difference]: Start difference. First operand 177 states and 239 transitions. Second operand 40 states. [2019-10-14 22:08:17,480 WARN L191 SmtUtils]: Spent 3.51 s on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-10-14 22:08:19,479 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2019-10-14 22:08:22,517 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 73 [2019-10-14 22:08:22,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:22,981 INFO L93 Difference]: Finished difference Result 314 states and 422 transitions. [2019-10-14 22:08:22,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-14 22:08:22,982 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 41 [2019-10-14 22:08:22,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:22,985 INFO L225 Difference]: With dead ends: 314 [2019-10-14 22:08:22,985 INFO L226 Difference]: Without dead ends: 304 [2019-10-14 22:08:22,988 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1357 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=669, Invalid=4733, Unknown=0, NotChecked=0, Total=5402 [2019-10-14 22:08:22,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2019-10-14 22:08:23,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 274. [2019-10-14 22:08:23,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-10-14 22:08:23,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 370 transitions. [2019-10-14 22:08:23,021 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 370 transitions. Word has length 41 [2019-10-14 22:08:23,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:23,022 INFO L462 AbstractCegarLoop]: Abstraction has 274 states and 370 transitions. [2019-10-14 22:08:23,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 40 states. [2019-10-14 22:08:23,022 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 370 transitions. [2019-10-14 22:08:23,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-14 22:08:23,024 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:23,024 INFO L380 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-10-14 22:08:23,236 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:23,236 INFO L410 AbstractCegarLoop]: === Iteration 7 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:23,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:23,236 INFO L82 PathProgramCache]: Analyzing trace with hash 868237973, now seen corresponding path program 3 times [2019-10-14 22:08:23,236 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:23,237 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535818447] [2019-10-14 22:08:23,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:23,237 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:23,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:23,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:23,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:24,194 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-10-14 22:08:24,209 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 22:08:24,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535818447] [2019-10-14 22:08:24,210 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [672134060] [2019-10-14 22:08:24,210 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:24,410 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-14 22:08:24,411 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 22:08:24,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 109 conjunts are in the unsatisfiable core [2019-10-14 22:08:24,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:24,482 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-14 22:08:24,483 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:24,528 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:24,536 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:24,538 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-10-14 22:08:24,539 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:24,565 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:24,567 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:24,593 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:24,598 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:24,599 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:24,600 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-10-14 22:08:24,601 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:24,623 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:24,629 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:24,630 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-10-14 22:08:24,631 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:24,646 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:24,647 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:24,647 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:101, output treesize:32 [2019-10-14 22:08:24,704 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-10-14 22:08:24,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:24,716 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:24,722 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-10-14 22:08:24,722 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:24,737 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:24,738 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-10-14 22:08:24,739 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:15 [2019-10-14 22:08:24,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:24,899 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-10-14 22:08:24,899 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:24,930 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:24,934 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:24,935 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-10-14 22:08:24,936 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:24,957 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:24,958 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-10-14 22:08:24,959 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:107, output treesize:60 [2019-10-14 22:08:25,346 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:25,346 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-10-14 22:08:25,346 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:25,391 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:25,393 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-10-14 22:08:25,395 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:25,453 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:25,456 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:25,487 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:25,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:25,493 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:25,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:25,497 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:25,498 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-10-14 22:08:25,498 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:25,526 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:25,532 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:25,533 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:25,534 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:25,540 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-10-14 22:08:25,541 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:25,572 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:25,572 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:25,573 INFO L221 ElimStorePlain]: Needed 6 recursive calls to eliminate 5 variables, input treesize:132, output treesize:58 [2019-10-14 22:08:25,774 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:25,776 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:25,777 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-10-14 22:08:25,778 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:25,808 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:25,811 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:25,822 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:25,823 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-10-14 22:08:25,824 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:25,871 INFO L567 ElimStorePlain]: treesize reduction 32, result has 68.3 percent of original size [2019-10-14 22:08:25,872 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:25,872 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:125, output treesize:90 [2019-10-14 22:08:26,323 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 22:08:26,399 INFO L341 Elim1Store]: treesize reduction 8, result has 89.2 percent of original size [2019-10-14 22:08:26,400 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-10-14 22:08:26,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:26,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:26,403 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:26,404 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:26,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:26,408 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:26,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:26,410 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:26,412 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:26,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:26,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:26,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:26,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:26,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:26,420 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:26,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:26,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:26,423 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:26,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:26,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:26,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:26,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:26,429 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:26,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:26,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:26,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:26,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:26,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:26,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:26,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 22:08:26,435 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-14 22:08:26,492 INFO L567 ElimStorePlain]: treesize reduction 103, result has 36.0 percent of original size [2019-10-14 22:08:26,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:26,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:26,512 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:26,512 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-10-14 22:08:26,513 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:26,522 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:26,522 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:26,523 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:161, output treesize:7 [2019-10-14 22:08:26,540 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 22:08:26,540 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:26,541 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 33 [2019-10-14 22:08:26,541 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435937753] [2019-10-14 22:08:26,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-14 22:08:26,542 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:26,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-14 22:08:26,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=966, Unknown=0, NotChecked=0, Total=1056 [2019-10-14 22:08:26,543 INFO L87 Difference]: Start difference. First operand 274 states and 370 transitions. Second operand 33 states. [2019-10-14 22:08:30,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:30,170 INFO L93 Difference]: Finished difference Result 607 states and 836 transitions. [2019-10-14 22:08:30,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-10-14 22:08:30,174 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 44 [2019-10-14 22:08:30,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:30,177 INFO L225 Difference]: With dead ends: 607 [2019-10-14 22:08:30,178 INFO L226 Difference]: Without dead ends: 399 [2019-10-14 22:08:30,180 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 478 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=238, Invalid=2114, Unknown=0, NotChecked=0, Total=2352 [2019-10-14 22:08:30,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2019-10-14 22:08:30,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 388. [2019-10-14 22:08:30,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 388 states. [2019-10-14 22:08:30,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 388 states to 388 states and 523 transitions. [2019-10-14 22:08:30,222 INFO L78 Accepts]: Start accepts. Automaton has 388 states and 523 transitions. Word has length 44 [2019-10-14 22:08:30,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:30,222 INFO L462 AbstractCegarLoop]: Abstraction has 388 states and 523 transitions. [2019-10-14 22:08:30,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-14 22:08:30,223 INFO L276 IsEmpty]: Start isEmpty. Operand 388 states and 523 transitions. [2019-10-14 22:08:30,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-14 22:08:30,225 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:30,225 INFO L380 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-10-14 22:08:30,430 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:30,430 INFO L410 AbstractCegarLoop]: === Iteration 8 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:30,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:30,431 INFO L82 PathProgramCache]: Analyzing trace with hash -775608654, now seen corresponding path program 1 times [2019-10-14 22:08:30,431 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:30,431 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771193421] [2019-10-14 22:08:30,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:30,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:30,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:30,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:30,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:31,303 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:31,304 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771193421] [2019-10-14 22:08:31,304 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [23485181] [2019-10-14 22:08:31,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:31,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 85 conjunts are in the unsatisfiable core [2019-10-14 22:08:31,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:31,562 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:31,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-10-14 22:08:31,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:31,586 INFO L567 ElimStorePlain]: treesize reduction 20, result has 71.4 percent of original size [2019-10-14 22:08:31,611 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:31,611 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-10-14 22:08:31,612 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:31,625 INFO L567 ElimStorePlain]: treesize reduction 20, result has 47.4 percent of original size [2019-10-14 22:08:31,626 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:31,626 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:82, output treesize:15 [2019-10-14 22:08:32,212 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:32,213 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-10-14 22:08:32,214 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:32,235 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:32,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-14 22:08:32,247 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-10-14 22:08:32,248 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:32,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:32,265 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-10-14 22:08:32,266 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:32,277 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:32,278 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:32,278 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:174, output treesize:55 [2019-10-14 22:08:32,454 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-10-14 22:08:32,454 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:32,462 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:32,465 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-10-14 22:08:32,465 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:32,481 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:32,481 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:32,482 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:48, output treesize:11 [2019-10-14 22:08:32,500 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-10-14 22:08:32,501 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:32,502 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:32,502 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:32,502 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-14 22:08:32,515 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 22:08:32,516 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 22:08:32,516 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 37 [2019-10-14 22:08:32,516 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274911630] [2019-10-14 22:08:32,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-10-14 22:08:32,517 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 22:08:32,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-10-14 22:08:32,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1224, Unknown=0, NotChecked=0, Total=1332 [2019-10-14 22:08:32,518 INFO L87 Difference]: Start difference. First operand 388 states and 523 transitions. Second operand 37 states. [2019-10-14 22:08:34,662 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-10-14 22:08:36,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 22:08:36,359 INFO L93 Difference]: Finished difference Result 501 states and 667 transitions. [2019-10-14 22:08:36,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-10-14 22:08:36,359 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 50 [2019-10-14 22:08:36,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 22:08:36,366 INFO L225 Difference]: With dead ends: 501 [2019-10-14 22:08:36,366 INFO L226 Difference]: Without dead ends: 499 [2019-10-14 22:08:36,368 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1041 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=425, Invalid=3865, Unknown=0, NotChecked=0, Total=4290 [2019-10-14 22:08:36,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2019-10-14 22:08:36,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 472. [2019-10-14 22:08:36,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2019-10-14 22:08:36,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 631 transitions. [2019-10-14 22:08:36,432 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 631 transitions. Word has length 50 [2019-10-14 22:08:36,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 22:08:36,434 INFO L462 AbstractCegarLoop]: Abstraction has 472 states and 631 transitions. [2019-10-14 22:08:36,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-10-14 22:08:36,434 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 631 transitions. [2019-10-14 22:08:36,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-14 22:08:36,436 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 22:08:36,437 INFO L380 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-10-14 22:08:36,639 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:36,640 INFO L410 AbstractCegarLoop]: === Iteration 9 === [check_queueErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 22:08:36,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 22:08:36,641 INFO L82 PathProgramCache]: Analyzing trace with hash -2006943180, now seen corresponding path program 1 times [2019-10-14 22:08:36,641 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 22:08:36,642 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101886040] [2019-10-14 22:08:36,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:36,642 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 22:08:36,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 22:08:36,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:36,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:36,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:36,940 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 22:08:36,940 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101886040] [2019-10-14 22:08:36,940 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [923578039] [2019-10-14 22:08:36,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 22:08:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 22:08:37,063 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 78 conjunts are in the unsatisfiable core [2019-10-14 22:08:37,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 22:08:37,127 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 22:08:37,128 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-10-14 22:08:37,128 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 22:08:37,156 INFO L567 ElimStorePlain]: treesize reduction 21, result has 25.0 percent of original size [2019-10-14 22:08:37,156 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 22:08:37,156 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:7