java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-simple/sll2n_prepend_unequal.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-efa34d5 [2019-09-16 16:30:30,038 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-16 16:30:30,040 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-16 16:30:30,057 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-16 16:30:30,058 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-16 16:30:30,059 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-16 16:30:30,062 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-16 16:30:30,066 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-16 16:30:30,068 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-16 16:30:30,075 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-16 16:30:30,076 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-16 16:30:30,080 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-16 16:30:30,080 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-16 16:30:30,081 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-16 16:30:30,082 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-16 16:30:30,087 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-16 16:30:30,087 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-16 16:30:30,088 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-16 16:30:30,090 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-16 16:30:30,092 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-16 16:30:30,093 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-16 16:30:30,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-16 16:30:30,095 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-16 16:30:30,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-16 16:30:30,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-16 16:30:30,099 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-16 16:30:30,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-16 16:30:30,100 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-16 16:30:30,100 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-16 16:30:30,101 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-16 16:30:30,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-16 16:30:30,102 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-16 16:30:30,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-16 16:30:30,103 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-16 16:30:30,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-16 16:30:30,105 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-16 16:30:30,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-16 16:30:30,105 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-16 16:30:30,106 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-16 16:30:30,106 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-16 16:30:30,107 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-16 16:30:30,108 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-16 16:30:30,123 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-16 16:30:30,123 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-16 16:30:30,125 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-16 16:30:30,125 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-16 16:30:30,125 INFO L138 SettingsManager]: * Use SBE=true [2019-09-16 16:30:30,125 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-16 16:30:30,126 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-16 16:30:30,126 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-16 16:30:30,126 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-16 16:30:30,126 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-16 16:30:30,126 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-16 16:30:30,127 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-16 16:30:30,127 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-16 16:30:30,127 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-16 16:30:30,127 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-16 16:30:30,127 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-16 16:30:30,128 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-16 16:30:30,128 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-16 16:30:30,128 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-16 16:30:30,128 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-16 16:30:30,128 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-16 16:30:30,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:30:30,129 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-16 16:30:30,129 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-16 16:30:30,129 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-16 16:30:30,129 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-16 16:30:30,130 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-16 16:30:30,130 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-16 16:30:30,130 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-16 16:30:30,158 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-16 16:30:30,172 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-16 16:30:30,175 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-16 16:30:30,177 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-16 16:30:30,177 INFO L275 PluginConnector]: CDTParser initialized [2019-09-16 16:30:30,178 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_prepend_unequal.i [2019-09-16 16:30:30,262 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/821575d0f/dfbacbaa96334857b6bcb84f4299259d/FLAGb7f3c0e33 [2019-09-16 16:30:30,815 INFO L306 CDTParser]: Found 1 translation units. [2019-09-16 16:30:30,817 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_prepend_unequal.i [2019-09-16 16:30:30,836 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/821575d0f/dfbacbaa96334857b6bcb84f4299259d/FLAGb7f3c0e33 [2019-09-16 16:30:31,065 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/821575d0f/dfbacbaa96334857b6bcb84f4299259d [2019-09-16 16:30:31,075 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-16 16:30:31,077 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-16 16:30:31,079 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-16 16:30:31,079 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-16 16:30:31,082 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-16 16:30:31,084 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:30:31" (1/1) ... [2019-09-16 16:30:31,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a8ab7de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:30:31, skipping insertion in model container [2019-09-16 16:30:31,087 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.09 04:30:31" (1/1) ... [2019-09-16 16:30:31,095 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-16 16:30:31,143 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-16 16:30:31,576 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:30:31,587 INFO L188 MainTranslator]: Completed pre-run [2019-09-16 16:30:31,638 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-16 16:30:31,696 INFO L192 MainTranslator]: Completed translation [2019-09-16 16:30:31,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:30:31 WrapperNode [2019-09-16 16:30:31,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-16 16:30:31,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-16 16:30:31,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-16 16:30:31,698 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-16 16:30:31,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:30:31" (1/1) ... [2019-09-16 16:30:31,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:30:31" (1/1) ... [2019-09-16 16:30:31,732 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:30:31" (1/1) ... [2019-09-16 16:30:31,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:30:31" (1/1) ... [2019-09-16 16:30:31,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:30:31" (1/1) ... [2019-09-16 16:30:31,775 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:30:31" (1/1) ... [2019-09-16 16:30:31,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:30:31" (1/1) ... [2019-09-16 16:30:31,798 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-16 16:30:31,799 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-16 16:30:31,799 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-16 16:30:31,799 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-16 16:30:31,800 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:30:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-16 16:30:31,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-16 16:30:31,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-16 16:30:31,861 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-09-16 16:30:31,861 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-09-16 16:30:31,862 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-09-16 16:30:31,862 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-09-16 16:30:31,862 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2019-09-16 16:30:31,862 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2019-09-16 16:30:31,862 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_prepend [2019-09-16 16:30:31,863 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-16 16:30:31,863 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-16 16:30:31,863 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-09-16 16:30:31,863 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-09-16 16:30:31,863 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-09-16 16:30:31,864 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-09-16 16:30:31,864 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-09-16 16:30:31,864 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-09-16 16:30:31,864 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-09-16 16:30:31,864 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-09-16 16:30:31,865 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-09-16 16:30:31,865 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-09-16 16:30:31,865 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-09-16 16:30:31,865 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-09-16 16:30:31,865 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-09-16 16:30:31,865 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-09-16 16:30:31,866 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-09-16 16:30:31,866 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-09-16 16:30:31,866 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-09-16 16:30:31,866 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-09-16 16:30:31,866 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-09-16 16:30:31,866 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-09-16 16:30:31,867 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-09-16 16:30:31,867 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-09-16 16:30:31,867 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-09-16 16:30:31,867 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-09-16 16:30:31,867 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-09-16 16:30:31,867 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-09-16 16:30:31,868 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-09-16 16:30:31,868 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-09-16 16:30:31,868 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-09-16 16:30:31,868 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-09-16 16:30:31,868 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-09-16 16:30:31,868 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-09-16 16:30:31,869 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-09-16 16:30:31,869 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-09-16 16:30:31,869 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-09-16 16:30:31,869 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-09-16 16:30:31,869 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-09-16 16:30:31,869 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-09-16 16:30:31,870 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-09-16 16:30:31,870 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-09-16 16:30:31,870 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-09-16 16:30:31,870 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-09-16 16:30:31,870 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-09-16 16:30:31,870 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-09-16 16:30:31,871 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-09-16 16:30:31,871 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-09-16 16:30:31,871 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-09-16 16:30:31,871 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-09-16 16:30:31,871 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-09-16 16:30:31,871 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-09-16 16:30:31,872 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-09-16 16:30:31,872 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-09-16 16:30:31,872 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-16 16:30:31,872 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-09-16 16:30:31,872 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-09-16 16:30:31,872 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-16 16:30:31,873 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-09-16 16:30:31,873 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-09-16 16:30:31,873 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-09-16 16:30:31,873 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-09-16 16:30:31,873 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-09-16 16:30:31,873 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-09-16 16:30:31,874 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-09-16 16:30:31,874 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-09-16 16:30:31,874 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-09-16 16:30:31,874 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-09-16 16:30:31,874 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-09-16 16:30:31,874 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-09-16 16:30:31,874 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-09-16 16:30:31,875 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-09-16 16:30:31,875 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-09-16 16:30:31,875 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-09-16 16:30:31,875 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-09-16 16:30:31,875 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-09-16 16:30:31,875 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-09-16 16:30:31,876 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-09-16 16:30:31,876 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-09-16 16:30:31,876 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-09-16 16:30:31,876 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-09-16 16:30:31,876 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-09-16 16:30:31,876 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-09-16 16:30:31,877 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-09-16 16:30:31,877 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-09-16 16:30:31,877 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-09-16 16:30:31,877 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-09-16 16:30:31,877 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-09-16 16:30:31,877 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-09-16 16:30:31,877 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-09-16 16:30:31,878 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-09-16 16:30:31,878 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-09-16 16:30:31,878 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-09-16 16:30:31,878 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-09-16 16:30:31,878 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-09-16 16:30:31,878 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-09-16 16:30:31,879 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-09-16 16:30:31,879 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-09-16 16:30:31,879 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-09-16 16:30:31,879 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-09-16 16:30:31,879 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-09-16 16:30:31,879 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-09-16 16:30:31,879 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-09-16 16:30:31,880 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-09-16 16:30:31,880 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-09-16 16:30:31,880 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-09-16 16:30:31,880 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-09-16 16:30:31,880 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-09-16 16:30:31,880 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-09-16 16:30:31,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-16 16:30:31,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-16 16:30:31,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-16 16:30:31,881 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2019-09-16 16:30:31,881 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2019-09-16 16:30:31,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-16 16:30:31,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-16 16:30:31,882 INFO L130 BoogieDeclarations]: Found specification of procedure sll_prepend [2019-09-16 16:30:31,882 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-16 16:30:31,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-16 16:30:31,882 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-16 16:30:31,882 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-16 16:30:31,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-16 16:30:31,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-16 16:30:32,286 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-09-16 16:30:32,508 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-16 16:30:32,509 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-09-16 16:30:32,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:30:32 BoogieIcfgContainer [2019-09-16 16:30:32,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-16 16:30:32,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-16 16:30:32,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-16 16:30:32,515 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-16 16:30:32,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.09 04:30:31" (1/3) ... [2019-09-16 16:30:32,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73efb11e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:30:32, skipping insertion in model container [2019-09-16 16:30:32,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.09 04:30:31" (2/3) ... [2019-09-16 16:30:32,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73efb11e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.09 04:30:32, skipping insertion in model container [2019-09-16 16:30:32,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.09 04:30:32" (3/3) ... [2019-09-16 16:30:32,519 INFO L109 eAbstractionObserver]: Analyzing ICFG sll2n_prepend_unequal.i [2019-09-16 16:30:32,529 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-16 16:30:32,538 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-16 16:30:32,555 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-16 16:30:32,586 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-16 16:30:32,587 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-16 16:30:32,587 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-16 16:30:32,588 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-16 16:30:32,588 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-16 16:30:32,588 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-16 16:30:32,588 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-16 16:30:32,588 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-16 16:30:32,589 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-16 16:30:32,608 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-09-16 16:30:32,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 16:30:32,615 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:30:32,616 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:30:32,618 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:30:32,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:30:32,624 INFO L82 PathProgramCache]: Analyzing trace with hash 266861268, now seen corresponding path program 1 times [2019-09-16 16:30:32,626 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:30:32,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:30:32,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:30:32,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:30:32,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:30:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:30:32,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:30:32,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:30:32,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-16 16:30:32,821 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-16 16:30:32,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-16 16:30:32,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 16:30:32,834 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-09-16 16:30:32,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:30:32,859 INFO L93 Difference]: Finished difference Result 82 states and 100 transitions. [2019-09-16 16:30:32,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-16 16:30:32,861 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2019-09-16 16:30:32,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:30:32,870 INFO L225 Difference]: With dead ends: 82 [2019-09-16 16:30:32,871 INFO L226 Difference]: Without dead ends: 34 [2019-09-16 16:30:32,874 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-16 16:30:32,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-16 16:30:32,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2019-09-16 16:30:32,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-09-16 16:30:32,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2019-09-16 16:30:32,919 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 27 [2019-09-16 16:30:32,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:30:32,920 INFO L475 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2019-09-16 16:30:32,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-16 16:30:32,920 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2019-09-16 16:30:32,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-16 16:30:32,923 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:30:32,923 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:30:32,923 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:30:32,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:30:32,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1567298356, now seen corresponding path program 1 times [2019-09-16 16:30:32,924 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:30:32,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:30:32,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:30:32,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:30:32,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:30:32,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:30:33,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:30:33,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:30:33,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-16 16:30:33,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-16 16:30:33,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-16 16:30:33,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-16 16:30:33,074 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 5 states. [2019-09-16 16:30:33,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:30:33,143 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2019-09-16 16:30:33,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-16 16:30:33,144 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-09-16 16:30:33,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:30:33,146 INFO L225 Difference]: With dead ends: 60 [2019-09-16 16:30:33,146 INFO L226 Difference]: Without dead ends: 38 [2019-09-16 16:30:33,147 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:30:33,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-16 16:30:33,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2019-09-16 16:30:33,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-16 16:30:33,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-16 16:30:33,158 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 27 [2019-09-16 16:30:33,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:30:33,158 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-16 16:30:33,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-16 16:30:33,158 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-16 16:30:33,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-16 16:30:33,160 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:30:33,160 INFO L407 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-16 16:30:33,160 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:30:33,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:30:33,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1679873603, now seen corresponding path program 1 times [2019-09-16 16:30:33,161 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:30:33,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:30:33,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:30:33,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:30:33,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:30:33,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:30:33,308 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-16 16:30:33,309 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:30:33,309 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:30:33,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:30:33,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:30:33,468 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-16 16:30:33,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:30:33,532 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-16 16:30:33,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:30:33,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-09-16 16:30:33,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-16 16:30:33,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-16 16:30:33,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-16 16:30:33,548 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 6 states. [2019-09-16 16:30:33,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:30:33,619 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2019-09-16 16:30:33,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-16 16:30:33,620 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-09-16 16:30:33,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:30:33,621 INFO L225 Difference]: With dead ends: 64 [2019-09-16 16:30:33,621 INFO L226 Difference]: Without dead ends: 42 [2019-09-16 16:30:33,622 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-09-16 16:30:33,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-16 16:30:33,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-09-16 16:30:33,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-16 16:30:33,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2019-09-16 16:30:33,630 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 36 [2019-09-16 16:30:33,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:30:33,630 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2019-09-16 16:30:33,630 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-16 16:30:33,631 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2019-09-16 16:30:33,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-09-16 16:30:33,632 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:30:33,632 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-16 16:30:33,633 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:30:33,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:30:33,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1518605332, now seen corresponding path program 2 times [2019-09-16 16:30:33,633 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:30:33,633 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:30:33,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:30:33,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:30:33,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:30:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:30:34,038 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-16 16:30:34,039 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-16 16:30:34,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-16 16:30:34,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-16 16:30:34,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-16 16:30:34,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-16 16:30:34,043 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 10 states. [2019-09-16 16:30:34,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:30:34,386 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2019-09-16 16:30:34,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-16 16:30:34,388 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 45 [2019-09-16 16:30:34,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:30:34,389 INFO L225 Difference]: With dead ends: 41 [2019-09-16 16:30:34,390 INFO L226 Difference]: Without dead ends: 39 [2019-09-16 16:30:34,390 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-09-16 16:30:34,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-16 16:30:34,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-09-16 16:30:34,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-16 16:30:34,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-16 16:30:34,405 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 45 [2019-09-16 16:30:34,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:30:34,406 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-16 16:30:34,406 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-16 16:30:34,406 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-16 16:30:34,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-16 16:30:34,407 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:30:34,407 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-16 16:30:34,408 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:30:34,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:30:34,408 INFO L82 PathProgramCache]: Analyzing trace with hash 909201437, now seen corresponding path program 1 times [2019-09-16 16:30:34,408 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:30:34,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:30:34,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:30:34,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-16 16:30:34,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:30:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:30:35,051 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-16 16:30:35,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:30:35,052 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:30:35,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:30:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:30:35,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 51 conjunts are in the unsatisfiable core [2019-09-16 16:30:35,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:30:35,348 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 8 treesize of output 4 [2019-09-16 16:30:35,349 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:30:35,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:30:35,358 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:30:35,358 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-09-16 16:30:39,589 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 20 [2019-09-16 16:30:43,710 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 26 [2019-09-16 16:30:43,724 INFO L392 ElimStorePlain]: Different costs {4=[|v_#memory_$Pointer$.offset_25|], 10=[|v_#memory_$Pointer$.base_26|]} [2019-09-16 16:30:43,779 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:30:43,779 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 47 [2019-09-16 16:30:43,780 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:30:43,817 INFO L567 ElimStorePlain]: treesize reduction 20, result has 78.3 percent of original size [2019-09-16 16:30:43,824 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:30:43,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:30:43,851 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-16 16:30:43,851 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:104, output treesize:95 [2019-09-16 16:30:45,865 WARN L860 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.offset Int) (sll_prepend_~new_head~1.base Int) (v_DerPreprocessor_1 Int)) (and (<= (+ |c_#StackHeapBarrier| 1) sll_prepend_~new_head~1.base) (= |c_#memory_$Pointer$.base| (let ((.cse0 (store |c_old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base (let ((.cse1 (store (store (select |c_old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base) (+ node_create_~temp~0.offset 4) 0) node_create_~temp~0.offset v_DerPreprocessor_1))) (store .cse1 (+ (select (select |c_#memory_$Pointer$.offset| |c_sll_prepend_#in~head.base|) |c_sll_prepend_#in~head.offset|) 4) (select (select (store |c_old(#memory_$Pointer$.base)| sll_prepend_~new_head~1.base .cse1) |c_sll_prepend_#in~head.base|) |c_sll_prepend_#in~head.offset|)))))) (store .cse0 |c_sll_prepend_#in~head.base| (store (select .cse0 |c_sll_prepend_#in~head.base|) |c_sll_prepend_#in~head.offset| sll_prepend_~new_head~1.base)))))) is different from true [2019-09-16 16:30:45,887 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:30:45,903 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:30:45,962 INFO L341 Elim1Store]: treesize reduction 32, result has 71.2 percent of original size [2019-09-16 16:30:45,963 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 2 case distinctions, treesize of input 72 treesize of output 103 [2019-09-16 16:30:45,965 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:30:46,019 INFO L567 ElimStorePlain]: treesize reduction 60, result has 53.1 percent of original size [2019-09-16 16:30:46,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:30:46,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:30:46,026 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:30:46,027 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:106, output treesize:31 [2019-09-16 16:30:46,114 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 26 treesize of output 18 [2019-09-16 16:30:46,115 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:30:46,124 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:30:46,128 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:30:46,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:31 [2019-09-16 16:30:46,248 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:30:46,250 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 30 [2019-09-16 16:30:46,251 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:30:46,253 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:30:46,255 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:30:46,273 INFO L567 ElimStorePlain]: treesize reduction 14, result has 41.7 percent of original size [2019-09-16 16:30:46,274 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:30:46,274 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:4 [2019-09-16 16:30:46,285 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-16 16:30:46,300 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:30:46,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 29 [2019-09-16 16:30:46,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-16 16:30:46,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-16 16:30:46,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=688, Unknown=3, NotChecked=52, Total=812 [2019-09-16 16:30:46,307 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 29 states. [2019-09-16 16:30:52,702 WARN L191 SmtUtils]: Spent 6.09 s on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2019-09-16 16:30:57,120 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 33 DAG size of output: 28 [2019-09-16 16:31:03,329 WARN L191 SmtUtils]: Spent 4.04 s on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2019-09-16 16:31:03,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:31:03,623 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2019-09-16 16:31:03,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-16 16:31:03,625 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 47 [2019-09-16 16:31:03,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:31:03,627 INFO L225 Difference]: With dead ends: 46 [2019-09-16 16:31:03,627 INFO L226 Difference]: Without dead ends: 43 [2019-09-16 16:31:03,628 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=124, Invalid=1282, Unknown=4, NotChecked=72, Total=1482 [2019-09-16 16:31:03,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-16 16:31:03,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-09-16 16:31:03,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-09-16 16:31:03,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2019-09-16 16:31:03,636 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 47 [2019-09-16 16:31:03,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:31:03,637 INFO L475 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2019-09-16 16:31:03,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-09-16 16:31:03,638 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2019-09-16 16:31:03,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-09-16 16:31:03,639 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:31:03,639 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-16 16:31:03,640 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:31:03,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:31:03,640 INFO L82 PathProgramCache]: Analyzing trace with hash 909203111, now seen corresponding path program 1 times [2019-09-16 16:31:03,640 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:31:03,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:31:03,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:03,644 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:31:03,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:31:04,479 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2019-09-16 16:31:05,057 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-16 16:31:05,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:31:05,058 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:31:05,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:31:05,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:31:05,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 105 conjunts are in the unsatisfiable core [2019-09-16 16:31:05,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:31:05,263 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-16 16:31:05,264 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:05,273 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:05,273 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:05,273 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-16 16:31:05,287 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-09-16 16:31:05,288 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:05,296 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:05,296 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:05,297 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-09-16 16:31:05,328 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-09-16 16:31:05,329 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:05,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:05,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:05,344 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-09-16 16:31:05,523 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 3 [2019-09-16 16:31:05,524 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:05,546 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:05,562 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-16 16:31:05,563 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:05,581 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:05,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 21 treesize of output 13 [2019-09-16 16:31:05,588 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:31:05,605 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:05,611 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2019-09-16 16:31:05,611 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:05,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:05,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:05,628 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:59, output treesize:13 [2019-09-16 16:31:05,782 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:31:05,800 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:05,801 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-09-16 16:31:05,802 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:79, output treesize:65 [2019-09-16 16:31:09,926 WARN L191 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 40 [2019-09-16 16:31:14,039 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 46 [2019-09-16 16:31:14,053 INFO L392 ElimStorePlain]: Different costs {2=[|v_#memory_int_25|], 10=[|v_#memory_$Pointer$.base_28|, |v_#memory_$Pointer$.offset_27|]} [2019-09-16 16:31:14,060 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:31:14,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:14,146 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:31:14,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:14,211 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:31:14,259 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:14,260 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2019-09-16 16:31:14,261 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:169, output treesize:222 [2019-09-16 16:31:24,600 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-09-16 16:31:24,640 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:24,641 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-09-16 16:31:24,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:24,757 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-09-16 16:31:24,758 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:24,761 INFO L392 ElimStorePlain]: Different costs {8=[|v_old(#memory_int)_AFTER_CALL_14|], 20=[|v_#memory_$Pointer$.offset_BEFORE_CALL_4|, |v_#memory_$Pointer$.base_BEFORE_CALL_8|]} [2019-09-16 16:31:24,773 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:31:24,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:31:24,786 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:31:24,820 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:24,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, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 86 [2019-09-16 16:31:24,822 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:25,090 WARN L191 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 74 [2019-09-16 16:31:25,091 INFO L567 ElimStorePlain]: treesize reduction 32, result has 88.9 percent of original size [2019-09-16 16:31:25,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:31:25,102 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:31:25,105 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:31:25,142 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:25,143 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 2 case distinctions, treesize of input 70 treesize of output 85 [2019-09-16 16:31:25,144 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:25,318 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 69 [2019-09-16 16:31:25,319 INFO L567 ElimStorePlain]: treesize reduction 52, result has 79.9 percent of original size [2019-09-16 16:31:25,322 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:31:25,332 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:31:25,333 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:31:25,362 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:25,363 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 2 case distinctions, treesize of input 84 treesize of output 95 [2019-09-16 16:31:25,364 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:25,514 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-09-16 16:31:25,515 INFO L567 ElimStorePlain]: treesize reduction 44, result has 79.3 percent of original size [2019-09-16 16:31:25,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:31:25,518 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:31:25,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:31:25,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:31:25,520 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:31:25,523 INFO L496 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-1 vars, 3 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:31:25,524 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 12 variables, input treesize:273, output treesize:243 [2019-09-16 16:31:25,870 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:25,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 85 [2019-09-16 16:31:25,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:31:25,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:31:25,874 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:31:25,915 INFO L567 ElimStorePlain]: treesize reduction 18, result has 78.0 percent of original size [2019-09-16 16:31:25,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:31:25,921 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 15 [2019-09-16 16:31:25,922 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:25,934 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:25,935 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:25,935 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:143, output treesize:17 [2019-09-16 16:31:26,013 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:31:26,020 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:26,021 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 10 [2019-09-16 16:31:26,021 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:26,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:26,028 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:26,028 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:7 [2019-09-16 16:31:26,105 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-16 16:31:26,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:31:26,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 33 [2019-09-16 16:31:26,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-09-16 16:31:26,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-09-16 16:31:26,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=972, Unknown=7, NotChecked=0, Total=1056 [2019-09-16 16:31:26,116 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand 33 states. [2019-09-16 16:31:40,241 WARN L191 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 87 DAG size of output: 57 [2019-09-16 16:31:51,032 WARN L191 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 75 DAG size of output: 50 [2019-09-16 16:31:51,518 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 70 [2019-09-16 16:31:52,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:31:52,474 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2019-09-16 16:31:52,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-16 16:31:52,476 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 47 [2019-09-16 16:31:52,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:31:52,478 INFO L225 Difference]: With dead ends: 43 [2019-09-16 16:31:52,478 INFO L226 Difference]: Without dead ends: 41 [2019-09-16 16:31:52,479 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 232 ImplicationChecksByTransitivity, 35.2s TimeCoverageRelationStatistics Valid=150, Invalid=1821, Unknown=9, NotChecked=0, Total=1980 [2019-09-16 16:31:52,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-09-16 16:31:52,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-09-16 16:31:52,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-16 16:31:52,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2019-09-16 16:31:52,486 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 47 [2019-09-16 16:31:52,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:31:52,487 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2019-09-16 16:31:52,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-09-16 16:31:52,487 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2019-09-16 16:31:52,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-16 16:31:52,488 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:31:52,488 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-16 16:31:52,488 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:31:52,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:31:52,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1865873432, now seen corresponding path program 1 times [2019-09-16 16:31:52,489 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:31:52,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:31:52,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:52,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:31:52,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:31:52,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:31:53,709 WARN L191 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 57 [2019-09-16 16:31:53,959 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-16 16:31:53,960 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:31:53,960 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:31:54,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:31:54,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:31:54,088 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 102 conjunts are in the unsatisfiable core [2019-09-16 16:31:54,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:31:54,179 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-16 16:31:54,179 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:54,185 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:54,186 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:54,186 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-09-16 16:31:54,205 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-09-16 16:31:54,205 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:54,216 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:54,217 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:54,217 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2019-09-16 16:31:54,365 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 9 treesize of output 3 [2019-09-16 16:31:54,366 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:54,384 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:54,390 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-09-16 16:31:54,391 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:54,406 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:54,410 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:54,411 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 13 [2019-09-16 16:31:54,411 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:31:54,418 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:31:54,419 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:31:54,419 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:57, output treesize:10 [2019-09-16 16:31:58,648 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 31 [2019-09-16 16:32:02,809 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 37 [2019-09-16 16:32:02,817 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:32:02,851 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:02,855 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:32:02,882 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:02,883 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-09-16 16:32:02,883 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:127, output treesize:171 [2019-09-16 16:32:15,217 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:15,218 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2019-09-16 16:32:15,219 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:15,310 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:15,312 INFO L392 ElimStorePlain]: Different costs {20=[|v_#memory_$Pointer$.offset_BEFORE_CALL_8|], 32=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_19|]} [2019-09-16 16:32:15,319 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:32:15,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:32:15,329 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:32:15,370 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:15,371 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 2 case distinctions, treesize of input 70 treesize of output 85 [2019-09-16 16:32:15,374 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:15,516 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-16 16:32:15,516 INFO L567 ElimStorePlain]: treesize reduction 52, result has 76.1 percent of original size [2019-09-16 16:32:15,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:32:15,525 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:32:15,527 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:32:15,662 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-09-16 16:32:15,662 INFO L341 Elim1Store]: treesize reduction 59, result has 65.9 percent of original size [2019-09-16 16:32:15,663 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 85 treesize of output 146 [2019-09-16 16:32:15,666 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-09-16 16:32:15,667 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:15,783 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 50 [2019-09-16 16:32:15,783 INFO L567 ElimStorePlain]: treesize reduction 124, result has 50.8 percent of original size [2019-09-16 16:32:15,785 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:15,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:15,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:15,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:15,789 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:15,790 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:32:15,790 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:220, output treesize:201 [2019-09-16 16:32:15,791 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:16,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:32:16,062 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 79 [2019-09-16 16:32:16,063 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:32:16,080 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:16,081 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-16 16:32:16,081 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:141, output treesize:80 [2019-09-16 16:32:16,179 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:32:16,180 INFO L172 IndexEqualityManager]: detected equality via solver [2019-09-16 16:32:16,209 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:16,210 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 80 treesize of output 75 [2019-09-16 16:32:16,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:16,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:16,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:16,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:16,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:16,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-16 16:32:16,217 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-16 16:32:16,250 INFO L567 ElimStorePlain]: treesize reduction 44, result has 36.2 percent of original size [2019-09-16 16:32:16,252 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:32:16,252 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:86, output treesize:4 [2019-09-16 16:32:16,265 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (5)] Exception during sending of exit command (exit): Broken pipe [2019-09-16 16:32:16,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-16 16:32:16,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 37 [2019-09-16 16:32:16,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-09-16 16:32:16,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-09-16 16:32:16,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1237, Unknown=8, NotChecked=0, Total=1332 [2019-09-16 16:32:16,272 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 37 states. [2019-09-16 16:32:30,819 WARN L191 SmtUtils]: Spent 4.11 s on a formula simplification. DAG size of input: 65 DAG size of output: 47 [2019-09-16 16:32:43,643 WARN L191 SmtUtils]: Spent 4.07 s on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-09-16 16:32:45,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-16 16:32:45,347 INFO L93 Difference]: Finished difference Result 49 states and 54 transitions. [2019-09-16 16:32:45,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-16 16:32:45,348 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 49 [2019-09-16 16:32:45,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-16 16:32:45,354 INFO L225 Difference]: With dead ends: 49 [2019-09-16 16:32:45,354 INFO L226 Difference]: Without dead ends: 46 [2019-09-16 16:32:45,358 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 37.9s TimeCoverageRelationStatistics Valid=182, Invalid=2257, Unknown=11, NotChecked=0, Total=2450 [2019-09-16 16:32:45,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-16 16:32:45,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2019-09-16 16:32:45,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-16 16:32:45,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2019-09-16 16:32:45,375 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 49 [2019-09-16 16:32:45,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-16 16:32:45,375 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2019-09-16 16:32:45,375 INFO L476 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-09-16 16:32:45,375 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2019-09-16 16:32:45,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-16 16:32:45,379 INFO L399 BasicCegarLoop]: Found error trace [2019-09-16 16:32:45,379 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2019-09-16 16:32:45,380 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-16 16:32:45,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-16 16:32:45,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1865875106, now seen corresponding path program 1 times [2019-09-16 16:32:45,380 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-16 16:32:45,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-16 16:32:45,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:32:45,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:32:45,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-16 16:32:45,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:32:46,877 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-16 16:32:47,177 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 53 [2019-09-16 16:32:49,195 WARN L191 SmtUtils]: Spent 1.58 s on a formula simplification. DAG size of input: 117 DAG size of output: 116 [2019-09-16 16:32:50,288 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 3 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-16 16:32:50,289 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-16 16:32:50,289 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:32:50,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-16 16:32:50,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-16 16:32:50,442 WARN L254 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 151 conjunts are in the unsatisfiable core [2019-09-16 16:32:50,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-16 16:32:50,598 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-09-16 16:32:50,598 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:50,606 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:50,606 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:32:50,607 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2019-09-16 16:32:50,617 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2019-09-16 16:32:50,617 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:50,626 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:50,627 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:32:50,627 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2019-09-16 16:32:50,640 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-09-16 16:32:50,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:50,647 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:50,648 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:32:50,648 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2019-09-16 16:32:50,660 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 5 treesize of output 3 [2019-09-16 16:32:50,661 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:50,666 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:50,667 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-09-16 16:32:50,667 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:7 [2019-09-16 16:32:50,691 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_30|, |v_#memory_$Pointer$.base_32|], 2=[|v_#memory_int_30|]} [2019-09-16 16:32:50,700 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:32:50,703 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2019-09-16 16:32:50,704 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:50,749 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:50,757 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-09-16 16:32:50,758 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 9 [2019-09-16 16:32:50,759 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-16 16:32:50,793 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:50,795 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-16 16:32:50,827 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:50,827 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-09-16 16:32:50,828 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:101, output treesize:65 [2019-09-16 16:32:52,218 WARN L191 SmtUtils]: Spent 1.27 s on a formula simplification that was a NOOP. DAG size: 39 [2019-09-16 16:32:52,265 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-09-16 16:32:52,466 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-16 16:32:52,467 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: var is still there: |v_#valid_BEFORE_CALL_10| input size 35 context size 35 output size 35 at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:349) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:361) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:461) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-16 16:32:52,473 INFO L168 Benchmark]: Toolchain (without parser) took 141396.15 ms. Allocated memory was 138.4 MB in the beginning and 418.9 MB in the end (delta: 280.5 MB). Free memory was 83.7 MB in the beginning and 316.4 MB in the end (delta: -232.7 MB). Peak memory consumption was 47.8 MB. Max. memory is 7.1 GB. [2019-09-16 16:32:52,474 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 138.4 MB. Free memory was 103.1 MB in the beginning and 102.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-16 16:32:52,474 INFO L168 Benchmark]: CACSL2BoogieTranslator took 618.90 ms. Allocated memory was 138.4 MB in the beginning and 199.2 MB in the end (delta: 60.8 MB). Free memory was 83.5 MB in the beginning and 163.3 MB in the end (delta: -79.8 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. [2019-09-16 16:32:52,475 INFO L168 Benchmark]: Boogie Preprocessor took 100.90 ms. Allocated memory is still 199.2 MB. Free memory was 163.3 MB in the beginning and 160.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-09-16 16:32:52,475 INFO L168 Benchmark]: RCFGBuilder took 711.30 ms. Allocated memory is still 199.2 MB. Free memory was 159.9 MB in the beginning and 113.9 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. [2019-09-16 16:32:52,476 INFO L168 Benchmark]: TraceAbstraction took 139960.05 ms. Allocated memory was 199.2 MB in the beginning and 418.9 MB in the end (delta: 219.7 MB). Free memory was 113.9 MB in the beginning and 316.4 MB in the end (delta: -202.6 MB). Peak memory consumption was 17.1 MB. Max. memory is 7.1 GB. [2019-09-16 16:32:52,479 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.50 ms. Allocated memory is still 138.4 MB. Free memory was 103.1 MB in the beginning and 102.9 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 618.90 ms. Allocated memory was 138.4 MB in the beginning and 199.2 MB in the end (delta: 60.8 MB). Free memory was 83.5 MB in the beginning and 163.3 MB in the end (delta: -79.8 MB). Peak memory consumption was 21.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 100.90 ms. Allocated memory is still 199.2 MB. Free memory was 163.3 MB in the beginning and 160.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 711.30 ms. Allocated memory is still 199.2 MB. Free memory was 159.9 MB in the beginning and 113.9 MB in the end (delta: 46.0 MB). Peak memory consumption was 46.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 139960.05 ms. Allocated memory was 199.2 MB in the beginning and 418.9 MB in the end (delta: 219.7 MB). Free memory was 113.9 MB in the beginning and 316.4 MB in the end (delta: -202.6 MB). Peak memory consumption was 17.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: var is still there: |v_#valid_BEFORE_CALL_10| input size 35 context size 35 output size 35 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: var is still there: |v_#valid_BEFORE_CALL_10| input size 35 context size 35 output size 35: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...