./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/list-simple/dll2c_update_all_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_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 ed4d18349810257ce078dfe4f08b9b953ed4516f ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:15:04,924 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 19:15:04,926 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 19:15:04,944 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 19:15:04,945 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 19:15:04,946 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 19:15:04,948 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 19:15:04,951 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 19:15:04,953 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 19:15:04,956 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 19:15:04,958 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 19:15:04,958 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 19:15:04,959 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 19:15:04,961 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 19:15:04,962 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 19:15:04,963 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 19:15:04,963 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 19:15:04,968 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 19:15:04,977 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 19:15:04,982 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 19:15:04,983 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 19:15:04,984 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 19:15:04,986 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 19:15:04,987 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 19:15:04,987 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 19:15:04,988 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 19:15:04,989 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 19:15:04,992 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 19:15:04,992 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 19:15:04,993 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 19:15:04,993 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 19:15:04,996 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 19:15:04,996 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 19:15:04,998 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 19:15:04,999 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 19:15:05,001 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 19:15:05,001 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:15:05,027 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 19:15:05,029 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 19:15:05,030 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 19:15:05,032 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 19:15:05,032 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 19:15:05,032 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 19:15:05,032 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-01 19:15:05,033 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 19:15:05,033 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 19:15:05,034 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-01 19:15:05,034 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 19:15:05,034 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-01 19:15:05,034 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-01 19:15:05,034 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-01 19:15:05,034 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-01 19:15:05,035 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-01 19:15:05,035 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 19:15:05,036 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 19:15:05,036 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 19:15:05,036 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-01 19:15:05,036 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-01 19:15:05,036 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-01 19:15:05,039 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 19:15:05,039 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-01 19:15:05,039 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 19:15:05,039 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-01 19:15:05,039 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 -> ed4d18349810257ce078dfe4f08b9b953ed4516f [2019-01-01 19:15:05,076 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 19:15:05,093 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 19:15:05,097 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 19:15:05,099 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 19:15:05,100 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 19:15:05,100 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2019-01-01 19:15:05,164 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6b634d51/29b2d4ad22354e199cca623e18d8791d/FLAG82f2caf09 [2019-01-01 19:15:05,736 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 19:15:05,736 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-simple/dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2019-01-01 19:15:05,751 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6b634d51/29b2d4ad22354e199cca623e18d8791d/FLAG82f2caf09 [2019-01-01 19:15:06,011 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6b634d51/29b2d4ad22354e199cca623e18d8791d [2019-01-01 19:15:06,014 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 19:15:06,016 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-01 19:15:06,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 19:15:06,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 19:15:06,021 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 19:15:06,022 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 07:15:06" (1/1) ... [2019-01-01 19:15:06,025 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4004f16f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:15:06, skipping insertion in model container [2019-01-01 19:15:06,026 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 07:15:06" (1/1) ... [2019-01-01 19:15:06,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 19:15:06,085 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 19:15:06,478 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 19:15:06,490 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 19:15:06,609 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 19:15:06,670 INFO L195 MainTranslator]: Completed translation [2019-01-01 19:15:06,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:15:06 WrapperNode [2019-01-01 19:15:06,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 19:15:06,671 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 19:15:06,671 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 19:15:06,671 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 19:15:06,688 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:15:06" (1/1) ... [2019-01-01 19:15:06,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:15:06" (1/1) ... [2019-01-01 19:15:06,710 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:15:06" (1/1) ... [2019-01-01 19:15:06,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:15:06" (1/1) ... [2019-01-01 19:15:06,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:15:06" (1/1) ... [2019-01-01 19:15:06,761 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:15:06" (1/1) ... [2019-01-01 19:15:06,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:15:06" (1/1) ... [2019-01-01 19:15:06,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 19:15:06,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 19:15:06,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 19:15:06,784 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 19:15:06,785 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:15:06" (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:15:06,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-01 19:15:06,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 19:15:06,860 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-01-01 19:15:06,860 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-01-01 19:15:06,861 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-01-01 19:15:06,861 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2019-01-01 19:15:06,861 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_create [2019-01-01 19:15:06,861 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_destroy [2019-01-01 19:15:06,861 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_get_data_at [2019-01-01 19:15:06,861 INFO L138 BoogieDeclarations]: Found implementation of procedure dll_circular_update_at [2019-01-01 19:15:06,862 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-01 19:15:06,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-01 19:15:06,862 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-01-01 19:15:06,862 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-01-01 19:15:06,862 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-01 19:15:06,862 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-01 19:15:06,863 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-01 19:15:06,863 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-01 19:15:06,863 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-01 19:15:06,864 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-01 19:15:06,864 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-01 19:15:06,864 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-01 19:15:06,864 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-01 19:15:06,864 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-01 19:15:06,864 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-01 19:15:06,864 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-01 19:15:06,865 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-01 19:15:06,865 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-01 19:15:06,865 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-01 19:15:06,865 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-01 19:15:06,865 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-01 19:15:06,865 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-01 19:15:06,866 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-01 19:15:06,866 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-01 19:15:06,866 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-01 19:15:06,866 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-01 19:15:06,867 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-01 19:15:06,867 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-01 19:15:06,867 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-01 19:15:06,867 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-01 19:15:06,867 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-01 19:15:06,867 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-01 19:15:06,867 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-01 19:15:06,869 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-01 19:15:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-01 19:15:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-01 19:15:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-01 19:15:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-01 19:15:06,870 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-01 19:15:06,871 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-01 19:15:06,871 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-01 19:15:06,871 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-01 19:15:06,871 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-01 19:15:06,871 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-01 19:15:06,871 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-01 19:15:06,871 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-01 19:15:06,873 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-01 19:15:06,873 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-01 19:15:06,873 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-01 19:15:06,874 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-01 19:15:06,874 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-01 19:15:06,874 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-01 19:15:06,874 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-01 19:15:06,875 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-01 19:15:06,875 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-01 19:15:06,875 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-01 19:15:06,875 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-01 19:15:06,875 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-01 19:15:06,875 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-01 19:15:06,875 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-01 19:15:06,877 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-01 19:15:06,878 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-01 19:15:06,878 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-01-01 19:15:06,878 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-01 19:15:06,878 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-01 19:15:06,878 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-01-01 19:15:06,878 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-01 19:15:06,878 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-01 19:15:06,879 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-01-01 19:15:06,881 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-01 19:15:06,881 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-01 19:15:06,881 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-01 19:15:06,881 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-01 19:15:06,883 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-01 19:15:06,883 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-01 19:15:06,884 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-01 19:15:06,884 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-01 19:15:06,884 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-01 19:15:06,884 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-01 19:15:06,884 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-01 19:15:06,885 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-01 19:15:06,885 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-01 19:15:06,885 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-01 19:15:06,885 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-01 19:15:06,885 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-01 19:15:06,885 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-01 19:15:06,885 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-01 19:15:06,885 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-01 19:15:06,885 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-01 19:15:06,886 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-01 19:15:06,886 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-01 19:15:06,886 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-01 19:15:06,886 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-01 19:15:06,886 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-01 19:15:06,886 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-01 19:15:06,886 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-01 19:15:06,886 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-01 19:15:06,886 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-01 19:15:06,890 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-01 19:15:06,890 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-01 19:15:06,890 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-01 19:15:06,891 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-01 19:15:06,891 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-01 19:15:06,891 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-01 19:15:06,891 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-01 19:15:06,891 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-01 19:15:06,891 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-01 19:15:06,891 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-01-01 19:15:06,891 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2019-01-01 19:15:06,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-01 19:15:06,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-01 19:15:06,892 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 19:15:06,892 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_create [2019-01-01 19:15:06,894 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_destroy [2019-01-01 19:15:06,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-01 19:15:06,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 19:15:06,895 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_get_data_at [2019-01-01 19:15:06,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 19:15:06,895 INFO L130 BoogieDeclarations]: Found specification of procedure dll_circular_update_at [2019-01-01 19:15:06,895 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-01 19:15:06,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-01 19:15:06,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 19:15:08,160 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 19:15:08,160 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2019-01-01 19:15:08,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 07:15:08 BoogieIcfgContainer [2019-01-01 19:15:08,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 19:15:08,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-01 19:15:08,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-01 19:15:08,166 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-01 19:15:08,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.01 07:15:06" (1/3) ... [2019-01-01 19:15:08,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26d1c930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 07:15:08, skipping insertion in model container [2019-01-01 19:15:08,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 07:15:06" (2/3) ... [2019-01-01 19:15:08,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26d1c930 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.01 07:15:08, skipping insertion in model container [2019-01-01 19:15:08,169 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 07:15:08" (3/3) ... [2019-01-01 19:15:08,171 INFO L112 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_true-unreach-call_true-valid-memsafety.i [2019-01-01 19:15:08,181 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-01 19:15:08,189 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 33 error locations. [2019-01-01 19:15:08,207 INFO L257 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2019-01-01 19:15:08,235 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 19:15:08,236 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-01 19:15:08,237 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-01 19:15:08,237 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-01 19:15:08,238 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 19:15:08,238 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 19:15:08,238 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-01 19:15:08,238 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 19:15:08,239 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-01 19:15:08,259 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states. [2019-01-01 19:15:08,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-01 19:15:08,269 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:15:08,270 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:15:08,273 INFO L423 AbstractCegarLoop]: === Iteration 1 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:15:08,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:15:08,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1471092252, now seen corresponding path program 1 times [2019-01-01 19:15:08,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:15:08,283 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:15:08,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:08,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:08,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:08,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:08,528 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:15:08,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:15:08,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 19:15:08,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 19:15:08,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 19:15:08,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 19:15:08,557 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 3 states. [2019-01-01 19:15:08,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:15:08,784 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2019-01-01 19:15:08,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 19:15:08,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-01 19:15:08,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:15:08,796 INFO L225 Difference]: With dead ends: 110 [2019-01-01 19:15:08,797 INFO L226 Difference]: Without dead ends: 103 [2019-01-01 19:15:08,798 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:15:08,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-01 19:15:08,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2019-01-01 19:15:08,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-01-01 19:15:08,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-01-01 19:15:08,852 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 12 [2019-01-01 19:15:08,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:15:08,853 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-01-01 19:15:08,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 19:15:08,853 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-01-01 19:15:08,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-01 19:15:08,854 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:15:08,854 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:15:08,854 INFO L423 AbstractCegarLoop]: === Iteration 2 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:15:08,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:15:08,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1471092251, now seen corresponding path program 1 times [2019-01-01 19:15:08,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:15:08,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:15:08,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:08,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:08,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:09,146 WARN L181 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-01 19:15:09,148 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:15:09,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:15:09,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-01 19:15:09,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-01 19:15:09,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-01 19:15:09,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-01 19:15:09,151 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 3 states. [2019-01-01 19:15:09,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:15:09,345 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2019-01-01 19:15:09,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-01 19:15:09,346 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-01 19:15:09,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:15:09,348 INFO L225 Difference]: With dead ends: 100 [2019-01-01 19:15:09,348 INFO L226 Difference]: Without dead ends: 100 [2019-01-01 19:15:09,349 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:15:09,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-01 19:15:09,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-01-01 19:15:09,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-01 19:15:09,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-01-01 19:15:09,362 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 12 [2019-01-01 19:15:09,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:15:09,362 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-01-01 19:15:09,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-01 19:15:09,363 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-01-01 19:15:09,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-01-01 19:15:09,364 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:15:09,364 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:15:09,364 INFO L423 AbstractCegarLoop]: === Iteration 3 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:15:09,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:15:09,365 INFO L82 PathProgramCache]: Analyzing trace with hash 322104282, now seen corresponding path program 1 times [2019-01-01 19:15:09,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:15:09,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:15:09,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:09,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:09,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:09,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:09,461 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:15:09,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:15:09,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:15:09,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 19:15:09,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 19:15:09,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:15:09,463 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 5 states. [2019-01-01 19:15:09,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:15:09,548 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2019-01-01 19:15:09,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 19:15:09,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-01-01 19:15:09,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:15:09,550 INFO L225 Difference]: With dead ends: 101 [2019-01-01 19:15:09,550 INFO L226 Difference]: Without dead ends: 101 [2019-01-01 19:15:09,552 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:15:09,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-01 19:15:09,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-01 19:15:09,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-01 19:15:09,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2019-01-01 19:15:09,563 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 20 [2019-01-01 19:15:09,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:15:09,566 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2019-01-01 19:15:09,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 19:15:09,566 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2019-01-01 19:15:09,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 19:15:09,568 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:15:09,568 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:15:09,568 INFO L423 AbstractCegarLoop]: === Iteration 4 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:15:09,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:15:09,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1342193716, now seen corresponding path program 1 times [2019-01-01 19:15:09,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:15:09,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:15:09,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:09,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:09,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:09,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:09,941 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:15:09,942 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:15:09,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:15:09,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:15:09,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:15:09,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:15:09,943 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 6 states. [2019-01-01 19:15:10,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:15:10,393 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2019-01-01 19:15:10,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:15:10,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-01-01 19:15:10,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:15:10,398 INFO L225 Difference]: With dead ends: 101 [2019-01-01 19:15:10,398 INFO L226 Difference]: Without dead ends: 101 [2019-01-01 19:15:10,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 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:15:10,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-01 19:15:10,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2019-01-01 19:15:10,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-01-01 19:15:10,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-01-01 19:15:10,408 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 30 [2019-01-01 19:15:10,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:15:10,408 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-01-01 19:15:10,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:15:10,409 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-01-01 19:15:10,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-01-01 19:15:10,410 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:15:10,410 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:15:10,410 INFO L423 AbstractCegarLoop]: === Iteration 5 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:15:10,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:15:10,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1342193717, now seen corresponding path program 1 times [2019-01-01 19:15:10,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:15:10,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:15:10,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:10,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:10,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:10,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:10,538 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:15:10,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:15:10,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:15:10,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:15:10,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:15:10,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:15:10,540 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 6 states. [2019-01-01 19:15:10,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:15:10,904 INFO L93 Difference]: Finished difference Result 100 states and 109 transitions. [2019-01-01 19:15:10,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:15:10,905 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2019-01-01 19:15:10,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:15:10,907 INFO L225 Difference]: With dead ends: 100 [2019-01-01 19:15:10,907 INFO L226 Difference]: Without dead ends: 100 [2019-01-01 19:15:10,907 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:15:10,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-01 19:15:10,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2019-01-01 19:15:10,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-01 19:15:10,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2019-01-01 19:15:10,915 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 30 [2019-01-01 19:15:10,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:15:10,916 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2019-01-01 19:15:10,916 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:15:10,916 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2019-01-01 19:15:10,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-01 19:15:10,917 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:15:10,917 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:15:10,918 INFO L423 AbstractCegarLoop]: === Iteration 6 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:15:10,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:15:10,918 INFO L82 PathProgramCache]: Analyzing trace with hash -1357973588, now seen corresponding path program 1 times [2019-01-01 19:15:10,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:15:10,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:15:10,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:10,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:10,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:10,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:11,391 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:15:11,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:15:11,392 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:15:11,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:11,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:11,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:15:13,590 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:15:13,591 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:15:13,602 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:15:13,602 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:11 [2019-01-01 19:15:13,626 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:15:13,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:15:13,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2019-01-01 19:15:13,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:15:13,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:15:13,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=96, Unknown=4, NotChecked=0, Total=132 [2019-01-01 19:15:13,657 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand 12 states. [2019-01-01 19:15:14,646 WARN L181 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 19:15:15,107 WARN L181 SmtUtils]: Spent 441.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-01-01 19:15:16,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:15:16,135 INFO L93 Difference]: Finished difference Result 140 states and 153 transitions. [2019-01-01 19:15:16,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 19:15:16,136 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2019-01-01 19:15:16,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:15:16,138 INFO L225 Difference]: With dead ends: 140 [2019-01-01 19:15:16,138 INFO L226 Difference]: Without dead ends: 140 [2019-01-01 19:15:16,139 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=58, Invalid=178, Unknown=4, NotChecked=0, Total=240 [2019-01-01 19:15:16,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-01-01 19:15:16,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 104. [2019-01-01 19:15:16,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-01 19:15:16,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2019-01-01 19:15:16,148 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 32 [2019-01-01 19:15:16,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:15:16,148 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2019-01-01 19:15:16,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:15:16,149 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2019-01-01 19:15:16,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-01-01 19:15:16,150 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:15:16,150 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:15:16,151 INFO L423 AbstractCegarLoop]: === Iteration 7 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:15:16,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:15:16,151 INFO L82 PathProgramCache]: Analyzing trace with hash -1357973587, now seen corresponding path program 1 times [2019-01-01 19:15:16,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:15:16,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:15:16,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:16,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:16,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:16,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:16,458 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:15:16,458 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:15:16,458 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:15:16,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:16,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:16,531 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:15:16,557 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:15:16,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:15:16,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:15:16,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-01 19:15:17,344 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:15:17,357 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:15:17,358 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:15:17,363 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:15:17,364 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2019-01-01 19:15:17,460 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:15:17,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:15:17,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 9 [2019-01-01 19:15:17,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-01 19:15:17,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-01 19:15:17,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=56, Unknown=1, NotChecked=14, Total=90 [2019-01-01 19:15:17,493 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand 10 states. [2019-01-01 19:15:18,313 WARN L181 SmtUtils]: Spent 705.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2019-01-01 19:15:19,095 WARN L181 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 18 [2019-01-01 19:15:19,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:15:19,705 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2019-01-01 19:15:19,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 19:15:19,706 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-01-01 19:15:19,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:15:19,708 INFO L225 Difference]: With dead ends: 105 [2019-01-01 19:15:19,708 INFO L226 Difference]: Without dead ends: 105 [2019-01-01 19:15:19,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 23 SyntacticMatches, 9 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=39, Invalid=120, Unknown=1, NotChecked=22, Total=182 [2019-01-01 19:15:19,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-01 19:15:19,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-01-01 19:15:19,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-01 19:15:19,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2019-01-01 19:15:19,715 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 32 [2019-01-01 19:15:19,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:15:19,715 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2019-01-01 19:15:19,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-01 19:15:19,716 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2019-01-01 19:15:19,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-01-01 19:15:19,717 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:15:19,717 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:15:19,717 INFO L423 AbstractCegarLoop]: === Iteration 8 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:15:19,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:15:19,718 INFO L82 PathProgramCache]: Analyzing trace with hash 657593987, now seen corresponding path program 1 times [2019-01-01 19:15:19,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:15:19,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:15:19,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:19,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:19,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:20,067 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:15:20,068 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:15:20,068 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:15:20,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:20,137 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:15:20,254 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:15:20,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:15:20,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-01 19:15:20,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:15:20,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:15:20,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:15:20,289 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand 6 states. [2019-01-01 19:15:20,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:15:20,438 INFO L93 Difference]: Finished difference Result 105 states and 114 transitions. [2019-01-01 19:15:20,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:15:20,439 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2019-01-01 19:15:20,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:15:20,440 INFO L225 Difference]: With dead ends: 105 [2019-01-01 19:15:20,441 INFO L226 Difference]: Without dead ends: 105 [2019-01-01 19:15:20,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:15:20,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-01 19:15:20,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2019-01-01 19:15:20,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-01 19:15:20,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2019-01-01 19:15:20,447 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 34 [2019-01-01 19:15:20,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:15:20,447 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2019-01-01 19:15:20,447 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:15:20,447 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2019-01-01 19:15:20,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-01 19:15:20,448 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:15:20,449 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:15:20,449 INFO L423 AbstractCegarLoop]: === Iteration 9 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:15:20,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:15:20,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1094203578, now seen corresponding path program 1 times [2019-01-01 19:15:20,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:15:20,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:15:20,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:20,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:20,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:20,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:20,749 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:15:20,749 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:15:20,749 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:15:20,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:20,804 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:15:20,947 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:15:20,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:15:20,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-01 19:15:20,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 19:15:20,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 19:15:20,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-01 19:15:20,968 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand 9 states. [2019-01-01 19:15:21,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:15:21,315 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2019-01-01 19:15:21,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 19:15:21,316 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-01-01 19:15:21,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:15:21,318 INFO L225 Difference]: With dead ends: 115 [2019-01-01 19:15:21,318 INFO L226 Difference]: Without dead ends: 115 [2019-01-01 19:15:21,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-01-01 19:15:21,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-01-01 19:15:21,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 107. [2019-01-01 19:15:21,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-01 19:15:21,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 118 transitions. [2019-01-01 19:15:21,323 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 118 transitions. Word has length 35 [2019-01-01 19:15:21,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:15:21,324 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 118 transitions. [2019-01-01 19:15:21,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 19:15:21,324 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 118 transitions. [2019-01-01 19:15:21,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-01 19:15:21,325 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:15:21,325 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:15:21,325 INFO L423 AbstractCegarLoop]: === Iteration 10 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:15:21,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:15:21,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1094203579, now seen corresponding path program 1 times [2019-01-01 19:15:21,326 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:15:21,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:15:21,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:21,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:21,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:21,545 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 6 [2019-01-01 19:15:21,599 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:15:21,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:15:21,599 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:15:21,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:21,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:21,647 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:15:21,664 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:15:21,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:15:21,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2019-01-01 19:15:21,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 19:15:21,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 19:15:21,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:15:21,685 INFO L87 Difference]: Start difference. First operand 107 states and 118 transitions. Second operand 5 states. [2019-01-01 19:15:22,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:15:22,288 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2019-01-01 19:15:22,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:15:22,289 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-01-01 19:15:22,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:15:22,292 INFO L225 Difference]: With dead ends: 108 [2019-01-01 19:15:22,292 INFO L226 Difference]: Without dead ends: 108 [2019-01-01 19:15:22,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:15:22,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-01-01 19:15:22,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2019-01-01 19:15:22,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-01 19:15:22,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2019-01-01 19:15:22,304 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 35 [2019-01-01 19:15:22,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:15:22,305 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2019-01-01 19:15:22,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 19:15:22,306 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2019-01-01 19:15:22,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-01 19:15:22,308 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:15:22,308 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:15:22,308 INFO L423 AbstractCegarLoop]: === Iteration 11 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:15:22,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:15:22,311 INFO L82 PathProgramCache]: Analyzing trace with hash 439427422, now seen corresponding path program 1 times [2019-01-01 19:15:22,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:15:22,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:15:22,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:22,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:22,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:22,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:22,654 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:15:22,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:15:22,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 19:15:22,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 19:15:22,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 19:15:22,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:15:22,657 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand 7 states. [2019-01-01 19:15:22,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:15:22,854 INFO L93 Difference]: Finished difference Result 107 states and 117 transitions. [2019-01-01 19:15:22,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 19:15:22,855 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-01-01 19:15:22,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:15:22,857 INFO L225 Difference]: With dead ends: 107 [2019-01-01 19:15:22,857 INFO L226 Difference]: Without dead ends: 107 [2019-01-01 19:15:22,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-01-01 19:15:22,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-01-01 19:15:22,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-01-01 19:15:22,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-01 19:15:22,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 116 transitions. [2019-01-01 19:15:22,862 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 116 transitions. Word has length 36 [2019-01-01 19:15:22,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:15:22,863 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 116 transitions. [2019-01-01 19:15:22,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 19:15:22,863 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 116 transitions. [2019-01-01 19:15:22,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-01-01 19:15:22,864 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:15:22,864 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:15:22,864 INFO L423 AbstractCegarLoop]: === Iteration 12 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:15:22,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:15:22,865 INFO L82 PathProgramCache]: Analyzing trace with hash 439427423, now seen corresponding path program 1 times [2019-01-01 19:15:22,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:15:22,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:15:22,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:22,866 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:22,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:22,979 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:15:22,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:15:22,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 19:15:22,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 19:15:22,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 19:15:22,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:15:22,980 INFO L87 Difference]: Start difference. First operand 106 states and 116 transitions. Second operand 7 states. [2019-01-01 19:15:23,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:15:23,253 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2019-01-01 19:15:23,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 19:15:23,254 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2019-01-01 19:15:23,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:15:23,256 INFO L225 Difference]: With dead ends: 105 [2019-01-01 19:15:23,256 INFO L226 Difference]: Without dead ends: 105 [2019-01-01 19:15:23,257 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:15:23,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-01-01 19:15:23,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-01-01 19:15:23,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-01-01 19:15:23,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2019-01-01 19:15:23,262 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 36 [2019-01-01 19:15:23,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:15:23,262 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2019-01-01 19:15:23,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 19:15:23,262 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2019-01-01 19:15:23,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-01 19:15:23,264 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:15:23,264 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:15:23,264 INFO L423 AbstractCegarLoop]: === Iteration 13 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:15:23,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:15:23,265 INFO L82 PathProgramCache]: Analyzing trace with hash -869726790, now seen corresponding path program 1 times [2019-01-01 19:15:23,265 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:15:23,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:15:23,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:23,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:23,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:23,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:23,558 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:15:23,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:15:23,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-01 19:15:23,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:15:23,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:15:23,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:15:23,560 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand 12 states. [2019-01-01 19:15:24,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:15:24,242 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2019-01-01 19:15:24,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 19:15:24,243 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-01-01 19:15:24,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:15:24,245 INFO L225 Difference]: With dead ends: 111 [2019-01-01 19:15:24,245 INFO L226 Difference]: Without dead ends: 111 [2019-01-01 19:15:24,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 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:15:24,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-01 19:15:24,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2019-01-01 19:15:24,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-01 19:15:24,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 121 transitions. [2019-01-01 19:15:24,249 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 121 transitions. Word has length 45 [2019-01-01 19:15:24,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:15:24,250 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 121 transitions. [2019-01-01 19:15:24,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:15:24,250 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 121 transitions. [2019-01-01 19:15:24,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-01-01 19:15:24,251 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:15:24,251 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:15:24,251 INFO L423 AbstractCegarLoop]: === Iteration 14 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:15:24,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:15:24,252 INFO L82 PathProgramCache]: Analyzing trace with hash -869726789, now seen corresponding path program 1 times [2019-01-01 19:15:24,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:15:24,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:15:24,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:24,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:24,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:24,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:24,789 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:15:24,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:15:24,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-01 19:15:24,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:15:24,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:15:24,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:15:24,790 INFO L87 Difference]: Start difference. First operand 108 states and 121 transitions. Second operand 12 states. [2019-01-01 19:15:25,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:15:25,284 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2019-01-01 19:15:25,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 19:15:25,285 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 45 [2019-01-01 19:15:25,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:15:25,287 INFO L225 Difference]: With dead ends: 111 [2019-01-01 19:15:25,287 INFO L226 Difference]: Without dead ends: 111 [2019-01-01 19:15:25,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-01 19:15:25,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-01-01 19:15:25,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 108. [2019-01-01 19:15:25,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-01-01 19:15:25,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 119 transitions. [2019-01-01 19:15:25,294 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 119 transitions. Word has length 45 [2019-01-01 19:15:25,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:15:25,294 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 119 transitions. [2019-01-01 19:15:25,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:15:25,294 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 119 transitions. [2019-01-01 19:15:25,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-01 19:15:25,295 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:15:25,295 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] [2019-01-01 19:15:25,298 INFO L423 AbstractCegarLoop]: === Iteration 15 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:15:25,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:15:25,299 INFO L82 PathProgramCache]: Analyzing trace with hash 2061228451, now seen corresponding path program 1 times [2019-01-01 19:15:25,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:15:25,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:15:25,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:25,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:25,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:25,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:25,997 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:15:25,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:15:25,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-01 19:15:25,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:15:25,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:15:25,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:15:25,999 INFO L87 Difference]: Start difference. First operand 108 states and 119 transitions. Second operand 12 states. [2019-01-01 19:15:26,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:15:26,612 INFO L93 Difference]: Finished difference Result 129 states and 140 transitions. [2019-01-01 19:15:26,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 19:15:26,613 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 47 [2019-01-01 19:15:26,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:15:26,615 INFO L225 Difference]: With dead ends: 129 [2019-01-01 19:15:26,615 INFO L226 Difference]: Without dead ends: 129 [2019-01-01 19:15:26,616 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:15:26,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-01 19:15:26,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 111. [2019-01-01 19:15:26,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-01 19:15:26,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 125 transitions. [2019-01-01 19:15:26,620 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 125 transitions. Word has length 47 [2019-01-01 19:15:26,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:15:26,621 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 125 transitions. [2019-01-01 19:15:26,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:15:26,622 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 125 transitions. [2019-01-01 19:15:26,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-01 19:15:26,624 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:15:26,624 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] [2019-01-01 19:15:26,626 INFO L423 AbstractCegarLoop]: === Iteration 16 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:15:26,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:15:26,626 INFO L82 PathProgramCache]: Analyzing trace with hash 2061228452, now seen corresponding path program 1 times [2019-01-01 19:15:26,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:15:26,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:15:26,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:26,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:26,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:26,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:26,836 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:15:26,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:15:26,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-01 19:15:26,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-01 19:15:26,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-01 19:15:26,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 19:15:26,839 INFO L87 Difference]: Start difference. First operand 111 states and 125 transitions. Second operand 4 states. [2019-01-01 19:15:26,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:15:26,929 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2019-01-01 19:15:26,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-01 19:15:26,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-01-01 19:15:26,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:15:26,931 INFO L225 Difference]: With dead ends: 119 [2019-01-01 19:15:26,931 INFO L226 Difference]: Without dead ends: 119 [2019-01-01 19:15:26,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-01 19:15:26,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-01-01 19:15:26,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2019-01-01 19:15:26,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-01 19:15:26,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2019-01-01 19:15:26,940 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 47 [2019-01-01 19:15:26,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:15:26,940 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2019-01-01 19:15:26,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-01 19:15:26,940 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2019-01-01 19:15:26,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-01 19:15:26,943 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:15:26,943 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:15:26,944 INFO L423 AbstractCegarLoop]: === Iteration 17 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:15:26,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:15:26,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1383731480, now seen corresponding path program 1 times [2019-01-01 19:15:26,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:15:26,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:15:26,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:26,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:26,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:27,015 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:15:27,015 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:15:27,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-01 19:15:27,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-01 19:15:27,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-01 19:15:27,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:15:27,016 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand 6 states. [2019-01-01 19:15:27,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:15:27,067 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2019-01-01 19:15:27,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:15:27,068 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-01-01 19:15:27,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:15:27,070 INFO L225 Difference]: With dead ends: 101 [2019-01-01 19:15:27,070 INFO L226 Difference]: Without dead ends: 101 [2019-01-01 19:15:27,070 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:15:27,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-01-01 19:15:27,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-01-01 19:15:27,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-01-01 19:15:27,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2019-01-01 19:15:27,076 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 47 [2019-01-01 19:15:27,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:15:27,076 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2019-01-01 19:15:27,076 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-01 19:15:27,076 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2019-01-01 19:15:27,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-01-01 19:15:27,079 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:15:27,079 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:15:27,079 INFO L423 AbstractCegarLoop]: === Iteration 18 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:15:27,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:15:27,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1508555054, now seen corresponding path program 1 times [2019-01-01 19:15:27,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:15:27,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:15:27,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:27,081 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:27,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:27,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:27,264 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-01 19:15:27,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:15:27,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:15:27,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 19:15:27,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 19:15:27,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:15:27,267 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand 5 states. [2019-01-01 19:15:27,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:15:27,314 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2019-01-01 19:15:27,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 19:15:27,315 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-01-01 19:15:27,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:15:27,317 INFO L225 Difference]: With dead ends: 112 [2019-01-01 19:15:27,317 INFO L226 Difference]: Without dead ends: 112 [2019-01-01 19:15:27,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:15:27,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-01 19:15:27,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 107. [2019-01-01 19:15:27,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-01-01 19:15:27,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2019-01-01 19:15:27,323 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 48 [2019-01-01 19:15:27,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:15:27,324 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2019-01-01 19:15:27,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 19:15:27,324 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2019-01-01 19:15:27,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-01 19:15:27,327 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:15:27,327 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] [2019-01-01 19:15:27,327 INFO L423 AbstractCegarLoop]: === Iteration 19 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:15:27,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:15:27,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1297390898, now seen corresponding path program 1 times [2019-01-01 19:15:27,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:15:27,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:15:27,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:27,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:27,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:27,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:27,526 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 19:15:27,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:15:27,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-01 19:15:27,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:15:27,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:15:27,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:15:27,528 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand 12 states. [2019-01-01 19:15:27,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:15:27,938 INFO L93 Difference]: Finished difference Result 112 states and 123 transitions. [2019-01-01 19:15:27,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 19:15:27,939 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 55 [2019-01-01 19:15:27,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:15:27,941 INFO L225 Difference]: With dead ends: 112 [2019-01-01 19:15:27,941 INFO L226 Difference]: Without dead ends: 112 [2019-01-01 19:15:27,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-01 19:15:27,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-01 19:15:27,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-01-01 19:15:27,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-01 19:15:27,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 123 transitions. [2019-01-01 19:15:27,945 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 123 transitions. Word has length 55 [2019-01-01 19:15:27,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:15:27,945 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 123 transitions. [2019-01-01 19:15:27,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:15:27,947 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 123 transitions. [2019-01-01 19:15:27,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-01 19:15:27,948 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:15:27,948 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] [2019-01-01 19:15:27,950 INFO L423 AbstractCegarLoop]: === Iteration 20 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:15:27,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:15:27,950 INFO L82 PathProgramCache]: Analyzing trace with hash -1297390897, now seen corresponding path program 1 times [2019-01-01 19:15:27,950 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:15:27,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:15:27,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:27,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:27,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:28,171 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-01 19:15:28,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:15:28,171 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:15:28,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:28,233 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:15:28,274 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-01 19:15:28,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:15:28,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-01-01 19:15:28,293 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 19:15:28,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 19:15:28,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:15:28,294 INFO L87 Difference]: Start difference. First operand 110 states and 123 transitions. Second operand 7 states. [2019-01-01 19:15:28,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:15:28,477 INFO L93 Difference]: Finished difference Result 123 states and 139 transitions. [2019-01-01 19:15:28,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-01 19:15:28,478 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-01-01 19:15:28,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:15:28,479 INFO L225 Difference]: With dead ends: 123 [2019-01-01 19:15:28,479 INFO L226 Difference]: Without dead ends: 123 [2019-01-01 19:15:28,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=29, Unknown=0, NotChecked=0, Total=56 [2019-01-01 19:15:28,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2019-01-01 19:15:28,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2019-01-01 19:15:28,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-01 19:15:28,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 131 transitions. [2019-01-01 19:15:28,485 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 131 transitions. Word has length 55 [2019-01-01 19:15:28,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:15:28,485 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 131 transitions. [2019-01-01 19:15:28,485 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 19:15:28,485 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 131 transitions. [2019-01-01 19:15:28,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-01 19:15:28,486 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:15:28,486 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:15:28,486 INFO L423 AbstractCegarLoop]: === Iteration 21 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:15:28,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:15:28,491 INFO L82 PathProgramCache]: Analyzing trace with hash 417802170, now seen corresponding path program 1 times [2019-01-01 19:15:28,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:15:28,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:15:28,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:28,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:28,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:15:28,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:29,259 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:15:29,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:15:29,259 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:15:29,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:15:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:15:29,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:15:29,419 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:15:29,421 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:15:29,421 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:29,422 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:15:29,428 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:15:29,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-01-01 19:15:29,492 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:29,516 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:29,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:15:29,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:15:29,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:15:29,641 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-01-01 19:15:29,823 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:15:29,827 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:15:29,827 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:15:29,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:29,840 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:15:29,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-01-01 19:15:29,933 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:15:29,940 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:15:29,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:15:29,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:15:30,008 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:15:30,008 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2019-01-01 19:15:32,080 WARN L181 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2019-01-01 19:15:32,093 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:15:32,097 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:15:32,098 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:15:32,099 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:15:32,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:15:32,118 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:15:32,118 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:44 [2019-01-01 19:15:32,398 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:15:32,402 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:15:32,403 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:15:32,404 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:15:32,415 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:32,415 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:15:32,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:15:32,469 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:15:32,469 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:47, output treesize:9 [2019-01-01 19:15:44,772 WARN L181 SmtUtils]: Spent 579.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-01 19:15:44,786 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 63 treesize of output 55 [2019-01-01 19:15:44,794 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:15:44,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:15:44,796 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:15:44,799 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 52 treesize of output 66 [2019-01-01 19:15:44,799 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:15:44,812 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,828 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 19:15:44,828 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:71, output treesize:51 [2019-01-01 19:15:45,158 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 51 treesize of output 35 [2019-01-01 19:15:45,165 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:15:45,166 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:15:45,166 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:15:45,180 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:45,180 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:15:45,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:15:45,197 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:15:45,198 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:51, output treesize:5 [2019-01-01 19:15:45,282 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 19:15:45,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:15:45,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 43 [2019-01-01 19:15:45,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-01-01 19:15:45,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-01-01 19:15:45,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1764, Unknown=19, NotChecked=0, Total=1892 [2019-01-01 19:15:45,313 INFO L87 Difference]: Start difference. First operand 117 states and 131 transitions. Second operand 44 states. [2019-01-01 19:16:01,319 WARN L181 SmtUtils]: Spent 1.49 s on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2019-01-01 19:16:11,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:16:11,540 INFO L93 Difference]: Finished difference Result 186 states and 208 transitions. [2019-01-01 19:16:11,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-01-01 19:16:11,542 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 56 [2019-01-01 19:16:11,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:16:11,543 INFO L225 Difference]: With dead ends: 186 [2019-01-01 19:16:11,543 INFO L226 Difference]: Without dead ends: 186 [2019-01-01 19:16:11,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 34 SyntacticMatches, 7 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 677 ImplicationChecksByTransitivity, 19.4s TimeCoverageRelationStatistics Valid=339, Invalid=4063, Unknown=20, NotChecked=0, Total=4422 [2019-01-01 19:16:11,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-01-01 19:16:11,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 132. [2019-01-01 19:16:11,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-01-01 19:16:11,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 152 transitions. [2019-01-01 19:16:11,551 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 152 transitions. Word has length 56 [2019-01-01 19:16:11,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:16:11,551 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 152 transitions. [2019-01-01 19:16:11,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-01-01 19:16:11,551 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 152 transitions. [2019-01-01 19:16:11,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-01-01 19:16:11,552 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:16:11,552 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:16:11,553 INFO L423 AbstractCegarLoop]: === Iteration 22 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:16:11,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:16:11,557 INFO L82 PathProgramCache]: Analyzing trace with hash 417802171, now seen corresponding path program 1 times [2019-01-01 19:16:11,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:16:11,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:16:11,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:16:11,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:16:11,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:16:11,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:16:13,060 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 19:16:13,061 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:16:13,061 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:16:13,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:16:13,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:16:13,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:16:13,484 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:16:13,486 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:16:13,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:13,506 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:16:13,507 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:16:13,508 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:13,509 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:13,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:13,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:26 [2019-01-01 19:16:13,804 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:13,809 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:13,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:13,814 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:13,841 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:13,844 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:16:13,844 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:13,851 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:13,868 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:13,868 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:48, output treesize:40 [2019-01-01 19:16:13,942 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 26 [2019-01-01 19:16:13,946 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 14 treesize of output 13 [2019-01-01 19:16:13,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:13,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:13,986 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 56 treesize of output 61 [2019-01-01 19:16:13,993 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 18 treesize of output 17 [2019-01-01 19:16:13,993 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:14,007 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:14,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:14,027 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:85, output treesize:72 [2019-01-01 19:16:14,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 49 treesize of output 48 [2019-01-01 19:16:14,175 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 21 [2019-01-01 19:16:14,176 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:14,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:14,262 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 67 treesize of output 97 [2019-01-01 19:16:14,272 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 28 treesize of output 33 [2019-01-01 19:16:14,273 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:14,290 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:14,315 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:14,316 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:94, output treesize:110 [2019-01-01 19:16:14,409 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 151 treesize of output 115 [2019-01-01 19:16:14,415 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:16:14,416 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 124 treesize of output 153 [2019-01-01 19:16:14,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:14,444 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:14,492 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 128 treesize of output 106 [2019-01-01 19:16:14,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:16:14,499 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 74 treesize of output 129 [2019-01-01 19:16:14,500 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:14,524 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:14,557 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:16:14,557 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:169, output treesize:173 [2019-01-01 19:16:15,231 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 168 treesize of output 115 [2019-01-01 19:16:15,270 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:16:15,272 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 61 treesize of output 49 [2019-01-01 19:16:15,274 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:16:15,316 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 57 [2019-01-01 19:16:15,317 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:15,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:16:15,360 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 55 treesize of output 45 [2019-01-01 19:16:15,370 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:16:15,372 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 36 treesize of output 27 [2019-01-01 19:16:15,375 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:16:15,398 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 13 treesize of output 1 [2019-01-01 19:16:15,398 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:15,404 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:15,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-01 19:16:15,420 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:179, output treesize:21 [2019-01-01 19:16:37,184 WARN L181 SmtUtils]: Spent 1.05 s on a formula simplification that was a NOOP. DAG size: 37 [2019-01-01 19:16:37,214 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 187 treesize of output 147 [2019-01-01 19:16:37,221 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:16:37,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:16:37,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:16:37,228 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 172 treesize of output 204 [2019-01-01 19:16:37,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:37,268 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:37,324 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:16:37,334 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 169 treesize of output 123 [2019-01-01 19:16:37,339 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:16:37,340 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:16:37,341 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:16:37,345 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 89 treesize of output 180 [2019-01-01 19:16:37,346 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:37,377 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:37,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-01 19:16:37,422 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:228, output treesize:199 [2019-01-01 19:16:37,760 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 175 treesize of output 113 [2019-01-01 19:16:37,767 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 63 [2019-01-01 19:16:37,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:37,795 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:16:37,796 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 62 treesize of output 42 [2019-01-01 19:16:37,797 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:37,813 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:37,838 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 62 treesize of output 50 [2019-01-01 19:16:37,843 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 15 treesize of output 1 [2019-01-01 19:16:37,844 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:37,857 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:16:37,859 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 32 treesize of output 20 [2019-01-01 19:16:37,859 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:16:37,865 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:16:37,876 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:16:37,876 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 5 variables, input treesize:187, output treesize:23 [2019-01-01 19:16:38,037 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-01 19:16:38,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:16:38,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 51 [2019-01-01 19:16:38,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-01-01 19:16:38,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-01-01 19:16:38,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=2499, Unknown=16, NotChecked=0, Total=2652 [2019-01-01 19:16:38,058 INFO L87 Difference]: Start difference. First operand 132 states and 152 transitions. Second operand 52 states. [2019-01-01 19:16:40,249 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 69 [2019-01-01 19:16:40,580 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 103 [2019-01-01 19:16:41,371 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 84 [2019-01-01 19:16:44,070 WARN L181 SmtUtils]: Spent 2.49 s on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2019-01-01 19:16:44,454 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 95 [2019-01-01 19:16:53,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:16:53,985 INFO L93 Difference]: Finished difference Result 273 states and 307 transitions. [2019-01-01 19:16:53,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-01 19:16:53,988 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 56 [2019-01-01 19:16:53,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:16:53,990 INFO L225 Difference]: With dead ends: 273 [2019-01-01 19:16:53,990 INFO L226 Difference]: Without dead ends: 273 [2019-01-01 19:16:53,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1268 ImplicationChecksByTransitivity, 32.4s TimeCoverageRelationStatistics Valid=436, Invalid=6027, Unknown=17, NotChecked=0, Total=6480 [2019-01-01 19:16:53,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2019-01-01 19:16:54,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 146. [2019-01-01 19:16:54,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-01-01 19:16:54,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 170 transitions. [2019-01-01 19:16:54,001 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 170 transitions. Word has length 56 [2019-01-01 19:16:54,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:16:54,001 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 170 transitions. [2019-01-01 19:16:54,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-01-01 19:16:54,004 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 170 transitions. [2019-01-01 19:16:54,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-01-01 19:16:54,005 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:16:54,005 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:16:54,005 INFO L423 AbstractCegarLoop]: === Iteration 23 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:16:54,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:16:54,006 INFO L82 PathProgramCache]: Analyzing trace with hash -69118162, now seen corresponding path program 2 times [2019-01-01 19:16:54,006 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:16:54,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:16:54,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:16:54,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:16:54,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:16:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:16:54,504 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-01 19:16:54,505 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:16:54,505 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:16:54,525 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:16:54,663 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 19:16:54,663 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:16:54,668 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:16:54,675 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-01 19:16:54,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:16:54,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-01 19:16:54,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 19:16:54,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 19:16:54,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:16:54,710 INFO L87 Difference]: Start difference. First operand 146 states and 170 transitions. Second operand 7 states. [2019-01-01 19:16:54,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:16:54,843 INFO L93 Difference]: Finished difference Result 127 states and 142 transitions. [2019-01-01 19:16:54,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 19:16:54,844 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-01-01 19:16:54,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:16:54,846 INFO L225 Difference]: With dead ends: 127 [2019-01-01 19:16:54,846 INFO L226 Difference]: Without dead ends: 127 [2019-01-01 19:16:54,846 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-01 19:16:54,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-01-01 19:16:54,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2019-01-01 19:16:54,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2019-01-01 19:16:54,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 142 transitions. [2019-01-01 19:16:54,852 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 142 transitions. Word has length 59 [2019-01-01 19:16:54,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:16:54,853 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 142 transitions. [2019-01-01 19:16:54,854 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 19:16:54,855 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 142 transitions. [2019-01-01 19:16:54,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-01-01 19:16:54,855 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:16:54,855 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] [2019-01-01 19:16:54,856 INFO L423 AbstractCegarLoop]: === Iteration 24 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:16:54,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:16:54,856 INFO L82 PathProgramCache]: Analyzing trace with hash -258228541, now seen corresponding path program 2 times [2019-01-01 19:16:54,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:16:54,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:16:54,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:16:54,857 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:16:54,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:16:54,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:16:55,321 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-01 19:16:55,321 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:16:55,321 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:16:55,340 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:16:55,386 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-01 19:16:55,386 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:16:55,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:16:55,790 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-01 19:16:55,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 19:16:55,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 18 [2019-01-01 19:16:55,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-01-01 19:16:55,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-01-01 19:16:55,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-01-01 19:16:55,812 INFO L87 Difference]: Start difference. First operand 127 states and 142 transitions. Second operand 18 states. [2019-01-01 19:16:57,108 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-01 19:16:57,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:16:57,396 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2019-01-01 19:16:57,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-01 19:16:57,398 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 63 [2019-01-01 19:16:57,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:16:57,400 INFO L225 Difference]: With dead ends: 134 [2019-01-01 19:16:57,400 INFO L226 Difference]: Without dead ends: 134 [2019-01-01 19:16:57,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2019-01-01 19:16:57,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-01-01 19:16:57,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 129. [2019-01-01 19:16:57,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-01-01 19:16:57,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 142 transitions. [2019-01-01 19:16:57,406 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 142 transitions. Word has length 63 [2019-01-01 19:16:57,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:16:57,406 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 142 transitions. [2019-01-01 19:16:57,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-01-01 19:16:57,406 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 142 transitions. [2019-01-01 19:16:57,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-01-01 19:16:57,407 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:16:57,407 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:16:57,411 INFO L423 AbstractCegarLoop]: === Iteration 25 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:16:57,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:16:57,411 INFO L82 PathProgramCache]: Analyzing trace with hash 161940742, now seen corresponding path program 1 times [2019-01-01 19:16:57,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:16:57,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:16:57,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:16:57,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:16:57,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:16:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:16:57,653 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:16:57,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:16:57,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-01 19:16:57,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-01 19:16:57,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-01 19:16:57,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-01 19:16:57,656 INFO L87 Difference]: Start difference. First operand 129 states and 142 transitions. Second operand 5 states. [2019-01-01 19:16:58,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:16:58,146 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2019-01-01 19:16:58,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-01 19:16:58,148 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-01-01 19:16:58,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:16:58,149 INFO L225 Difference]: With dead ends: 136 [2019-01-01 19:16:58,150 INFO L226 Difference]: Without dead ends: 136 [2019-01-01 19:16:58,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-01-01 19:16:58,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-01 19:16:58,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2019-01-01 19:16:58,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-01-01 19:16:58,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2019-01-01 19:16:58,161 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 66 [2019-01-01 19:16:58,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:16:58,161 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2019-01-01 19:16:58,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-01 19:16:58,162 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2019-01-01 19:16:58,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-01-01 19:16:58,166 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:16:58,166 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-01 19:16:58,166 INFO L423 AbstractCegarLoop]: === Iteration 26 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:16:58,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:16:58,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1587558982, now seen corresponding path program 3 times [2019-01-01 19:16:58,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:16:58,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:16:58,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:16:58,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:16:58,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:16:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:16:58,652 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-01-01 19:16:58,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:16:58,653 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:16:58,673 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-01 19:16:59,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-01-01 19:16:59,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:16:59,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:16:59,179 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-01 19:16:59,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:16:59,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9] total 12 [2019-01-01 19:16:59,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:16:59,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:16:59,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:16:59,201 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand 12 states. [2019-01-01 19:16:59,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:16:59,335 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2019-01-01 19:16:59,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-01 19:16:59,336 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-01-01 19:16:59,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:16:59,337 INFO L225 Difference]: With dead ends: 120 [2019-01-01 19:16:59,337 INFO L226 Difference]: Without dead ends: 120 [2019-01-01 19:16:59,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-01-01 19:16:59,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-01 19:16:59,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2019-01-01 19:16:59,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-01 19:16:59,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2019-01-01 19:16:59,341 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 67 [2019-01-01 19:16:59,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:16:59,342 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2019-01-01 19:16:59,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:16:59,342 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2019-01-01 19:16:59,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-01-01 19:16:59,342 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:16:59,346 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-01 19:16:59,346 INFO L423 AbstractCegarLoop]: === Iteration 27 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:16:59,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:16:59,346 INFO L82 PathProgramCache]: Analyzing trace with hash -144279084, now seen corresponding path program 1 times [2019-01-01 19:16:59,347 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:16:59,347 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:16:59,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:16:59,348 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:16:59,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:16:59,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:16:59,805 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-01-01 19:16:59,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:16:59,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-01 19:16:59,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:16:59,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:16:59,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:16:59,806 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand 12 states. [2019-01-01 19:17:00,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:17:00,178 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2019-01-01 19:17:00,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 19:17:00,180 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 77 [2019-01-01 19:17:00,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:17:00,182 INFO L225 Difference]: With dead ends: 124 [2019-01-01 19:17:00,182 INFO L226 Difference]: Without dead ends: 124 [2019-01-01 19:17:00,182 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:17:00,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-01-01 19:17:00,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2019-01-01 19:17:00,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-01 19:17:00,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 129 transitions. [2019-01-01 19:17:00,186 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 129 transitions. Word has length 77 [2019-01-01 19:17:00,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:17:00,187 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 129 transitions. [2019-01-01 19:17:00,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:17:00,187 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 129 transitions. [2019-01-01 19:17:00,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-01 19:17:00,187 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:17:00,188 INFO L402 BasicCegarLoop]: trace histogram [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:17:00,188 INFO L423 AbstractCegarLoop]: === Iteration 28 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:17:00,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:17:00,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1044090536, now seen corresponding path program 1 times [2019-01-01 19:17:00,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:17:00,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:17:00,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:17:00,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:17:00,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:17:00,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:17:01,491 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 19:17:01,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:17:01,491 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:17:01,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:17:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:17:01,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:17:01,668 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:01,670 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:01,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2019-01-01 19:17:01,671 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:01,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:01,679 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-01-01 19:17:01,844 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:01,847 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:17:01,847 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:01,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:01,859 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:01,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-01-01 19:17:02,006 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:02,009 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:02,009 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:02,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:02,030 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:17:02,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-01-01 19:17:02,178 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:02,204 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:02,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:02,217 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:02,227 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:02,227 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-01 19:17:02,272 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:17:02,288 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:02,289 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:17:02,289 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:02,320 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:02,330 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:17:02,331 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2019-01-01 19:17:03,245 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:17:03,273 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 54 treesize of output 48 [2019-01-01 19:17:03,278 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:03,279 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:03,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:03,286 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:17:03,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:03,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:03,310 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:17:03,310 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:37 [2019-01-01 19:17:04,662 WARN L181 SmtUtils]: Spent 917.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 19:17:04,671 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:17:04,689 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:04,691 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 19:17:04,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:17:04,736 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:17:04,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:78 [2019-01-01 19:17:05,092 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:17:05,094 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:05,096 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:05,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:05,104 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:05,109 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:17:05,109 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2019-01-01 19:17:05,353 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 5 trivial. 2 not checked. [2019-01-01 19:17:05,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:17:05,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30] total 50 [2019-01-01 19:17:05,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-01 19:17:05,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-01 19:17:05,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=2309, Unknown=1, NotChecked=96, Total=2550 [2019-01-01 19:17:05,390 INFO L87 Difference]: Start difference. First operand 120 states and 129 transitions. Second operand 51 states. [2019-01-01 19:17:07,025 WARN L181 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 52 [2019-01-01 19:17:10,240 WARN L181 SmtUtils]: Spent 1.35 s on a formula simplification. DAG size of input: 37 DAG size of output: 20 [2019-01-01 19:17:11,683 WARN L181 SmtUtils]: Spent 988.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-01 19:17:14,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:17:14,328 INFO L93 Difference]: Finished difference Result 146 states and 153 transitions. [2019-01-01 19:17:14,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-01 19:17:14,331 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 80 [2019-01-01 19:17:14,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:17:14,333 INFO L225 Difference]: With dead ends: 146 [2019-01-01 19:17:14,333 INFO L226 Difference]: Without dead ends: 146 [2019-01-01 19:17:14,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 57 SyntacticMatches, 10 SemanticMatches, 73 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=402, Invalid=5003, Unknown=1, NotChecked=144, Total=5550 [2019-01-01 19:17:14,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-01-01 19:17:14,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 124. [2019-01-01 19:17:14,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-01-01 19:17:14,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2019-01-01 19:17:14,339 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 80 [2019-01-01 19:17:14,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:17:14,339 INFO L480 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2019-01-01 19:17:14,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-01 19:17:14,340 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2019-01-01 19:17:14,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-01-01 19:17:14,340 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:17:14,341 INFO L402 BasicCegarLoop]: trace histogram [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:17:14,341 INFO L423 AbstractCegarLoop]: === Iteration 29 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:17:14,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:17:14,341 INFO L82 PathProgramCache]: Analyzing trace with hash 1044090537, now seen corresponding path program 1 times [2019-01-01 19:17:14,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:17:14,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:17:14,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:17:14,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:17:14,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:17:14,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:17:16,424 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 8 proven. 17 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-01-01 19:17:16,425 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:17:16,425 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:17:16,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:17:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:17:16,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:17:16,911 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:16,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:16,914 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:16,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:16,919 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:16,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:8 [2019-01-01 19:17:16,994 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:16,998 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:17:16,998 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:17,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:17,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:17,009 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2019-01-01 19:17:17,105 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:17,111 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:17,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:17,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:17,138 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:17:17,139 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:21 [2019-01-01 19:17:17,302 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:17,305 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:17,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:17,325 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:17,336 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:17,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:32, output treesize:28 [2019-01-01 19:17:17,448 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:17:17,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:17,456 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:17:17,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:17,466 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:17,474 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:17:17,474 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:39, output treesize:35 [2019-01-01 19:17:18,419 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:17:18,430 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 54 treesize of output 48 [2019-01-01 19:17:18,434 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:18,436 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:18,439 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:18,446 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:17:18,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:18,459 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,470 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:17:18,471 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:57, output treesize:37 [2019-01-01 19:17:18,863 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 128 treesize of output 120 [2019-01-01 19:17:18,880 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 42 treesize of output 61 [2019-01-01 19:17:18,881 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 19:17:18,908 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:17:18,956 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 96 treesize of output 89 [2019-01-01 19:17:18,974 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 32 treesize of output 1 [2019-01-01 19:17:18,975 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:18,997 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:19,006 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 100 treesize of output 93 [2019-01-01 19:17:19,010 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 32 treesize of output 1 [2019-01-01 19:17:19,011 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:19,075 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:19,107 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 2 xjuncts. [2019-01-01 19:17:19,108 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:137, output treesize:108 [2019-01-01 19:17:19,649 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 34 [2019-01-01 19:17:19,652 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:19,653 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:17:19,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:19,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:19,668 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 28 treesize of output 22 [2019-01-01 19:17:19,671 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 22 treesize of output 13 [2019-01-01 19:17:19,671 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:19,676 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:19,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:19,682 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:60, output treesize:13 [2019-01-01 19:17:19,821 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2019-01-01 19:17:19,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:17:19,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 59 [2019-01-01 19:17:19,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-01-01 19:17:19,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-01-01 19:17:19,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3254, Unknown=3, NotChecked=114, Total=3540 [2019-01-01 19:17:19,842 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand 60 states. [2019-01-01 19:17:30,981 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 74 [2019-01-01 19:17:33,541 WARN L181 SmtUtils]: Spent 2.06 s on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-01-01 19:17:38,041 WARN L181 SmtUtils]: Spent 2.08 s on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-01-01 19:17:40,626 WARN L181 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-01-01 19:17:43,872 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2019-01-01 19:17:45,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:17:45,807 INFO L93 Difference]: Finished difference Result 145 states and 153 transitions. [2019-01-01 19:17:45,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-01 19:17:45,809 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 80 [2019-01-01 19:17:45,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:17:45,811 INFO L225 Difference]: With dead ends: 145 [2019-01-01 19:17:45,812 INFO L226 Difference]: Without dead ends: 145 [2019-01-01 19:17:45,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 53 SyntacticMatches, 6 SemanticMatches, 86 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1389 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=505, Invalid=6978, Unknown=3, NotChecked=170, Total=7656 [2019-01-01 19:17:45,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-01-01 19:17:45,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 123. [2019-01-01 19:17:45,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2019-01-01 19:17:45,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 133 transitions. [2019-01-01 19:17:45,819 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 133 transitions. Word has length 80 [2019-01-01 19:17:45,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:17:45,819 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 133 transitions. [2019-01-01 19:17:45,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-01-01 19:17:45,819 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 133 transitions. [2019-01-01 19:17:45,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-01-01 19:17:45,820 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:17:45,820 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,820 INFO L423 AbstractCegarLoop]: === Iteration 30 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:17:45,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:17:45,823 INFO L82 PathProgramCache]: Analyzing trace with hash 349687324, now seen corresponding path program 2 times [2019-01-01 19:17:45,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:17:45,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:17:45,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:17:45,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:17:45,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:17:45,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:17:46,328 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-01 19:17:46,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:17:46,328 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:17:46,342 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-01 19:17:46,458 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-01 19:17:46,458 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-01 19:17:46,461 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:17:46,471 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-01 19:17:46,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:17:46,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2019-01-01 19:17:46,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-01 19:17:46,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-01 19:17:46,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-01 19:17:46,503 INFO L87 Difference]: Start difference. First operand 123 states and 133 transitions. Second operand 7 states. [2019-01-01 19:17:46,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:17:46,604 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-01-01 19:17:46,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-01 19:17:46,605 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-01-01 19:17:46,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:17:46,606 INFO L225 Difference]: With dead ends: 114 [2019-01-01 19:17:46,608 INFO L226 Difference]: Without dead ends: 114 [2019-01-01 19:17:46,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-01 19:17:46,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-01 19:17:46,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-01 19:17:46,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-01 19:17:46,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2019-01-01 19:17:46,614 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 83 [2019-01-01 19:17:46,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:17:46,614 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2019-01-01 19:17:46,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-01 19:17:46,617 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2019-01-01 19:17:46,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-01-01 19:17:46,617 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:17:46,618 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] [2019-01-01 19:17:46,618 INFO L423 AbstractCegarLoop]: === Iteration 31 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:17:46,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:17:46,618 INFO L82 PathProgramCache]: Analyzing trace with hash -66085160, now seen corresponding path program 1 times [2019-01-01 19:17:46,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:17:46,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:17:46,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:17:46,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-01 19:17:46,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:17:46,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:17:46,786 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-01-01 19:17:46,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:17:46,786 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:46,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:17:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:17:46,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:17:46,898 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-01-01 19:17:46,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-01 19:17:46,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2019-01-01 19:17:46,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-01 19:17:46,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-01 19:17:46,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-01-01 19:17:46,919 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 9 states. [2019-01-01 19:17:47,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:17:47,073 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2019-01-01 19:17:47,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-01 19:17:47,075 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-01-01 19:17:47,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:17:47,076 INFO L225 Difference]: With dead ends: 120 [2019-01-01 19:17:47,077 INFO L226 Difference]: Without dead ends: 116 [2019-01-01 19:17:47,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-01-01 19:17:47,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-01 19:17:47,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2019-01-01 19:17:47,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-01 19:17:47,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 121 transitions. [2019-01-01 19:17:47,081 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 121 transitions. Word has length 88 [2019-01-01 19:17:47,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:17:47,081 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 121 transitions. [2019-01-01 19:17:47,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-01 19:17:47,082 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 121 transitions. [2019-01-01 19:17:47,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-01-01 19:17:47,082 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:17:47,085 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:17:47,085 INFO L423 AbstractCegarLoop]: === Iteration 32 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:17:47,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:17:47,085 INFO L82 PathProgramCache]: Analyzing trace with hash 2097097292, now seen corresponding path program 1 times [2019-01-01 19:17:47,085 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:17:47,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:17:47,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:17:47,086 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:17:47,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:17:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:17:48,148 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:17:48,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:17:48,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-01 19:17:48,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:17:48,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:17:48,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:17:48,150 INFO L87 Difference]: Start difference. First operand 114 states and 121 transitions. Second operand 12 states. [2019-01-01 19:17:48,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:17:48,610 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2019-01-01 19:17:48,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 19:17:48,612 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 91 [2019-01-01 19:17:48,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:17:48,613 INFO L225 Difference]: With dead ends: 112 [2019-01-01 19:17:48,614 INFO L226 Difference]: Without dead ends: 112 [2019-01-01 19:17:48,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-01 19:17:48,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-01 19:17:48,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-01-01 19:17:48,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-01 19:17:48,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 118 transitions. [2019-01-01 19:17:48,624 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 118 transitions. Word has length 91 [2019-01-01 19:17:48,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:17:48,624 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 118 transitions. [2019-01-01 19:17:48,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:17:48,624 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 118 transitions. [2019-01-01 19:17:48,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-01 19:17:48,625 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:17:48,625 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:17:48,631 INFO L423 AbstractCegarLoop]: === Iteration 33 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:17:48,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:17:48,631 INFO L82 PathProgramCache]: Analyzing trace with hash 31236951, now seen corresponding path program 1 times [2019-01-01 19:17:48,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:17:48,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:17:48,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:17:48,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:17:48,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:17:48,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:17:48,828 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-01-01 19:17:48,828 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:17:48,829 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:48,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:17:48,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:17:48,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:17:48,936 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:17:48,940 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:17:48,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:48,949 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:48,951 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:17:48,951 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-01-01 19:17:48,958 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-01-01 19:17:48,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:17:48,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2019-01-01 19:17:48,978 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-01 19:17:48,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-01 19:17:48,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-01-01 19:17:48,979 INFO L87 Difference]: Start difference. First operand 112 states and 118 transitions. Second operand 11 states. [2019-01-01 19:17:49,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:17:49,407 INFO L93 Difference]: Finished difference Result 132 states and 137 transitions. [2019-01-01 19:17:49,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-01-01 19:17:49,409 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2019-01-01 19:17:49,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:17:49,411 INFO L225 Difference]: With dead ends: 132 [2019-01-01 19:17:49,411 INFO L226 Difference]: Without dead ends: 132 [2019-01-01 19:17:49,411 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 93 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-01-01 19:17:49,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-01-01 19:17:49,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 112. [2019-01-01 19:17:49,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-01-01 19:17:49,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2019-01-01 19:17:49,416 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 94 [2019-01-01 19:17:49,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:17:49,416 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2019-01-01 19:17:49,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-01 19:17:49,417 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2019-01-01 19:17:49,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-01 19:17:49,417 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:17:49,417 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:17:49,423 INFO L423 AbstractCegarLoop]: === Iteration 34 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:17:49,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:17:49,423 INFO L82 PathProgramCache]: Analyzing trace with hash 31236952, now seen corresponding path program 1 times [2019-01-01 19:17:49,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:17:49,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:17:49,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:17:49,424 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:17:49,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:17:49,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:17:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 17 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-01-01 19:17:50,915 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:17:50,915 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:50,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:17:50,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:17:51,009 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:17:51,460 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:51,461 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:51,462 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:51,463 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:51,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:51,472 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-01-01 19:17:51,563 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:51,567 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:51,567 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:51,571 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:51,588 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:51,592 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:17:51,593 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:51,596 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:51,607 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:51,629 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2019-01-01 19:17:51,700 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:17:51,708 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:51,708 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:51,716 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:51,739 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:17:51,742 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:17:51,742 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:51,750 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:51,764 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:51,765 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:44, output treesize:40 [2019-01-01 19:17:51,899 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 60 [2019-01-01 19:17:51,904 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 22 treesize of output 34 [2019-01-01 19:17:51,904 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:51,919 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:51,944 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 79 treesize of output 58 [2019-01-01 19:17:51,949 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:17:51,949 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:51,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:51,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:51,983 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:78, output treesize:58 [2019-01-01 19:17:52,423 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:52,427 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 70 treesize of output 69 [2019-01-01 19:17:52,431 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:52,432 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 70 treesize of output 84 [2019-01-01 19:17:52,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:52,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:52,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:52,510 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 43 treesize of output 50 [2019-01-01 19:17:52,514 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:52,516 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 23 [2019-01-01 19:17:52,517 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:52,533 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:52,555 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:52,555 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:93, output treesize:96 [2019-01-01 19:17:54,032 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:54,039 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:54,040 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:54,045 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:54,048 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 95 treesize of output 98 [2019-01-01 19:17:54,054 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:54,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:54,109 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 101 treesize of output 121 [2019-01-01 19:17:54,111 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:54,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:54,192 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:54,199 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 68 treesize of output 67 [2019-01-01 19:17:54,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:54,204 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:54,215 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 48 treesize of output 50 [2019-01-01 19:17:54,216 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:54,231 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:54,251 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:17:54,252 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:127, output treesize:82 [2019-01-01 19:17:55,478 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:17:55,521 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:55,543 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:17:55,545 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 107 treesize of output 84 [2019-01-01 19:17:55,700 INFO L303 Elim1Store]: Index analysis took 152 ms [2019-01-01 19:17:55,876 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 65 treesize of output 74 [2019-01-01 19:17:55,883 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:17:56,639 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 66 treesize of output 70 [2019-01-01 19:17:56,641 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-01 19:17:56,658 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 56 treesize of output 42 [2019-01-01 19:17:56,658 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:56,689 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 66 treesize of output 62 [2019-01-01 19:17:56,690 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2019-01-01 19:17:56,716 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 62 treesize of output 66 [2019-01-01 19:17:56,717 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-01-01 19:17:56,860 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:17:56,963 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 49 treesize of output 42 [2019-01-01 19:17:56,999 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 31 treesize of output 35 [2019-01-01 19:17:57,000 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2019-01-01 19:17:57,034 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-01 19:17:57,041 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 49 treesize of output 42 [2019-01-01 19:17:57,068 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 31 treesize of output 35 [2019-01-01 19:17:57,069 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2019-01-01 19:17:57,105 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-01 19:17:57,113 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 49 treesize of output 42 [2019-01-01 19:17:57,144 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 31 treesize of output 35 [2019-01-01 19:17:57,145 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 4 xjuncts. [2019-01-01 19:17:57,178 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-01 19:17:57,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 49 treesize of output 46 [2019-01-01 19:17:57,213 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 31 treesize of output 35 [2019-01-01 19:17:57,214 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 4 xjuncts. [2019-01-01 19:17:57,252 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2019-01-01 19:17:57,466 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 12 dim-0 vars, and 13 xjuncts. [2019-01-01 19:17:57,466 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 3 variables, input treesize:117, output treesize:343 [2019-01-01 19:17:58,888 WARN L181 SmtUtils]: Spent 229.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-01 19:17:59,624 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 44 [2019-01-01 19:17:59,954 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 52 treesize of output 48 [2019-01-01 19:17:59,961 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:17:59,962 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:17:59,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:18:00,020 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:18:00,024 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:18:00,024 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:18:00,054 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:18:00,101 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:18:00,105 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:18:00,105 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:18:00,111 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:18:00,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:18:00,138 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:152, output treesize:11 [2019-01-01 19:18:00,311 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 13 refuted. 0 times theorem prover too weak. 6 trivial. 2 not checked. [2019-01-01 19:18:00,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:18:00,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 38] total 65 [2019-01-01 19:18:00,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2019-01-01 19:18:00,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2019-01-01 19:18:00,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=3830, Unknown=2, NotChecked=250, Total=4290 [2019-01-01 19:18:00,333 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 66 states. [2019-01-01 19:18:01,895 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 67 [2019-01-01 19:18:04,471 WARN L181 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2019-01-01 19:18:04,875 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-01-01 19:18:08,083 WARN L181 SmtUtils]: Spent 1.86 s on a formula simplification. DAG size of input: 28 DAG size of output: 21 [2019-01-01 19:18:08,803 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-01-01 19:18:11,252 WARN L181 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-01-01 19:18:11,961 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-01-01 19:18:14,183 WARN L181 SmtUtils]: Spent 2.14 s on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-01-01 19:18:14,531 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-01-01 19:18:14,883 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-01-01 19:18:15,134 WARN L181 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-01-01 19:18:15,831 WARN L181 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-01-01 19:18:16,271 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 73 [2019-01-01 19:18:16,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:18:16,542 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2019-01-01 19:18:16,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-01-01 19:18:16,545 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 94 [2019-01-01 19:18:16,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:18:16,546 INFO L225 Difference]: With dead ends: 129 [2019-01-01 19:18:16,546 INFO L226 Difference]: Without dead ends: 129 [2019-01-01 19:18:16,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 63 SyntacticMatches, 11 SemanticMatches, 92 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2097 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=567, Invalid=7810, Unknown=3, NotChecked=362, Total=8742 [2019-01-01 19:18:16,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-01 19:18:16,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 114. [2019-01-01 19:18:16,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-01 19:18:16,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 120 transitions. [2019-01-01 19:18:16,552 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 120 transitions. Word has length 94 [2019-01-01 19:18:16,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:18:16,552 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 120 transitions. [2019-01-01 19:18:16,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2019-01-01 19:18:16,552 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 120 transitions. [2019-01-01 19:18:16,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-01-01 19:18:16,553 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:18:16,553 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:18:16,557 INFO L423 AbstractCegarLoop]: === Iteration 35 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:18:16,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:18:16,557 INFO L82 PathProgramCache]: Analyzing trace with hash 63727722, now seen corresponding path program 1 times [2019-01-01 19:18:16,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:18:16,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:18:16,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:18:16,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:18:16,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:18:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:18:16,821 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:18:16,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:18:16,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-01 19:18:16,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:18:16,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:18:16,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:18:16,822 INFO L87 Difference]: Start difference. First operand 114 states and 120 transitions. Second operand 12 states. [2019-01-01 19:18:17,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:18:17,044 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2019-01-01 19:18:17,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 19:18:17,046 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2019-01-01 19:18:17,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:18:17,048 INFO L225 Difference]: With dead ends: 116 [2019-01-01 19:18:17,048 INFO L226 Difference]: Without dead ends: 114 [2019-01-01 19:18:17,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-01 19:18:17,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-01-01 19:18:17,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-01-01 19:18:17,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-01 19:18:17,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2019-01-01 19:18:17,051 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 94 [2019-01-01 19:18:17,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:18:17,052 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2019-01-01 19:18:17,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:18:17,052 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2019-01-01 19:18:17,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-01-01 19:18:17,053 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:18:17,053 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:18:17,053 INFO L423 AbstractCegarLoop]: === Iteration 36 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:18:17,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:18:17,053 INFO L82 PathProgramCache]: Analyzing trace with hash 968344146, now seen corresponding path program 1 times [2019-01-01 19:18:17,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:18:17,054 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:18:17,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:18:17,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:18:17,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:18:17,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:18:17,255 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:18:17,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-01 19:18:17,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-01-01 19:18:17,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-01 19:18:17,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-01 19:18:17,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-01-01 19:18:17,256 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand 12 states. [2019-01-01 19:18:17,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:18:17,647 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2019-01-01 19:18:17,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-01 19:18:17,649 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 95 [2019-01-01 19:18:17,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:18:17,651 INFO L225 Difference]: With dead ends: 113 [2019-01-01 19:18:17,651 INFO L226 Difference]: Without dead ends: 113 [2019-01-01 19:18:17,652 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2019-01-01 19:18:17,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-01-01 19:18:17,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-01-01 19:18:17,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-01-01 19:18:17,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2019-01-01 19:18:17,655 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 95 [2019-01-01 19:18:17,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:18:17,655 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2019-01-01 19:18:17,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-01 19:18:17,656 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2019-01-01 19:18:17,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-01 19:18:17,656 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:18:17,656 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:18:17,657 INFO L423 AbstractCegarLoop]: === Iteration 37 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:18:17,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:18:17,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1427754921, now seen corresponding path program 1 times [2019-01-01 19:18:17,657 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:18:17,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:18:17,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:18:17,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:18:17,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:18:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:18:18,809 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-01-01 19:18:18,809 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:18:18,809 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:18:18,822 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:18:18,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:18:18,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:18:18,923 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:18:18,923 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:18:18,932 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:18:18,932 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2019-01-01 19:18:18,999 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:18:19,001 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:18:19,003 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:18:19,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:18:19,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:18:19,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2019-01-01 19:18:19,086 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:18:19,090 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:18:19,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:18:19,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:18:19,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:18:19,102 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2019-01-01 19:18:19,153 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:18:19,155 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:18:19,156 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:18:19,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:18:19,172 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:18:19,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:26 [2019-01-01 19:18:19,408 WARN L181 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-01-01 19:18:19,496 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:18:19,536 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:18:19,536 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:18:19,662 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:18:19,801 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:18:19,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:33 [2019-01-01 19:18:19,858 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:18:19,861 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:18:19,863 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:18:19,864 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:18:19,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:18:19,885 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:18:19,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:44 [2019-01-01 19:18:20,123 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:18:20,126 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:18:20,127 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:18:20,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:18:20,135 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:18:20,135 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:18:20,139 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:18:20,141 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:18:20,141 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:47, output treesize:3 [2019-01-01 19:18:20,834 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:18:20,843 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 63 treesize of output 55 [2019-01-01 19:18:20,847 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:18:20,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:18:20,852 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:18:20,856 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 52 treesize of output 66 [2019-01-01 19:18:20,857 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:18:20,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:18:20,885 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:18:20,885 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:66, output treesize:46 [2019-01-01 19:18:20,945 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:18:20,948 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:18:20,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 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2019-01-01 19:18:20,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:18:20,958 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:18:20,958 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:18:20,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:18:20,963 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:18:20,963 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:47, output treesize:3 [2019-01-01 19:18:21,767 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:18:21,775 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:18:21,791 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:18:21,791 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 19:18:21,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:18:21,836 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:18:21,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:75, output treesize:78 [2019-01-01 19:18:22,915 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:18:22,917 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:18:22,919 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:18:22,921 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 19:18:22,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:18:22,950 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:18:22,950 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2019-01-01 19:18:22,981 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 2 not checked. [2019-01-01 19:18:23,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:18:23,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33] total 53 [2019-01-01 19:18:23,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-01 19:18:23,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-01 19:18:23,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=2502, Unknown=2, NotChecked=202, Total=2862 [2019-01-01 19:18:23,003 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand 54 states. [2019-01-01 19:18:28,098 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2019-01-01 19:18:30,026 WARN L181 SmtUtils]: Spent 1.41 s on a formula simplification. DAG size of input: 35 DAG size of output: 20 [2019-01-01 19:18:33,407 WARN L181 SmtUtils]: Spent 1.98 s on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2019-01-01 19:18:35,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:18:35,102 INFO L93 Difference]: Finished difference Result 117 states and 121 transitions. [2019-01-01 19:18:35,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-01 19:18:35,105 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 97 [2019-01-01 19:18:35,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:18:35,106 INFO L225 Difference]: With dead ends: 117 [2019-01-01 19:18:35,106 INFO L226 Difference]: Without dead ends: 117 [2019-01-01 19:18:35,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 71 SyntacticMatches, 13 SemanticMatches, 80 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1285 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=450, Invalid=5875, Unknown=3, NotChecked=314, Total=6642 [2019-01-01 19:18:35,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-01 19:18:35,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2019-01-01 19:18:35,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-01-01 19:18:35,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 118 transitions. [2019-01-01 19:18:35,111 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 118 transitions. Word has length 97 [2019-01-01 19:18:35,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:18:35,115 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 118 transitions. [2019-01-01 19:18:35,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-01 19:18:35,115 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2019-01-01 19:18:35,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-01 19:18:35,116 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:18:35,116 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:18:35,116 INFO L423 AbstractCegarLoop]: === Iteration 38 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:18:35,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:18:35,117 INFO L82 PathProgramCache]: Analyzing trace with hash -451355010, now seen corresponding path program 1 times [2019-01-01 19:18:35,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:18:35,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:18:35,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:18:35,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:18:35,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:18:35,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:18:35,999 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-01 19:18:35,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:18:35,999 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:18:36,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:18:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:18:36,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:18:36,185 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:18:36,186 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:18:36,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, 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:18:36,188 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:18:36,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:18:36,195 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2019-01-01 19:18:36,231 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:18:36,237 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:18:36,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:18:36,241 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:18:36,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:18:36,250 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-01-01 19:18:36,294 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:18:36,298 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:18:36,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:18:36,305 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:18:36,316 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:18:36,316 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:24 [2019-01-01 19:18:36,409 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:18:36,414 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:18:36,415 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:18:36,425 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:18:36,437 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:18:36,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:31 [2019-01-01 19:18:36,487 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:18:36,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:18:36,492 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:18:36,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:18:36,501 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:18:36,511 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:18:36,512 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:38 [2019-01-01 19:18:37,410 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:18:37,424 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 44 [2019-01-01 19:18:37,428 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:18:37,429 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:18:37,434 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 41 treesize of output 45 [2019-01-01 19:18:37,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:18:37,447 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:18:37,460 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:18:37,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:36 [2019-01-01 19:18:38,282 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:18:38,286 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:18:38,288 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:18:38,297 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:18:38,312 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:18:38,313 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 19:18:38,333 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:18:38,357 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:18:38,357 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:60 [2019-01-01 19:18:51,282 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 17 refuted. 0 times theorem prover too weak. 13 trivial. 2 not checked. [2019-01-01 19:18:51,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:18:51,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34] total 54 [2019-01-01 19:18:51,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2019-01-01 19:18:51,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2019-01-01 19:18:51,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=2488, Unknown=2, NotChecked=202, Total=2862 [2019-01-01 19:18:51,302 INFO L87 Difference]: Start difference. First operand 114 states and 118 transitions. Second operand 54 states. [2019-01-01 19:19:14,136 WARN L181 SmtUtils]: Spent 1.53 s on a formula simplification. DAG size of input: 37 DAG size of output: 20 [2019-01-01 19:19:23,335 WARN L181 SmtUtils]: Spent 1.83 s on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2019-01-01 19:19:26,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:19:26,910 INFO L93 Difference]: Finished difference Result 117 states and 120 transitions. [2019-01-01 19:19:26,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-01 19:19:26,913 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 100 [2019-01-01 19:19:26,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:19:26,914 INFO L225 Difference]: With dead ends: 117 [2019-01-01 19:19:26,914 INFO L226 Difference]: Without dead ends: 112 [2019-01-01 19:19:26,915 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 74 SyntacticMatches, 14 SemanticMatches, 75 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=437, Invalid=5116, Unknown=5, NotChecked=294, Total=5852 [2019-01-01 19:19:26,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-01-01 19:19:26,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2019-01-01 19:19:26,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-01-01 19:19:26,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 114 transitions. [2019-01-01 19:19:26,925 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 114 transitions. Word has length 100 [2019-01-01 19:19:26,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:19:26,925 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 114 transitions. [2019-01-01 19:19:26,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2019-01-01 19:19:26,925 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 114 transitions. [2019-01-01 19:19:26,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-01-01 19:19:26,926 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:19:26,926 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:19:26,926 INFO L423 AbstractCegarLoop]: === Iteration 39 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:19:26,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:19:26,927 INFO L82 PathProgramCache]: Analyzing trace with hash -1185512996, now seen corresponding path program 1 times [2019-01-01 19:19:26,927 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:19:26,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:19:26,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:19:26,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:19:26,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:19:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:19:28,738 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-01-01 19:19:28,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:19:28,739 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:19:28,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:19:28,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:19:28,830 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:19:29,052 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:29,053 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:29,055 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:19:29,057 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:29,070 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:19:29,070 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:25 [2019-01-01 19:19:29,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, 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:19:29,195 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:19:29,195 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:29,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:19:29,224 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:19:29,228 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:19:29,228 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:29,232 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:19:29,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:19:29,253 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2019-01-01 19:19:29,374 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 20 [2019-01-01 19:19:29,377 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:19:29,378 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:29,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:19:29,416 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 28 [2019-01-01 19:19:29,421 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:19:29,421 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:29,430 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:19:29,453 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:19:29,453 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:55, output treesize:55 [2019-01-01 19:19:29,617 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:29,621 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 73 treesize of output 63 [2019-01-01 19:19:29,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:29,626 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 45 treesize of output 55 [2019-01-01 19:19:29,626 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:29,648 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:19:29,689 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 34 treesize of output 48 [2019-01-01 19:19:29,696 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:29,697 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 18 treesize of output 27 [2019-01-01 19:19:29,697 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:29,710 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:19:29,738 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:19:29,738 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:96, output treesize:81 [2019-01-01 19:19:29,888 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:29,910 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:29,949 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:29,950 INFO L303 Elim1Store]: Index analysis took 120 ms [2019-01-01 19:19:29,951 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 106 treesize of output 105 [2019-01-01 19:19:29,961 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:29,978 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 114 treesize of output 153 [2019-01-01 19:19:29,980 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:19:30,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:19:30,072 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:30,082 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 85 [2019-01-01 19:19:30,087 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:30,088 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:19:30,089 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:30,107 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:19:30,138 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:19:30,139 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:125, output treesize:125 [2019-01-01 19:19:30,688 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:30,690 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:30,692 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 119 treesize of output 86 [2019-01-01 19:19:30,713 INFO L478 Elim1Store]: Elim1 applied some 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 44 [2019-01-01 19:19:30,714 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:19:30,747 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:30,749 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 38 treesize of output 28 [2019-01-01 19:19:30,750 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:19:30,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-01 19:19:30,801 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 31 treesize of output 27 [2019-01-01 19:19:30,806 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:30,807 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:19:30,808 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:30,819 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 11 treesize of output 1 [2019-01-01 19:19:30,819 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:30,822 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:19:30,837 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:19:30,837 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:131, output treesize:12 [2019-01-01 19:19:31,104 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:31,122 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 78 treesize of output 84 [2019-01-01 19:19:31,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:31,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:31,132 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:31,138 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 37 treesize of output 76 [2019-01-01 19:19:31,139 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:31,161 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:19:31,202 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:31,205 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:31,208 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:31,210 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 138 treesize of output 131 [2019-01-01 19:19:31,217 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:31,219 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:31,224 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:31,262 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 152 treesize of output 186 [2019-01-01 19:19:31,264 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:19:31,454 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:19:31,505 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:19:31,505 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:168, output treesize:142 [2019-01-01 19:19:31,588 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:31,590 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:31,591 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 119 treesize of output 86 [2019-01-01 19:19:31,597 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:31,613 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 52 [2019-01-01 19:19:31,615 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:19:31,697 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 62 treesize of output 60 [2019-01-01 19:19:31,698 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-01 19:19:31,702 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:31,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 62 [2019-01-01 19:19:31,714 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-01-01 19:19:31,719 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 56 treesize of output 40 [2019-01-01 19:19:31,719 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:31,725 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:31,733 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 60 [2019-01-01 19:19:31,735 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2019-01-01 19:19:31,854 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:19:31,939 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 36 [2019-01-01 19:19:31,943 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:31,944 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:19:31,944 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:31,958 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 11 treesize of output 1 [2019-01-01 19:19:31,959 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:31,965 INFO L267 ElimStorePlain]: Start of recursive call 8: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:19:31,969 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 32 [2019-01-01 19:19:31,973 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 11 treesize of output 1 [2019-01-01 19:19:31,973 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:31,985 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:31,987 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:19:31,987 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:31,994 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:19:31,997 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 36 [2019-01-01 19:19:32,001 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 11 treesize of output 1 [2019-01-01 19:19:32,001 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:32,015 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:32,017 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:19:32,017 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:32,024 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:19:32,027 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 36 [2019-01-01 19:19:32,031 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:32,032 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:19:32,032 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:32,045 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 11 treesize of output 1 [2019-01-01 19:19:32,045 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:32,052 INFO L267 ElimStorePlain]: Start of recursive call 17: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:19:32,082 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:19:32,082 INFO L202 ElimStorePlain]: Needed 19 recursive calls to eliminate 4 variables, input treesize:131, output treesize:12 [2019-01-01 19:19:32,365 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:32,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 79 [2019-01-01 19:19:32,376 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 11 treesize of output 1 [2019-01-01 19:19:32,377 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:32,393 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:32,394 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 48 treesize of output 34 [2019-01-01 19:19:32,395 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:32,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:19:32,430 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:32,433 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:32,435 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:32,439 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 88 treesize of output 87 [2019-01-01 19:19:32,466 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 102 [2019-01-01 19:19:32,467 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-01-01 19:19:32,498 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:19:32,517 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:19:32,517 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:169, output treesize:74 [2019-01-01 19:19:33,767 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:33,768 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 62 [2019-01-01 19:19:33,785 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:33,799 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 40 treesize of output 35 [2019-01-01 19:19:33,800 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:19:33,825 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 23 treesize of output 22 [2019-01-01 19:19:33,826 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2019-01-01 19:19:33,837 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:19:33,859 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:19:33,860 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:90, output treesize:35 [2019-01-01 19:19:34,117 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:34,118 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 12 treesize of output 21 [2019-01-01 19:19:34,118 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:34,126 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:19:34,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:11 [2019-01-01 19:19:34,255 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-01 19:19:34,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:19:34,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 39] total 70 [2019-01-01 19:19:34,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-01-01 19:19:34,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-01-01 19:19:34,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=4608, Unknown=0, NotChecked=0, Total=4830 [2019-01-01 19:19:34,276 INFO L87 Difference]: Start difference. First operand 111 states and 114 transitions. Second operand 70 states. [2019-01-01 19:19:36,168 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-01-01 19:19:36,531 WARN L181 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 79 [2019-01-01 19:19:37,943 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 47 [2019-01-01 19:19:39,263 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-01-01 19:19:39,599 WARN L181 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-01-01 19:19:39,883 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-01-01 19:19:40,257 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-01-01 19:19:40,616 WARN L181 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 79 [2019-01-01 19:19:40,990 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 61 [2019-01-01 19:19:41,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:19:41,513 INFO L93 Difference]: Finished difference Result 103 states and 105 transitions. [2019-01-01 19:19:41,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-01-01 19:19:41,515 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 100 [2019-01-01 19:19:41,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:19:41,516 INFO L225 Difference]: With dead ends: 103 [2019-01-01 19:19:41,520 INFO L226 Difference]: Without dead ends: 103 [2019-01-01 19:19:41,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 63 SyntacticMatches, 10 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2154 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=608, Invalid=8512, Unknown=0, NotChecked=0, Total=9120 [2019-01-01 19:19:41,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-01-01 19:19:41,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2019-01-01 19:19:41,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-01-01 19:19:41,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2019-01-01 19:19:41,525 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 100 [2019-01-01 19:19:41,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:19:41,526 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2019-01-01 19:19:41,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-01-01 19:19:41,526 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2019-01-01 19:19:41,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-01 19:19:41,527 INFO L394 BasicCegarLoop]: Found error trace [2019-01-01 19:19:41,527 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:19:41,527 INFO L423 AbstractCegarLoop]: === Iteration 40 === [dll_circular_destroyErr7ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr6ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr0REQUIRES_VIOLATION, dll_circular_destroyErr8ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr4ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr9ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr1REQUIRES_VIOLATION, dll_circular_destroyErr2REQUIRES_VIOLATION, dll_circular_destroyErr5ASSERT_VIOLATIONMEMORY_FREE, dll_circular_destroyErr3REQUIRES_VIOLATION, mainErr0ENSURES_VIOLATIONMEMORY_LEAK, dll_circular_createErr4REQUIRES_VIOLATION, dll_circular_createErr6REQUIRES_VIOLATION, dll_circular_createErr0REQUIRES_VIOLATION, dll_circular_createErr5REQUIRES_VIOLATION, dll_circular_createErr2REQUIRES_VIOLATION, dll_circular_createErr7REQUIRES_VIOLATION, dll_circular_createErr1REQUIRES_VIOLATION, dll_circular_createErr3REQUIRES_VIOLATION, dll_circular_update_atErr0REQUIRES_VIOLATION, dll_circular_update_atErr2REQUIRES_VIOLATION, dll_circular_update_atErr1REQUIRES_VIOLATION, dll_circular_update_atErr3REQUIRES_VIOLATION, node_createErr3REQUIRES_VIOLATION, node_createErr1REQUIRES_VIOLATION, node_createErr2REQUIRES_VIOLATION, node_createErr0REQUIRES_VIOLATION, node_createErr5REQUIRES_VIOLATION, node_createErr4REQUIRES_VIOLATION, dll_circular_get_data_atErr0REQUIRES_VIOLATION, dll_circular_get_data_atErr3REQUIRES_VIOLATION, dll_circular_get_data_atErr2REQUIRES_VIOLATION, dll_circular_get_data_atErr1REQUIRES_VIOLATION]=== [2019-01-01 19:19:41,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 19:19:41,527 INFO L82 PathProgramCache]: Analyzing trace with hash -2133785277, now seen corresponding path program 1 times [2019-01-01 19:19:41,528 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 19:19:41,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 19:19:41,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:19:41,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:19:41,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 19:19:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:19:41,950 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2019-01-01 19:19:42,250 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 14 [2019-01-01 19:19:43,693 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-01-01 19:19:43,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-01 19:19:43,694 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-01 19:19:43,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 19:19:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 19:19:43,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 19:19:44,065 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:19:44,084 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:19:44,084 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:40 [2019-01-01 19:19:44,792 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:19:44,795 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:19:44,796 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:44,801 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:19:44,819 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:19:44,820 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:47 [2019-01-01 19:19:44,904 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:44,911 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:19:44,915 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:19:44,916 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:44,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:19:44,944 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:19:44,944 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:57, output treesize:53 [2019-01-01 19:19:45,118 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:45,124 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:19:45,130 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:19:45,130 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:45,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:19:45,163 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:19:45,164 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:64, output treesize:60 [2019-01-01 19:19:45,245 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:45,253 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:19:45,257 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:45,258 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:19:45,258 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:45,271 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:19:45,293 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:19:45,293 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:75, output treesize:71 [2019-01-01 19:19:45,841 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:45,842 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:19:45,848 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:45,850 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:45,851 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:19:45,853 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 23 treesize of output 50 [2019-01-01 19:19:45,853 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:45,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:19:45,912 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 53 treesize of output 37 [2019-01-01 19:19:45,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:45,917 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 30 treesize of output 16 [2019-01-01 19:19:45,918 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:45,930 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:19:45,930 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:45,937 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:19:45,953 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:19:45,954 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:74, output treesize:18 [2019-01-01 19:19:53,461 WARN L181 SmtUtils]: Spent 722.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-01 19:19:53,476 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:53,482 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 67 treesize of output 65 [2019-01-01 19:19:53,486 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:53,488 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:53,489 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:53,493 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 62 treesize of output 78 [2019-01-01 19:19:53,493 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:53,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:19:53,540 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-01-01 19:19:53,540 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:107, output treesize:87 [2019-01-01 19:19:53,703 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:53,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 44 [2019-01-01 19:19:53,709 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:53,710 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:19:53,712 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:19:53,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:53,727 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:19:53,756 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 51 treesize of output 35 [2019-01-01 19:19:53,760 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:19:53,760 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:19:53,761 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:53,769 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:19:53,770 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-01 19:19:53,776 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:19:53,789 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:19:53,789 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 7 variables, input treesize:74, output treesize:18 [2019-01-01 19:20:03,680 WARN L181 SmtUtils]: Spent 986.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-01 19:20:03,687 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:20:03,694 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:20:03,711 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:20:03,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-01 19:20:03,733 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-01 19:20:03,782 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:20:03,783 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:116, output treesize:160 [2019-01-01 19:20:04,060 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:20:04,061 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:20:04,065 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:20:04,067 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:20:04,068 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:20:04,069 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 23 treesize of output 50 [2019-01-01 19:20:04,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:20:04,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:20:04,100 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:20:04,101 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:58, output treesize:44 [2019-01-01 19:20:04,373 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:20:04,375 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:20:04,379 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:20:04,382 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:20:04,384 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:20:04,386 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 23 treesize of output 50 [2019-01-01 19:20:04,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 19:20:04,403 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 19:20:04,420 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:20:04,421 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:58, output treesize:46 [2019-01-01 19:20:04,891 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:20:04,892 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-01 19:20:04,910 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:20:04,910 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:52, output treesize:31 [2019-01-01 19:20:07,351 WARN L181 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 28 [2019-01-01 19:20:18,109 WARN L181 SmtUtils]: Spent 2.50 s on a formula simplification that was a NOOP. DAG size: 31 [2019-01-01 19:20:20,117 WARN L860 $PredicateComparison]: unable to prove that (and (exists ((main_~s~0.offset Int) (v_main_~s~0.base_BEFORE_CALL_41 Int)) (let ((.cse1 (select |c_#memory_$Pointer$.base| v_main_~s~0.base_BEFORE_CALL_41))) (let ((.cse0 (select .cse1 main_~s~0.offset))) (and (not (= v_main_~s~0.base_BEFORE_CALL_41 .cse0)) (= .cse0 (select .cse1 (+ main_~s~0.offset 4))) (<= 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:20:20,132 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:20:20,136 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:20:20,138 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:20:20,139 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:20:20,140 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:20:20,183 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:20:20,184 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:20:20,185 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-01 19:20:20,219 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:20:20,220 INFO L683 Elim1Store]: detected equality via solver [2019-01-01 19:20:20,222 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 19:20:20,223 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2019-01-01 19:20:20,224 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:20:20,250 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:20:20,295 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:20:20,295 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:101, output treesize:75 [2019-01-01 19:20:49,935 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 9 proven. 16 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-01-01 19:20:49,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-01 19:20:49,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 38] total 66 [2019-01-01 19:20:49,955 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-01-01 19:20:49,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-01-01 19:20:49,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=4008, Unknown=48, NotChecked=128, Total=4422 [2019-01-01 19:20:49,956 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand 67 states. [2019-01-01 19:21:05,271 WARN L181 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 66 [2019-01-01 19:21:10,472 WARN L181 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 50 DAG size of output: 27 [2019-01-01 19:21:18,052 WARN L181 SmtUtils]: Spent 755.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-01 19:21:24,103 WARN L181 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 37 [2019-01-01 19:21:25,829 WARN L181 SmtUtils]: Spent 1.64 s on a formula simplification. DAG size of input: 56 DAG size of output: 33 [2019-01-01 19:21:32,160 WARN L181 SmtUtils]: Spent 983.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-01-01 19:21:44,795 WARN L181 SmtUtils]: Spent 1.46 s on a formula simplification. DAG size of input: 60 DAG size of output: 37 [2019-01-01 19:21:47,407 WARN L181 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 63 DAG size of output: 38 [2019-01-01 19:21:53,460 WARN L181 SmtUtils]: Spent 4.05 s on a formula simplification. DAG size of input: 45 DAG size of output: 35 [2019-01-01 19:22:00,124 WARN L181 SmtUtils]: Spent 5.23 s on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-01-01 19:22:06,109 WARN L181 SmtUtils]: Spent 5.18 s on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2019-01-01 19:22:13,433 WARN L181 SmtUtils]: Spent 6.12 s on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2019-01-01 19:22:13,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-01 19:22:13,434 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2019-01-01 19:22:13,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-01-01 19:22:13,434 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 106 [2019-01-01 19:22:13,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-01 19:22:13,435 INFO L225 Difference]: With dead ends: 101 [2019-01-01 19:22:13,435 INFO L226 Difference]: Without dead ends: 0 [2019-01-01 19:22:13,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 75 SyntacticMatches, 14 SemanticMatches, 89 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2261 ImplicationChecksByTransitivity, 104.3s TimeCoverageRelationStatistics Valid=556, Invalid=7404, Unknown=54, NotChecked=176, Total=8190 [2019-01-01 19:22:13,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-01 19:22:13,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-01 19:22:13,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-01 19:22:13,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-01 19:22:13,437 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 106 [2019-01-01 19:22:13,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-01 19:22:13,437 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 19:22:13,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-01-01 19:22:13,437 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-01 19:22:13,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-01 19:22:13,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.01 07:22:13 BoogieIcfgContainer [2019-01-01 19:22:13,443 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-01 19:22:13,444 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 19:22:13,444 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 19:22:13,444 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 19:22:13,445 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 07:15:08" (3/4) ... [2019-01-01 19:22:13,449 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-01 19:22:13,456 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-01 19:22:13,457 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-01-01 19:22:13,457 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_destroy [2019-01-01 19:22:13,457 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-01-01 19:22:13,457 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-01-01 19:22:13,457 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-01 19:22:13,458 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_create [2019-01-01 19:22:13,458 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_update_at [2019-01-01 19:22:13,458 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure node_create [2019-01-01 19:22:13,458 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure dll_circular_get_data_at [2019-01-01 19:22:13,465 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2019-01-01 19:22:13,465 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-01-01 19:22:13,466 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-01 19:22:13,542 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-01 19:22:13,542 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 19:22:13,543 INFO L168 Benchmark]: Toolchain (without parser) took 427527.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.4 MB). Free memory was 940.6 MB in the beginning and 832.9 MB in the end (delta: 107.7 MB). Peak memory consumption was 310.1 MB. Max. memory is 11.5 GB. [2019-01-01 19:22:13,543 INFO L168 Benchmark]: CDTParser took 1.30 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 19:22:13,544 INFO L168 Benchmark]: CACSL2BoogieTranslator took 654.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2019-01-01 19:22:13,544 INFO L168 Benchmark]: Boogie Preprocessor took 112.80 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-01 19:22:13,544 INFO L168 Benchmark]: RCFGBuilder took 1376.83 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: 57.6 MB). Peak memory consumption was 57.6 MB. Max. memory is 11.5 GB. [2019-01-01 19:22:13,550 INFO L168 Benchmark]: TraceAbstraction took 425281.47 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.8 MB). Free memory was 1.1 GB in the beginning and 832.9 MB in the end (delta: 219.3 MB). Peak memory consumption was 280.2 MB. Max. memory is 11.5 GB. [2019-01-01 19:22:13,551 INFO L168 Benchmark]: Witness Printer took 98.21 ms. Allocated memory is still 1.2 GB. Free memory was 832.9 MB in the beginning and 832.9 MB in the end (delta: 6.2 kB). Peak memory consumption was 6.2 kB. Max. memory is 11.5 GB. [2019-01-01 19:22:13,555 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.30 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 654.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.6 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -175.9 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 112.80 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1376.83 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: 57.6 MB). Peak memory consumption was 57.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 425281.47 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.8 MB). Free memory was 1.1 GB in the beginning and 832.9 MB in the end (delta: 219.3 MB). Peak memory consumption was 280.2 MB. Max. memory is 11.5 GB. * Witness Printer took 98.21 ms. Allocated memory is still 1.2 GB. Free memory was 832.9 MB in the beginning and 832.9 MB in the end (delta: 6.2 kB). Peak memory consumption was 6.2 kB. 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: 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: 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: 592]: pointer dereference always succeeds For all program executions holds that pointer dereference 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: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference 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: 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: 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: 581]: 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: 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: 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: 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: 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: 571]: 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 - PositiveResult [Line: 603]: 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.2s OverallTime, 40 OverallIterations, 3 TraceHistogramMax, 246.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 3158 SDtfs, 3907 SDslu, 18024 SDs, 0 SdLazy, 31726 SolverSat, 970 SolverUnsat, 95 SolverUnknown, 0 SolverNotchecked, 142.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2344 GetRequests, 1204 SyntacticMatches, 114 SemanticMatches, 1026 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 13786 ImplicationChecksByTransitivity, 259.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=146occurred in iteration=22, 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, 40 MinimizatonAttempts, 370 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.0s SatisfiabilityAnalysisTime, 174.2s InterpolantComputationTime, 3825 NumberOfCodeBlocks, 3798 NumberOfCodeBlocksAsserted, 65 NumberOfCheckSat, 3764 ConstructedInterpolants, 329 QuantifiedInterpolants, 3627565 SizeOfPredicates, 285 NumberOfNonLiveVariables, 7050 ConjunctsInSsa, 1081 ConjunctsInUnsatCore, 61 InterpolantComputations, 21 PerfectInterpolantSequences, 917/1280 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...