/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-simple/dll2c_update_all.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 21:16:37,584 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:16:37,587 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:16:37,599 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:16:37,600 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:16:37,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:16:37,602 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:16:37,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:16:37,606 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:16:37,607 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:16:37,608 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:16:37,609 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:16:37,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:16:37,610 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:16:37,611 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:16:37,613 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:16:37,613 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:16:37,614 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:16:37,616 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:16:37,618 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:16:37,620 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:16:37,621 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:16:37,623 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:16:37,624 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:16:37,628 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:16:37,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:16:37,629 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:16:37,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:16:37,630 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:16:37,634 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:16:37,635 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:16:37,635 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:16:37,639 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:16:37,639 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:16:37,641 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:16:37,643 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:16:37,644 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:16:37,644 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:16:37,644 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:16:37,645 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:16:37,649 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:16:37,651 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 21:16:37,674 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:16:37,675 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:16:37,678 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:16:37,679 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:16:37,679 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:16:37,679 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:16:37,679 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:16:37,679 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:16:37,680 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:16:37,680 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:16:37,681 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:16:37,681 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:16:37,681 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:16:37,682 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:16:37,682 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:16:37,682 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:16:37,682 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:16:37,682 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:16:37,683 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:16:37,683 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:16:37,683 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:16:37,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:16:37,684 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:16:37,684 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:16:37,684 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:16:37,684 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:16:37,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:16:37,685 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:16:37,685 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:16:38,015 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:16:38,033 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:16:38,037 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:16:38,039 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:16:38,039 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:16:38,040 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_update_all.i [2019-11-06 21:16:38,103 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/105dba6b2/f97974c2ecfe48afa1b7c73120b5bdf7/FLAG66380a22d [2019-11-06 21:16:38,648 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:16:38,649 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all.i [2019-11-06 21:16:38,674 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/105dba6b2/f97974c2ecfe48afa1b7c73120b5bdf7/FLAG66380a22d [2019-11-06 21:16:38,955 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/105dba6b2/f97974c2ecfe48afa1b7c73120b5bdf7 [2019-11-06 21:16:38,963 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:16:38,965 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:16:38,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:16:38,966 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:16:38,970 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:16:38,971 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:16:38" (1/1) ... [2019-11-06 21:16:38,974 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@637d7e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:38, skipping insertion in model container [2019-11-06 21:16:38,974 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:16:38" (1/1) ... [2019-11-06 21:16:38,982 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:16:39,038 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:16:39,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:16:39,608 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:16:39,673 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:16:39,738 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:16:39,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:39 WrapperNode [2019-11-06 21:16:39,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:16:39,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:16:39,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:16:39,740 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:16:39,752 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:39" (1/1) ... [2019-11-06 21:16:39,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:39" (1/1) ... [2019-11-06 21:16:39,780 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:39" (1/1) ... [2019-11-06 21:16:39,781 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:39" (1/1) ... [2019-11-06 21:16:39,803 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:39" (1/1) ... [2019-11-06 21:16:39,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:39" (1/1) ... [2019-11-06 21:16:39,819 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:39" (1/1) ... [2019-11-06 21:16:39,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:16:39,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:16:39,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:16:39,827 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:16:39,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:16:39,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:16:39,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:16:39,890 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-06 21:16:39,890 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-06 21:16:39,890 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-06 21:16:39,890 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-11-06 21:16:39,891 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-11-06 21:16:39,891 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2019-11-06 21:16:39,891 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_get_data_at [2019-11-06 21:16:39,891 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_update_at [2019-11-06 21:16:39,891 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:16:39,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:16:39,892 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-06 21:16:39,892 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-06 21:16:39,892 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-06 21:16:39,892 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-06 21:16:39,892 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-06 21:16:39,893 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-06 21:16:39,893 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-06 21:16:39,893 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-06 21:16:39,893 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-06 21:16:39,893 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-06 21:16:39,893 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-06 21:16:39,893 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-06 21:16:39,894 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-06 21:16:39,894 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-06 21:16:39,894 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-06 21:16:39,894 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-06 21:16:39,894 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-06 21:16:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-06 21:16:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-06 21:16:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-06 21:16:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-06 21:16:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-06 21:16:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-06 21:16:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-06 21:16:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-06 21:16:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-06 21:16:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-06 21:16:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-06 21:16:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-06 21:16:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-06 21:16:39,897 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-06 21:16:39,897 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-06 21:16:39,897 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-06 21:16:39,897 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-06 21:16:39,897 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-06 21:16:39,897 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-06 21:16:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-06 21:16:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-06 21:16:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-06 21:16:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-06 21:16:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-06 21:16:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-06 21:16:39,898 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-06 21:16:39,899 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-06 21:16:39,899 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-06 21:16:39,899 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-06 21:16:39,899 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-06 21:16:39,899 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-06 21:16:39,899 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-06 21:16:39,899 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-06 21:16:39,900 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-06 21:16:39,900 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-06 21:16:39,900 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 21:16:39,900 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-06 21:16:39,900 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-06 21:16:39,900 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-06 21:16:39,902 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-06 21:16:39,903 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-06 21:16:39,903 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-06 21:16:39,903 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-06 21:16:39,903 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-06 21:16:39,904 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-06 21:16:39,905 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-06 21:16:39,905 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-06 21:16:39,905 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-06 21:16:39,905 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 21:16:39,905 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-06 21:16:39,906 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-06 21:16:39,906 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-06 21:16:39,906 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-06 21:16:39,906 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-06 21:16:39,906 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-06 21:16:39,906 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-06 21:16:39,907 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-06 21:16:39,907 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-06 21:16:39,907 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-06 21:16:39,907 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-06 21:16:39,907 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-06 21:16:39,907 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-06 21:16:39,907 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-06 21:16:39,908 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-06 21:16:39,908 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-06 21:16:39,908 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-06 21:16:39,908 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-06 21:16:39,908 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-06 21:16:39,908 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-06 21:16:39,909 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-06 21:16:39,909 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-06 21:16:39,909 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-06 21:16:39,909 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-06 21:16:39,909 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-06 21:16:39,909 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-06 21:16:39,909 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-06 21:16:39,909 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-06 21:16:39,909 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-06 21:16:39,910 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-06 21:16:39,910 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-06 21:16:39,910 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-06 21:16:39,910 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-06 21:16:39,910 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-06 21:16:39,910 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-06 21:16:39,910 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-06 21:16:39,910 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-06 21:16:39,911 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-06 21:16:39,911 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-06 21:16:39,911 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-06 21:16:39,911 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-11-06 21:16:39,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 21:16:39,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-06 21:16:39,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 21:16:39,912 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-11-06 21:16:39,912 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2019-11-06 21:16:39,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-06 21:16:39,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 21:16:39,912 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_get_data_at [2019-11-06 21:16:39,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 21:16:39,913 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_update_at [2019-11-06 21:16:39,913 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:16:39,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:16:39,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:16:40,407 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-06 21:16:40,528 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:16:40,529 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-11-06 21:16:40,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:16:40 BoogieIcfgContainer [2019-11-06 21:16:40,530 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:16:40,531 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:16:40,531 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:16:40,535 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:16:40,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:16:38" (1/3) ... [2019-11-06 21:16:40,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0f2903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:16:40, skipping insertion in model container [2019-11-06 21:16:40,536 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:16:39" (2/3) ... [2019-11-06 21:16:40,536 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c0f2903 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:16:40, skipping insertion in model container [2019-11-06 21:16:40,537 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:16:40" (3/3) ... [2019-11-06 21:16:40,538 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2c_update_all.i [2019-11-06 21:16:40,548 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:16:40,557 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 21:16:40,568 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 21:16:40,594 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:16:40,594 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:16:40,594 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:16:40,595 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:16:40,595 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:16:40,595 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:16:40,595 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:16:40,595 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:16:40,614 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2019-11-06 21:16:40,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-06 21:16:40,621 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:16:40,622 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:16:40,624 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:16:40,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:16:40,630 INFO L82 PathProgramCache]: Analyzing trace with hash 1661227511, now seen corresponding path program 1 times [2019-11-06 21:16:40,636 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:16:40,637 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226634878] [2019-11-06 21:16:40,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:16:40,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:40,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:40,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:40,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:40,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:16:40,939 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226634878] [2019-11-06 21:16:40,940 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:16:40,940 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 21:16:40,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674632404] [2019-11-06 21:16:40,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 21:16:40,946 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:16:40,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 21:16:40,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:16:40,963 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 4 states. [2019-11-06 21:16:41,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:16:41,181 INFO L93 Difference]: Finished difference Result 101 states and 133 transitions. [2019-11-06 21:16:41,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 21:16:41,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-06 21:16:41,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:16:41,193 INFO L225 Difference]: With dead ends: 101 [2019-11-06 21:16:41,193 INFO L226 Difference]: Without dead ends: 45 [2019-11-06 21:16:41,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:16:41,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-06 21:16:41,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-11-06 21:16:41,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-06 21:16:41,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2019-11-06 21:16:41,244 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 32 [2019-11-06 21:16:41,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:16:41,246 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2019-11-06 21:16:41,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 21:16:41,246 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2019-11-06 21:16:41,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-06 21:16:41,249 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:16:41,249 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:16:41,249 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:16:41,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:16:41,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1248070634, now seen corresponding path program 1 times [2019-11-06 21:16:41,250 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:16:41,250 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369307633] [2019-11-06 21:16:41,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:16:41,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:41,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:41,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:41,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:16:41,484 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369307633] [2019-11-06 21:16:41,484 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:16:41,484 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 21:16:41,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179579122] [2019-11-06 21:16:41,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 21:16:41,487 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:16:41,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 21:16:41,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:16:41,487 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 7 states. [2019-11-06 21:16:41,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:16:41,865 INFO L93 Difference]: Finished difference Result 75 states and 87 transitions. [2019-11-06 21:16:41,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 21:16:41,865 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-11-06 21:16:41,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:16:41,867 INFO L225 Difference]: With dead ends: 75 [2019-11-06 21:16:41,867 INFO L226 Difference]: Without dead ends: 50 [2019-11-06 21:16:41,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:16:41,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-06 21:16:41,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 46. [2019-11-06 21:16:41,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-11-06 21:16:41,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2019-11-06 21:16:41,880 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 32 [2019-11-06 21:16:41,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:16:41,881 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2019-11-06 21:16:41,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 21:16:41,881 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2019-11-06 21:16:41,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-06 21:16:41,884 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:16:41,884 INFO L410 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, 1, 1, 1, 1, 1, 1] [2019-11-06 21:16:41,884 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:16:41,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:16:41,886 INFO L82 PathProgramCache]: Analyzing trace with hash -820838434, now seen corresponding path program 1 times [2019-11-06 21:16:41,886 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:16:41,886 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368207372] [2019-11-06 21:16:41,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:16:41,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:42,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:42,102 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-06 21:16:42,103 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368207372] [2019-11-06 21:16:42,103 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:16:42,103 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-06 21:16:42,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647383353] [2019-11-06 21:16:42,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:16:42,105 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:16:42,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:16:42,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:16:42,106 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand 6 states. [2019-11-06 21:16:42,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:16:42,371 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2019-11-06 21:16:42,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:16:42,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-11-06 21:16:42,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:16:42,373 INFO L225 Difference]: With dead ends: 69 [2019-11-06 21:16:42,373 INFO L226 Difference]: Without dead ends: 56 [2019-11-06 21:16:42,374 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:16:42,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-06 21:16:42,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2019-11-06 21:16:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-06 21:16:42,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2019-11-06 21:16:42,383 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 42 [2019-11-06 21:16:42,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:16:42,384 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2019-11-06 21:16:42,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:16:42,384 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2019-11-06 21:16:42,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-06 21:16:42,385 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:16:42,386 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:16:42,386 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:16:42,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:16:42,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1202630968, now seen corresponding path program 1 times [2019-11-06 21:16:42,387 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:16:42,387 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622955708] [2019-11-06 21:16:42,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:16:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:42,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:42,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:42,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:42,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:42,586 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-06 21:16:42,587 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622955708] [2019-11-06 21:16:42,587 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645135475] [2019-11-06 21:16:42,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:16:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:42,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 21:16:42,764 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:16:42,832 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-06 21:16:42,833 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:16:42,833 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-11-06 21:16:42,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619021099] [2019-11-06 21:16:42,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 21:16:42,835 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:16:42,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 21:16:42,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:16:42,835 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand 10 states. [2019-11-06 21:16:43,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:16:43,170 INFO L93 Difference]: Finished difference Result 79 states and 91 transitions. [2019-11-06 21:16:43,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 21:16:43,170 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 50 [2019-11-06 21:16:43,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:16:43,172 INFO L225 Difference]: With dead ends: 79 [2019-11-06 21:16:43,172 INFO L226 Difference]: Without dead ends: 66 [2019-11-06 21:16:43,173 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-11-06 21:16:43,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-06 21:16:43,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 50. [2019-11-06 21:16:43,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-06 21:16:43,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 57 transitions. [2019-11-06 21:16:43,183 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 57 transitions. Word has length 50 [2019-11-06 21:16:43,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:16:43,184 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 57 transitions. [2019-11-06 21:16:43,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 21:16:43,184 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2019-11-06 21:16:43,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-06 21:16:43,185 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:16:43,185 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:16:43,390 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:16:43,391 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:16:43,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:16:43,391 INFO L82 PathProgramCache]: Analyzing trace with hash -470871118, now seen corresponding path program 2 times [2019-11-06 21:16:43,392 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:16:43,392 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556718683] [2019-11-06 21:16:43,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:16:43,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:43,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:43,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:43,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:43,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:43,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:43,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:43,650 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-06 21:16:43,651 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556718683] [2019-11-06 21:16:43,651 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064786606] [2019-11-06 21:16:43,652 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:16:43,955 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 21:16:43,956 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:16:43,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-06 21:16:43,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:16:44,017 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-06 21:16:44,018 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 21:16:44,019 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2019-11-06 21:16:44,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269394714] [2019-11-06 21:16:44,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:16:44,020 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:16:44,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:16:44,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-11-06 21:16:44,020 INFO L87 Difference]: Start difference. First operand 50 states and 57 transitions. Second operand 6 states. [2019-11-06 21:16:44,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:16:44,100 INFO L93 Difference]: Finished difference Result 82 states and 95 transitions. [2019-11-06 21:16:44,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:16:44,101 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-11-06 21:16:44,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:16:44,108 INFO L225 Difference]: With dead ends: 82 [2019-11-06 21:16:44,108 INFO L226 Difference]: Without dead ends: 61 [2019-11-06 21:16:44,109 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-06 21:16:44,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-06 21:16:44,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2019-11-06 21:16:44,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-06 21:16:44,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2019-11-06 21:16:44,125 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 58 [2019-11-06 21:16:44,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:16:44,125 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2019-11-06 21:16:44,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:16:44,126 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2019-11-06 21:16:44,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-06 21:16:44,129 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:16:44,130 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:16:44,335 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:16:44,335 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:16:44,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:16:44,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1967505627, now seen corresponding path program 1 times [2019-11-06 21:16:44,338 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:16:44,340 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124070713] [2019-11-06 21:16:44,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:16:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:45,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:45,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:45,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:45,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:45,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:45,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:46,106 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-06 21:16:46,106 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124070713] [2019-11-06 21:16:46,125 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1214529962] [2019-11-06 21:16:46,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:16:46,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:16:46,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 96 conjunts are in the unsatisfiable core [2019-11-06 21:16:46,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:16:46,343 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:16:46,343 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:46,349 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:46,350 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:46,350 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-06 21:16:46,517 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:46,518 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 11 treesize of output 15 [2019-11-06 21:16:46,519 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:46,525 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:46,526 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:46,526 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-11-06 21:16:46,589 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-11-06 21:16:46,589 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:46,594 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:46,595 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:46,595 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-11-06 21:16:46,671 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 21 treesize of output 20 [2019-11-06 21:16:46,672 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:46,679 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:46,680 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-11-06 21:16:46,681 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-11-06 21:16:47,003 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-11-06 21:16:47,003 INFO L341 Elim1Store]: treesize reduction 67, result has 62.8 percent of original size [2019-11-06 21:16:47,005 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 132 [2019-11-06 21:16:47,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:47,046 INFO L567 ElimStorePlain]: treesize reduction 155, result has 25.1 percent of original size [2019-11-06 21:16:47,047 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:16:47,048 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:71, output treesize:52 [2019-11-06 21:16:47,609 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 13 treesize of output 9 [2019-11-06 21:16:47,609 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:47,617 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:47,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:47,618 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2019-11-06 21:16:47,711 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:16:47,712 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:16:47,713 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:16:47,781 INFO L341 Elim1Store]: treesize reduction 28, result has 65.0 percent of original size [2019-11-06 21:16:47,782 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 81 [2019-11-06 21:16:47,784 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:47,815 INFO L567 ElimStorePlain]: treesize reduction 72, result has 41.5 percent of original size [2019-11-06 21:16:47,816 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-11-06 21:16:47,816 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:70, output treesize:51 [2019-11-06 21:16:48,654 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~data Int) (dll_circular_update_at_~head.offset Int)) (= (let ((.cse0 (select (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|))) (store |c_old(#memory_int)| .cse0 (store (select |c_old(#memory_int)| .cse0) (+ dll_circular_update_at_~head.offset 8) dll_circular_update_at_~data))) |c_#memory_int|)) is different from true [2019-11-06 21:16:48,669 INFO L392 ElimStorePlain]: Different costs {2=[|v_old(#memory_int)_AFTER_CALL_14|], 6=[|v_old(#memory_$Pointer$.base)_AFTER_CALL_14|]} [2019-11-06 21:16:48,697 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:16:48,698 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 31 treesize of output 26 [2019-11-06 21:16:48,699 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:48,711 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:48,723 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:16:48,740 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:48,741 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 53 [2019-11-06 21:16:48,742 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:48,743 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:48,746 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:48,747 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:16:48,748 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:16:48,769 INFO L567 ElimStorePlain]: treesize reduction 30, result has 46.4 percent of original size [2019-11-06 21:16:48,770 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:48,770 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:72, output treesize:13 [2019-11-06 21:16:49,799 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:16:49,800 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 37 treesize of output 29 [2019-11-06 21:16:49,801 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:16:49,812 INFO L567 ElimStorePlain]: treesize reduction 16, result has 30.4 percent of original size [2019-11-06 21:16:49,812 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:16:49,812 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:37, output treesize:7 [2019-11-06 21:16:49,888 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2019-11-06 21:16:49,888 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:16:49,888 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 60 [2019-11-06 21:16:49,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136758066] [2019-11-06 21:16:49,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-11-06 21:16:49,890 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:16:49,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-11-06 21:16:49,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=3249, Unknown=2, NotChecked=114, Total=3540 [2019-11-06 21:16:49,892 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 60 states. [2019-11-06 21:16:56,014 WARN L191 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2019-11-06 21:17:03,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:17:03,545 INFO L93 Difference]: Finished difference Result 128 states and 165 transitions. [2019-11-06 21:17:03,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-11-06 21:17:03,546 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 59 [2019-11-06 21:17:03,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:17:03,549 INFO L225 Difference]: With dead ends: 128 [2019-11-06 21:17:03,549 INFO L226 Difference]: Without dead ends: 125 [2019-11-06 21:17:03,554 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1747 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=562, Invalid=8549, Unknown=13, NotChecked=188, Total=9312 [2019-11-06 21:17:03,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-06 21:17:03,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 107. [2019-11-06 21:17:03,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-06 21:17:03,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 139 transitions. [2019-11-06 21:17:03,575 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 139 transitions. Word has length 59 [2019-11-06 21:17:03,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:17:03,576 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 139 transitions. [2019-11-06 21:17:03,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-11-06 21:17:03,576 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 139 transitions. [2019-11-06 21:17:03,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-06 21:17:03,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:17:03,578 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:17:03,779 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:17:03,780 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:17:03,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:17:03,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1479492828, now seen corresponding path program 1 times [2019-11-06 21:17:03,781 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:17:03,781 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10612732] [2019-11-06 21:17:03,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:17:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:03,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:03,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:03,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:03,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:03,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:03,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:03,931 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-06 21:17:03,932 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10612732] [2019-11-06 21:17:03,932 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641590515] [2019-11-06 21:17:03,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:17:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:04,122 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 21:17:04,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:17:04,174 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-06 21:17:04,174 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:17:04,174 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-11-06 21:17:04,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042141338] [2019-11-06 21:17:04,175 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 21:17:04,176 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:17:04,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 21:17:04,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:17:04,176 INFO L87 Difference]: Start difference. First operand 107 states and 139 transitions. Second operand 10 states. [2019-11-06 21:17:04,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:17:04,592 INFO L93 Difference]: Finished difference Result 145 states and 184 transitions. [2019-11-06 21:17:04,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-06 21:17:04,593 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2019-11-06 21:17:04,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:17:04,596 INFO L225 Difference]: With dead ends: 145 [2019-11-06 21:17:04,596 INFO L226 Difference]: Without dead ends: 119 [2019-11-06 21:17:04,597 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-06 21:17:04,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-06 21:17:04,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2019-11-06 21:17:04,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-06 21:17:04,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 146 transitions. [2019-11-06 21:17:04,656 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 146 transitions. Word has length 60 [2019-11-06 21:17:04,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:17:04,657 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 146 transitions. [2019-11-06 21:17:04,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 21:17:04,657 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 146 transitions. [2019-11-06 21:17:04,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-06 21:17:04,659 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:17:04,660 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:17:04,864 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:17:04,864 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:17:04,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:17:04,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1118535150, now seen corresponding path program 2 times [2019-11-06 21:17:04,865 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:17:04,865 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646139710] [2019-11-06 21:17:04,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:17:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:04,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:04,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:04,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:04,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:05,021 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-06 21:17:05,022 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646139710] [2019-11-06 21:17:05,022 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [388049077] [2019-11-06 21:17:05,022 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:17:05,365 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 21:17:05,365 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:17:05,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-06 21:17:05,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:17:05,412 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-06 21:17:05,412 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:17:05,413 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-11-06 21:17:05,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585167693] [2019-11-06 21:17:05,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-06 21:17:05,416 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:17:05,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-06 21:17:05,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-11-06 21:17:05,416 INFO L87 Difference]: Start difference. First operand 113 states and 146 transitions. Second operand 12 states. [2019-11-06 21:17:05,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:17:05,891 INFO L93 Difference]: Finished difference Result 158 states and 197 transitions. [2019-11-06 21:17:05,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-06 21:17:05,892 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-11-06 21:17:05,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:17:05,893 INFO L225 Difference]: With dead ends: 158 [2019-11-06 21:17:05,893 INFO L226 Difference]: Without dead ends: 117 [2019-11-06 21:17:05,895 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2019-11-06 21:17:05,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-06 21:17:05,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 109. [2019-11-06 21:17:05,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-06 21:17:05,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 134 transitions. [2019-11-06 21:17:05,911 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 134 transitions. Word has length 60 [2019-11-06 21:17:05,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:17:05,912 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 134 transitions. [2019-11-06 21:17:05,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-06 21:17:05,912 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 134 transitions. [2019-11-06 21:17:05,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-06 21:17:05,913 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:17:05,913 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:17:06,118 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:17:06,119 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:17:06,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:17:06,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1221148414, now seen corresponding path program 3 times [2019-11-06 21:17:06,120 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:17:06,120 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658868515] [2019-11-06 21:17:06,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:17:06,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:06,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:06,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:06,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:06,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:06,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:06,243 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-06 21:17:06,243 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658868515] [2019-11-06 21:17:06,244 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265817509] [2019-11-06 21:17:06,244 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:17:06,636 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-11-06 21:17:06,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:17:06,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 21:17:06,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:17:06,681 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-06 21:17:06,682 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:17:06,682 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 10 [2019-11-06 21:17:06,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672019517] [2019-11-06 21:17:06,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 21:17:06,683 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:17:06,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 21:17:06,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:17:06,683 INFO L87 Difference]: Start difference. First operand 109 states and 134 transitions. Second operand 10 states. [2019-11-06 21:17:07,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:17:07,031 INFO L93 Difference]: Finished difference Result 148 states and 177 transitions. [2019-11-06 21:17:07,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 21:17:07,031 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2019-11-06 21:17:07,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:17:07,033 INFO L225 Difference]: With dead ends: 148 [2019-11-06 21:17:07,033 INFO L226 Difference]: Without dead ends: 115 [2019-11-06 21:17:07,034 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2019-11-06 21:17:07,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-06 21:17:07,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2019-11-06 21:17:07,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-06 21:17:07,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 131 transitions. [2019-11-06 21:17:07,048 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 131 transitions. Word has length 60 [2019-11-06 21:17:07,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:17:07,048 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 131 transitions. [2019-11-06 21:17:07,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 21:17:07,048 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 131 transitions. [2019-11-06 21:17:07,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-06 21:17:07,049 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:17:07,050 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:17:07,254 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:17:07,254 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:17:07,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:17:07,255 INFO L82 PathProgramCache]: Analyzing trace with hash -2045941912, now seen corresponding path program 4 times [2019-11-06 21:17:07,255 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:17:07,255 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714429425] [2019-11-06 21:17:07,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:17:07,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:07,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:07,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:07,472 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-06 21:17:07,472 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714429425] [2019-11-06 21:17:07,472 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618183022] [2019-11-06 21:17:07,472 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:17:07,614 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-06 21:17:07,614 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:17:07,615 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-06 21:17:07,619 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:17:07,684 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-06 21:17:07,685 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 21:17:07,685 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 13 [2019-11-06 21:17:07,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840648935] [2019-11-06 21:17:07,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:17:07,688 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:17:07,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:17:07,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-11-06 21:17:07,689 INFO L87 Difference]: Start difference. First operand 109 states and 131 transitions. Second operand 6 states. [2019-11-06 21:17:07,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:17:07,741 INFO L93 Difference]: Finished difference Result 164 states and 193 transitions. [2019-11-06 21:17:07,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:17:07,742 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-06 21:17:07,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:17:07,743 INFO L225 Difference]: With dead ends: 164 [2019-11-06 21:17:07,743 INFO L226 Difference]: Without dead ends: 112 [2019-11-06 21:17:07,744 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-11-06 21:17:07,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-06 21:17:07,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 108. [2019-11-06 21:17:07,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-06 21:17:07,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 126 transitions. [2019-11-06 21:17:07,756 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 126 transitions. Word has length 68 [2019-11-06 21:17:07,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:17:07,756 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 126 transitions. [2019-11-06 21:17:07,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:17:07,756 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2019-11-06 21:17:07,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-06 21:17:07,757 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:17:07,757 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:17:07,962 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:17:07,963 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:17:07,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:17:07,963 INFO L82 PathProgramCache]: Analyzing trace with hash 715119440, now seen corresponding path program 1 times [2019-11-06 21:17:07,964 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:17:07,964 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367819709] [2019-11-06 21:17:07,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:17:07,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:08,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:08,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:08,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:08,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:08,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:08,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:08,120 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-06 21:17:08,121 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367819709] [2019-11-06 21:17:08,121 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084903031] [2019-11-06 21:17:08,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:17:08,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:08,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-06 21:17:08,329 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:17:08,375 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-06 21:17:08,376 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 21:17:08,376 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2019-11-06 21:17:08,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065601654] [2019-11-06 21:17:08,377 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:17:08,377 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:17:08,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:17:08,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:17:08,378 INFO L87 Difference]: Start difference. First operand 108 states and 126 transitions. Second operand 6 states. [2019-11-06 21:17:08,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:17:08,457 INFO L93 Difference]: Finished difference Result 114 states and 130 transitions. [2019-11-06 21:17:08,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:17:08,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-11-06 21:17:08,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:17:08,459 INFO L225 Difference]: With dead ends: 114 [2019-11-06 21:17:08,459 INFO L226 Difference]: Without dead ends: 110 [2019-11-06 21:17:08,460 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-11-06 21:17:08,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-06 21:17:08,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2019-11-06 21:17:08,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-06 21:17:08,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2019-11-06 21:17:08,480 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 69 [2019-11-06 21:17:08,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:17:08,480 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2019-11-06 21:17:08,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:17:08,480 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2019-11-06 21:17:08,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-06 21:17:08,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:17:08,482 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:17:08,694 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:17:08,695 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:17:08,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:17:08,696 INFO L82 PathProgramCache]: Analyzing trace with hash 2055631537, now seen corresponding path program 5 times [2019-11-06 21:17:08,696 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:17:08,696 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558364818] [2019-11-06 21:17:08,697 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:17:08,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:08,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:08,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:08,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:08,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:08,857 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-06 21:17:08,858 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558364818] [2019-11-06 21:17:08,858 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [26228945] [2019-11-06 21:17:08,858 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:17:09,119 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2019-11-06 21:17:09,119 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:17:09,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-06 21:17:09,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:17:09,146 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-06 21:17:09,146 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:17:09,146 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 10 [2019-11-06 21:17:09,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588886958] [2019-11-06 21:17:09,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 21:17:09,147 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:17:09,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 21:17:09,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:17:09,148 INFO L87 Difference]: Start difference. First operand 108 states and 124 transitions. Second operand 10 states. [2019-11-06 21:17:09,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:17:09,474 INFO L93 Difference]: Finished difference Result 121 states and 135 transitions. [2019-11-06 21:17:09,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-06 21:17:09,475 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 69 [2019-11-06 21:17:09,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:17:09,476 INFO L225 Difference]: With dead ends: 121 [2019-11-06 21:17:09,476 INFO L226 Difference]: Without dead ends: 75 [2019-11-06 21:17:09,479 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2019-11-06 21:17:09,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2019-11-06 21:17:09,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2019-11-06 21:17:09,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-06 21:17:09,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2019-11-06 21:17:09,486 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 69 [2019-11-06 21:17:09,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:17:09,487 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2019-11-06 21:17:09,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 21:17:09,487 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2019-11-06 21:17:09,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-06 21:17:09,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:17:09,488 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:17:09,700 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:17:09,700 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:17:09,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:17:09,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1258476015, now seen corresponding path program 1 times [2019-11-06 21:17:09,702 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:17:09,702 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873685103] [2019-11-06 21:17:09,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:17:09,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:10,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:10,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:10,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:10,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:11,095 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 31 [2019-11-06 21:17:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:11,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:11,412 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-06 21:17:11,412 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873685103] [2019-11-06 21:17:11,412 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072526351] [2019-11-06 21:17:11,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:17:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:17:11,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 110 conjunts are in the unsatisfiable core [2019-11-06 21:17:11,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:17:11,629 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-06 21:17:11,629 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:17:11,630 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:17:11,631 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:17:11,631 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-06 21:17:11,960 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:17:11,960 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 11 treesize of output 15 [2019-11-06 21:17:11,961 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:17:11,986 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:17:11,986 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:17:11,987 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-11-06 21:17:12,037 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-11-06 21:17:12,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:17:12,043 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:17:12,043 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:17:12,044 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-11-06 21:17:12,115 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 21 treesize of output 20 [2019-11-06 21:17:12,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:17:12,123 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:17:12,124 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-11-06 21:17:12,124 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-11-06 21:17:12,427 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2019-11-06 21:17:12,428 INFO L341 Elim1Store]: treesize reduction 67, result has 62.8 percent of original size [2019-11-06 21:17:12,429 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 71 treesize of output 132 [2019-11-06 21:17:12,430 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:17:12,471 INFO L567 ElimStorePlain]: treesize reduction 155, result has 25.1 percent of original size [2019-11-06 21:17:12,472 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:17:12,473 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:71, output treesize:52 [2019-11-06 21:17:12,887 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 19 treesize of output 1 [2019-11-06 21:17:12,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:17:12,894 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:17:12,895 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-11-06 21:17:12,896 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2019-11-06 21:17:13,533 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (and (= (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base| (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.base| |c_dll_circular_update_at_#in~head.base|) .cse0)))) |c_#memory_$Pointer$.base|) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset))) is different from true [2019-11-06 21:17:13,541 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:17:13,543 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:17:13,553 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:17:13,641 INFO L341 Elim1Store]: treesize reduction 28, result has 65.0 percent of original size [2019-11-06 21:17:13,641 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 58 treesize of output 81 [2019-11-06 21:17:13,643 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:17:13,682 INFO L567 ElimStorePlain]: treesize reduction 72, result has 40.0 percent of original size [2019-11-06 21:17:13,683 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 21:17:13,684 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:67, output treesize:45 [2019-11-06 21:17:14,064 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 25 treesize of output 17 [2019-11-06 21:17:14,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:17:14,078 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:17:14,078 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:17:14,078 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:104, output treesize:96 [2019-11-06 21:17:14,220 INFO L392 ElimStorePlain]: Different costs {2=[|v_old(#memory_$Pointer$.offset)_AFTER_CALL_51|], 12=[|v_#memory_$Pointer$.base_BEFORE_CALL_8|]} [2019-11-06 21:17:14,224 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:17:14,226 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 80 [2019-11-06 21:17:14,226 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:17:14,245 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:17:14,437 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-11-06 21:17:14,437 INFO L341 Elim1Store]: treesize reduction 10, result has 95.4 percent of original size [2019-11-06 21:17:14,438 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 97 treesize of output 260 [2019-11-06 21:17:14,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:17:14,440 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:17:14,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-06 21:17:14,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:17:14,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:17:14,444 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2019-11-06 21:17:14,580 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 34 [2019-11-06 21:17:14,581 INFO L567 ElimStorePlain]: treesize reduction 566, result has 11.0 percent of original size [2019-11-06 21:17:14,582 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:17:14,582 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:139, output treesize:44 [2019-11-06 21:17:15,690 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.offset|, |#memory_int|], 12=[|#memory_$Pointer$.base|]} [2019-11-06 21:17:15,703 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:17:15,704 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 52 treesize of output 52 [2019-11-06 21:17:15,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:17:15,706 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:17:15,707 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-06 21:17:15,736 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:17:15,759 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:17:15,759 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 34 [2019-11-06 21:17:15,760 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:17:15,809 INFO L567 ElimStorePlain]: treesize reduction 24, result has 71.8 percent of original size [2019-11-06 21:17:15,820 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:17:15,822 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-06 21:17:15,857 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:17:15,858 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 71 [2019-11-06 21:17:15,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:17:15,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:17:15,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:17:15,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:17:15,862 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-06 21:17:15,878 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:17:15,880 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:17:15,880 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 7 variables, input treesize:97, output treesize:7 [2019-11-06 21:17:15,980 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2019-11-06 21:17:15,981 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:17:15,981 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 67 [2019-11-06 21:17:15,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759633965] [2019-11-06 21:17:15,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-11-06 21:17:15,982 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:17:15,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-11-06 21:17:15,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=4094, Unknown=1, NotChecked=128, Total=4422 [2019-11-06 21:17:15,983 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 67 states. [2019-11-06 21:17:20,353 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63