./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/list-simple/dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/list-simple/dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 16891def4f6ae6ab6c00fe328146dbdee1a68356 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 19:13:40,899 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 19:13:40,901 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 19:13:40,915 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 19:13:40,916 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 19:13:40,917 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 19:13:40,918 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 19:13:40,920 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 19:13:40,925 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 19:13:40,926 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 19:13:40,927 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 19:13:40,927 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 19:13:40,933 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 19:13:40,934 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 19:13:40,936 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 19:13:40,937 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 19:13:40,938 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 19:13:40,940 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 19:13:40,942 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 19:13:40,944 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 19:13:40,945 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 19:13:40,946 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 19:13:40,949 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 19:13:40,949 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 19:13:40,949 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 19:13:40,950 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 19:13:40,952 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 19:13:40,952 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 19:13:40,954 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 19:13:40,956 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 19:13:40,958 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 19:13:40,959 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 19:13:40,959 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 19:13:40,959 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 19:13:40,960 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 19:13:40,962 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 19:13:40,962 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-01 19:13:40,985 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 19:13:40,985 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 19:13:40,986 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 19:13:40,990 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 19:13:40,990 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 19:13:40,990 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 19:13:40,990 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 19:13:40,991 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 19:13:40,991 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 19:13:40,991 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 19:13:40,991 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 19:13:40,991 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 19:13:40,995 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 19:13:40,995 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 19:13:40,995 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 19:13:40,995 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 19:13:40,995 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 19:13:40,996 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 19:13:40,996 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 19:13:40,996 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 19:13:40,996 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 19:13:40,996 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 19:13:40,997 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 19:13:40,997 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 19:13:40,997 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 19:13:40,997 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 19:13:40,997 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 16891def4f6ae6ab6c00fe328146dbdee1a68356 [2019-01-01 19:13:41,059 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 19:13:41,080 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 19:13:41,084 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 19:13:41,086 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 19:13:41,087 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 19:13:41,087 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-simple/dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2019-01-01 19:13:41,148 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7a2d13fe/328ada1ed3764bd4b17d694af88d716f/FLAGd95f5a52c [2019-01-01 19:13:41,654 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 19:13:41,654 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-simple/dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2019-01-01 19:13:41,671 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7a2d13fe/328ada1ed3764bd4b17d694af88d716f/FLAGd95f5a52c [2019-01-01 19:13:41,971 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7a2d13fe/328ada1ed3764bd4b17d694af88d716f [2019-01-01 19:13:41,975 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 19:13:41,976 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 19:13:41,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 19:13:41,978 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 19:13:41,982 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 19:13:41,983 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 07:13:41" (1/1) ... [2019-01-01 19:13:41,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1145bd84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:13:41, skipping insertion in model container [2019-01-01 19:13:41,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 07:13:41" (1/1) ... [2019-01-01 19:13:42,000 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 19:13:42,054 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 19:13:42,422 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 19:13:42,436 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 19:13:42,572 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 19:13:42,659 INFO L195 MainTranslator]: Completed translation [2019-01-01 19:13:42,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:13:42 WrapperNode [2019-01-01 19:13:42,660 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 19:13:42,661 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 19:13:42,661 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 19:13:42,663 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 19:13:42,679 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:13:42" (1/1) ... [2019-01-01 19:13:42,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:13:42" (1/1) ... [2019-01-01 19:13:42,711 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:13:42" (1/1) ... [2019-01-01 19:13:42,712 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:13:42" (1/1) ... [2019-01-01 19:13:42,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:13:42" (1/1) ... [2019-01-01 19:13:42,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:13:42" (1/1) ... [2019-01-01 19:13:42,768 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:13:42" (1/1) ... [2019-01-01 19:13:42,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 19:13:42,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 19:13:42,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 19:13:42,786 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 19:13:42,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:13:42" (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-01-01 19:13:42,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 19:13:42,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 19:13:42,857 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-01 19:13:42,857 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-01 19:13:42,858 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-01-01 19:13:42,858 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-01-01 19:13:42,858 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-01-01 19:13:42,858 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2019-01-01 19:13:42,858 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_get_data_at [2019-01-01 19:13:42,859 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_update_at [2019-01-01 19:13:42,859 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 19:13:42,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-01 19:13:42,860 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-01 19:13:42,860 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-01 19:13:42,860 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 19:13:42,860 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 19:13:42,860 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 19:13:42,862 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 19:13:42,862 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 19:13:42,863 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 19:13:42,864 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 19:13:42,864 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 19:13:42,864 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 19:13:42,865 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 19:13:42,866 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 19:13:42,866 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 19:13:42,866 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 19:13:42,866 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 19:13:42,866 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 19:13:42,866 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 19:13:42,866 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 19:13:42,867 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 19:13:42,867 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 19:13:42,867 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 19:13:42,867 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 19:13:42,867 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 19:13:42,867 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 19:13:42,869 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 19:13:42,869 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 19:13:42,869 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 19:13:42,871 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 19:13:42,871 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 19:13:42,871 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 19:13:42,871 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 19:13:42,871 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 19:13:42,871 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 19:13:42,872 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 19:13:42,872 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 19:13:42,872 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 19:13:42,872 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 19:13:42,872 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 19:13:42,872 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 19:13:42,872 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 19:13:42,874 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 19:13:42,875 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 19:13:42,875 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 19:13:42,875 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 19:13:42,875 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 19:13:42,875 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 19:13:42,875 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 19:13:42,876 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 19:13:42,878 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 19:13:42,879 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 19:13:42,879 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 19:13:42,879 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 19:13:42,879 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 19:13:42,879 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 19:13:42,879 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 19:13:42,880 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 19:13:42,880 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 19:13:42,880 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 19:13:42,880 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 19:13:42,880 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-01-01 19:13:42,880 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 19:13:42,880 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 19:13:42,883 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-01-01 19:13:42,883 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 19:13:42,883 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 19:13:42,884 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-01-01 19:13:42,884 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 19:13:42,884 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 19:13:42,885 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 19:13:42,885 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 19:13:42,885 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 19:13:42,885 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 19:13:42,885 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 19:13:42,885 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 19:13:42,885 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 19:13:42,886 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 19:13:42,886 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 19:13:42,886 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 19:13:42,886 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 19:13:42,886 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 19:13:42,886 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 19:13:42,886 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 19:13:42,886 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 19:13:42,892 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 19:13:42,892 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 19:13:42,892 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 19:13:42,892 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 19:13:42,892 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 19:13:42,892 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 19:13:42,892 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 19:13:42,893 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 19:13:42,893 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 19:13:42,894 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 19:13:42,894 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 19:13:42,894 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 19:13:42,894 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 19:13:42,894 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 19:13:42,894 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 19:13:42,894 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 19:13:42,894 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 19:13:42,894 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 19:13:42,896 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 19:13:42,896 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 19:13:42,896 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 19:13:42,896 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-01-01 19:13:42,896 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-01-01 19:13:42,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 19:13:42,896 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-01 19:13:42,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 19:13:42,897 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-01-01 19:13:42,899 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2019-01-01 19:13:42,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-01 19:13:42,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 19:13:42,899 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_get_data_at [2019-01-01 19:13:42,899 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 19:13:42,899 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_update_at [2019-01-01 19:13:42,899 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 19:13:42,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 19:13:42,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 19:13:44,034 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 19:13:44,035 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-01 19:13:44,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 07:13:44 BoogieIcfgContainer [2019-01-01 19:13:44,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 19:13:44,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 19:13:44,039 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 19:13:44,042 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 19:13:44,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 07:13:41" (1/3) ... [2019-01-01 19:13:44,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9e3dc1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 07:13:44, skipping insertion in model container [2019-01-01 19:13:44,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:13:42" (2/3) ... [2019-01-01 19:13:44,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9e3dc1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 07:13:44, skipping insertion in model container [2019-01-01 19:13:44,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 07:13:44" (3/3) ... [2019-01-01 19:13:44,053 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2019-01-01 19:13:44,066 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 19:13:44,081 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2019-01-01 19:13:44,104 INFO L257 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2019-01-01 19:13:44,140 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 19:13:44,141 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 19:13:44,141 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 19:13:44,143 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 19:13:44,143 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 19:13:44,143 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 19:13:44,143 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 19:13:44,144 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 19:13:44,144 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 19:13:44,180 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-01-01 19:13:44,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-01 19:13:44,191 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:13:44,192 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:13:44,195 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:13:44,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:13:44,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1471092252, now seen corresponding path program 1 times [2019-01-01 19:13:44,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:13:44,204 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:13:44,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:13:44,258 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:13:44,258 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:13:44,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:13:44,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:13:44,454 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:13:44,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 19:13:44,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 19:13:44,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 19:13:44,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 19:13:44,482 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 3 states. [2019-01-01 19:13:45,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:13:45,013 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2019-01-01 19:13:45,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 19:13:45,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-01 19:13:45,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:13:45,025 INFO L225 Difference]: With dead ends: 110 [2019-01-01 19:13:45,025 INFO L226 Difference]: Without dead ends: 103 [2019-01-01 19:13:45,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 19:13:45,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-01 19:13:45,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-01 19:13:45,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-01 19:13:45,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-01-01 19:13:45,082 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 12 [2019-01-01 19:13:45,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:13:45,083 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-01-01 19:13:45,083 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 19:13:45,083 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-01-01 19:13:45,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-01 19:13:45,084 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:13:45,084 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:13:45,084 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:13:45,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:13:45,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1471092251, now seen corresponding path program 1 times [2019-01-01 19:13:45,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:13:45,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:13:45,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:13:45,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:13:45,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:13:45,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:13:45,369 WARN L181 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-01 19:13:45,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:13:45,372 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:13:45,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 19:13:45,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 19:13:45,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 19:13:45,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 19:13:45,375 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 3 states. [2019-01-01 19:13:45,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:13:45,681 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2019-01-01 19:13:45,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 19:13:45,682 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-01 19:13:45,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:13:45,684 INFO L225 Difference]: With dead ends: 100 [2019-01-01 19:13:45,684 INFO L226 Difference]: Without dead ends: 100 [2019-01-01 19:13:45,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 19:13:45,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-01 19:13:45,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-01 19:13:45,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-01 19:13:45,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-01-01 19:13:45,700 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 12 [2019-01-01 19:13:45,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:13:45,700 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-01-01 19:13:45,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 19:13:45,701 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-01-01 19:13:45,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 19:13:45,702 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:13:45,702 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:13:45,702 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:13:45,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:13:45,703 INFO L82 PathProgramCache]: Analyzing trace with hash 322104282, now seen corresponding path program 1 times [2019-01-01 19:13:45,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:13:45,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:13:45,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:13:45,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:13:45,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:13:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:13:45,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:13:45,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:13:45,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:13:45,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 19:13:45,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 19:13:45,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:13:45,797 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 5 states. [2019-01-01 19:13:45,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:13:45,886 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2019-01-01 19:13:45,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 19:13:45,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-01-01 19:13:45,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:13:45,889 INFO L225 Difference]: With dead ends: 101 [2019-01-01 19:13:45,889 INFO L226 Difference]: Without dead ends: 101 [2019-01-01 19:13:45,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:13:45,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-01 19:13:45,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-01 19:13:45,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-01 19:13:45,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2019-01-01 19:13:45,901 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 20 [2019-01-01 19:13:45,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:13:45,903 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2019-01-01 19:13:45,904 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 19:13:45,904 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2019-01-01 19:13:45,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 19:13:45,905 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:13:45,905 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:13:45,906 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:13:45,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:13:45,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1342193716, now seen corresponding path program 1 times [2019-01-01 19:13:45,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:13:45,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:13:45,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:13:45,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:13:45,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:13:45,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:13:46,120 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:13:46,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:13:46,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:13:46,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:13:46,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:13:46,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:13:46,123 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 6 states. [2019-01-01 19:13:46,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:13:46,484 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2019-01-01 19:13:46,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:13:46,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-01-01 19:13:46,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:13:46,490 INFO L225 Difference]: With dead ends: 101 [2019-01-01 19:13:46,490 INFO L226 Difference]: Without dead ends: 101 [2019-01-01 19:13:46,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:13:46,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-01 19:13:46,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-01-01 19:13:46,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-01 19:13:46,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-01-01 19:13:46,501 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 30 [2019-01-01 19:13:46,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:13:46,501 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-01-01 19:13:46,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:13:46,502 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-01-01 19:13:46,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 19:13:46,503 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:13:46,503 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:13:46,503 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:13:46,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:13:46,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1342193717, now seen corresponding path program 1 times [2019-01-01 19:13:46,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:13:46,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:13:46,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:13:46,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:13:46,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:13:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:13:46,641 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 19:13:46,642 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:13:46,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:13:46,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:13:46,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:13:46,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:13:46,643 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 6 states. [2019-01-01 19:13:46,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:13:46,930 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2019-01-01 19:13:46,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:13:46,931 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-01-01 19:13:46,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:13:46,934 INFO L225 Difference]: With dead ends: 100 [2019-01-01 19:13:46,934 INFO L226 Difference]: Without dead ends: 100 [2019-01-01 19:13:46,935 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:13:46,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-01 19:13:46,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-01-01 19:13:46,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-01 19:13:46,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2019-01-01 19:13:46,944 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 30 [2019-01-01 19:13:46,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:13:46,944 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2019-01-01 19:13:46,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:13:46,944 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2019-01-01 19:13:46,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-01 19:13:46,946 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:13:46,946 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:13:46,946 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:13:46,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:13:46,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1357973588, now seen corresponding path program 1 times [2019-01-01 19:13:46,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:13:46,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:13:46,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:13:46,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:13:46,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:13:46,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:13:47,880 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:13:47,880 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:13:47,881 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:13:47,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:13:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:13:47,971 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:13:49,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2019-01-01 19:13:49,599 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:13:49,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:13:49,612 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-01-01 19:13:49,624 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:13:49,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:13:49,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2019-01-01 19:13:49,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:13:49,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:13:49,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=96, Unknown=4, NotChecked=0, Total=132 [2019-01-01 19:13:49,656 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 12 states. [2019-01-01 19:13:50,565 WARN L181 SmtUtils]: Spent 369.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 19:13:51,056 WARN L181 SmtUtils]: Spent 474.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 19:13:52,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:13:52,577 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2019-01-01 19:13:52,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 19:13:52,578 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-01-01 19:13:52,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:13:52,580 INFO L225 Difference]: With dead ends: 140 [2019-01-01 19:13:52,580 INFO L226 Difference]: Without dead ends: 140 [2019-01-01 19:13:52,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=58, Invalid=178, Unknown=4, NotChecked=0, Total=240 [2019-01-01 19:13:52,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-01 19:13:52,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 104. [2019-01-01 19:13:52,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-01 19:13:52,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2019-01-01 19:13:52,595 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 32 [2019-01-01 19:13:52,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:13:52,596 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2019-01-01 19:13:52,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:13:52,596 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2019-01-01 19:13:52,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-01 19:13:52,597 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:13:52,597 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:13:52,598 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:13:52,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:13:52,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1357973587, now seen corresponding path program 1 times [2019-01-01 19:13:52,600 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:13:52,600 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:13:52,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:13:52,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:13:52,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:13:52,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:13:52,888 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-01-01 19:13:53,102 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:13:53,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:13:53,103 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:13:53,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:13:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:13:53,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:13:53,203 INFO L478 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-01-01 19:13:53,204 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:13:53,244 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:13:53,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-01 19:13:53,642 WARN L860 $PredicateComparison]: unable to prove that (exists ((node_create_~temp~0.base Int)) (= |c_#length| (store |c_old(#length)| node_create_~temp~0.base 12))) is different from true [2019-01-01 19:13:53,654 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 11 [2019-01-01 19:13:53,655 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:13:53,661 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:13:53,661 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-01 19:13:53,674 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2019-01-01 19:13:53,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:13:53,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2019-01-01 19:13:53,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 19:13:53,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 19:13:53,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=56, Unknown=1, NotChecked=14, Total=90 [2019-01-01 19:13:53,706 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand 10 states. [2019-01-01 19:13:54,490 WARN L181 SmtUtils]: Spent 700.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-01-01 19:13:55,301 WARN L181 SmtUtils]: Spent 727.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2019-01-01 19:13:55,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:13:55,844 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2019-01-01 19:13:55,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 19:13:55,845 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-01-01 19:13:55,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:13:55,847 INFO L225 Difference]: With dead ends: 105 [2019-01-01 19:13:55,848 INFO L226 Difference]: Without dead ends: 105 [2019-01-01 19:13:55,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 9 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=39, Invalid=120, Unknown=1, NotChecked=22, Total=182 [2019-01-01 19:13:55,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-01 19:13:55,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-01-01 19:13:55,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-01 19:13:55,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2019-01-01 19:13:55,856 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 32 [2019-01-01 19:13:55,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:13:55,858 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2019-01-01 19:13:55,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 19:13:55,858 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2019-01-01 19:13:55,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-01 19:13:55,859 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:13:55,859 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:13:55,861 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:13:55,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:13:55,862 INFO L82 PathProgramCache]: Analyzing trace with hash 657593987, now seen corresponding path program 1 times [2019-01-01 19:13:55,862 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:13:55,862 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:13:55,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:13:55,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:13:55,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:13:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:13:56,048 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:13:56,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:13:56,049 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:13:56,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:13:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:13:56,108 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:13:56,199 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:13:56,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:13:56,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-01 19:13:56,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:13:56,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:13:56,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:13:56,220 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand 6 states. [2019-01-01 19:13:56,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:13:56,285 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2019-01-01 19:13:56,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:13:56,286 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-01-01 19:13:56,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:13:56,288 INFO L225 Difference]: With dead ends: 105 [2019-01-01 19:13:56,288 INFO L226 Difference]: Without dead ends: 105 [2019-01-01 19:13:56,289 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:13:56,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-01 19:13:56,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-01-01 19:13:56,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-01 19:13:56,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2019-01-01 19:13:56,295 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 34 [2019-01-01 19:13:56,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:13:56,295 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2019-01-01 19:13:56,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:13:56,296 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2019-01-01 19:13:56,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-01 19:13:56,297 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:13:56,297 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:13:56,297 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:13:56,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:13:56,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1094203578, now seen corresponding path program 1 times [2019-01-01 19:13:56,298 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:13:56,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:13:56,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:13:56,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:13:56,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:13:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:13:56,533 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:13:56,533 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:13:56,533 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:13:56,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:13:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:13:56,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:13:56,733 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:13:56,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:13:56,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-01 19:13:56,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 19:13:56,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 19:13:56,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-01 19:13:56,754 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand 9 states. [2019-01-01 19:13:57,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:13:57,109 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2019-01-01 19:13:57,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 19:13:57,111 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-01-01 19:13:57,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:13:57,112 INFO L225 Difference]: With dead ends: 115 [2019-01-01 19:13:57,112 INFO L226 Difference]: Without dead ends: 115 [2019-01-01 19:13:57,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-01 19:13:57,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-01 19:13:57,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 107. [2019-01-01 19:13:57,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-01 19:13:57,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2019-01-01 19:13:57,119 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 35 [2019-01-01 19:13:57,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:13:57,119 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2019-01-01 19:13:57,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 19:13:57,119 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2019-01-01 19:13:57,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-01 19:13:57,130 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:13:57,130 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:13:57,130 INFO L423 AbstractCegarLoop]: === Iteration 10 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:13:57,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:13:57,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1094203579, now seen corresponding path program 1 times [2019-01-01 19:13:57,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:13:57,132 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:13:57,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:13:57,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:13:57,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:13:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:13:57,286 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-01 19:13:57,286 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:13:57,286 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:13:57,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:13:57,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:13:57,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:13:57,358 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-01 19:13:57,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:13:57,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2019-01-01 19:13:57,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 19:13:57,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 19:13:57,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:13:57,380 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand 5 states. [2019-01-01 19:13:58,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:13:58,011 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2019-01-01 19:13:58,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:13:58,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-01-01 19:13:58,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:13:58,015 INFO L225 Difference]: With dead ends: 108 [2019-01-01 19:13:58,015 INFO L226 Difference]: Without dead ends: 108 [2019-01-01 19:13:58,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:13:58,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-01 19:13:58,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-01-01 19:13:58,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-01 19:13:58,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2019-01-01 19:13:58,035 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 35 [2019-01-01 19:13:58,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:13:58,036 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2019-01-01 19:13:58,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 19:13:58,036 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2019-01-01 19:13:58,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-01 19:13:58,042 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:13:58,042 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:13:58,043 INFO L423 AbstractCegarLoop]: === Iteration 11 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:13:58,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:13:58,043 INFO L82 PathProgramCache]: Analyzing trace with hash 439427422, now seen corresponding path program 1 times [2019-01-01 19:13:58,043 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:13:58,043 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:13:58,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:13:58,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:13:58,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:13:58,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:13:58,365 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 19:13:58,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:13:58,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 19:13:58,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 19:13:58,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 19:13:58,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:13:58,366 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand 7 states. [2019-01-01 19:13:58,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:13:58,566 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2019-01-01 19:13:58,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 19:13:58,567 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-01-01 19:13:58,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:13:58,569 INFO L225 Difference]: With dead ends: 107 [2019-01-01 19:13:58,569 INFO L226 Difference]: Without dead ends: 107 [2019-01-01 19:13:58,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-01 19:13:58,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-01 19:13:58,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-01-01 19:13:58,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-01 19:13:58,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2019-01-01 19:13:58,575 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 36 [2019-01-01 19:13:58,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:13:58,575 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2019-01-01 19:13:58,575 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 19:13:58,575 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2019-01-01 19:13:58,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-01 19:13:58,576 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:13:58,576 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:13:58,577 INFO L423 AbstractCegarLoop]: === Iteration 12 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:13:58,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:13:58,577 INFO L82 PathProgramCache]: Analyzing trace with hash 439427423, now seen corresponding path program 1 times [2019-01-01 19:13:58,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:13:58,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:13:58,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:13:58,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:13:58,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:13:58,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:13:58,728 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:13:58,728 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:13:58,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 19:13:58,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 19:13:58,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 19:13:58,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:13:58,729 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 7 states. [2019-01-01 19:13:58,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:13:58,997 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2019-01-01 19:13:58,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 19:13:58,997 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-01-01 19:13:58,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:13:58,998 INFO L225 Difference]: With dead ends: 105 [2019-01-01 19:13:58,999 INFO L226 Difference]: Without dead ends: 105 [2019-01-01 19:13:58,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-01 19:13:58,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-01 19:13:59,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-01 19:13:59,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-01 19:13:59,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2019-01-01 19:13:59,003 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 36 [2019-01-01 19:13:59,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:13:59,003 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2019-01-01 19:13:59,004 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 19:13:59,004 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2019-01-01 19:13:59,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-01 19:13:59,005 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:13:59,005 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:13:59,005 INFO L423 AbstractCegarLoop]: === Iteration 13 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:13:59,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:13:59,006 INFO L82 PathProgramCache]: Analyzing trace with hash -869726790, now seen corresponding path program 1 times [2019-01-01 19:13:59,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:13:59,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:13:59,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:13:59,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:13:59,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:13:59,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:13:59,414 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 19:13:59,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:13:59,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-01 19:13:59,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:13:59,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:13:59,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:13:59,415 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand 12 states. [2019-01-01 19:14:00,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:14:00,071 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2019-01-01 19:14:00,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 19:14:00,072 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-01-01 19:14:00,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:14:00,074 INFO L225 Difference]: With dead ends: 111 [2019-01-01 19:14:00,075 INFO L226 Difference]: Without dead ends: 111 [2019-01-01 19:14:00,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-01 19:14:00,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-01 19:14:00,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2019-01-01 19:14:00,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-01 19:14:00,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2019-01-01 19:14:00,080 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 45 [2019-01-01 19:14:00,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:14:00,081 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2019-01-01 19:14:00,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:14:00,081 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2019-01-01 19:14:00,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-01 19:14:00,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:14:00,082 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:14:00,083 INFO L423 AbstractCegarLoop]: === Iteration 14 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:14:00,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:14:00,083 INFO L82 PathProgramCache]: Analyzing trace with hash -869726789, now seen corresponding path program 1 times [2019-01-01 19:14:00,083 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:14:00,083 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:14:00,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:14:00,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:14:00,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:14:00,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:14:00,340 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-01 19:14:00,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:14:00,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 19:14:00,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:14:00,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:14:00,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:14:00,342 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand 6 states. [2019-01-01 19:14:00,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:14:00,413 INFO L93 Difference]: Finished difference Result 129 states and 145 transitions. [2019-01-01 19:14:00,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 19:14:00,414 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2019-01-01 19:14:00,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:14:00,416 INFO L225 Difference]: With dead ends: 129 [2019-01-01 19:14:00,417 INFO L226 Difference]: Without dead ends: 129 [2019-01-01 19:14:00,417 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-01 19:14:00,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-01 19:14:00,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 120. [2019-01-01 19:14:00,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-01 19:14:00,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 139 transitions. [2019-01-01 19:14:00,422 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 139 transitions. Word has length 45 [2019-01-01 19:14:00,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:14:00,423 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 139 transitions. [2019-01-01 19:14:00,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:14:00,423 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 139 transitions. [2019-01-01 19:14:00,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-01 19:14:00,424 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:14:00,424 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:14:00,425 INFO L423 AbstractCegarLoop]: === Iteration 15 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:14:00,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:14:00,425 INFO L82 PathProgramCache]: Analyzing trace with hash -869726734, now seen corresponding path program 1 times [2019-01-01 19:14:00,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:14:00,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:14:00,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:14:00,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:14:00,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:14:00,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:14:01,257 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:14:01,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:14:01,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-01 19:14:01,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:14:01,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:14:01,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:14:01,259 INFO L87 Difference]: Start difference. First operand 120 states and 139 transitions. Second operand 12 states. [2019-01-01 19:14:01,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:14:01,968 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2019-01-01 19:14:01,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 19:14:01,970 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-01-01 19:14:01,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:14:01,971 INFO L225 Difference]: With dead ends: 124 [2019-01-01 19:14:01,972 INFO L226 Difference]: Without dead ends: 124 [2019-01-01 19:14:01,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-01 19:14:01,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-01 19:14:01,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2019-01-01 19:14:01,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-01 19:14:01,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 136 transitions. [2019-01-01 19:14:01,978 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 136 transitions. Word has length 45 [2019-01-01 19:14:01,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:14:01,978 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 136 transitions. [2019-01-01 19:14:01,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:14:01,978 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 136 transitions. [2019-01-01 19:14:01,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-01 19:14:01,979 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:14:01,979 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:14:01,980 INFO L423 AbstractCegarLoop]: === Iteration 16 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:14:01,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:14:01,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1383731480, now seen corresponding path program 1 times [2019-01-01 19:14:01,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:14:01,980 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:14:01,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:14:01,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:14:01,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:14:01,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:14:02,069 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-01-01 19:14:02,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:14:02,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 19:14:02,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:14:02,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:14:02,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:14:02,070 INFO L87 Difference]: Start difference. First operand 120 states and 136 transitions. Second operand 6 states. [2019-01-01 19:14:02,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:14:02,136 INFO L93 Difference]: Finished difference Result 108 states and 120 transitions. [2019-01-01 19:14:02,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:14:02,137 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-01-01 19:14:02,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:14:02,139 INFO L225 Difference]: With dead ends: 108 [2019-01-01 19:14:02,139 INFO L226 Difference]: Without dead ends: 108 [2019-01-01 19:14:02,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-01-01 19:14:02,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-01 19:14:02,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-01 19:14:02,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-01 19:14:02,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 120 transitions. [2019-01-01 19:14:02,144 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 120 transitions. Word has length 47 [2019-01-01 19:14:02,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:14:02,144 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 120 transitions. [2019-01-01 19:14:02,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:14:02,144 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 120 transitions. [2019-01-01 19:14:02,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-01 19:14:02,145 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:14:02,145 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:14:02,145 INFO L423 AbstractCegarLoop]: === Iteration 17 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:14:02,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:14:02,146 INFO L82 PathProgramCache]: Analyzing trace with hash 1508555054, now seen corresponding path program 1 times [2019-01-01 19:14:02,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:14:02,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:14:02,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:14:02,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:14:02,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:14:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:14:02,929 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:14:02,929 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:14:02,929 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:14:02,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:14:02,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:14:03,004 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:14:03,391 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:03,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:03,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 19:14:03,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:03,412 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:03,412 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:28 [2019-01-01 19:14:03,507 INFO L478 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 11 treesize of output 8 [2019-01-01 19:14:03,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2019-01-01 19:14:03,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:03,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:03,536 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:03,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:39, output treesize:35 [2019-01-01 19:14:03,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-01 19:14:03,611 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2019-01-01 19:14:03,612 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:03,619 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:03,636 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:03,636 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2019-01-01 19:14:03,967 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:03,969 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 49 [2019-01-01 19:14:03,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:03,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 52 [2019-01-01 19:14:03,983 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:03,996 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:04,051 INFO L267 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-01-01 19:14:04,051 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:72, output treesize:62 [2019-01-01 19:14:04,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:04,171 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:04,173 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:04,175 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 89 [2019-01-01 19:14:04,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:04,206 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 96 treesize of output 131 [2019-01-01 19:14:04,210 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:14:04,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:04,297 INFO L267 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-01-01 19:14:04,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:96, output treesize:92 [2019-01-01 19:14:04,820 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:04,821 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:04,822 INFO L478 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 0 case distinctions, treesize of input 87 treesize of output 63 [2019-01-01 19:14:04,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:04,848 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 42 [2019-01-01 19:14:04,850 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:14:04,893 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:04,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2019-01-01 19:14:04,895 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:04,902 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:04,916 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:14:04,917 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:99, output treesize:15 [2019-01-01 19:14:05,038 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:14:05,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:14:05,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 44 [2019-01-01 19:14:05,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-01 19:14:05,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-01 19:14:05,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1849, Unknown=0, NotChecked=0, Total=1980 [2019-01-01 19:14:05,060 INFO L87 Difference]: Start difference. First operand 108 states and 120 transitions. Second operand 45 states. [2019-01-01 19:14:06,262 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 66 [2019-01-01 19:14:06,675 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 59 [2019-01-01 19:14:07,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:14:07,957 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2019-01-01 19:14:07,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-01-01 19:14:07,958 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 48 [2019-01-01 19:14:07,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:14:07,959 INFO L225 Difference]: With dead ends: 137 [2019-01-01 19:14:07,959 INFO L226 Difference]: Without dead ends: 137 [2019-01-01 19:14:07,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 609 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=253, Invalid=2939, Unknown=0, NotChecked=0, Total=3192 [2019-01-01 19:14:07,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-01-01 19:14:07,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 112. [2019-01-01 19:14:07,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-01 19:14:07,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2019-01-01 19:14:07,968 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 48 [2019-01-01 19:14:07,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:14:07,968 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2019-01-01 19:14:07,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-01 19:14:07,969 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2019-01-01 19:14:07,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-01 19:14:07,969 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:14:07,969 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:14:07,971 INFO L423 AbstractCegarLoop]: === Iteration 18 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:14:07,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:14:07,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1508555055, now seen corresponding path program 1 times [2019-01-01 19:14:07,972 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:14:07,972 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:14:07,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:14:07,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:14:07,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:14:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:14:09,043 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:14:09,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:14:09,043 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:14:09,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:14:09,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:14:09,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:14:09,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:09,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 14 treesize of output 17 [2019-01-01 19:14:09,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:09,465 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:09,466 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:09,467 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 19:14:09,468 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:09,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:09,481 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:29 [2019-01-01 19:14:09,631 INFO L478 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 11 treesize of output 8 [2019-01-01 19:14:09,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2019-01-01 19:14:09,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:09,639 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:09,704 INFO L478 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 11 treesize of output 8 [2019-01-01 19:14:09,720 INFO L478 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 8 treesize of output 7 [2019-01-01 19:14:09,721 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:09,746 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:09,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:09,783 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:51, output treesize:43 [2019-01-01 19:14:09,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-01 19:14:09,890 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2019-01-01 19:14:09,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:09,904 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:09,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 32 [2019-01-01 19:14:09,994 INFO L478 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 14 treesize of output 13 [2019-01-01 19:14:09,995 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:10,001 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:10,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:10,023 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:68, output treesize:65 [2019-01-01 19:14:10,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 64 [2019-01-01 19:14:10,201 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:10,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 57 [2019-01-01 19:14:10,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:10,222 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:10,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 54 [2019-01-01 19:14:10,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:10,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2019-01-01 19:14:10,270 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:10,280 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:10,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:10,309 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:111, output treesize:95 [2019-01-01 19:14:10,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:10,442 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 105 [2019-01-01 19:14:10,447 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:10,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 137 [2019-01-01 19:14:10,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:10,475 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:10,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 75 [2019-01-01 19:14:10,530 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:10,531 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 26 treesize of output 43 [2019-01-01 19:14:10,532 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:10,545 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:10,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:14:10,579 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:146, output treesize:152 [2019-01-01 19:14:11,215 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:11,217 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 153 treesize of output 109 [2019-01-01 19:14:11,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:11,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 34 [2019-01-01 19:14:11,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:11,248 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:11,250 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 34 [2019-01-01 19:14:11,251 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:11,272 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:11,298 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2019-01-01 19:14:11,303 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:11,305 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 6 [2019-01-01 19:14:11,306 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:11,319 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:11,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2019-01-01 19:14:11,321 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:11,325 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:11,341 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:14:11,341 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:166, output treesize:23 [2019-01-01 19:14:11,473 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:14:11,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:14:11,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 44 [2019-01-01 19:14:11,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2019-01-01 19:14:11,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2019-01-01 19:14:11,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1862, Unknown=0, NotChecked=0, Total=1980 [2019-01-01 19:14:11,497 INFO L87 Difference]: Start difference. First operand 112 states and 127 transitions. Second operand 45 states. [2019-01-01 19:14:13,328 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2019-01-01 19:14:13,568 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 95 [2019-01-01 19:14:16,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:14:16,171 INFO L93 Difference]: Finished difference Result 138 states and 148 transitions. [2019-01-01 19:14:16,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-01-01 19:14:16,178 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 48 [2019-01-01 19:14:16,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:14:16,179 INFO L225 Difference]: With dead ends: 138 [2019-01-01 19:14:16,179 INFO L226 Difference]: Without dead ends: 138 [2019-01-01 19:14:16,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=258, Invalid=3402, Unknown=0, NotChecked=0, Total=3660 [2019-01-01 19:14:16,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2019-01-01 19:14:16,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 112. [2019-01-01 19:14:16,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-01 19:14:16,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 125 transitions. [2019-01-01 19:14:16,189 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 125 transitions. Word has length 48 [2019-01-01 19:14:16,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:14:16,189 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 125 transitions. [2019-01-01 19:14:16,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2019-01-01 19:14:16,189 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 125 transitions. [2019-01-01 19:14:16,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-01 19:14:16,190 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:14:16,190 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-01 19:14:16,190 INFO L423 AbstractCegarLoop]: === Iteration 19 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:14:16,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:14:16,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1172512454, now seen corresponding path program 2 times [2019-01-01 19:14:16,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:14:16,196 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:14:16,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:14:16,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:14:16,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:14:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:14:16,321 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-01 19:14:16,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:14:16,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 19:14:16,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 19:14:16,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 19:14:16,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:14:16,323 INFO L87 Difference]: Start difference. First operand 112 states and 125 transitions. Second operand 7 states. [2019-01-01 19:14:16,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:14:16,442 INFO L93 Difference]: Finished difference Result 104 states and 110 transitions. [2019-01-01 19:14:16,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 19:14:16,444 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-01-01 19:14:16,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:14:16,446 INFO L225 Difference]: With dead ends: 104 [2019-01-01 19:14:16,446 INFO L226 Difference]: Without dead ends: 104 [2019-01-01 19:14:16,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-01 19:14:16,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-01 19:14:16,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-01 19:14:16,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-01 19:14:16,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 110 transitions. [2019-01-01 19:14:16,451 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 110 transitions. Word has length 51 [2019-01-01 19:14:16,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:14:16,451 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 110 transitions. [2019-01-01 19:14:16,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 19:14:16,451 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 110 transitions. [2019-01-01 19:14:16,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-01 19:14:16,454 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:14:16,454 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:14:16,455 INFO L423 AbstractCegarLoop]: === Iteration 20 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:14:16,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:14:16,455 INFO L82 PathProgramCache]: Analyzing trace with hash 600462658, now seen corresponding path program 1 times [2019-01-01 19:14:16,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:14:16,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:14:16,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:14:16,456 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:14:16,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:14:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:14:16,811 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-01 19:14:16,812 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:14:16,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-01 19:14:16,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:14:16,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:14:16,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:14:16,813 INFO L87 Difference]: Start difference. First operand 104 states and 110 transitions. Second operand 12 states. [2019-01-01 19:14:17,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:14:17,197 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2019-01-01 19:14:17,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 19:14:17,198 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 58 [2019-01-01 19:14:17,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:14:17,200 INFO L225 Difference]: With dead ends: 109 [2019-01-01 19:14:17,200 INFO L226 Difference]: Without dead ends: 109 [2019-01-01 19:14:17,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-01 19:14:17,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-01-01 19:14:17,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2019-01-01 19:14:17,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-01 19:14:17,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 116 transitions. [2019-01-01 19:14:17,205 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 116 transitions. Word has length 58 [2019-01-01 19:14:17,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:14:17,205 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 116 transitions. [2019-01-01 19:14:17,205 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:14:17,205 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 116 transitions. [2019-01-01 19:14:17,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-01-01 19:14:17,206 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:14:17,206 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:14:17,206 INFO L423 AbstractCegarLoop]: === Iteration 21 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:14:17,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:14:17,211 INFO L82 PathProgramCache]: Analyzing trace with hash 600462659, now seen corresponding path program 1 times [2019-01-01 19:14:17,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:14:17,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:14:17,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:14:17,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:14:17,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:14:17,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:14:17,377 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-01 19:14:17,377 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:14:17,377 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:14:17,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:14:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:14:17,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:14:17,445 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-01 19:14:17,469 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:14:17,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-01 19:14:17,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 19:14:17,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 19:14:17,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:14:17,470 INFO L87 Difference]: Start difference. First operand 107 states and 116 transitions. Second operand 5 states. [2019-01-01 19:14:17,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:14:17,533 INFO L93 Difference]: Finished difference Result 114 states and 124 transitions. [2019-01-01 19:14:17,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 19:14:17,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-01-01 19:14:17,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:14:17,536 INFO L225 Difference]: With dead ends: 114 [2019-01-01 19:14:17,536 INFO L226 Difference]: Without dead ends: 114 [2019-01-01 19:14:17,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:14:17,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-01 19:14:17,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-01 19:14:17,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-01 19:14:17,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 124 transitions. [2019-01-01 19:14:17,541 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 124 transitions. Word has length 58 [2019-01-01 19:14:17,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:14:17,541 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 124 transitions. [2019-01-01 19:14:17,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 19:14:17,541 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 124 transitions. [2019-01-01 19:14:17,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-01 19:14:17,542 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:14:17,542 INFO L402 BasicCegarLoop]: trace histogram [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, 1] [2019-01-01 19:14:17,543 INFO L423 AbstractCegarLoop]: === Iteration 22 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:14:17,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:14:17,543 INFO L82 PathProgramCache]: Analyzing trace with hash -878279738, now seen corresponding path program 1 times [2019-01-01 19:14:17,543 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:14:17,543 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:14:17,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:14:17,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:14:17,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:14:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:14:17,680 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-01 19:14:17,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:14:17,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 19:14:17,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 19:14:17,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 19:14:17,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:14:17,681 INFO L87 Difference]: Start difference. First operand 114 states and 124 transitions. Second operand 7 states. [2019-01-01 19:14:17,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:14:17,768 INFO L93 Difference]: Finished difference Result 108 states and 117 transitions. [2019-01-01 19:14:17,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 19:14:17,771 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-01-01 19:14:17,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:14:17,772 INFO L225 Difference]: With dead ends: 108 [2019-01-01 19:14:17,772 INFO L226 Difference]: Without dead ends: 108 [2019-01-01 19:14:17,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-01 19:14:17,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-01 19:14:17,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-01-01 19:14:17,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-01 19:14:17,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 117 transitions. [2019-01-01 19:14:17,776 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 117 transitions. Word has length 59 [2019-01-01 19:14:17,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:14:17,777 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 117 transitions. [2019-01-01 19:14:17,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 19:14:17,777 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 117 transitions. [2019-01-01 19:14:17,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-01 19:14:17,777 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:14:17,780 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2019-01-01 19:14:17,780 INFO L423 AbstractCegarLoop]: === Iteration 23 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:14:17,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:14:17,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1135279415, now seen corresponding path program 2 times [2019-01-01 19:14:17,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:14:17,781 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:14:17,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:14:17,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:14:17,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:14:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:14:18,058 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-01 19:14:18,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:14:18,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 19:14:18,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:14:18,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:14:18,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:14:18,059 INFO L87 Difference]: Start difference. First operand 108 states and 117 transitions. Second operand 6 states. [2019-01-01 19:14:18,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:14:18,139 INFO L93 Difference]: Finished difference Result 122 states and 132 transitions. [2019-01-01 19:14:18,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 19:14:18,141 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-01-01 19:14:18,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:14:18,143 INFO L225 Difference]: With dead ends: 122 [2019-01-01 19:14:18,143 INFO L226 Difference]: Without dead ends: 122 [2019-01-01 19:14:18,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-01-01 19:14:18,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2019-01-01 19:14:18,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 118. [2019-01-01 19:14:18,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-01 19:14:18,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 132 transitions. [2019-01-01 19:14:18,155 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 132 transitions. Word has length 66 [2019-01-01 19:14:18,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:14:18,155 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 132 transitions. [2019-01-01 19:14:18,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:14:18,155 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2019-01-01 19:14:18,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-01 19:14:18,158 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:14:18,158 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2019-01-01 19:14:18,158 INFO L423 AbstractCegarLoop]: === Iteration 24 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:14:18,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:14:18,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1135279470, now seen corresponding path program 1 times [2019-01-01 19:14:18,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:14:18,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:14:18,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:14:18,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:14:18,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:14:18,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:14:18,609 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-01-01 19:14:18,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:14:18,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-01 19:14:18,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:14:18,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:14:18,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:14:18,611 INFO L87 Difference]: Start difference. First operand 118 states and 132 transitions. Second operand 12 states. [2019-01-01 19:14:19,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:14:19,003 INFO L93 Difference]: Finished difference Result 123 states and 134 transitions. [2019-01-01 19:14:19,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 19:14:19,005 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-01-01 19:14:19,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:14:19,006 INFO L225 Difference]: With dead ends: 123 [2019-01-01 19:14:19,007 INFO L226 Difference]: Without dead ends: 123 [2019-01-01 19:14:19,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-01 19:14:19,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-01 19:14:19,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 118. [2019-01-01 19:14:19,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2019-01-01 19:14:19,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2019-01-01 19:14:19,012 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 66 [2019-01-01 19:14:19,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:14:19,013 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2019-01-01 19:14:19,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:14:19,013 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2019-01-01 19:14:19,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-01 19:14:19,013 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:14:19,014 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:14:19,014 INFO L423 AbstractCegarLoop]: === Iteration 25 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:14:19,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:14:19,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1756746546, now seen corresponding path program 1 times [2019-01-01 19:14:19,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:14:19,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:14:19,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:14:19,019 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:14:19,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:14:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:14:19,578 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 8 [2019-01-01 19:14:20,319 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-01 19:14:20,320 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:14:20,320 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:14:20,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:14:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:14:20,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:14:20,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:20,496 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:20,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 19:14:20,497 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:20,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:20,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-01-01 19:14:20,561 INFO L478 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 11 treesize of output 8 [2019-01-01 19:14:20,565 INFO L478 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 8 treesize of output 7 [2019-01-01 19:14:20,566 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:20,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:20,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:20,573 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-01-01 19:14:20,618 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-01 19:14:20,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2019-01-01 19:14:20,637 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:20,641 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:20,648 INFO L267 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-01-01 19:14:20,649 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-01-01 19:14:20,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-01-01 19:14:20,743 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 17 [2019-01-01 19:14:20,743 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:20,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:20,758 INFO L267 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-01-01 19:14:20,758 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-01 19:14:20,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2019-01-01 19:14:20,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:20,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2019-01-01 19:14:20,818 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:20,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:20,833 INFO L267 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-01-01 19:14:20,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2019-01-01 19:14:22,135 WARN L181 SmtUtils]: Spent 932.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 19:14:22,145 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 67 [2019-01-01 19:14:22,158 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2019-01-01 19:14:22,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 19:14:22,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:14:22,204 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:14:22,205 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:78 [2019-01-01 19:14:22,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2019-01-01 19:14:22,291 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:22,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 23 treesize of output 19 [2019-01-01 19:14:22,292 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:14:22,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:14:22,313 INFO L267 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-01-01 19:14:22,314 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:9 [2019-01-01 19:14:33,528 WARN L181 SmtUtils]: Spent 637.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-01 19:14:33,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2019-01-01 19:14:33,541 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:33,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:33,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:33,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 51 [2019-01-01 19:14:33,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:33,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:33,590 INFO L267 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-01-01 19:14:33,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:36 [2019-01-01 19:14:33,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2019-01-01 19:14:33,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:33,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2019-01-01 19:14:33,800 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:33,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:33,811 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:33,811 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2019-01-01 19:14:33,847 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 19:14:33,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:14:33,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 50 [2019-01-01 19:14:33,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-01 19:14:33,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-01 19:14:33,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=2390, Unknown=17, NotChecked=0, Total=2550 [2019-01-01 19:14:33,873 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand 51 states. [2019-01-01 19:14:36,817 WARN L181 SmtUtils]: Spent 820.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-01 19:14:38,821 WARN L181 SmtUtils]: Spent 630.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-01 19:14:41,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:14:41,515 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2019-01-01 19:14:41,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-01 19:14:41,517 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 69 [2019-01-01 19:14:41,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:14:41,519 INFO L225 Difference]: With dead ends: 154 [2019-01-01 19:14:41,519 INFO L226 Difference]: Without dead ends: 154 [2019-01-01 19:14:41,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 42 SyntacticMatches, 10 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1038 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=416, Invalid=5267, Unknown=17, NotChecked=0, Total=5700 [2019-01-01 19:14:41,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-01-01 19:14:41,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 126. [2019-01-01 19:14:41,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-01-01 19:14:41,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 143 transitions. [2019-01-01 19:14:41,527 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 143 transitions. Word has length 69 [2019-01-01 19:14:41,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:14:41,527 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 143 transitions. [2019-01-01 19:14:41,527 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-01 19:14:41,527 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 143 transitions. [2019-01-01 19:14:41,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-01 19:14:41,528 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:14:41,528 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:14:41,528 INFO L423 AbstractCegarLoop]: === Iteration 26 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:14:41,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:14:41,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1756746545, now seen corresponding path program 1 times [2019-01-01 19:14:41,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:14:41,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:14:41,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:14:41,530 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:14:41,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:14:41,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:14:43,081 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-01-01 19:14:43,334 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:14:43,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:14:43,334 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:14:43,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:14:43,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:14:43,416 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:14:43,585 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:43,587 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:43,587 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 19:14:43,588 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:43,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:43,596 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-01-01 19:14:43,757 INFO L478 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 11 treesize of output 8 [2019-01-01 19:14:43,759 INFO L478 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 8 treesize of output 7 [2019-01-01 19:14:43,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:43,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:43,772 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:43,772 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-01-01 19:14:43,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-01 19:14:43,852 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2019-01-01 19:14:43,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:43,859 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:43,864 INFO L267 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-01-01 19:14:43,864 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-01-01 19:14:43,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-01-01 19:14:43,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 17 [2019-01-01 19:14:43,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:44,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:44,011 INFO L267 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-01-01 19:14:44,012 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:28 [2019-01-01 19:14:46,070 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 20 [2019-01-01 19:14:46,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 40 [2019-01-01 19:14:46,113 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:46,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 52 [2019-01-01 19:14:46,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:46,130 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:46,147 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-01 19:14:46,150 INFO L478 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 10 treesize of output 9 [2019-01-01 19:14:46,151 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:46,158 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:46,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:14:46,169 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:63, output treesize:52 [2019-01-01 19:14:48,259 WARN L181 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 23 [2019-01-01 19:14:50,325 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-01-01 19:14:52,392 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-01-01 19:14:54,457 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 23 [2019-01-01 19:14:55,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 123 [2019-01-01 19:14:55,190 INFO L478 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 34 treesize of output 33 [2019-01-01 19:14:55,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:55,212 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:55,243 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 92 [2019-01-01 19:14:55,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 96 [2019-01-01 19:14:55,278 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2019-01-01 19:14:55,325 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-01 19:14:55,395 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 4 xjuncts. [2019-01-01 19:14:55,396 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:154, output treesize:283 [2019-01-01 19:14:55,622 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 59 [2019-01-01 19:14:55,657 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:55,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:55,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 32 treesize of output 32 [2019-01-01 19:14:55,672 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:55,688 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:55,726 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 65 [2019-01-01 19:14:55,731 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:55,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 36 [2019-01-01 19:14:55,735 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:14:55,749 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:14:55,823 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:55,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2019-01-01 19:14:55,829 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:55,830 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 31 treesize of output 23 [2019-01-01 19:14:55,830 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:14:55,841 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 19:14:55,842 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:55,849 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:14:55,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2019-01-01 19:14:55,879 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:55,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 23 treesize of output 19 [2019-01-01 19:14:55,881 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:14:55,888 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:14:55,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-01 19:14:55,938 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:139, output treesize:25 [2019-01-01 19:14:57,024 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_46 Int)) (<= 4 (select |c_#length| v_arrayElimCell_46))) (exists ((dll_circular_update_at_~head.offset Int)) (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_dll_circular_update_at_#in~head.base|) .cse0)))) (= (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base| (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-01-01 19:14:57,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 107 treesize of output 96 [2019-01-01 19:14:57,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:57,046 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:57,048 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:57,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 57 [2019-01-01 19:14:57,052 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:57,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:57,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 102 [2019-01-01 19:14:57,155 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:57,157 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:57,158 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:57,163 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 64 [2019-01-01 19:14:57,163 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:57,191 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:57,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:57,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 88 [2019-01-01 19:14:57,264 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:57,266 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:57,268 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:57,273 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 84 [2019-01-01 19:14:57,274 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:57,298 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:57,350 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 77 [2019-01-01 19:14:57,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:57,357 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:57,359 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:57,362 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:57,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 74 [2019-01-01 19:14:57,368 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:57,392 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:57,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 4 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-01 19:14:57,438 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:219, output treesize:135 [2019-01-01 19:14:57,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 65 [2019-01-01 19:14:57,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:57,738 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2019-01-01 19:14:57,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:57,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:57,790 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 47 treesize of output 37 [2019-01-01 19:14:57,798 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:57,799 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:57,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2019-01-01 19:14:57,801 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:57,815 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:57,844 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2019-01-01 19:14:57,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:57,851 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2019-01-01 19:14:57,852 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:14:57,866 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:14:57,892 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:57,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 53 [2019-01-01 19:14:57,914 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 19:14:57,915 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:57,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:14:57,950 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 18 [2019-01-01 19:14:57,951 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-01 19:14:57,960 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:58,084 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:14:58,084 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 8 variables, input treesize:155, output treesize:13 [2019-01-01 19:14:58,115 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 2 not checked. [2019-01-01 19:14:58,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:14:58,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 53 [2019-01-01 19:14:58,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-01 19:14:58,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-01 19:14:58,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2615, Unknown=1, NotChecked=102, Total=2862 [2019-01-01 19:14:58,155 INFO L87 Difference]: Start difference. First operand 126 states and 143 transitions. Second operand 54 states. [2019-01-01 19:15:03,540 WARN L181 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2019-01-01 19:15:07,700 WARN L181 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-01-01 19:15:15,879 WARN L181 SmtUtils]: Spent 8.09 s on a formula simplification. DAG size of input: 70 DAG size of output: 57 [2019-01-01 19:15:19,977 WARN L181 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-01 19:15:24,105 WARN L181 SmtUtils]: Spent 4.06 s on a formula simplification. DAG size of input: 27 DAG size of output: 25 [2019-01-01 19:15:32,249 WARN L181 SmtUtils]: Spent 6.90 s on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2019-01-01 19:15:33,006 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 63 [2019-01-01 19:15:33,350 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2019-01-01 19:15:36,360 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-01-01 19:15:37,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:15:37,678 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2019-01-01 19:15:37,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-01 19:15:37,680 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 69 [2019-01-01 19:15:37,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:15:37,682 INFO L225 Difference]: With dead ends: 151 [2019-01-01 19:15:37,682 INFO L226 Difference]: Without dead ends: 151 [2019-01-01 19:15:37,685 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 43 SyntacticMatches, 7 SemanticMatches, 78 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 984 ImplicationChecksByTransitivity, 48.3s TimeCoverageRelationStatistics Valid=398, Invalid=5767, Unknown=1, NotChecked=154, Total=6320 [2019-01-01 19:15:37,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-01-01 19:15:37,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 125. [2019-01-01 19:15:37,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2019-01-01 19:15:37,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 140 transitions. [2019-01-01 19:15:37,693 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 140 transitions. Word has length 69 [2019-01-01 19:15:37,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:15:37,693 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 140 transitions. [2019-01-01 19:15:37,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-01 19:15:37,693 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 140 transitions. [2019-01-01 19:15:37,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-01 19:15:37,699 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:15:37,699 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:15:37,700 INFO L423 AbstractCegarLoop]: === Iteration 27 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:15:37,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:15:37,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1756746490, now seen corresponding path program 1 times [2019-01-01 19:15:37,700 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:15:37,700 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:15:37,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:37,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:37,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:37,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:38,082 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-01 19:15:38,082 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:15:38,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-01 19:15:38,083 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 19:15:38,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 19:15:38,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:15:38,084 INFO L87 Difference]: Start difference. First operand 125 states and 140 transitions. Second operand 7 states. [2019-01-01 19:15:38,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:15:38,148 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2019-01-01 19:15:38,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 19:15:38,150 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-01-01 19:15:38,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:15:38,151 INFO L225 Difference]: With dead ends: 111 [2019-01-01 19:15:38,151 INFO L226 Difference]: Without dead ends: 111 [2019-01-01 19:15:38,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-01 19:15:38,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-01 19:15:38,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-01-01 19:15:38,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-01 19:15:38,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2019-01-01 19:15:38,155 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 69 [2019-01-01 19:15:38,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:15:38,155 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2019-01-01 19:15:38,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 19:15:38,159 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2019-01-01 19:15:38,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 19:15:38,163 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:15:38,163 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:15:38,164 INFO L423 AbstractCegarLoop]: === Iteration 28 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:15:38,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:15:38,164 INFO L82 PathProgramCache]: Analyzing trace with hash 493143767, now seen corresponding path program 1 times [2019-01-01 19:15:38,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:15:38,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:15:38,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:38,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:38,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:38,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:38,652 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-01 19:15:38,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:15:38,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-01 19:15:38,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:15:38,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:15:38,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:15:38,653 INFO L87 Difference]: Start difference. First operand 111 states and 116 transitions. Second operand 12 states. [2019-01-01 19:15:39,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:15:39,060 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2019-01-01 19:15:39,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 19:15:39,062 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2019-01-01 19:15:39,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:15:39,064 INFO L225 Difference]: With dead ends: 131 [2019-01-01 19:15:39,064 INFO L226 Difference]: Without dead ends: 131 [2019-01-01 19:15:39,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-01 19:15:39,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-01-01 19:15:39,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 114. [2019-01-01 19:15:39,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-01 19:15:39,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2019-01-01 19:15:39,073 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 91 [2019-01-01 19:15:39,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:15:39,073 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2019-01-01 19:15:39,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:15:39,073 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2019-01-01 19:15:39,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 19:15:39,074 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:15:39,074 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:15:39,075 INFO L423 AbstractCegarLoop]: === Iteration 29 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:15:39,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:15:39,075 INFO L82 PathProgramCache]: Analyzing trace with hash 493143768, now seen corresponding path program 1 times [2019-01-01 19:15:39,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:15:39,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:15:39,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:39,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:39,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:39,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:39,518 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-01 19:15:39,518 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:15:39,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-01 19:15:39,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:15:39,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:15:39,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:15:39,519 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 12 states. [2019-01-01 19:15:41,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:15:41,083 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2019-01-01 19:15:41,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 19:15:41,085 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2019-01-01 19:15:41,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:15:41,087 INFO L225 Difference]: With dead ends: 112 [2019-01-01 19:15:41,087 INFO L226 Difference]: Without dead ends: 112 [2019-01-01 19:15:41,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-01 19:15:41,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-01 19:15:41,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-01-01 19:15:41,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-01 19:15:41,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2019-01-01 19:15:41,091 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 91 [2019-01-01 19:15:41,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:15:41,091 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2019-01-01 19:15:41,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:15:41,092 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2019-01-01 19:15:41,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-01 19:15:41,092 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:15:41,092 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:15:41,093 INFO L423 AbstractCegarLoop]: === Iteration 30 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:15:41,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:15:41,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1837028533, now seen corresponding path program 1 times [2019-01-01 19:15:41,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:15:41,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:15:41,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:41,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:41,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:41,486 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-01 19:15:41,487 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:15:41,487 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:15:41,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:41,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:41,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:15:41,799 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2019-01-01 19:15:41,801 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2019-01-01 19:15:41,802 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:15:41,805 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:15:41,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:15:41,807 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-01-01 19:15:41,816 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-01-01 19:15:41,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:15:41,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 11 [2019-01-01 19:15:41,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:15:41,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:15:41,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:15:41,837 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 12 states. [2019-01-01 19:15:42,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:15:42,314 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2019-01-01 19:15:42,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 19:15:42,316 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2019-01-01 19:15:42,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:15:42,318 INFO L225 Difference]: With dead ends: 129 [2019-01-01 19:15:42,318 INFO L226 Difference]: Without dead ends: 129 [2019-01-01 19:15:42,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 91 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2019-01-01 19:15:42,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-01 19:15:42,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 112. [2019-01-01 19:15:42,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-01 19:15:42,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 120 transitions. [2019-01-01 19:15:42,322 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 120 transitions. Word has length 94 [2019-01-01 19:15:42,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:15:42,322 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 120 transitions. [2019-01-01 19:15:42,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:15:42,322 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 120 transitions. [2019-01-01 19:15:42,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-01 19:15:42,323 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:15:42,323 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:15:42,325 INFO L423 AbstractCegarLoop]: === Iteration 31 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:15:42,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:15:42,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1837028532, now seen corresponding path program 1 times [2019-01-01 19:15:42,325 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:15:42,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:15:42,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:42,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:42,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:42,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:43,521 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-01 19:15:43,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:15:43,522 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:15:43,534 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:43,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:43,613 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:15:44,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:15:44,412 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:15:44,413 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 19:15:44,413 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:15:44,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:15:44,423 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-01-01 19:15:44,507 INFO L478 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 11 treesize of output 8 [2019-01-01 19:15:44,528 INFO L478 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 8 treesize of output 7 [2019-01-01 19:15:44,528 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:15:44,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:15:44,547 INFO L478 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 11 treesize of output 8 [2019-01-01 19:15:44,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2019-01-01 19:15:44,554 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:15:44,557 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:15:44,567 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:15:44,568 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2019-01-01 19:15:44,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2019-01-01 19:15:44,630 INFO L478 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 12 treesize of output 11 [2019-01-01 19:15:44,630 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:15:44,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:15:44,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2019-01-01 19:15:44,664 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2019-01-01 19:15:44,665 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:15:44,675 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:15:44,689 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:15:44,690 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2019-01-01 19:15:44,807 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 47 [2019-01-01 19:15:44,814 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 29 treesize of output 26 [2019-01-01 19:15:44,815 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:15:44,832 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:15:44,860 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 44 [2019-01-01 19:15:44,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 18 treesize of output 26 [2019-01-01 19:15:44,868 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:15:44,883 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:15:44,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:15:44,906 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:78, output treesize:62 [2019-01-01 19:15:45,036 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:15:45,038 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 80 [2019-01-01 19:15:45,047 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:15:45,048 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 99 [2019-01-01 19:15:45,049 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:15:45,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:15:45,107 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:15:45,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 69 [2019-01-01 19:15:45,128 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:15:45,131 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 24 treesize of output 39 [2019-01-01 19:15:45,131 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:15:45,149 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:15:45,173 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:15:45,174 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:101, output treesize:109 [2019-01-01 19:15:46,422 WARN L860 $PredicateComparison]: unable to prove that (exists ((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_$Pointer$.offset)| .cse0 (let ((.cse1 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.offset)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))))) |c_#memory_$Pointer$.offset|)) is different from true [2019-01-01 19:15:46,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:15:46,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:15:46,431 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 94 [2019-01-01 19:15:46,458 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 70 [2019-01-01 19:15:46,463 INFO L267 ElimStorePlain]: Start of recursive call 3: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2019-01-01 19:15:47,455 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 52 [2019-01-01 19:15:47,456 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:15:47,589 INFO L303 Elim1Store]: Index analysis took 132 ms [2019-01-01 19:15:47,650 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 72 treesize of output 72 [2019-01-01 19:15:47,652 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-01 19:15:47,675 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 76 treesize of output 76 [2019-01-01 19:15:47,676 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-01-01 19:15:47,709 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 68 [2019-01-01 19:15:47,711 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-01-01 19:15:47,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 4 xjuncts. [2019-01-01 19:15:48,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2019-01-01 19:15:48,043 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 35 [2019-01-01 19:15:48,045 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2019-01-01 19:15:48,081 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-01 19:15:48,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2019-01-01 19:15:48,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 35 [2019-01-01 19:15:48,118 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2019-01-01 19:15:48,157 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-01 19:15:48,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2019-01-01 19:15:48,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 35 [2019-01-01 19:15:48,218 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2019-01-01 19:15:48,254 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-01 19:15:48,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 49 [2019-01-01 19:15:48,290 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 35 [2019-01-01 19:15:48,290 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 4 xjuncts. [2019-01-01 19:15:48,330 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-01 19:15:48,579 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 12 dim-0 vars, and 13 xjuncts. [2019-01-01 19:15:48,579 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 4 variables, input treesize:132, output treesize:343 [2019-01-01 19:15:49,493 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base| (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_dll_circular_update_at_#in~head.base|) .cse0))))) (<= |c_dll_circular_update_at_#in~head.offset| dll_circular_update_at_~head.offset))) is different from true [2019-01-01 19:15:49,505 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2019-01-01 19:15:49,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:15:49,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 22 treesize of output 14 [2019-01-01 19:15:49,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:15:49,528 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:15:49,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2019-01-01 19:15:49,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:15:49,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:15:49,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 31 [2019-01-01 19:15:49,611 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:15:49,627 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:15:49,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 33 [2019-01-01 19:15:49,708 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:15:49,710 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:15:49,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2019-01-01 19:15:49,715 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:15:49,729 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:15:49,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-01 19:15:49,762 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:133, output treesize:67 [2019-01-01 19:15:51,123 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 40 [2019-01-01 19:15:52,278 WARN L181 SmtUtils]: Spent 958.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-01-01 19:15:52,782 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 42 [2019-01-01 19:15:52,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-01 19:15:52,785 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:15:52,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 15 [2019-01-01 19:15:52,796 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:15:52,802 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:15:52,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2019-01-01 19:15:52,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2019-01-01 19:15:52,840 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 19:15:52,846 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:15:52,879 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 26 treesize of output 22 [2019-01-01 19:15:52,882 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-01-01 19:15:52,882 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-01 19:15:52,888 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:15:52,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 25 [2019-01-01 19:15:52,924 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 11 [2019-01-01 19:15:52,924 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-01 19:15:52,928 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:15:52,948 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:15:52,949 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 11 variables, input treesize:145, output treesize:11 [2019-01-01 19:15:53,015 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 21 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2019-01-01 19:15:53,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:15:53,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 40] total 65 [2019-01-01 19:15:53,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-01 19:15:53,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-01 19:15:53,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=3815, Unknown=6, NotChecked=250, Total=4290 [2019-01-01 19:15:53,036 INFO L87 Difference]: Start difference. First operand 112 states and 120 transitions. Second operand 66 states. [2019-01-01 19:15:54,356 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2019-01-01 19:15:54,882 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 72 [2019-01-01 19:15:57,468 WARN L181 SmtUtils]: Spent 1.72 s on a formula simplification. DAG size of input: 26 DAG size of output: 21 [2019-01-01 19:15:58,949 WARN L181 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 30 DAG size of output: 20 [2019-01-01 19:15:59,548 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-01-01 19:15:59,950 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 64 [2019-01-01 19:16:00,592 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 77 [2019-01-01 19:16:00,983 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 81 [2019-01-01 19:16:01,268 WARN L181 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 76 [2019-01-01 19:16:02,212 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-01-01 19:16:02,483 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-01-01 19:16:03,055 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-01 19:16:03,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:16:03,706 INFO L93 Difference]: Finished difference Result 126 states and 132 transitions. [2019-01-01 19:16:03,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-01 19:16:03,708 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 94 [2019-01-01 19:16:03,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:16:03,710 INFO L225 Difference]: With dead ends: 126 [2019-01-01 19:16:03,710 INFO L226 Difference]: Without dead ends: 126 [2019-01-01 19:16:03,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 64 SyntacticMatches, 10 SemanticMatches, 93 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2115 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=621, Invalid=7937, Unknown=6, NotChecked=366, Total=8930 [2019-01-01 19:16:03,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-01-01 19:16:03,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 114. [2019-01-01 19:16:03,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-01 19:16:03,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2019-01-01 19:16:03,719 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 94 [2019-01-01 19:16:03,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:16:03,722 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2019-01-01 19:16:03,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-01 19:16:03,722 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2019-01-01 19:16:03,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-01 19:16:03,722 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:16:03,723 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:16:03,723 INFO L423 AbstractCegarLoop]: === Iteration 32 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:16:03,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:16:03,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1804537762, now seen corresponding path program 1 times [2019-01-01 19:16:03,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:16:03,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:16:03,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:16:03,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:16:03,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:16:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:16:04,449 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-01 19:16:04,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:16:04,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-01 19:16:04,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:16:04,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:16:04,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:16:04,451 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 12 states. [2019-01-01 19:16:04,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:16:04,665 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2019-01-01 19:16:04,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 19:16:04,669 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2019-01-01 19:16:04,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:16:04,670 INFO L225 Difference]: With dead ends: 116 [2019-01-01 19:16:04,670 INFO L226 Difference]: Without dead ends: 114 [2019-01-01 19:16:04,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-01 19:16:04,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-01 19:16:04,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-01 19:16:04,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-01 19:16:04,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2019-01-01 19:16:04,678 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 94 [2019-01-01 19:16:04,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:16:04,678 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2019-01-01 19:16:04,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:16:04,679 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2019-01-01 19:16:04,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-01 19:16:04,679 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:16:04,679 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:16:04,680 INFO L423 AbstractCegarLoop]: === Iteration 33 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:16:04,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:16:04,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1113311010, now seen corresponding path program 1 times [2019-01-01 19:16:04,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:16:04,680 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:16:04,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:16:04,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:16:04,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:16:04,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:16:05,525 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-01-01 19:16:05,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:16:05,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-01 19:16:05,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:16:05,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:16:05,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:16:05,526 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand 12 states. [2019-01-01 19:16:05,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:16:05,904 INFO L93 Difference]: Finished difference Result 113 states and 118 transitions. [2019-01-01 19:16:05,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 19:16:05,906 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 95 [2019-01-01 19:16:05,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:16:05,908 INFO L225 Difference]: With dead ends: 113 [2019-01-01 19:16:05,908 INFO L226 Difference]: Without dead ends: 113 [2019-01-01 19:16:05,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-01 19:16:05,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-01 19:16:05,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-01 19:16:05,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-01 19:16:05,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 118 transitions. [2019-01-01 19:16:05,912 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 118 transitions. Word has length 95 [2019-01-01 19:16:05,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:16:05,912 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 118 transitions. [2019-01-01 19:16:05,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:16:05,912 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 118 transitions. [2019-01-01 19:16:05,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-01 19:16:05,913 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:16:05,913 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:16:05,914 INFO L423 AbstractCegarLoop]: === Iteration 34 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:16:05,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:16:05,914 INFO L82 PathProgramCache]: Analyzing trace with hash -443599901, now seen corresponding path program 1 times [2019-01-01 19:16:05,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:16:05,914 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:16:05,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:16:05,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:16:05,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:16:05,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:16:06,930 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-01 19:16:06,930 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:16:06,930 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:16:06,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:16:07,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:16:07,020 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:16:07,118 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2019-01-01 19:16:07,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:07,123 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:07,124 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-01-01 19:16:07,256 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:16:07,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:16:07,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 19:16:07,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:07,264 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:07,265 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2019-01-01 19:16:07,336 INFO L478 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 11 treesize of output 8 [2019-01-01 19:16:07,363 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2019-01-01 19:16:07,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:07,389 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:07,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:07,464 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-01-01 19:16:07,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-01 19:16:07,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2019-01-01 19:16:07,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:07,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:07,536 INFO L267 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-01-01 19:16:07,536 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2019-01-01 19:16:07,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-01-01 19:16:07,657 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 17 [2019-01-01 19:16:07,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:07,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:07,678 INFO L267 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-01-01 19:16:07,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2019-01-01 19:16:07,736 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 40 [2019-01-01 19:16:07,742 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:16:07,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 50 [2019-01-01 19:16:07,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:07,756 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:07,767 INFO L267 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-01-01 19:16:07,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:44 [2019-01-01 19:16:08,010 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 37 [2019-01-01 19:16:08,014 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-01 19:16:08,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:08,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:16:08,026 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 23 treesize of output 19 [2019-01-01 19:16:08,026 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:08,029 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:08,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:08,032 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:47, output treesize:3 [2019-01-01 19:16:08,808 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (= |c_#memory_$Pointer$.base| (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_$Pointer$.base)| .cse0 (let ((.cse1 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))))))) is different from true [2019-01-01 19:16:08,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 67 [2019-01-01 19:16:08,835 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2019-01-01 19:16:08,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 19:16:08,858 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:16:08,884 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:16:08,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:78 [2019-01-01 19:16:08,963 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2019-01-01 19:16:08,966 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:16:08,968 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 23 treesize of output 19 [2019-01-01 19:16:08,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:08,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:08,974 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:08,974 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:3 [2019-01-01 19:16:09,593 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-01-01 19:16:09,598 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2019-01-01 19:16:09,602 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:16:09,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:16:09,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:16:09,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 51 [2019-01-01 19:16:09,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:09,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:09,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:09,634 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:31 [2019-01-01 19:16:10,226 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2019-01-01 19:16:10,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:16:10,231 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 28 treesize of output 22 [2019-01-01 19:16:10,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 19:16:10,247 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:16:10,280 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:10,281 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2019-01-01 19:16:10,312 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 1 proven. 17 refuted. 0 times theorem prover too weak. 16 trivial. 2 not checked. [2019-01-01 19:16:10,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:16:10,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 33] total 53 [2019-01-01 19:16:10,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-01 19:16:10,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-01 19:16:10,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2507, Unknown=2, NotChecked=202, Total=2862 [2019-01-01 19:16:10,335 INFO L87 Difference]: Start difference. First operand 113 states and 118 transitions. Second operand 54 states. [2019-01-01 19:16:17,557 WARN L181 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2019-01-01 19:16:20,316 WARN L181 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 35 DAG size of output: 20 [2019-01-01 19:16:22,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:16:22,171 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2019-01-01 19:16:22,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-01 19:16:22,174 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 97 [2019-01-01 19:16:22,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:16:22,175 INFO L225 Difference]: With dead ends: 121 [2019-01-01 19:16:22,175 INFO L226 Difference]: Without dead ends: 121 [2019-01-01 19:16:22,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 69 SyntacticMatches, 12 SemanticMatches, 81 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1271 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=448, Invalid=6037, Unknown=3, NotChecked=318, Total=6806 [2019-01-01 19:16:22,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-01-01 19:16:22,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 114. [2019-01-01 19:16:22,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-01 19:16:22,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2019-01-01 19:16:22,187 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 97 [2019-01-01 19:16:22,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:16:22,188 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2019-01-01 19:16:22,188 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-01 19:16:22,188 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2019-01-01 19:16:22,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-01 19:16:22,191 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:16:22,191 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:16:22,192 INFO L423 AbstractCegarLoop]: === Iteration 35 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:16:22,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:16:22,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1064083314, now seen corresponding path program 1 times [2019-01-01 19:16:22,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:16:22,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:16:22,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:16:22,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:16:22,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:16:22,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:16:23,379 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 13 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-01-01 19:16:23,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:16:23,380 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:16:23,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:16:23,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:16:23,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:16:23,919 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:16:23,927 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:16:23,927 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 19:16:23,928 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:23,938 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:23,938 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-01-01 19:16:24,001 INFO L478 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 11 treesize of output 8 [2019-01-01 19:16:24,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 8 treesize of output 7 [2019-01-01 19:16:24,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:24,005 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:24,010 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:24,010 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-01-01 19:16:24,054 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-01 19:16:24,058 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2019-01-01 19:16:24,059 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:24,063 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:24,072 INFO L267 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-01-01 19:16:24,072 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2019-01-01 19:16:24,165 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-01-01 19:16:24,169 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 17 [2019-01-01 19:16:24,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:24,176 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:24,184 INFO L267 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-01-01 19:16:24,185 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:31 [2019-01-01 19:16:24,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2019-01-01 19:16:24,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:16:24,230 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 41 [2019-01-01 19:16:24,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:24,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:24,247 INFO L267 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-01-01 19:16:24,247 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2019-01-01 19:16:25,555 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (= |c_#memory_$Pointer$.base| (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_$Pointer$.base)| .cse0 (let ((.cse1 (+ dll_circular_update_at_~head.offset 8))) (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1))))))) is different from true [2019-01-01 19:16:25,584 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:16:25,585 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:16:25,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 73 [2019-01-01 19:16:25,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 45 [2019-01-01 19:16:25,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 19:16:25,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:16:25,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:16:25,647 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:60 [2019-01-01 19:16:26,382 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-01-01 19:16:26,387 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2019-01-01 19:16:26,390 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:16:26,392 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:16:26,395 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2019-01-01 19:16:26,395 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:26,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:26,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:26,408 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:45, output treesize:23 [2019-01-01 19:16:38,928 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 2 not checked. [2019-01-01 19:16:38,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:16:38,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 34] total 56 [2019-01-01 19:16:38,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2019-01-01 19:16:38,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2019-01-01 19:16:38,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=2691, Unknown=2, NotChecked=210, Total=3080 [2019-01-01 19:16:38,950 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 56 states. [2019-01-01 19:16:56,668 WARN L181 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-01 19:17:02,664 WARN L181 SmtUtils]: Spent 1.81 s on a formula simplification. DAG size of input: 29 DAG size of output: 20 [2019-01-01 19:17:11,240 WARN L181 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 32 DAG size of output: 20 [2019-01-01 19:17:14,638 WARN L181 SmtUtils]: Spent 545.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 35 [2019-01-01 19:17:15,312 WARN L181 SmtUtils]: Spent 527.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 32 [2019-01-01 19:17:15,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:17:15,724 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2019-01-01 19:17:15,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-01-01 19:17:15,727 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 100 [2019-01-01 19:17:15,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:17:15,729 INFO L225 Difference]: With dead ends: 117 [2019-01-01 19:17:15,729 INFO L226 Difference]: Without dead ends: 112 [2019-01-01 19:17:15,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 71 SyntacticMatches, 12 SemanticMatches, 76 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1434 ImplicationChecksByTransitivity, 26.8s TimeCoverageRelationStatistics Valid=434, Invalid=5269, Unknown=5, NotChecked=298, Total=6006 [2019-01-01 19:17:15,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-01 19:17:15,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-01-01 19:17:15,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-01 19:17:15,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 115 transitions. [2019-01-01 19:17:15,739 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 115 transitions. Word has length 100 [2019-01-01 19:17:15,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:17:15,740 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 115 transitions. [2019-01-01 19:17:15,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2019-01-01 19:17:15,740 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2019-01-01 19:17:15,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-01 19:17:15,741 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:17:15,741 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:17:15,741 INFO L423 AbstractCegarLoop]: === Iteration 36 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:17:15,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:17:15,745 INFO L82 PathProgramCache]: Analyzing trace with hash 329925328, now seen corresponding path program 1 times [2019-01-01 19:17:15,745 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:17:15,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:17:15,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:17:15,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:17:15,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:17:15,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:17:17,739 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-01 19:17:17,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:17:17,740 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:17:17,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:17:17,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:17:17,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:17:17,973 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:17,975 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:17,976 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 19:17:17,976 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:17,985 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:17,985 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:17 [2019-01-01 19:17:18,013 INFO L478 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 11 treesize of output 8 [2019-01-01 19:17:18,016 INFO L478 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 8 treesize of output 7 [2019-01-01 19:17:18,016 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:18,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:18,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:18,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-01-01 19:17:18,098 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-01 19:17:18,102 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2019-01-01 19:17:18,102 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:18,109 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:18,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:18,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2019-01-01 19:17:18,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:18,249 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 40 [2019-01-01 19:17:18,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:18,255 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 41 [2019-01-01 19:17:18,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:18,269 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:18,453 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 12 [2019-01-01 19:17:18,456 INFO L478 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 12 treesize of output 11 [2019-01-01 19:17:18,457 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:18,462 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:18,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:18,479 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:51 [2019-01-01 19:17:18,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:18,556 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:18,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:18,563 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 76 [2019-01-01 19:17:18,570 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:18,584 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 114 [2019-01-01 19:17:18,586 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:17:18,621 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:18,642 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:18,649 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 32 [2019-01-01 19:17:18,658 INFO L478 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 10 treesize of output 9 [2019-01-01 19:17:18,658 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:18,666 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:18,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:18,685 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:73 [2019-01-01 19:17:20,530 WARN L860 $PredicateComparison]: unable to prove that (exists ((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|)) (.cse1 (+ dll_circular_update_at_~head.offset 8))) (and (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse0 (store (select |c_old(#memory_$Pointer$.base)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.base| .cse0) .cse1)))) (= (store |c_old(#memory_$Pointer$.offset)| .cse0 (store (select |c_old(#memory_$Pointer$.offset)| .cse0) .cse1 (select (select |c_#memory_$Pointer$.offset| .cse0) .cse1))) |c_#memory_$Pointer$.offset|) (<= (select (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base|) |c_dll_circular_update_at_#in~head.offset|) dll_circular_update_at_~head.offset)))) is different from true [2019-01-01 19:17:20,537 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:20,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:20,540 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:17:20,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:20,545 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:20,551 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 119 treesize of output 145 [2019-01-01 19:17:20,615 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 62 treesize of output 111 [2019-01-01 19:17:20,621 INFO L267 ElimStorePlain]: Start of recursive call 3: 8 dim-0 vars, End of recursive call: 8 dim-0 vars, and 14 xjuncts. [2019-01-01 19:17:20,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2019-01-01 19:17:20,811 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:20,813 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:20,814 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:17:20,816 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:20,819 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:20,823 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 125 [2019-01-01 19:17:20,830 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:20,849 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 55 [2019-01-01 19:17:20,850 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:17:21,025 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:21,028 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:21,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:21,032 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:17:21,035 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:21,042 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 104 [2019-01-01 19:17:21,054 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:17:21,073 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 43 [2019-01-01 19:17:21,077 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-01 19:17:21,125 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:21,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:21,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:21,133 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:17:21,142 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 112 [2019-01-01 19:17:21,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 17 [2019-01-01 19:17:21,157 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2019-01-01 19:17:21,184 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:17:21,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 19:17:21,257 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:136, output treesize:167 [2019-01-01 19:17:22,501 WARN L860 $PredicateComparison]: unable to prove that (exists ((dll_circular_update_at_~head.offset Int)) (let ((.cse0 (+ dll_circular_update_at_~head.offset 8))) (and (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base| (store (select |c_old(#memory_$Pointer$.offset)| |c_dll_circular_update_at_#in~head.base|) .cse0 (select (select |c_#memory_$Pointer$.offset| |c_dll_circular_update_at_#in~head.base|) .cse0)))) (= (store |c_old(#memory_$Pointer$.base)| |c_dll_circular_update_at_#in~head.base| (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-01-01 19:17:22,509 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:22,512 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:22,519 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:22,521 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 126 [2019-01-01 19:17:22,528 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:22,531 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:22,538 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:22,546 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:22,574 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 82 [2019-01-01 19:17:22,575 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:17:22,656 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:22,838 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:22,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:22,846 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:22,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 96 [2019-01-01 19:17:22,856 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:22,859 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:22,863 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:22,890 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 95 [2019-01-01 19:17:22,892 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:17:22,965 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:23,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:23,092 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:23,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 106 [2019-01-01 19:17:23,101 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:23,103 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:23,109 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:23,133 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 66 treesize of output 84 [2019-01-01 19:17:23,135 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:17:23,181 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:23,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:23,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:23,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:23,293 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 119 [2019-01-01 19:17:23,300 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:23,309 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:23,334 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 90 treesize of output 117 [2019-01-01 19:17:23,336 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:17:23,395 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:23,483 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:23,489 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 88 [2019-01-01 19:17:23,493 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:23,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 22 treesize of output 14 [2019-01-01 19:17:23,497 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:23,519 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:23,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 65 [2019-01-01 19:17:23,603 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:23,606 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:23,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:23,611 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:23,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 45 [2019-01-01 19:17:23,615 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:23,641 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:23,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 6 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 19:17:23,705 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 9 variables, input treesize:290, output treesize:167 [2019-01-01 19:17:25,336 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-01 19:17:25,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:25,426 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:25,427 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:25,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 62 [2019-01-01 19:17:25,451 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 51 [2019-01-01 19:17:25,454 INFO L267 ElimStorePlain]: Start of recursive call 4: 7 dim-0 vars, End of recursive call: 7 dim-0 vars, and 4 xjuncts. [2019-01-01 19:17:25,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:25,551 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 63 [2019-01-01 19:17:25,554 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 8 xjuncts. [2019-01-01 19:17:25,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 44 treesize of output 59 [2019-01-01 19:17:25,588 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 8 xjuncts. [2019-01-01 19:17:25,629 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 63 [2019-01-01 19:17:25,632 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 8 xjuncts. [2019-01-01 19:17:25,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 35 [2019-01-01 19:17:25,649 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2019-01-01 19:17:25,951 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: 11 dim-0 vars, and 11 xjuncts. [2019-01-01 19:17:26,110 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:26,112 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:26,114 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2019-01-01 19:17:26,133 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2019-01-01 19:17:26,136 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-01-01 19:17:26,160 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:26,163 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:26,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2019-01-01 19:17:26,164 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:26,176 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:26,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2019-01-01 19:17:26,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:26,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 11 [2019-01-01 19:17:26,189 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:26,208 INFO L478 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 19:17:26,209 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2019-01-01 19:17:26,220 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:17:26,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:26,226 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:26,228 INFO L478 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 0 case distinctions, treesize of input 37 treesize of output 37 [2019-01-01 19:17:26,249 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2019-01-01 19:17:26,251 INFO L267 ElimStorePlain]: Start of recursive call 16: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-01-01 19:17:26,267 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:26,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:26,271 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2019-01-01 19:17:26,272 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:26,280 INFO L267 ElimStorePlain]: Start of recursive call 15: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:26,283 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:26,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:26,288 INFO L478 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 0 case distinctions, treesize of input 37 treesize of output 37 [2019-01-01 19:17:26,311 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2019-01-01 19:17:26,313 INFO L267 ElimStorePlain]: Start of recursive call 19: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-01-01 19:17:26,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:26,336 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:26,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2019-01-01 19:17:26,339 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:26,349 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:26,353 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:26,356 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:26,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2019-01-01 19:17:26,363 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:26,367 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:26,382 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 37 [2019-01-01 19:17:26,384 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:17:26,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 19:17:26,402 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:26,411 INFO L267 ElimStorePlain]: Start of recursive call 21: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:26,416 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:26,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:26,421 INFO L478 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 0 case distinctions, treesize of input 37 treesize of output 37 [2019-01-01 19:17:26,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:26,432 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:26,447 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 37 [2019-01-01 19:17:26,449 INFO L267 ElimStorePlain]: Start of recursive call 25: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:17:26,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 19:17:26,466 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:26,473 INFO L267 ElimStorePlain]: Start of recursive call 24: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:26,477 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:26,479 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:26,481 INFO L478 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 0 case distinctions, treesize of input 37 treesize of output 37 [2019-01-01 19:17:26,490 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:26,494 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:26,508 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 37 [2019-01-01 19:17:26,510 INFO L267 ElimStorePlain]: Start of recursive call 28: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:17:26,527 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 19:17:26,527 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:26,535 INFO L267 ElimStorePlain]: Start of recursive call 27: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:26,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2019-01-01 19:17:26,548 INFO L478 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 19:17:26,548 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2019-01-01 19:17:26,566 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:26,569 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 11 [2019-01-01 19:17:26,570 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:26,580 INFO L267 ElimStorePlain]: Start of recursive call 30: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:17:26,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2019-01-01 19:17:26,594 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:26,596 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 11 [2019-01-01 19:17:26,597 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:26,617 INFO L478 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 19:17:26,617 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2019-01-01 19:17:26,630 INFO L267 ElimStorePlain]: Start of recursive call 33: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:17:26,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2019-01-01 19:17:26,644 INFO L478 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 19:17:26,644 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 2 xjuncts. [2019-01-01 19:17:26,664 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:26,667 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 11 [2019-01-01 19:17:26,668 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:26,680 INFO L267 ElimStorePlain]: Start of recursive call 36: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:17:26,685 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:26,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:26,689 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2019-01-01 19:17:26,708 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 27 [2019-01-01 19:17:26,711 INFO L267 ElimStorePlain]: Start of recursive call 40: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts. [2019-01-01 19:17:26,733 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:26,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:26,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2019-01-01 19:17:26,738 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:26,748 INFO L267 ElimStorePlain]: Start of recursive call 39: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:27,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-01-01 19:17:27,028 INFO L202 ElimStorePlain]: Needed 41 recursive calls to eliminate 6 variables, input treesize:263, output treesize:43 [2019-01-01 19:17:27,481 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 18 trivial. 2 not checked. [2019-01-01 19:17:27,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:17:27,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38] total 62 [2019-01-01 19:17:27,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2019-01-01 19:17:27,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2019-01-01 19:17:27,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=3359, Unknown=5, NotChecked=234, Total=3782 [2019-01-01 19:17:27,506 INFO L87 Difference]: Start difference. First operand 111 states and 115 transitions. Second operand 62 states. [2019-01-01 19:17:29,601 WARN L181 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 72 [2019-01-01 19:17:34,723 WARN L181 SmtUtils]: Spent 3.79 s on a formula simplification. DAG size of input: 58 DAG size of output: 50 [2019-01-01 19:17:35,156 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-01-01 19:17:38,949 WARN L181 SmtUtils]: Spent 2.38 s on a formula simplification. DAG size of input: 61 DAG size of output: 28 [2019-01-01 19:17:39,841 WARN L181 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-01-01 19:17:40,136 WARN L181 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-01 19:17:40,384 WARN L181 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-01-01 19:17:40,828 WARN L181 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 85 [2019-01-01 19:17:41,220 WARN L181 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 85 [2019-01-01 19:17:41,580 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 78 [2019-01-01 19:17:42,045 WARN L181 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 83 [2019-01-01 19:17:42,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:17:42,310 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2019-01-01 19:17:42,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-01 19:17:42,313 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 100 [2019-01-01 19:17:42,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:17:42,315 INFO L225 Difference]: With dead ends: 103 [2019-01-01 19:17:42,315 INFO L226 Difference]: Without dead ends: 103 [2019-01-01 19:17:42,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 65 SyntacticMatches, 15 SemanticMatches, 87 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1671 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=515, Invalid=6970, Unknown=5, NotChecked=342, Total=7832 [2019-01-01 19:17:42,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-01 19:17:42,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-01 19:17:42,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-01 19:17:42,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 106 transitions. [2019-01-01 19:17:42,324 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 106 transitions. Word has length 100 [2019-01-01 19:17:42,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:17:42,324 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 106 transitions. [2019-01-01 19:17:42,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2019-01-01 19:17:42,324 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 106 transitions. [2019-01-01 19:17:42,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-01-01 19:17:42,325 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:17:42,325 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:17:42,326 INFO L423 AbstractCegarLoop]: === Iteration 37 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:17:42,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:17:42,326 INFO L82 PathProgramCache]: Analyzing trace with hash -769380864, now seen corresponding path program 1 times [2019-01-01 19:17:42,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:17:42,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:17:42,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:17:42,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:17:42,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:17:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:17:43,703 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-01 19:17:43,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:17:43,703 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:17:43,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:17:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:17:43,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:17:43,995 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:43,996 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 24 [2019-01-01 19:17:43,996 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:44,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:44,032 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 15 treesize of output 18 [2019-01-01 19:17:44,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 19:17:44,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2019-01-01 19:17:44,058 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:38, output treesize:38 [2019-01-01 19:17:44,184 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-01-01 19:17:44,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:17:44,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 7] total 40 [2019-01-01 19:17:44,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2019-01-01 19:17:44,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2019-01-01 19:17:44,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=1525, Unknown=0, NotChecked=0, Total=1640 [2019-01-01 19:17:44,206 INFO L87 Difference]: Start difference. First operand 103 states and 106 transitions. Second operand 41 states. [2019-01-01 19:17:46,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:17:46,868 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2019-01-01 19:17:46,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-01-01 19:17:46,871 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 102 [2019-01-01 19:17:46,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:17:46,872 INFO L225 Difference]: With dead ends: 102 [2019-01-01 19:17:46,872 INFO L226 Difference]: Without dead ends: 102 [2019-01-01 19:17:46,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=329, Invalid=3331, Unknown=0, NotChecked=0, Total=3660 [2019-01-01 19:17:46,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2019-01-01 19:17:46,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2019-01-01 19:17:46,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-01 19:17:46,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 105 transitions. [2019-01-01 19:17:46,878 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 105 transitions. Word has length 102 [2019-01-01 19:17:46,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:17:46,879 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 105 transitions. [2019-01-01 19:17:46,879 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2019-01-01 19:17:46,879 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 105 transitions. [2019-01-01 19:17:46,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-01 19:17:46,880 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:17:46,880 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 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-01-01 19:17:46,880 INFO L423 AbstractCegarLoop]: === Iteration 38 === [dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION]=== [2019-01-01 19:17:46,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:17:46,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1463468233, now seen corresponding path program 1 times [2019-01-01 19:17:46,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:17:46,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:17:46,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:17:46,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:17:46,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:17:46,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:17:47,286 WARN L181 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2019-01-01 19:17:47,518 WARN L181 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2019-01-01 19:17:47,926 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2019-01-01 19:17:49,077 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-01 19:17:49,077 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:17:49,077 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:17:49,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:17:49,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:17:49,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:17:49,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 19:17:49,502 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 19:17:49,502 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:40 [2019-01-01 19:17:49,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2019-01-01 19:17:49,690 INFO L478 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 8 treesize of output 7 [2019-01-01 19:17:49,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:49,694 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:49,713 INFO L267 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-01-01 19:17:49,713 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:47 [2019-01-01 19:17:49,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:49,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2019-01-01 19:17:49,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2019-01-01 19:17:49,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:49,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:49,833 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-01 19:17:49,833 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:53 [2019-01-01 19:17:50,014 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:50,019 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-01-01 19:17:50,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 16 treesize of output 17 [2019-01-01 19:17:50,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:50,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:50,060 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-01 19:17:50,061 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:64, output treesize:60 [2019-01-01 19:17:50,141 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:50,148 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2019-01-01 19:17:50,153 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:50,154 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 62 [2019-01-01 19:17:50,154 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:50,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:50,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-01 19:17:50,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:75, output treesize:71 [2019-01-01 19:17:50,694 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:50,696 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 44 [2019-01-01 19:17:50,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:50,703 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:17:50,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 42 [2019-01-01 19:17:50,705 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:50,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:50,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2019-01-01 19:17:50,756 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:50,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2019-01-01 19:17:50,758 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:50,781 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 1 [2019-01-01 19:17:50,781 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:50,785 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:50,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 19:17:50,799 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:74, output treesize:18 [2019-01-01 19:17:59,344 WARN L181 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 29 [2019-01-01 19:17:59,351 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:59,356 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 79 [2019-01-01 19:17:59,372 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 49 [2019-01-01 19:17:59,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 19:17:59,397 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:17:59,442 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 9 dim-0 vars, and 2 xjuncts. [2019-01-01 19:17:59,442 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:116, output treesize:160 [2019-01-01 19:17:59,658 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:59,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 48 [2019-01-01 19:17:59,663 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:59,665 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:17:59,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 42 [2019-01-01 19:17:59,666 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:59,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:59,697 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 32 treesize of output 24 [2019-01-01 19:17:59,701 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:59,702 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2019-01-01 19:17:59,702 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:59,706 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:59,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 19:17:59,720 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:61, output treesize:18 [2019-01-01 19:18:10,182 WARN L181 SmtUtils]: Spent 691.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-01 19:18:10,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2019-01-01 19:18:10,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:18:10,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:18:10,229 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:18:10,232 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 55 [2019-01-01 19:18:10,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:18:10,245 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:18:10,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-01-01 19:18:10,275 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:94, output treesize:72 [2019-01-01 19:18:10,422 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:18:10,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 46 [2019-01-01 19:18:10,456 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:18:10,457 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:18:10,458 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 36 [2019-01-01 19:18:10,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:18:10,467 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:18:10,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 19:18:10,484 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:58, output treesize:42 [2019-01-01 19:18:10,815 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:18:10,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 48 [2019-01-01 19:18:10,819 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:18:10,820 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 42 [2019-01-01 19:18:10,821 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:18:10,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:18:10,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 19:18:10,858 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:58, output treesize:46 [2019-01-01 19:18:11,047 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 13 [2019-01-01 19:18:11,047 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:18:11,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 19:18:11,064 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:31 [2019-01-01 19:18:13,463 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2019-01-01 19:18:30,242 WARN L181 SmtUtils]: Spent 2.50 s on a formula simplification that was a NOOP. DAG size: 31 [2019-01-01 19:18:32,249 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((main_~s~0.offset Int) (v_main_~s~0.base_BEFORE_CALL_35 Int)) (let ((.cse0 (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_35))) (let ((.cse1 (select .cse0 main_~s~0.offset))) (and (= (select .cse0 (+ main_~s~0.offset 4)) .cse1) (not (= .cse1 v_main_~s~0.base_BEFORE_CALL_35)) (<= 0 main_~s~0.offset) (<= main_~s~0.offset 0))))) (exists ((dll_circular_destroy_~head.offset Int)) (and (= (store (store |c_old(#valid)| (select (select |c_#memory_$Pointer$.base| |c_dll_circular_destroy_#in~head.base|) dll_circular_destroy_~head.offset) 0) |c_dll_circular_destroy_#in~head.base| 0) |c_#valid|) (<= dll_circular_destroy_~head.offset 0) (<= 0 dll_circular_destroy_~head.offset)))) is different from true [2019-01-01 19:18:32,265 INFO L478 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 75 treesize of output 67 [2019-01-01 19:18:32,270 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:18:32,272 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:18:32,274 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:18:32,275 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:18:32,277 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:18:32,277 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 64 [2019-01-01 19:18:32,278 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:18:32,346 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:18:32,348 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:18:32,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 60 [2019-01-01 19:18:32,350 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:18:32,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:18:32,389 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 0 case distinctions, treesize of input 48 treesize of output 46 [2019-01-01 19:18:32,390 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:18:32,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-01 19:18:32,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2019-01-01 19:18:32,472 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:101, output treesize:75 [2019-01-01 19:19:07,484 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 7 proven. 12 refuted. 2 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-01 19:19:07,504 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:19:07,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 36] total 64 [2019-01-01 19:19:07,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2019-01-01 19:19:07,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2019-01-01 19:19:07,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=3750, Unknown=54, NotChecked=124, Total=4160 [2019-01-01 19:19:07,506 INFO L87 Difference]: Start difference. First operand 102 states and 105 transitions. Second operand 65 states. [2019-01-01 19:19:32,583 WARN L181 SmtUtils]: Spent 1.15 s on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-01-01 19:19:45,759 WARN L181 SmtUtils]: Spent 1.04 s on a formula simplification that was a NOOP. DAG size: 31 [2019-01-01 19:20:02,148 WARN L181 SmtUtils]: Spent 670.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-01 19:20:24,443 WARN L181 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2019-01-01 19:20:35,253 WARN L181 SmtUtils]: Spent 3.12 s on a formula simplification. DAG size of input: 43 DAG size of output: 32 [2019-01-01 19:20:41,056 WARN L181 SmtUtils]: Spent 4.44 s on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-01-01 19:20:48,036 WARN L181 SmtUtils]: Spent 5.51 s on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-01-01 19:20:49,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:20:49,600 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2019-01-01 19:20:49,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-01 19:20:49,600 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 106 [2019-01-01 19:20:49,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:20:49,601 INFO L225 Difference]: With dead ends: 101 [2019-01-01 19:20:49,601 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 19:20:49,603 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 78 SyntacticMatches, 11 SemanticMatches, 83 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1956 ImplicationChecksByTransitivity, 106.3s TimeCoverageRelationStatistics Valid=468, Invalid=6444, Unknown=64, NotChecked=164, Total=7140 [2019-01-01 19:20:49,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 19:20:49,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 19:20:49,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 19:20:49,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 19:20:49,603 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2019-01-01 19:20:49,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:20:49,603 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 19:20:49,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2019-01-01 19:20:49,604 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 19:20:49,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 19:20:49,610 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 07:20:49 BoogieIcfgContainer [2019-01-01 19:20:49,610 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 19:20:49,611 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 19:20:49,611 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 19:20:49,611 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 19:20:49,611 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 07:13:44" (3/4) ... [2019-01-01 19:20:49,616 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 19:20:49,624 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-01 19:20:49,625 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-01-01 19:20:49,625 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_destroy [2019-01-01 19:20:49,625 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-01 19:20:49,625 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-01 19:20:49,625 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-01 19:20:49,626 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_create [2019-01-01 19:20:49,626 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_update_at [2019-01-01 19:20:49,626 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2019-01-01 19:20:49,626 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_get_data_at [2019-01-01 19:20:49,634 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2019-01-01 19:20:49,635 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-01-01 19:20:49,635 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-01 19:20:49,708 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 19:20:49,709 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 19:20:49,711 INFO L168 Benchmark]: Toolchain (without parser) took 427736.04 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 265.8 MB). Free memory was 952.7 MB in the beginning and 812.3 MB in the end (delta: 140.4 MB). Peak memory consumption was 406.2 MB. Max. memory is 11.5 GB. [2019-01-01 19:20:49,712 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 19:20:49,713 INFO L168 Benchmark]: CACSL2BoogieTranslator took 683.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -147.2 MB). Peak memory consumption was 35.7 MB. Max. memory is 11.5 GB. [2019-01-01 19:20:49,713 INFO L168 Benchmark]: Boogie Preprocessor took 123.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-01-01 19:20:49,713 INFO L168 Benchmark]: RCFGBuilder took 1250.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.2 MB). Peak memory consumption was 53.2 MB. Max. memory is 11.5 GB. [2019-01-01 19:20:49,714 INFO L168 Benchmark]: TraceAbstraction took 425572.53 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 144.7 MB). Free memory was 1.0 GB in the beginning and 822.1 MB in the end (delta: 217.7 MB). Peak memory consumption was 362.4 MB. Max. memory is 11.5 GB. [2019-01-01 19:20:49,714 INFO L168 Benchmark]: Witness Printer took 99.65 ms. Allocated memory is still 1.3 GB. Free memory was 822.1 MB in the beginning and 812.3 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2019-01-01 19:20:49,723 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 683.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -147.2 MB). Peak memory consumption was 35.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 123.66 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1250.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.2 MB). Peak memory consumption was 53.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 425572.53 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 144.7 MB). Free memory was 1.0 GB in the beginning and 822.1 MB in the end (delta: 217.7 MB). Peak memory consumption was 362.4 MB. Max. memory is 11.5 GB. * Witness Printer took 99.65 ms. Allocated memory is still 1.3 GB. Free memory was 822.1 MB in the beginning and 812.3 MB in the end (delta: 9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 615]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 586]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 587]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 579]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 586]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 610]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 610]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 613]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 613]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 603]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 603]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 606]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 606]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 33 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 121 locations, 33 error locations. SAFE Result, 425.4s OverallTime, 38 OverallIterations, 3 TraceHistogramMax, 247.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2931 SDtfs, 3236 SDslu, 17592 SDs, 0 SdLazy, 30477 SolverSat, 872 SolverUnsat, 89 SolverUnknown, 0 SolverNotchecked, 136.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2015 GetRequests, 915 SyntacticMatches, 104 SemanticMatches, 996 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 12472 ImplicationChecksByTransitivity, 265.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=126occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 38 MinimizatonAttempts, 236 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 174.2s InterpolantComputationTime, 3404 NumberOfCodeBlocks, 3404 NumberOfCodeBlocksAsserted, 55 NumberOfCheckSat, 3349 ConstructedInterpolants, 290 QuantifiedInterpolants, 3893201 SizeOfPredicates, 274 NumberOfNonLiveVariables, 5697 ConjunctsInSsa, 1035 ConjunctsInUnsatCore, 55 InterpolantComputations, 21 PerfectInterpolantSequences, 728/1094 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...