./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memcleanup.prp --file /storage/repos/svcomp/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 0ed9222f 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-properties/list_search_false-unreach-call_false-valid-memcleanup.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 9fdfa874c4a41b156e998d9e6fe5a8270aecd034 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 21:05:50,746 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 21:05:50,748 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 21:05:50,760 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 21:05:50,760 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 21:05:50,761 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 21:05:50,763 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 21:05:50,765 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 21:05:50,767 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 21:05:50,768 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 21:05:50,769 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 21:05:50,769 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 21:05:50,771 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 21:05:50,772 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 21:05:50,773 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 21:05:50,774 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 21:05:50,775 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 21:05:50,777 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 21:05:50,779 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 21:05:50,781 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 21:05:50,782 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 21:05:50,783 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 21:05:50,786 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 21:05:50,787 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 21:05:50,787 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 21:05:50,788 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 21:05:50,789 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 21:05:50,790 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 21:05:50,791 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 21:05:50,792 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 21:05:50,793 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 21:05:50,793 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 21:05:50,793 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 21:05:50,794 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 21:05:50,795 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 21:05:50,796 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 21:05:50,796 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-01-14 21:05:50,812 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 21:05:50,812 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 21:05:50,814 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 21:05:50,814 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 21:05:50,814 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 21:05:50,815 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 21:05:50,815 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 21:05:50,815 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 21:05:50,815 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 21:05:50,815 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 21:05:50,815 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 21:05:50,816 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 21:05:50,816 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 21:05:50,816 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 21:05:50,816 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 21:05:50,816 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 21:05:50,816 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 21:05:50,817 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 21:05:50,819 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 21:05:50,819 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 21:05:50,819 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 21:05:50,819 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 21:05:50,819 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 21:05:50,819 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 21:05:50,820 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-memcleanup) ) 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 -> 9fdfa874c4a41b156e998d9e6fe5a8270aecd034 [2019-01-14 21:05:50,879 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 21:05:50,896 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 21:05:50,902 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 21:05:50,904 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 21:05:50,905 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 21:05:50,906 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i [2019-01-14 21:05:50,966 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0aa5a6e4/298c97bd1af54dc383f0f22ca115ede9/FLAGa2e882e89 [2019-01-14 21:05:51,459 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 21:05:51,460 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i [2019-01-14 21:05:51,478 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0aa5a6e4/298c97bd1af54dc383f0f22ca115ede9/FLAGa2e882e89 [2019-01-14 21:05:51,780 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d0aa5a6e4/298c97bd1af54dc383f0f22ca115ede9 [2019-01-14 21:05:51,783 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 21:05:51,784 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 21:05:51,786 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 21:05:51,786 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 21:05:51,790 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 21:05:51,791 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 09:05:51" (1/1) ... [2019-01-14 21:05:51,794 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@158d50ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:05:51, skipping insertion in model container [2019-01-14 21:05:51,794 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 09:05:51" (1/1) ... [2019-01-14 21:05:51,802 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 21:05:51,844 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 21:05:52,231 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 21:05:52,246 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 21:05:52,397 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 21:05:52,460 INFO L195 MainTranslator]: Completed translation [2019-01-14 21:05:52,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:05:52 WrapperNode [2019-01-14 21:05:52,461 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 21:05:52,462 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 21:05:52,462 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 21:05:52,462 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 21:05:52,479 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:05:52" (1/1) ... [2019-01-14 21:05:52,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:05:52" (1/1) ... [2019-01-14 21:05:52,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:05:52" (1/1) ... [2019-01-14 21:05:52,496 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:05:52" (1/1) ... [2019-01-14 21:05:52,514 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:05:52" (1/1) ... [2019-01-14 21:05:52,521 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:05:52" (1/1) ... [2019-01-14 21:05:52,524 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:05:52" (1/1) ... [2019-01-14 21:05:52,533 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 21:05:52,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 21:05:52,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 21:05:52,534 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 21:05:52,534 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:05:52" (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-14 21:05:52,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 21:05:52,593 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 21:05:52,594 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-01-14 21:05:52,594 INFO L138 BoogieDeclarations]: Found implementation of procedure search_list [2019-01-14 21:05:52,594 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2019-01-14 21:05:52,594 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 21:05:52,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-01-14 21:05:52,594 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-01-14 21:05:52,595 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-01-14 21:05:52,595 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-01-14 21:05:52,595 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-01-14 21:05:52,595 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-01-14 21:05:52,595 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-01-14 21:05:52,596 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-01-14 21:05:52,596 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-01-14 21:05:52,596 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-01-14 21:05:52,596 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-01-14 21:05:52,596 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-01-14 21:05:52,596 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-01-14 21:05:52,596 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-01-14 21:05:52,597 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-01-14 21:05:52,597 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-01-14 21:05:52,597 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-01-14 21:05:52,597 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-01-14 21:05:52,597 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-01-14 21:05:52,597 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-01-14 21:05:52,597 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-01-14 21:05:52,598 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-01-14 21:05:52,600 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-01-14 21:05:52,600 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-01-14 21:05:52,600 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-01-14 21:05:52,600 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-01-14 21:05:52,600 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-01-14 21:05:52,601 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-01-14 21:05:52,601 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-01-14 21:05:52,601 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-01-14 21:05:52,601 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-01-14 21:05:52,601 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-01-14 21:05:52,601 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-01-14 21:05:52,601 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-01-14 21:05:52,601 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-01-14 21:05:52,601 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-01-14 21:05:52,602 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-01-14 21:05:52,602 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-01-14 21:05:52,602 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-01-14 21:05:52,602 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-01-14 21:05:52,602 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-01-14 21:05:52,602 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-01-14 21:05:52,602 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-01-14 21:05:52,602 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-01-14 21:05:52,603 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-01-14 21:05:52,604 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-01-14 21:05:52,604 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-01-14 21:05:52,604 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-01-14 21:05:52,604 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-01-14 21:05:52,604 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-01-14 21:05:52,604 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-01-14 21:05:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-01-14 21:05:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 21:05:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-01-14 21:05:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 21:05:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 21:05:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-01-14 21:05:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 21:05:52,606 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-01-14 21:05:52,606 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-01-14 21:05:52,606 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-01-14 21:05:52,606 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-01-14 21:05:52,606 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-01-14 21:05:52,607 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-01-14 21:05:52,607 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-01-14 21:05:52,607 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-01-14 21:05:52,607 INFO L130 BoogieDeclarations]: Found specification of procedure __secure_getenv [2019-01-14 21:05:52,607 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-01-14 21:05:52,607 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-01-14 21:05:52,608 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-01-14 21:05:52,608 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-01-14 21:05:52,608 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-01-14 21:05:52,608 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-01-14 21:05:52,608 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-01-14 21:05:52,608 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-01-14 21:05:52,609 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-01-14 21:05:52,609 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-01-14 21:05:52,609 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-01-14 21:05:52,609 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-01-14 21:05:52,609 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-01-14 21:05:52,609 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-01-14 21:05:52,610 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-01-14 21:05:52,610 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-01-14 21:05:52,610 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-01-14 21:05:52,610 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-01-14 21:05:52,610 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-01-14 21:05:52,610 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-01-14 21:05:52,610 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-01-14 21:05:52,611 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-01-14 21:05:52,612 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-01-14 21:05:52,612 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-01-14 21:05:52,612 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-01-14 21:05:52,612 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-01-14 21:05:52,613 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-01-14 21:05:52,613 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-01-14 21:05:52,613 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-01-14 21:05:52,613 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-01-14 21:05:52,614 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-01-14 21:05:52,615 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-01-14 21:05:52,615 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-01-14 21:05:52,615 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-01-14 21:05:52,615 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-01-14 21:05:52,615 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-01-14 21:05:52,615 INFO L130 BoogieDeclarations]: Found specification of procedure search_list [2019-01-14 21:05:52,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 21:05:52,615 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-01-14 21:05:52,616 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2019-01-14 21:05:52,617 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 21:05:52,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 21:05:52,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-01-14 21:05:52,617 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 21:05:52,617 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 21:05:52,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 21:05:52,618 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 21:05:53,338 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 21:05:53,339 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-14 21:05:53,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:05:53 BoogieIcfgContainer [2019-01-14 21:05:53,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 21:05:53,342 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 21:05:53,342 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 21:05:53,346 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 21:05:53,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 09:05:51" (1/3) ... [2019-01-14 21:05:53,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c4744b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 09:05:53, skipping insertion in model container [2019-01-14 21:05:53,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 09:05:52" (2/3) ... [2019-01-14 21:05:53,348 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c4744b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 09:05:53, skipping insertion in model container [2019-01-14 21:05:53,349 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:05:53" (3/3) ... [2019-01-14 21:05:53,351 INFO L112 eAbstractionObserver]: Analyzing ICFG list_search_false-unreach-call_false-valid-memcleanup.i [2019-01-14 21:05:53,362 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 21:05:53,371 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-01-14 21:05:53,390 INFO L257 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-01-14 21:05:53,420 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 21:05:53,421 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 21:05:53,421 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 21:05:53,421 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 21:05:53,422 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 21:05:53,422 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 21:05:53,423 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 21:05:53,423 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 21:05:53,423 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 21:05:53,452 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2019-01-14 21:05:53,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 21:05:53,469 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:05:53,471 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:05:53,473 INFO L423 AbstractCegarLoop]: === Iteration 1 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2019-01-14 21:05:53,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:05:53,487 INFO L82 PathProgramCache]: Analyzing trace with hash -777813511, now seen corresponding path program 1 times [2019-01-14 21:05:53,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:05:53,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:05:53,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:53,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:05:53,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:53,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:05:53,663 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-14 21:05:53,665 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:05:53,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 21:05:53,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 21:05:53,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 21:05:53,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:05:53,690 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2019-01-14 21:05:53,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:05:53,986 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2019-01-14 21:05:53,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 21:05:53,989 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-14 21:05:53,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:05:54,000 INFO L225 Difference]: With dead ends: 70 [2019-01-14 21:05:54,001 INFO L226 Difference]: Without dead ends: 66 [2019-01-14 21:05:54,003 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-14 21:05:54,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-01-14 21:05:54,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-01-14 21:05:54,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-01-14 21:05:54,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2019-01-14 21:05:54,052 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 9 [2019-01-14 21:05:54,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:05:54,053 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2019-01-14 21:05:54,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 21:05:54,053 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2019-01-14 21:05:54,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-01-14 21:05:54,054 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:05:54,054 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:05:54,055 INFO L423 AbstractCegarLoop]: === Iteration 2 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2019-01-14 21:05:54,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:05:54,055 INFO L82 PathProgramCache]: Analyzing trace with hash -777813510, now seen corresponding path program 1 times [2019-01-14 21:05:54,055 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:05:54,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:05:54,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:54,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:05:54,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:05:54,127 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-14 21:05:54,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:05:54,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 21:05:54,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 21:05:54,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 21:05:54,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 21:05:54,131 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 3 states. [2019-01-14 21:05:54,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:05:54,317 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2019-01-14 21:05:54,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 21:05:54,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-01-14 21:05:54,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:05:54,323 INFO L225 Difference]: With dead ends: 62 [2019-01-14 21:05:54,323 INFO L226 Difference]: Without dead ends: 62 [2019-01-14 21:05:54,325 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-14 21:05:54,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2019-01-14 21:05:54,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2019-01-14 21:05:54,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-01-14 21:05:54,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 68 transitions. [2019-01-14 21:05:54,346 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 68 transitions. Word has length 9 [2019-01-14 21:05:54,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:05:54,347 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 68 transitions. [2019-01-14 21:05:54,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 21:05:54,347 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 68 transitions. [2019-01-14 21:05:54,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-14 21:05:54,351 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:05:54,351 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 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-14 21:05:54,353 INFO L423 AbstractCegarLoop]: === Iteration 3 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2019-01-14 21:05:54,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:05:54,353 INFO L82 PathProgramCache]: Analyzing trace with hash 682600898, now seen corresponding path program 1 times [2019-01-14 21:05:54,354 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:05:54,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:05:54,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:54,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:05:54,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:54,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:05:54,604 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-01-14 21:05:54,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:05:54,605 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-14 21:05:54,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:05:54,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:05:54,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:05:55,019 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 29 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-01-14 21:05:55,050 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:05:55,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-01-14 21:05:55,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 21:05:55,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 21:05:55,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 21:05:55,053 INFO L87 Difference]: Start difference. First operand 62 states and 68 transitions. Second operand 6 states. [2019-01-14 21:05:56,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:05:56,044 INFO L93 Difference]: Finished difference Result 118 states and 131 transitions. [2019-01-14 21:05:56,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-14 21:05:56,046 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-01-14 21:05:56,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:05:56,049 INFO L225 Difference]: With dead ends: 118 [2019-01-14 21:05:56,049 INFO L226 Difference]: Without dead ends: 118 [2019-01-14 21:05:56,050 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 47 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-01-14 21:05:56,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-01-14 21:05:56,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 69. [2019-01-14 21:05:56,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-01-14 21:05:56,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 75 transitions. [2019-01-14 21:05:56,078 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 75 transitions. Word has length 47 [2019-01-14 21:05:56,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:05:56,078 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 75 transitions. [2019-01-14 21:05:56,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 21:05:56,078 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 75 transitions. [2019-01-14 21:05:56,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-14 21:05:56,081 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:05:56,081 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 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-14 21:05:56,081 INFO L423 AbstractCegarLoop]: === Iteration 4 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2019-01-14 21:05:56,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:05:56,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1975785787, now seen corresponding path program 1 times [2019-01-14 21:05:56,082 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:05:56,082 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:05:56,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:56,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:05:56,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:56,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:05:56,245 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-14 21:05:56,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:05:56,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 21:05:56,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 21:05:56,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 21:05:56,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:05:56,247 INFO L87 Difference]: Start difference. First operand 69 states and 75 transitions. Second operand 5 states. [2019-01-14 21:05:56,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:05:56,551 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2019-01-14 21:05:56,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 21:05:56,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-01-14 21:05:56,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:05:56,560 INFO L225 Difference]: With dead ends: 83 [2019-01-14 21:05:56,560 INFO L226 Difference]: Without dead ends: 83 [2019-01-14 21:05:56,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-14 21:05:56,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-01-14 21:05:56,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 74. [2019-01-14 21:05:56,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-01-14 21:05:56,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 85 transitions. [2019-01-14 21:05:56,575 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 85 transitions. Word has length 50 [2019-01-14 21:05:56,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:05:56,576 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 85 transitions. [2019-01-14 21:05:56,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 21:05:56,576 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 85 transitions. [2019-01-14 21:05:56,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-01-14 21:05:56,578 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:05:56,581 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 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-14 21:05:56,581 INFO L423 AbstractCegarLoop]: === Iteration 5 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2019-01-14 21:05:56,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:05:56,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1975785786, now seen corresponding path program 1 times [2019-01-14 21:05:56,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:05:56,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:05:56,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:56,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:05:56,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:05:56,769 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-14 21:05:56,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:05:56,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-14 21:05:56,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 21:05:56,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 21:05:56,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:05:56,771 INFO L87 Difference]: Start difference. First operand 74 states and 85 transitions. Second operand 5 states. [2019-01-14 21:05:57,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:05:57,021 INFO L93 Difference]: Finished difference Result 89 states and 99 transitions. [2019-01-14 21:05:57,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 21:05:57,022 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-01-14 21:05:57,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:05:57,024 INFO L225 Difference]: With dead ends: 89 [2019-01-14 21:05:57,024 INFO L226 Difference]: Without dead ends: 89 [2019-01-14 21:05:57,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-01-14 21:05:57,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-14 21:05:57,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2019-01-14 21:05:57,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-14 21:05:57,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 89 transitions. [2019-01-14 21:05:57,034 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 89 transitions. Word has length 50 [2019-01-14 21:05:57,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:05:57,034 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 89 transitions. [2019-01-14 21:05:57,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 21:05:57,035 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 89 transitions. [2019-01-14 21:05:57,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-01-14 21:05:57,036 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:05:57,036 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 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-14 21:05:57,036 INFO L423 AbstractCegarLoop]: === Iteration 6 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2019-01-14 21:05:57,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:05:57,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1173083155, now seen corresponding path program 1 times [2019-01-14 21:05:57,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:05:57,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:05:57,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:57,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:05:57,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:05:57,636 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-14 21:05:57,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:05:57,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 21:05:57,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 21:05:57,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 21:05:57,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-01-14 21:05:57,638 INFO L87 Difference]: Start difference. First operand 79 states and 89 transitions. Second operand 7 states. [2019-01-14 21:05:57,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:05:57,978 INFO L93 Difference]: Finished difference Result 89 states and 98 transitions. [2019-01-14 21:05:57,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 21:05:57,984 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-01-14 21:05:57,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:05:57,986 INFO L225 Difference]: With dead ends: 89 [2019-01-14 21:05:57,986 INFO L226 Difference]: Without dead ends: 89 [2019-01-14 21:05:57,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-01-14 21:05:57,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-14 21:05:57,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 79. [2019-01-14 21:05:57,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-01-14 21:05:57,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 88 transitions. [2019-01-14 21:05:57,995 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 88 transitions. Word has length 55 [2019-01-14 21:05:57,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:05:57,996 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 88 transitions. [2019-01-14 21:05:57,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 21:05:57,996 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2019-01-14 21:05:57,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-14 21:05:57,999 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:05:57,999 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 21:05:57,999 INFO L423 AbstractCegarLoop]: === Iteration 7 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2019-01-14 21:05:58,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:05:58,001 INFO L82 PathProgramCache]: Analyzing trace with hash -13160950, now seen corresponding path program 1 times [2019-01-14 21:05:58,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:05:58,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:05:58,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:58,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:05:58,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:58,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:05:58,367 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-01-14 21:05:58,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:05:58,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 21:05:58,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 21:05:58,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 21:05:58,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 21:05:58,368 INFO L87 Difference]: Start difference. First operand 79 states and 88 transitions. Second operand 6 states. [2019-01-14 21:05:58,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:05:58,602 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2019-01-14 21:05:58,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 21:05:58,602 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-01-14 21:05:58,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:05:58,604 INFO L225 Difference]: With dead ends: 89 [2019-01-14 21:05:58,604 INFO L226 Difference]: Without dead ends: 89 [2019-01-14 21:05:58,604 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 21:05:58,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2019-01-14 21:05:58,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 84. [2019-01-14 21:05:58,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-01-14 21:05:58,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2019-01-14 21:05:58,611 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 57 [2019-01-14 21:05:58,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:05:58,612 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2019-01-14 21:05:58,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 21:05:58,612 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2019-01-14 21:05:58,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-14 21:05:58,613 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:05:58,613 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 21:05:58,614 INFO L423 AbstractCegarLoop]: === Iteration 8 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2019-01-14 21:05:58,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:05:58,614 INFO L82 PathProgramCache]: Analyzing trace with hash -13160949, now seen corresponding path program 1 times [2019-01-14 21:05:58,614 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:05:58,614 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:05:58,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:58,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:05:58,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:58,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:05:58,821 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-14 21:05:58,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:05:58,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-14 21:05:58,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 21:05:58,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 21:05:58,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-01-14 21:05:58,823 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand 8 states. [2019-01-14 21:05:59,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:05:59,219 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2019-01-14 21:05:59,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 21:05:59,220 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 57 [2019-01-14 21:05:59,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:05:59,222 INFO L225 Difference]: With dead ends: 117 [2019-01-14 21:05:59,222 INFO L226 Difference]: Without dead ends: 117 [2019-01-14 21:05:59,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-01-14 21:05:59,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-01-14 21:05:59,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 89. [2019-01-14 21:05:59,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-01-14 21:05:59,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 99 transitions. [2019-01-14 21:05:59,229 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 99 transitions. Word has length 57 [2019-01-14 21:05:59,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:05:59,230 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 99 transitions. [2019-01-14 21:05:59,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 21:05:59,230 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 99 transitions. [2019-01-14 21:05:59,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-14 21:05:59,231 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:05:59,231 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:05:59,232 INFO L423 AbstractCegarLoop]: === Iteration 9 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2019-01-14 21:05:59,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:05:59,232 INFO L82 PathProgramCache]: Analyzing trace with hash 37376632, now seen corresponding path program 1 times [2019-01-14 21:05:59,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:05:59,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:05:59,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:59,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:05:59,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:05:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:06:00,000 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 24 proven. 16 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 21:06:00,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:06:00,000 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-14 21:06:00,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:06:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:06:00,092 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:06:00,376 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 21:06:00,381 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 21:06:00,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:06:00,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:00,400 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:00,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-01-14 21:06:00,497 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:06:00,499 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:06:00,500 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 23 treesize of output 39 [2019-01-14 21:06:00,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 21:06:00,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:00,516 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2019-01-14 21:06:00,598 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 25 treesize of output 19 [2019-01-14 21:06:00,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 19 treesize of output 10 [2019-01-14 21:06:00,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:06:00,676 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:00,707 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-14 21:06:00,707 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:15 [2019-01-14 21:06:00,877 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 32 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-01-14 21:06:00,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:06:00,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11] total 20 [2019-01-14 21:06:00,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-01-14 21:06:00,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-01-14 21:06:00,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2019-01-14 21:06:00,900 INFO L87 Difference]: Start difference. First operand 89 states and 99 transitions. Second operand 21 states. [2019-01-14 21:06:02,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:06:02,346 INFO L93 Difference]: Finished difference Result 116 states and 128 transitions. [2019-01-14 21:06:02,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-14 21:06:02,347 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 57 [2019-01-14 21:06:02,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:06:02,349 INFO L225 Difference]: With dead ends: 116 [2019-01-14 21:06:02,349 INFO L226 Difference]: Without dead ends: 116 [2019-01-14 21:06:02,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 50 SyntacticMatches, 4 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=191, Invalid=931, Unknown=0, NotChecked=0, Total=1122 [2019-01-14 21:06:02,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-14 21:06:02,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 96. [2019-01-14 21:06:02,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-01-14 21:06:02,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 108 transitions. [2019-01-14 21:06:02,360 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 108 transitions. Word has length 57 [2019-01-14 21:06:02,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:06:02,361 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 108 transitions. [2019-01-14 21:06:02,361 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-01-14 21:06:02,361 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 108 transitions. [2019-01-14 21:06:02,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-01-14 21:06:02,363 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:06:02,363 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:06:02,364 INFO L423 AbstractCegarLoop]: === Iteration 10 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2019-01-14 21:06:02,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:06:02,364 INFO L82 PathProgramCache]: Analyzing trace with hash 37376633, now seen corresponding path program 1 times [2019-01-14 21:06:02,364 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:06:02,364 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:06:02,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:06:02,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:06:02,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:06:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:06:03,121 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 13 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-01-14 21:06:03,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:06:03,121 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-14 21:06:03,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:06:03,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:06:03,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:06:03,218 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-14 21:06:03,219 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 21:06:03,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:03,229 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 21:06:03,380 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 21:06:03,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 21:06:03,383 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:06:03,385 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:03,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 21:06:03,401 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 21:06:03,401 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 21:06:03,403 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:03,413 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:03,413 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:36, output treesize:28 [2019-01-14 21:06:03,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, 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-14 21:06:03,487 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 21:06:03,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:03,494 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 [2019-01-14 21:06:03,581 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-14 21:06:03,585 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-14 21:06:03,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:06:03,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:03,598 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 15 treesize of output 11 [2019-01-14 21:06:03,607 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 11 treesize of output 3 [2019-01-14 21:06:03,608 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 21:06:03,609 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:03,616 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-14 21:06:03,616 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:36, output treesize:14 [2019-01-14 21:06:03,648 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-14 21:06:03,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:06:03,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 21 [2019-01-14 21:06:03,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-01-14 21:06:03,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-01-14 21:06:03,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-01-14 21:06:03,669 INFO L87 Difference]: Start difference. First operand 96 states and 108 transitions. Second operand 22 states. [2019-01-14 21:06:06,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:06:06,155 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2019-01-14 21:06:06,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-14 21:06:06,156 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2019-01-14 21:06:06,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:06:06,159 INFO L225 Difference]: With dead ends: 120 [2019-01-14 21:06:06,159 INFO L226 Difference]: Without dead ends: 120 [2019-01-14 21:06:06,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 48 SyntacticMatches, 8 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=248, Invalid=1158, Unknown=0, NotChecked=0, Total=1406 [2019-01-14 21:06:06,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-01-14 21:06:06,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 99. [2019-01-14 21:06:06,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-01-14 21:06:06,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2019-01-14 21:06:06,166 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 57 [2019-01-14 21:06:06,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:06:06,166 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2019-01-14 21:06:06,166 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-01-14 21:06:06,166 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2019-01-14 21:06:06,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-01-14 21:06:06,167 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:06:06,168 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:06:06,168 INFO L423 AbstractCegarLoop]: === Iteration 11 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2019-01-14 21:06:06,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:06:06,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1490294810, now seen corresponding path program 1 times [2019-01-14 21:06:06,168 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:06:06,168 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:06:06,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:06:06,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:06:06,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:06:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:06:06,708 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2019-01-14 21:06:07,329 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 25 proven. 12 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-14 21:06:07,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:06:07,329 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-14 21:06:07,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:06:07,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:06:07,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:06:07,759 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 21 treesize of output 18 [2019-01-14 21:06:07,762 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-14 21:06:07,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:06:07,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:07,794 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 21 treesize of output 18 [2019-01-14 21:06:07,797 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 21:06:07,798 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 21:06:07,803 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:07,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 21:06:07,821 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:43, output treesize:23 [2019-01-14 21:06:08,216 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-14 21:06:08,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:06:08,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14] total 23 [2019-01-14 21:06:08,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-01-14 21:06:08,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-01-14 21:06:08,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2019-01-14 21:06:08,236 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 23 states. [2019-01-14 21:06:09,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:06:09,614 INFO L93 Difference]: Finished difference Result 116 states and 127 transitions. [2019-01-14 21:06:09,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-14 21:06:09,616 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 62 [2019-01-14 21:06:09,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:06:09,617 INFO L225 Difference]: With dead ends: 116 [2019-01-14 21:06:09,617 INFO L226 Difference]: Without dead ends: 116 [2019-01-14 21:06:09,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 55 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=269, Invalid=1213, Unknown=0, NotChecked=0, Total=1482 [2019-01-14 21:06:09,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-01-14 21:06:09,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2019-01-14 21:06:09,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-01-14 21:06:09,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 108 transitions. [2019-01-14 21:06:09,625 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 108 transitions. Word has length 62 [2019-01-14 21:06:09,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:06:09,626 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 108 transitions. [2019-01-14 21:06:09,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-01-14 21:06:09,626 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2019-01-14 21:06:09,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-14 21:06:09,629 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:06:09,629 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 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-14 21:06:09,630 INFO L423 AbstractCegarLoop]: === Iteration 12 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2019-01-14 21:06:09,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:06:09,630 INFO L82 PathProgramCache]: Analyzing trace with hash -307445000, now seen corresponding path program 1 times [2019-01-14 21:06:09,630 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:06:09,630 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:06:09,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:06:09,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:06:09,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:06:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:06:10,192 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-14 21:06:10,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:06:10,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 21:06:10,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 21:06:10,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 21:06:10,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-01-14 21:06:10,194 INFO L87 Difference]: Start difference. First operand 98 states and 108 transitions. Second operand 6 states. [2019-01-14 21:06:10,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:06:10,753 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2019-01-14 21:06:10,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 21:06:10,754 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-01-14 21:06:10,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:06:10,755 INFO L225 Difference]: With dead ends: 100 [2019-01-14 21:06:10,755 INFO L226 Difference]: Without dead ends: 100 [2019-01-14 21:06:10,756 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-01-14 21:06:10,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-01-14 21:06:10,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2019-01-14 21:06:10,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-01-14 21:06:10,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2019-01-14 21:06:10,759 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 64 [2019-01-14 21:06:10,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:06:10,760 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2019-01-14 21:06:10,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 21:06:10,760 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2019-01-14 21:06:10,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-14 21:06:10,761 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:06:10,761 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:06:10,762 INFO L423 AbstractCegarLoop]: === Iteration 13 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2019-01-14 21:06:10,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:06:10,762 INFO L82 PathProgramCache]: Analyzing trace with hash -256907419, now seen corresponding path program 2 times [2019-01-14 21:06:10,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:06:10,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:06:10,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:06:10,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:06:10,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:06:10,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:06:11,561 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 51 [2019-01-14 21:06:11,923 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 24 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 21:06:11,924 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:06:11,924 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-14 21:06:11,941 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:06:12,017 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:06:12,017 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:06:12,033 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:06:12,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 21:06:12,194 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 21:06:12,194 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:06:12,200 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:12,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:12,207 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2019-01-14 21:06:12,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 17 [2019-01-14 21:06:12,291 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 21:06:12,296 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:12,296 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:20 [2019-01-14 21:06:12,451 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:06:12,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:12,465 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:12,466 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:51, output treesize:36 [2019-01-14 21:06:12,470 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-14 21:06:12,477 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 21:06:12,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 21:06:12,500 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 21:06:12,501 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 21:06:12,504 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:12,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 21:06:12,526 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:56, output treesize:40 [2019-01-14 21:06:13,302 WARN L181 SmtUtils]: Spent 462.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 21:06:13,917 WARN L181 SmtUtils]: Spent 457.00 ms on a formula simplification that was a NOOP. DAG size: 29 [2019-01-14 21:06:13,932 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:06:13,933 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:06:13,935 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:06:13,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 48 [2019-01-14 21:06:13,937 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 21:06:13,965 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 38 treesize of output 39 [2019-01-14 21:06:13,969 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-14 21:06:13,972 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:06:13,974 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 16 treesize of output 23 [2019-01-14 21:06:13,974 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 21:06:13,979 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:13,990 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:14,006 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:14,007 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:56, output treesize:62 [2019-01-14 21:06:14,167 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 15 treesize of output 11 [2019-01-14 21:06:14,179 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 11 treesize of output 3 [2019-01-14 21:06:14,179 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:06:14,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:14,366 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-14 21:06:14,367 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:65, output treesize:54 [2019-01-14 21:06:14,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:06:14,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 41 [2019-01-14 21:06:14,616 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 21:06:14,617 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2019-01-14 21:06:14,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:06:14,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 14 treesize of output 10 [2019-01-14 21:06:14,648 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-14 21:06:14,656 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-14 21:06:14,669 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 21:06:14,670 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:55, output treesize:24 [2019-01-14 21:06:14,772 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 40 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 21:06:14,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:06:14,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19] total 35 [2019-01-14 21:06:14,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-01-14 21:06:14,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-01-14 21:06:14,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1131, Unknown=0, NotChecked=0, Total=1260 [2019-01-14 21:06:14,801 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand 36 states. [2019-01-14 21:06:17,034 WARN L181 SmtUtils]: Spent 1.87 s on a formula simplification. DAG size of input: 46 DAG size of output: 37 [2019-01-14 21:06:18,081 WARN L181 SmtUtils]: Spent 998.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 35 [2019-01-14 21:06:20,234 WARN L181 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 48 DAG size of output: 39 [2019-01-14 21:06:21,296 WARN L181 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2019-01-14 21:06:23,302 WARN L181 SmtUtils]: Spent 1.70 s on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-01-14 21:06:24,389 WARN L181 SmtUtils]: Spent 1.05 s on a formula simplification. DAG size of input: 60 DAG size of output: 45 [2019-01-14 21:06:26,909 WARN L181 SmtUtils]: Spent 2.00 s on a formula simplification. DAG size of input: 61 DAG size of output: 52 [2019-01-14 21:06:28,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:06:28,155 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2019-01-14 21:06:28,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-14 21:06:28,157 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 64 [2019-01-14 21:06:28,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:06:28,158 INFO L225 Difference]: With dead ends: 132 [2019-01-14 21:06:28,158 INFO L226 Difference]: Without dead ends: 132 [2019-01-14 21:06:28,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 52 SyntacticMatches, 9 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 905 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=468, Invalid=2954, Unknown=0, NotChecked=0, Total=3422 [2019-01-14 21:06:28,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-01-14 21:06:28,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 106. [2019-01-14 21:06:28,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-01-14 21:06:28,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2019-01-14 21:06:28,164 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 64 [2019-01-14 21:06:28,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:06:28,165 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2019-01-14 21:06:28,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-01-14 21:06:28,165 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2019-01-14 21:06:28,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-14 21:06:28,168 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:06:28,168 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:06:28,169 INFO L423 AbstractCegarLoop]: === Iteration 14 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2019-01-14 21:06:28,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:06:28,171 INFO L82 PathProgramCache]: Analyzing trace with hash -256907418, now seen corresponding path program 2 times [2019-01-14 21:06:28,171 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:06:28,171 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:06:28,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:06:28,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:06:28,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:06:28,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:06:29,473 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-01-14 21:06:29,964 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 20 proven. 34 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 21:06:29,964 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:06:29,964 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-14 21:06:29,979 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:06:30,041 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:06:30,042 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:06:30,048 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:06:30,052 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-14 21:06:30,052 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 21:06:30,063 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:30,063 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 21:06:30,221 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 21:06:30,224 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 21:06:30,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:06:30,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:30,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 21:06:30,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 21:06:30,248 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 21:06:30,251 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:30,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:30,267 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:46, output treesize:38 [2019-01-14 21:06:30,388 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:06:30,389 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:06:30,390 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 17 treesize of output 10 [2019-01-14 21:06:30,390 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 21:06:30,405 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-14 21:06:30,405 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:06:30,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:30,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:51, output treesize:44 [2019-01-14 21:06:30,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:06:30,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:30,685 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 21:06:30,688 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:30,705 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:30,706 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:81, output treesize:51 [2019-01-14 21:06:30,709 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-14 21:06:30,717 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 21:06:30,740 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-14 21:06:30,743 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 21:06:30,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 21:06:30,756 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:83, output treesize:47 [2019-01-14 21:06:36,825 WARN L181 SmtUtils]: Spent 1.45 s on a formula simplification that was a NOOP. DAG size: 35 [2019-01-14 21:06:39,071 WARN L181 SmtUtils]: Spent 1.33 s on a formula simplification that was a NOOP. DAG size: 35 [2019-01-14 21:06:39,090 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:06:39,091 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 32 [2019-01-14 21:06:39,092 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 21:06:39,129 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:06:39,130 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:06:39,131 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-14 21:06:39,131 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:06:39,159 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:06:39,160 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 34 treesize of output 49 [2019-01-14 21:06:39,166 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-01-14 21:06:39,169 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:06:39,172 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 27 treesize of output 31 [2019-01-14 21:06:39,173 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 21:06:39,181 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:39,192 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:39,220 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:06:39,224 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 24 treesize of output 31 [2019-01-14 21:06:39,227 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-14 21:06:39,230 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:06:39,232 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-14 21:06:39,233 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 21:06:39,238 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:39,246 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:39,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:39,271 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:81, output treesize:77 [2019-01-14 21:06:39,770 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:06:39,771 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:06:39,772 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 84 treesize of output 73 [2019-01-14 21:06:39,785 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 21:06:39,830 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 31 treesize of output 41 [2019-01-14 21:06:39,832 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-14 21:06:39,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 39 [2019-01-14 21:06:39,861 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-14 21:06:39,870 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-14 21:06:40,112 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-01-14 21:06:40,134 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 5 [2019-01-14 21:06:40,134 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 21:06:40,239 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 11 treesize of output 3 [2019-01-14 21:06:40,240 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 21:06:40,266 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:06:40,357 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 21:06:40,357 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:96, output treesize:27 [2019-01-14 21:06:40,535 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 29 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 21:06:40,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:06:40,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21] total 38 [2019-01-14 21:06:40,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-01-14 21:06:40,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-01-14 21:06:40,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1341, Unknown=6, NotChecked=0, Total=1482 [2019-01-14 21:06:40,561 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand 39 states. [2019-01-14 21:06:44,259 WARN L181 SmtUtils]: Spent 3.01 s on a formula simplification. DAG size of input: 61 DAG size of output: 43 [2019-01-14 21:06:50,720 WARN L181 SmtUtils]: Spent 6.39 s on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-01-14 21:06:53,354 WARN L181 SmtUtils]: Spent 2.56 s on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-01-14 21:06:56,905 WARN L181 SmtUtils]: Spent 3.10 s on a formula simplification. DAG size of input: 66 DAG size of output: 48 [2019-01-14 21:07:03,652 WARN L181 SmtUtils]: Spent 6.70 s on a formula simplification. DAG size of input: 80 DAG size of output: 69 [2019-01-14 21:07:07,731 WARN L181 SmtUtils]: Spent 3.50 s on a formula simplification. DAG size of input: 74 DAG size of output: 56 [2019-01-14 21:07:15,164 WARN L181 SmtUtils]: Spent 7.38 s on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-01-14 21:07:19,391 WARN L181 SmtUtils]: Spent 3.60 s on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2019-01-14 21:07:19,626 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 66 [2019-01-14 21:07:19,965 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 72 [2019-01-14 21:07:21,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:07:21,148 INFO L93 Difference]: Finished difference Result 136 states and 148 transitions. [2019-01-14 21:07:21,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-01-14 21:07:21,150 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 64 [2019-01-14 21:07:21,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:07:21,152 INFO L225 Difference]: With dead ends: 136 [2019-01-14 21:07:21,152 INFO L226 Difference]: Without dead ends: 136 [2019-01-14 21:07:21,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 51 SyntacticMatches, 9 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1150 ImplicationChecksByTransitivity, 49.3s TimeCoverageRelationStatistics Valid=570, Invalid=3714, Unknown=6, NotChecked=0, Total=4290 [2019-01-14 21:07:21,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-01-14 21:07:21,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 109. [2019-01-14 21:07:21,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-14 21:07:21,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 120 transitions. [2019-01-14 21:07:21,160 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 120 transitions. Word has length 64 [2019-01-14 21:07:21,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:07:21,160 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 120 transitions. [2019-01-14 21:07:21,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-01-14 21:07:21,161 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 120 transitions. [2019-01-14 21:07:21,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-01-14 21:07:21,164 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:07:21,164 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 21:07:21,164 INFO L423 AbstractCegarLoop]: === Iteration 15 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2019-01-14 21:07:21,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:07:21,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1158408333, now seen corresponding path program 1 times [2019-01-14 21:07:21,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:07:21,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:07:21,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:07:21,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:07:21,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:07:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:07:21,321 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-01-14 21:07:21,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:07:21,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 21:07:21,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-14 21:07:21,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-14 21:07:21,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-14 21:07:21,323 INFO L87 Difference]: Start difference. First operand 109 states and 120 transitions. Second operand 4 states. [2019-01-14 21:07:21,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:07:21,441 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2019-01-14 21:07:21,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 21:07:21,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-01-14 21:07:21,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:07:21,445 INFO L225 Difference]: With dead ends: 110 [2019-01-14 21:07:21,445 INFO L226 Difference]: Without dead ends: 110 [2019-01-14 21:07:21,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-14 21:07:21,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-01-14 21:07:21,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-01-14 21:07:21,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-01-14 21:07:21,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2019-01-14 21:07:21,455 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 68 [2019-01-14 21:07:21,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:07:21,455 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2019-01-14 21:07:21,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-14 21:07:21,455 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2019-01-14 21:07:21,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-01-14 21:07:21,456 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:07:21,457 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 21:07:21,457 INFO L423 AbstractCegarLoop]: === Iteration 16 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2019-01-14 21:07:21,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:07:21,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1294438221, now seen corresponding path program 2 times [2019-01-14 21:07:21,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:07:21,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:07:21,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:07:21,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:07:21,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:07:21,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:07:22,051 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2019-01-14 21:07:22,258 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-14 21:07:23,288 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2019-01-14 21:07:23,843 WARN L181 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-01-14 21:07:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 21 proven. 33 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 21:07:24,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:07:24,663 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-14 21:07:24,675 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 21:07:24,733 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 21:07:24,733 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:07:24,739 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:07:24,966 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 26 treesize of output 23 [2019-01-14 21:07:24,990 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-14 21:07:24,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:07:25,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:07:25,294 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 26 treesize of output 23 [2019-01-14 21:07:25,296 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 21:07:25,297 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 21:07:25,305 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:07:25,326 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-01-14 21:07:25,327 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:53, output treesize:33 [2019-01-14 21:07:25,599 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:07:25,602 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:07:25,610 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:07:25,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:30 [2019-01-14 21:07:25,615 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-14 21:07:25,618 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 21:07:25,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 21:07:25,644 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 21:07:25,644 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 21:07:25,658 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:07:25,665 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 21:07:25,666 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:50, output treesize:34 [2019-01-14 21:07:26,690 WARN L181 SmtUtils]: Spent 530.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-14 21:07:27,275 WARN L181 SmtUtils]: Spent 527.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-14 21:07:27,280 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:07:27,281 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:07:27,282 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-14 21:07:27,282 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 21:07:27,299 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-14 21:07:27,311 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-14 21:07:27,316 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:07:27,318 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 16 treesize of output 23 [2019-01-14 21:07:27,318 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 21:07:27,322 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:07:27,329 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:07:27,342 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:07:27,342 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:47, output treesize:37 [2019-01-14 21:07:27,865 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 37 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 21:07:27,883 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:07:27,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 23] total 58 [2019-01-14 21:07:27,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2019-01-14 21:07:27,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2019-01-14 21:07:27,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=3083, Unknown=1, NotChecked=0, Total=3306 [2019-01-14 21:07:27,886 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand 58 states. [2019-01-14 21:07:31,162 WARN L181 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 71 DAG size of output: 42 [2019-01-14 21:07:35,234 WARN L181 SmtUtils]: Spent 3.95 s on a formula simplification. DAG size of input: 126 DAG size of output: 56 [2019-01-14 21:07:37,497 WARN L181 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 87 DAG size of output: 38 [2019-01-14 21:07:37,809 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 35 [2019-01-14 21:07:38,000 WARN L181 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 40 [2019-01-14 21:07:39,415 WARN L181 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 92 DAG size of output: 46 [2019-01-14 21:07:43,724 WARN L181 SmtUtils]: Spent 4.20 s on a formula simplification. DAG size of input: 134 DAG size of output: 64 [2019-01-14 21:07:44,372 WARN L181 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 39 [2019-01-14 21:07:44,601 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 47 [2019-01-14 21:07:45,831 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 52 [2019-01-14 21:07:47,319 WARN L181 SmtUtils]: Spent 1.31 s on a formula simplification. DAG size of input: 101 DAG size of output: 53 [2019-01-14 21:07:47,987 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 45 [2019-01-14 21:07:48,248 WARN L181 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 48 [2019-01-14 21:07:48,452 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 48 [2019-01-14 21:07:48,653 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 49 [2019-01-14 21:07:49,108 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 52 [2019-01-14 21:07:50,155 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 40 [2019-01-14 21:07:51,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:07:51,028 INFO L93 Difference]: Finished difference Result 159 states and 176 transitions. [2019-01-14 21:07:51,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-01-14 21:07:51,035 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 69 [2019-01-14 21:07:51,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:07:51,036 INFO L225 Difference]: With dead ends: 159 [2019-01-14 21:07:51,036 INFO L226 Difference]: Without dead ends: 159 [2019-01-14 21:07:51,041 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2405 ImplicationChecksByTransitivity, 23.6s TimeCoverageRelationStatistics Valid=1272, Invalid=7847, Unknown=1, NotChecked=0, Total=9120 [2019-01-14 21:07:51,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-01-14 21:07:51,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 109. [2019-01-14 21:07:51,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-01-14 21:07:51,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2019-01-14 21:07:51,051 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 69 [2019-01-14 21:07:51,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:07:51,051 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2019-01-14 21:07:51,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2019-01-14 21:07:51,051 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2019-01-14 21:07:51,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-14 21:07:51,055 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:07:51,055 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 21:07:51,056 INFO L423 AbstractCegarLoop]: === Iteration 17 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2019-01-14 21:07:51,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:07:51,056 INFO L82 PathProgramCache]: Analyzing trace with hash 80529935, now seen corresponding path program 1 times [2019-01-14 21:07:51,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:07:51,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:07:51,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:07:51,060 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:07:51,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:07:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:07:51,374 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 16 [2019-01-14 21:07:51,444 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2019-01-14 21:07:51,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 21:07:51,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-01-14 21:07:51,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 21:07:51,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 21:07:51,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-01-14 21:07:51,445 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 12 states. [2019-01-14 21:07:51,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:07:51,808 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2019-01-14 21:07:51,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 21:07:51,809 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2019-01-14 21:07:51,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:07:51,811 INFO L225 Difference]: With dead ends: 110 [2019-01-14 21:07:51,811 INFO L226 Difference]: Without dead ends: 104 [2019-01-14 21:07:51,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=251, Unknown=0, NotChecked=0, Total=306 [2019-01-14 21:07:51,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-01-14 21:07:51,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-01-14 21:07:51,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-01-14 21:07:51,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2019-01-14 21:07:51,815 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 71 [2019-01-14 21:07:51,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:07:51,816 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2019-01-14 21:07:51,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 21:07:51,816 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2019-01-14 21:07:51,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-14 21:07:51,816 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:07:51,817 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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-14 21:07:51,817 INFO L423 AbstractCegarLoop]: === Iteration 18 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2019-01-14 21:07:51,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:07:51,817 INFO L82 PathProgramCache]: Analyzing trace with hash 503471576, now seen corresponding path program 3 times [2019-01-14 21:07:51,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:07:51,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:07:51,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:07:51,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 21:07:51,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:07:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:07:52,761 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-01-14 21:07:53,277 WARN L181 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2019-01-14 21:07:53,773 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 61 [2019-01-14 21:07:54,642 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 19 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:07:54,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:07:54,643 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-14 21:07:54,653 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:07:54,897 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 21:07:54,897 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:07:54,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:07:55,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 21:07:55,425 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 21:07:55,425 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:07:55,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:07:55,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:07:55,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2019-01-14 21:07:55,554 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:07:55,555 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:07:55,556 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 23 treesize of output 39 [2019-01-14 21:07:55,556 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 21:07:55,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:07:55,564 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:30 [2019-01-14 21:07:55,624 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-14 21:07:55,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 21:07:55,635 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:07:55,636 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:29 [2019-01-14 21:07:56,111 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:07:56,113 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:07:56,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:07:56,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:41 [2019-01-14 21:07:56,131 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-14 21:07:56,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 21:07:56,179 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 21:07:56,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 21:07:56,183 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 21:07:56,185 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:07:56,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 21:07:56,199 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:61, output treesize:45 [2019-01-14 21:07:56,742 WARN L181 SmtUtils]: Spent 458.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-14 21:07:57,286 WARN L181 SmtUtils]: Spent 471.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2019-01-14 21:07:57,296 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:07:57,297 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:07:57,299 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:07:57,300 INFO L478 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 82 [2019-01-14 21:07:57,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 21:07:57,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:07:57,335 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 66 treesize of output 81 [2019-01-14 21:07:57,339 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-01-14 21:07:57,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:07:57,348 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 27 treesize of output 31 [2019-01-14 21:07:57,349 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 21:07:57,355 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:07:57,366 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:07:57,391 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:07:57,391 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:83, output treesize:107 [2019-01-14 21:07:57,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:07:57,754 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:07:57,778 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 21:07:57,780 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:07:57,799 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:07:57,800 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:87, output treesize:57 [2019-01-14 21:07:57,804 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-14 21:07:57,809 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 21:07:57,832 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-14 21:07:57,836 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 21:07:57,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 21:07:57,854 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:53 [2019-01-14 21:08:00,661 WARN L181 SmtUtils]: Spent 1.17 s on a formula simplification that was a NOOP. DAG size: 39 [2019-01-14 21:08:02,007 WARN L181 SmtUtils]: Spent 1.26 s on a formula simplification that was a NOOP. DAG size: 39 [2019-01-14 21:08:02,019 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:08:02,021 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:08:02,022 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:08:02,023 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:08:02,024 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:08:02,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 127 [2019-01-14 21:08:02,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 21:08:02,080 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2019-01-14 21:08:02,081 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:08:02,135 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 102 [2019-01-14 21:08:02,144 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-14 21:08:02,148 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:08:02,149 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-14 21:08:02,150 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 21:08:02,158 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:08:02,180 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:08:02,231 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:08:02,233 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:08:02,234 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:08:02,240 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:08:02,241 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 147 [2019-01-14 21:08:02,244 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2019-01-14 21:08:02,249 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:08:02,252 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2019-01-14 21:08:02,252 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 21:08:02,262 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:08:02,285 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:08:02,325 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:08:02,325 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:138, output treesize:210 [2019-01-14 21:08:03,116 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:08:03,118 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 185 treesize of output 149 [2019-01-14 21:08:03,137 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 43 treesize of output 26 [2019-01-14 21:08:03,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:08:03,181 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 104 treesize of output 89 [2019-01-14 21:08:03,182 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 21:08:03,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:08:03,221 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-14 21:08:03,221 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:226, output treesize:141 [2019-01-14 21:08:03,574 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:08:03,575 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:08:03,576 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:08:03,579 INFO L478 Elim1Store]: Elim1 did not use 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 40 [2019-01-14 21:08:03,580 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 21:08:03,604 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:08:03,605 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:08:03,607 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:08:03,608 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:08:03,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:08:03,609 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:08:03,610 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 91 [2019-01-14 21:08:03,634 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 58 [2019-01-14 21:08:03,641 INFO L267 ElimStorePlain]: Start of recursive call 4: 17 dim-0 vars, End of recursive call: 17 dim-0 vars, and 7 xjuncts. [2019-01-14 21:08:03,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 35 [2019-01-14 21:08:03,771 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-14 21:08:03,806 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 57 [2019-01-14 21:08:03,808 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 21:08:03,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 47 [2019-01-14 21:08:03,838 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 21:08:03,840 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 41 [2019-01-14 21:08:03,841 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 21:08:03,854 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 53 [2019-01-14 21:08:03,856 INFO L267 ElimStorePlain]: Start of recursive call 9: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 21:08:03,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, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 49 [2019-01-14 21:08:03,861 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 21:08:03,872 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 57 [2019-01-14 21:08:03,874 INFO L267 ElimStorePlain]: Start of recursive call 11: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 21:08:04,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2019-01-14 21:08:04,186 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2019-01-14 21:08:04,187 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 40 [2019-01-14 21:08:04,188 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-01-14 21:08:04,195 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2019-01-14 21:08:04,196 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2019-01-14 21:08:04,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 56 [2019-01-14 21:08:04,206 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2019-01-14 21:08:04,214 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 56 [2019-01-14 21:08:04,215 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2019-01-14 21:08:04,236 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 60 [2019-01-14 21:08:04,237 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2019-01-14 21:08:04,254 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 40 [2019-01-14 21:08:04,254 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-01-14 21:08:04,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 52 [2019-01-14 21:08:04,259 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-01-14 21:08:04,261 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 [2019-01-14 21:08:04,262 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-01-14 21:08:04,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 48 [2019-01-14 21:08:04,270 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-01-14 21:08:04,405 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 56 [2019-01-14 21:08:04,406 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2019-01-14 21:08:05,620 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: 22 dim-0 vars, and 11 xjuncts. [2019-01-14 21:08:05,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 33 dim-0 vars, and 11 xjuncts. [2019-01-14 21:08:05,867 INFO L202 ElimStorePlain]: Needed 22 recursive calls to eliminate 3 variables, input treesize:147, output treesize:496 [2019-01-14 21:08:06,266 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 270 DAG size of output: 29 [2019-01-14 21:08:06,377 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 42 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:08:06,396 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:08:06,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 27] total 54 [2019-01-14 21:08:06,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2019-01-14 21:08:06,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2019-01-14 21:08:06,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=2727, Unknown=2, NotChecked=0, Total=2970 [2019-01-14 21:08:06,400 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand 55 states. [2019-01-14 21:08:10,178 WARN L181 SmtUtils]: Spent 3.30 s on a formula simplification. DAG size of input: 59 DAG size of output: 43 [2019-01-14 21:08:13,186 WARN L181 SmtUtils]: Spent 2.96 s on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2019-01-14 21:08:17,285 WARN L181 SmtUtils]: Spent 3.62 s on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-01-14 21:08:20,414 WARN L181 SmtUtils]: Spent 3.08 s on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2019-01-14 21:08:24,873 WARN L181 SmtUtils]: Spent 3.92 s on a formula simplification. DAG size of input: 67 DAG size of output: 51 [2019-01-14 21:08:28,209 WARN L181 SmtUtils]: Spent 3.28 s on a formula simplification. DAG size of input: 78 DAG size of output: 56 [2019-01-14 21:08:34,506 WARN L181 SmtUtils]: Spent 3.98 s on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2019-01-14 21:08:38,063 WARN L181 SmtUtils]: Spent 3.39 s on a formula simplification. DAG size of input: 88 DAG size of output: 63 [2019-01-14 21:08:38,402 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 90 [2019-01-14 21:08:38,736 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 96 [2019-01-14 21:08:39,708 WARN L181 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 90 [2019-01-14 21:08:40,573 WARN L181 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 59 [2019-01-14 21:08:41,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:08:41,450 INFO L93 Difference]: Finished difference Result 129 states and 136 transitions. [2019-01-14 21:08:41,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-14 21:08:41,452 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 71 [2019-01-14 21:08:41,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:08:41,453 INFO L225 Difference]: With dead ends: 129 [2019-01-14 21:08:41,453 INFO L226 Difference]: Without dead ends: 129 [2019-01-14 21:08:41,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1890 ImplicationChecksByTransitivity, 41.2s TimeCoverageRelationStatistics Valid=769, Invalid=5871, Unknown=2, NotChecked=0, Total=6642 [2019-01-14 21:08:41,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-01-14 21:08:41,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2019-01-14 21:08:41,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-01-14 21:08:41,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 124 transitions. [2019-01-14 21:08:41,463 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 124 transitions. Word has length 71 [2019-01-14 21:08:41,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:08:41,463 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 124 transitions. [2019-01-14 21:08:41,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2019-01-14 21:08:41,463 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 124 transitions. [2019-01-14 21:08:41,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-01-14 21:08:41,467 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:08:41,468 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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-14 21:08:41,468 INFO L423 AbstractCegarLoop]: === Iteration 19 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2019-01-14 21:08:41,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:08:41,468 INFO L82 PathProgramCache]: Analyzing trace with hash 503471577, now seen corresponding path program 3 times [2019-01-14 21:08:41,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:08:41,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:08:41,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:08:41,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:08:41,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:08:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:08:41,832 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2019-01-14 21:08:42,095 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2019-01-14 21:08:42,563 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2019-01-14 21:08:43,843 WARN L181 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 90 [2019-01-14 21:08:44,079 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2019-01-14 21:08:44,716 WARN L181 SmtUtils]: Spent 223.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-01-14 21:08:45,992 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 9 proven. 62 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 21:08:45,992 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:08:45,992 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-14 21:08:46,003 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:08:46,120 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 21:08:46,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:08:46,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:08:46,131 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-14 21:08:46,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 21:08:46,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:08:46,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-01-14 21:08:46,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 21:08:46,429 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 21:08:46,429 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:08:46,431 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:08:46,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 21:08:46,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 21:08:46,456 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 21:08:46,458 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:08:46,473 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:08:46,473 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:47, output treesize:39 [2019-01-14 21:08:46,712 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:08:46,713 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:08:46,714 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 23 treesize of output 39 [2019-01-14 21:08:46,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 21:08:46,732 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-14 21:08:46,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:08:46,746 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:08:46,746 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:55 [2019-01-14 21:08:47,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:08:47,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:08:47,137 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 21:08:47,140 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:08:47,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:08:47,158 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:87, output treesize:57 [2019-01-14 21:08:47,161 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-14 21:08:47,190 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 21:08:47,250 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-14 21:08:47,253 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 21:08:47,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 21:08:47,269 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:77, output treesize:53 [2019-01-14 21:08:55,344 WARN L181 SmtUtils]: Spent 1.19 s on a formula simplification that was a NOOP. DAG size: 39 [2019-01-14 21:08:57,513 WARN L181 SmtUtils]: Spent 1.23 s on a formula simplification that was a NOOP. DAG size: 39 [2019-01-14 21:08:57,561 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:08:57,589 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:08:57,612 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:08:57,614 INFO L478 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 50 [2019-01-14 21:08:57,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 21:08:57,713 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 21 treesize of output 40 [2019-01-14 21:08:57,713 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:08:57,755 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:08:57,757 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 66 [2019-01-14 21:08:57,761 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-01-14 21:08:57,764 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:08:57,765 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 27 treesize of output 31 [2019-01-14 21:08:57,766 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 21:08:57,773 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:08:57,787 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:08:58,125 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:08:58,129 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 24 treesize of output 31 [2019-01-14 21:08:58,132 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-14 21:08:58,135 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:08:58,136 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-14 21:08:58,137 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 21:08:58,144 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:08:58,152 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:08:58,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:08:58,185 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:96, output treesize:122 [2019-01-14 21:08:58,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:08:58,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:08:58,601 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 21:08:58,604 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:08:58,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:08:58,621 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:81, output treesize:51 [2019-01-14 21:08:58,624 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-14 21:08:58,627 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 21:08:58,646 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-14 21:08:58,649 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 21:08:58,662 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 21:08:58,662 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:47 [2019-01-14 21:09:12,417 WARN L181 SmtUtils]: Spent 1.20 s on a formula simplification that was a NOOP. DAG size: 35 [2019-01-14 21:09:14,397 WARN L181 SmtUtils]: Spent 1.06 s on a formula simplification that was a NOOP. DAG size: 35 [2019-01-14 21:09:14,405 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:09:14,407 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:09:14,408 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:09:14,410 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:09:14,411 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:09:14,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 61 [2019-01-14 21:09:14,412 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 21:09:14,454 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:09:14,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 93 [2019-01-14 21:09:14,456 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:09:14,500 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:09:14,502 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:09:14,504 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:09:14,510 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:09:14,511 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 134 [2019-01-14 21:09:14,515 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2019-01-14 21:09:14,547 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:09:14,549 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2019-01-14 21:09:14,549 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 21:09:14,559 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:09:14,585 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:09:14,624 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:09:14,625 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:09:14,627 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:09:14,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 58 [2019-01-14 21:09:14,639 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-14 21:09:14,643 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:09:14,645 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-14 21:09:14,646 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 21:09:14,652 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:09:14,666 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:09:14,699 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:09:14,699 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:147, output treesize:163 [2019-01-14 21:09:15,881 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 21:09:15,882 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:09:15,883 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:09:15,884 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:09:15,885 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:09:15,886 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:09:15,887 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:09:15,888 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 215 treesize of output 190 [2019-01-14 21:09:15,898 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 21:09:15,920 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 57 treesize of output 103 [2019-01-14 21:09:15,926 INFO L267 ElimStorePlain]: Start of recursive call 3: 10 dim-0 vars, End of recursive call: 10 dim-0 vars, and 7 xjuncts. [2019-01-14 21:09:16,052 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 75 [2019-01-14 21:09:16,053 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-14 21:09:16,082 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 21:09:16,083 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 53 [2019-01-14 21:09:16,083 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-14 21:09:16,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 21:09:16,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 41 [2019-01-14 21:09:16,147 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 9 [2019-01-14 21:09:16,147 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-01-14 21:09:16,163 INFO L683 Elim1Store]: detected equality via solver [2019-01-14 21:09:16,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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 11 [2019-01-14 21:09:16,164 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-01-14 21:09:16,170 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-14 21:09:16,170 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 21:09:16,172 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:09:16,192 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-14 21:09:16,192 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:227, output treesize:48 [2019-01-14 21:09:16,452 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 23 proven. 48 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 21:09:16,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:09:16,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 27] total 50 [2019-01-14 21:09:16,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-01-14 21:09:16,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-01-14 21:09:16,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=2342, Unknown=19, NotChecked=0, Total=2550 [2019-01-14 21:09:16,473 INFO L87 Difference]: Start difference. First operand 117 states and 124 transitions. Second operand 51 states. [2019-01-14 21:09:21,666 WARN L181 SmtUtils]: Spent 4.21 s on a formula simplification. DAG size of input: 66 DAG size of output: 43 [2019-01-14 21:09:24,803 WARN L181 SmtUtils]: Spent 3.06 s on a formula simplification. DAG size of input: 61 DAG size of output: 45 [2019-01-14 21:09:29,681 WARN L181 SmtUtils]: Spent 4.08 s on a formula simplification. DAG size of input: 71 DAG size of output: 48 [2019-01-14 21:09:32,825 WARN L181 SmtUtils]: Spent 3.06 s on a formula simplification. DAG size of input: 72 DAG size of output: 52 [2019-01-14 21:09:37,807 WARN L181 SmtUtils]: Spent 4.21 s on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-01-14 21:09:41,017 WARN L181 SmtUtils]: Spent 3.12 s on a formula simplification. DAG size of input: 82 DAG size of output: 61 [2019-01-14 21:09:45,801 WARN L181 SmtUtils]: Spent 3.99 s on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-01-14 21:09:49,156 WARN L181 SmtUtils]: Spent 3.27 s on a formula simplification. DAG size of input: 89 DAG size of output: 68 [2019-01-14 21:09:49,534 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 60 [2019-01-14 21:09:49,837 WARN L181 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2019-01-14 21:09:50,405 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 98 [2019-01-14 21:09:50,671 WARN L181 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 96 [2019-01-14 21:09:51,177 WARN L181 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 107 [2019-01-14 21:09:51,452 WARN L181 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 101 [2019-01-14 21:09:51,943 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 106 [2019-01-14 21:09:52,196 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 65 [2019-01-14 21:09:53,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:09:53,678 INFO L93 Difference]: Finished difference Result 130 states and 137 transitions. [2019-01-14 21:09:53,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-01-14 21:09:53,680 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 71 [2019-01-14 21:09:53,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:09:53,682 INFO L225 Difference]: With dead ends: 130 [2019-01-14 21:09:53,682 INFO L226 Difference]: Without dead ends: 130 [2019-01-14 21:09:53,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 45 SyntacticMatches, 13 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1538 ImplicationChecksByTransitivity, 65.2s TimeCoverageRelationStatistics Valid=695, Invalid=5448, Unknown=19, NotChecked=0, Total=6162 [2019-01-14 21:09:53,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-01-14 21:09:53,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 120. [2019-01-14 21:09:53,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2019-01-14 21:09:53,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 126 transitions. [2019-01-14 21:09:53,688 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 126 transitions. Word has length 71 [2019-01-14 21:09:53,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:09:53,691 INFO L480 AbstractCegarLoop]: Abstraction has 120 states and 126 transitions. [2019-01-14 21:09:53,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-01-14 21:09:53,691 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 126 transitions. [2019-01-14 21:09:53,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-01-14 21:09:53,692 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:09:53,692 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 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-14 21:09:53,692 INFO L423 AbstractCegarLoop]: === Iteration 20 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2019-01-14 21:09:53,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:09:53,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1020516166, now seen corresponding path program 3 times [2019-01-14 21:09:53,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:09:53,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:09:53,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:09:53,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:09:53,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:09:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:09:55,357 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-01-14 21:09:56,690 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 19 proven. 53 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:09:56,690 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:09:56,690 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-14 21:09:56,701 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 21:09:56,817 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-01-14 21:09:56,817 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:09:56,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:09:57,117 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 21:09:57,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 21:09:57,119 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:09:57,121 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:09:57,125 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:09:57,125 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2019-01-14 21:09:57,330 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 6 treesize of output 5 [2019-01-14 21:09:57,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 21:09:57,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:09:57,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:27 [2019-01-14 21:09:57,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:09:57,563 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:09:57,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:09:57,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:44 [2019-01-14 21:09:57,584 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 13 treesize of output 10 [2019-01-14 21:09:57,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 21:09:57,588 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:09:57,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:09:57,612 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-14 21:09:57,615 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 21:09:57,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 21:09:57,630 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:64, output treesize:48 [2019-01-14 21:09:58,420 WARN L181 SmtUtils]: Spent 713.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-14 21:09:59,205 WARN L181 SmtUtils]: Spent 704.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-14 21:09:59,213 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:09:59,214 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:09:59,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 4 [2019-01-14 21:09:59,215 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 21:09:59,238 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 33 treesize of output 34 [2019-01-14 21:09:59,248 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-14 21:09:59,251 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:09:59,252 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 16 treesize of output 23 [2019-01-14 21:09:59,253 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 21:09:59,260 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:09:59,267 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:09:59,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:09:59,288 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:69, output treesize:59 [2019-01-14 21:09:59,653 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:09:59,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:09:59,711 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 21:09:59,714 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:09:59,730 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:09:59,730 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:81, output treesize:51 [2019-01-14 21:09:59,733 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-14 21:09:59,736 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 21:09:59,756 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-14 21:09:59,767 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 21:09:59,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 21:09:59,783 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:71, output treesize:47 [2019-01-14 21:10:02,538 WARN L181 SmtUtils]: Spent 1.09 s on a formula simplification that was a NOOP. DAG size: 35 [2019-01-14 21:10:03,720 WARN L181 SmtUtils]: Spent 1.08 s on a formula simplification that was a NOOP. DAG size: 35 [2019-01-14 21:10:03,735 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:10:03,736 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:10:03,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 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-14 21:10:03,737 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 21:10:03,766 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 15 [2019-01-14 21:10:03,767 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:10:03,798 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 42 treesize of output 43 [2019-01-14 21:10:03,802 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-14 21:10:03,805 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:10:03,808 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-14 21:10:03,808 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 21:10:03,815 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:10:03,826 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:10:03,868 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:10:03,886 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 76 [2019-01-14 21:10:03,891 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 65 [2019-01-14 21:10:03,894 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:10:03,896 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 31 [2019-01-14 21:10:03,897 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 21:10:03,910 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:10:03,944 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:10:03,970 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:10:03,970 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:94, output treesize:102 [2019-01-14 21:10:05,474 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 24 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:10:05,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:10:05,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 30] total 74 [2019-01-14 21:10:05,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2019-01-14 21:10:05,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2019-01-14 21:10:05,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=5152, Unknown=2, NotChecked=0, Total=5402 [2019-01-14 21:10:05,498 INFO L87 Difference]: Start difference. First operand 120 states and 126 transitions. Second operand 74 states. [2019-01-14 21:10:07,424 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 53 [2019-01-14 21:10:10,470 WARN L181 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 63 [2019-01-14 21:10:15,453 WARN L181 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 63 [2019-01-14 21:10:24,619 WARN L181 SmtUtils]: Spent 4.17 s on a formula simplification. DAG size of input: 123 DAG size of output: 66 [2019-01-14 21:10:32,430 WARN L181 SmtUtils]: Spent 7.57 s on a formula simplification. DAG size of input: 216 DAG size of output: 87 [2019-01-14 21:10:36,073 WARN L181 SmtUtils]: Spent 3.27 s on a formula simplification. DAG size of input: 171 DAG size of output: 68 [2019-01-14 21:10:37,692 WARN L181 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 58 [2019-01-14 21:10:40,274 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 46 [2019-01-14 21:10:41,369 WARN L181 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 67 [2019-01-14 21:10:44,446 WARN L181 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 77 [2019-01-14 21:10:48,438 WARN L181 SmtUtils]: Spent 2.30 s on a formula simplification. DAG size of input: 93 DAG size of output: 50 [2019-01-14 21:10:58,062 WARN L181 SmtUtils]: Spent 7.76 s on a formula simplification. DAG size of input: 198 DAG size of output: 70 [2019-01-14 21:11:02,813 WARN L181 SmtUtils]: Spent 4.60 s on a formula simplification. DAG size of input: 133 DAG size of output: 74 [2019-01-14 21:11:03,317 WARN L181 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2019-01-14 21:11:04,428 WARN L181 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 44 [2019-01-14 21:11:04,714 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 62 [2019-01-14 21:11:06,090 WARN L181 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 54 [2019-01-14 21:11:08,288 WARN L181 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 71 [2019-01-14 21:11:14,566 WARN L181 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 81 [2019-01-14 21:11:20,877 WARN L181 SmtUtils]: Spent 4.16 s on a formula simplification. DAG size of input: 114 DAG size of output: 57 [2019-01-14 21:11:31,482 WARN L181 SmtUtils]: Spent 10.35 s on a formula simplification. DAG size of input: 206 DAG size of output: 80 [2019-01-14 21:11:33,734 WARN L181 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 59 [2019-01-14 21:11:36,401 WARN L181 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 69 [2019-01-14 21:11:37,011 WARN L181 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 66 [2019-01-14 21:11:37,353 WARN L181 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 67 [2019-01-14 21:11:37,860 WARN L181 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 71 [2019-01-14 21:11:38,192 WARN L181 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 67 [2019-01-14 21:11:38,546 WARN L181 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 68 [2019-01-14 21:11:39,068 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 76 [2019-01-14 21:11:39,402 WARN L181 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 70 [2019-01-14 21:11:39,750 WARN L181 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 71 [2019-01-14 21:11:40,310 WARN L181 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 78 [2019-01-14 21:11:40,698 WARN L181 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 74 [2019-01-14 21:11:41,050 WARN L181 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 75 [2019-01-14 21:11:41,597 WARN L181 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 63 [2019-01-14 21:11:43,360 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 40 [2019-01-14 21:11:43,890 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2019-01-14 21:11:44,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:11:44,358 INFO L93 Difference]: Finished difference Result 166 states and 173 transitions. [2019-01-14 21:11:44,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-01-14 21:11:44,360 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 76 [2019-01-14 21:11:44,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:11:44,362 INFO L225 Difference]: With dead ends: 166 [2019-01-14 21:11:44,362 INFO L226 Difference]: Without dead ends: 166 [2019-01-14 21:11:44,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4109 ImplicationChecksByTransitivity, 78.7s TimeCoverageRelationStatistics Valid=1883, Invalid=14358, Unknown=15, NotChecked=0, Total=16256 [2019-01-14 21:11:44,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2019-01-14 21:11:44,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 119. [2019-01-14 21:11:44,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-01-14 21:11:44,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 123 transitions. [2019-01-14 21:11:44,378 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 123 transitions. Word has length 76 [2019-01-14 21:11:44,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:11:44,378 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 123 transitions. [2019-01-14 21:11:44,378 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2019-01-14 21:11:44,378 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 123 transitions. [2019-01-14 21:11:44,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-01-14 21:11:44,379 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 21:11:44,379 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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-14 21:11:44,380 INFO L423 AbstractCegarLoop]: === Iteration 21 === [insert_listErr2REQUIRES_VIOLATION, insert_listErr7REQUIRES_VIOLATION, insert_listErr3REQUIRES_VIOLATION, insert_listErr4REQUIRES_VIOLATION, insert_listErr0REQUIRES_VIOLATION, insert_listErr5REQUIRES_VIOLATION, insert_listErr6REQUIRES_VIOLATION, insert_listErr1REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, search_listErr3REQUIRES_VIOLATION, search_listErr2REQUIRES_VIOLATION, search_listErr1REQUIRES_VIOLATION, search_listErr0REQUIRES_VIOLATION]=== [2019-01-14 21:11:44,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 21:11:44,380 INFO L82 PathProgramCache]: Analyzing trace with hash 625364997, now seen corresponding path program 4 times [2019-01-14 21:11:44,380 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 21:11:44,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 21:11:44,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:11:44,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 21:11:44,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 21:11:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 21:11:44,759 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-14 21:11:45,073 WARN L181 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 18 [2019-01-14 21:11:45,647 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-01-14 21:11:46,937 WARN L181 SmtUtils]: Spent 673.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 91 [2019-01-14 21:11:48,128 WARN L181 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 63 [2019-01-14 21:11:49,197 WARN L181 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 44 [2019-01-14 21:11:50,887 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 11 proven. 83 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-01-14 21:11:50,888 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 21:11:50,888 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-14 21:11:50,900 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 21:11:50,975 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 21:11:50,975 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 21:11:50,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 21:11:51,000 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-14 21:11:51,001 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 21:11:51,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:11:51,015 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-01-14 21:11:51,028 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-14 21:11:51,034 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-14 21:11:51,034 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:11:51,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:11:51,050 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:11:51,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:28 [2019-01-14 21:11:51,061 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 23 treesize of output 18 [2019-01-14 21:11:51,064 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 7 [2019-01-14 21:11:51,064 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:11:51,067 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:11:51,074 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:11:51,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2019-01-14 21:11:52,596 WARN L181 SmtUtils]: Spent 481.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2019-01-14 21:11:52,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 21:11:52,606 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 21:11:52,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:11:52,609 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:11:52,624 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-14 21:11:52,625 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:56, output treesize:52 [2019-01-14 21:11:53,234 WARN L181 SmtUtils]: Spent 485.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-14 21:11:53,851 WARN L181 SmtUtils]: Spent 489.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2019-01-14 21:11:53,858 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:11:53,859 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-14 21:11:53,859 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 21:11:53,913 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:11:53,915 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:11:53,917 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 23 treesize of output 39 [2019-01-14 21:11:53,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:11:53,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 36 treesize of output 43 [2019-01-14 21:11:53,947 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2019-01-14 21:11:53,950 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:11:53,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2019-01-14 21:11:53,952 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 21:11:53,955 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:11:53,961 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:11:53,978 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:11:53,978 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:78, output treesize:59 [2019-01-14 21:11:54,859 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:11:54,861 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:11:54,879 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-14 21:11:54,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:68, output treesize:53 [2019-01-14 21:11:55,887 WARN L181 SmtUtils]: Spent 490.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-01-14 21:11:55,890 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-14 21:11:55,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 21:11:55,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2019-01-14 21:11:55,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2019-01-14 21:11:55,930 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 21:11:55,933 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:11:55,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-01-14 21:11:55,956 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:84, output treesize:68 [2019-01-14 21:11:57,518 WARN L181 SmtUtils]: Spent 1.40 s on a formula simplification that was a NOOP. DAG size: 45 [2019-01-14 21:11:59,158 WARN L181 SmtUtils]: Spent 1.50 s on a formula simplification that was a NOOP. DAG size: 45 [2019-01-14 21:11:59,166 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:11:59,168 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:11:59,169 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 21 treesize of output 40 [2019-01-14 21:11:59,169 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 21:11:59,223 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:11:59,225 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:11:59,227 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:11:59,228 INFO L478 Elim1Store]: Elim1 did not use 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 46 [2019-01-14 21:11:59,228 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:11:59,280 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 39 [2019-01-14 21:11:59,284 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2019-01-14 21:11:59,289 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:11:59,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2019-01-14 21:11:59,291 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 21:11:59,296 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:11:59,304 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:11:59,347 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:11:59,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 77 [2019-01-14 21:11:59,352 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2019-01-14 21:11:59,355 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:11:59,358 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 27 treesize of output 31 [2019-01-14 21:11:59,358 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 21:11:59,365 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:11:59,384 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:11:59,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:11:59,422 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 7 variables, input treesize:115, output treesize:126 [2019-01-14 21:11:59,867 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:11:59,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:11:59,899 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-01-14 21:11:59,903 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:11:59,925 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-14 21:11:59,925 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:92, output treesize:62 [2019-01-14 21:12:01,776 WARN L181 SmtUtils]: Spent 769.00 ms on a formula simplification that was a NOOP. DAG size: 43 [2019-01-14 21:12:01,780 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-14 21:12:01,784 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 21:12:01,809 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-14 21:12:01,813 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-01-14 21:12:01,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-01-14 21:12:01,834 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:93, output treesize:69 [2019-01-14 21:12:23,537 WARN L181 SmtUtils]: Spent 2.50 s on a formula simplification that was a NOOP. DAG size: 46 [2019-01-14 21:12:28,222 WARN L181 SmtUtils]: Spent 2.57 s on a formula simplification that was a NOOP. DAG size: 46 [2019-01-14 21:12:28,254 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:12:28,258 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:12:28,259 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:12:28,261 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:12:28,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 93 [2019-01-14 21:12:28,262 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 21:12:28,328 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:12:28,329 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:12:28,331 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:12:28,333 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:12:28,334 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:12:28,335 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 61 [2019-01-14 21:12:28,335 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:12:28,398 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 47 [2019-01-14 21:12:28,402 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2019-01-14 21:12:28,406 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:12:28,409 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2019-01-14 21:12:28,410 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-01-14 21:12:28,415 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:12:28,426 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:12:28,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, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2019-01-14 21:12:28,487 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 16 [2019-01-14 21:12:28,491 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:12:28,493 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-14 21:12:28,493 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-01-14 21:12:28,499 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:12:28,509 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:12:28,560 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:12:28,563 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:12:28,565 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:12:28,569 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:12:28,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 134 [2019-01-14 21:12:28,573 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2019-01-14 21:12:28,577 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:12:28,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 43 [2019-01-14 21:12:28,581 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-01-14 21:12:28,590 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:12:28,617 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:12:28,656 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:12:28,656 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 9 variables, input treesize:173, output treesize:167 [2019-01-14 21:12:29,853 INFO L701 Elim1Store]: detected not equals via solver [2019-01-14 21:12:29,855 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 43 [2019-01-14 21:12:29,858 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 30 treesize of output 17 [2019-01-14 21:12:29,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-14 21:12:29,870 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 11 treesize of output 3 [2019-01-14 21:12:29,870 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-01-14 21:12:29,877 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:12:29,906 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-14 21:12:29,907 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:188, output treesize:150 [2019-01-14 21:12:30,730 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2019-01-14 21:12:30,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 8 [2019-01-14 21:12:30,737 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-01-14 21:12:30,743 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2019-01-14 21:12:30,779 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-01-14 21:12:30,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:174, output treesize:304 [2019-01-14 21:12:31,593 WARN L307 Elim1Store]: Array PQE input equivalent to false [2019-01-14 21:12:31,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-01-14 21:12:31,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-14 21:12:31,618 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:174, output treesize:1 [2019-01-14 21:12:31,674 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 28 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 21:12:31,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 21:12:31,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 41] total 75 [2019-01-14 21:12:31,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-01-14 21:12:31,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-01-14 21:12:31,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=5325, Unknown=21, NotChecked=0, Total=5550 [2019-01-14 21:12:31,694 INFO L87 Difference]: Start difference. First operand 119 states and 123 transitions. Second operand 75 states. [2019-01-14 21:12:45,999 WARN L181 SmtUtils]: Spent 5.25 s on a formula simplification. DAG size of input: 92 DAG size of output: 59 [2019-01-14 21:12:52,511 WARN L181 SmtUtils]: Spent 6.01 s on a formula simplification. DAG size of input: 197 DAG size of output: 60 [2019-01-14 21:12:59,806 WARN L181 SmtUtils]: Spent 6.64 s on a formula simplification. DAG size of input: 136 DAG size of output: 53 [2019-01-14 21:13:07,112 WARN L181 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 62 [2019-01-14 21:13:07,511 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-01-14 21:13:07,783 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-01-14 21:13:11,413 WARN L181 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 75 [2019-01-14 21:13:12,093 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 70 [2019-01-14 21:13:12,616 WARN L181 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 117 [2019-01-14 21:13:13,325 WARN L181 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 120 [2019-01-14 21:13:14,153 WARN L181 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 182 DAG size of output: 146 [2019-01-14 21:13:14,621 WARN L181 SmtUtils]: Spent 241.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 128 [2019-01-14 21:13:15,260 WARN L181 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 126 [2019-01-14 21:13:16,040 WARN L181 SmtUtils]: Spent 378.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 147 [2019-01-14 21:13:16,530 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 120 [2019-01-14 21:13:17,249 WARN L181 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 121 [2019-01-14 21:13:17,972 WARN L181 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 136 [2019-01-14 21:13:18,374 WARN L181 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 106 [2019-01-14 21:13:18,998 WARN L181 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 117 [2019-01-14 21:13:19,663 WARN L181 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 120 [2019-01-14 21:13:20,147 WARN L181 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 112 [2019-01-14 21:13:20,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 21:13:20,323 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2019-01-14 21:13:20,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-01-14 21:13:20,326 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 78 [2019-01-14 21:13:20,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 21:13:20,326 INFO L225 Difference]: With dead ends: 81 [2019-01-14 21:13:20,327 INFO L226 Difference]: Without dead ends: 0 [2019-01-14 21:13:20,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2160 ImplicationChecksByTransitivity, 82.6s TimeCoverageRelationStatistics Valid=628, Invalid=10462, Unknown=40, NotChecked=0, Total=11130 [2019-01-14 21:13:20,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-14 21:13:20,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-14 21:13:20,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-14 21:13:20,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-14 21:13:20,329 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 78 [2019-01-14 21:13:20,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 21:13:20,329 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-14 21:13:20,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-01-14 21:13:20,329 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-14 21:13:20,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-14 21:13:20,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 09:13:20 BoogieIcfgContainer [2019-01-14 21:13:20,335 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 21:13:20,335 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 21:13:20,335 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 21:13:20,335 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 21:13:20,336 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 09:05:53" (3/4) ... [2019-01-14 21:13:20,340 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-14 21:13:20,347 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-01-14 21:13:20,347 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure insert_list [2019-01-14 21:13:20,348 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-01-14 21:13:20,348 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2019-01-14 21:13:20,348 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure search_list [2019-01-14 21:13:20,354 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-01-14 21:13:20,354 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-14 21:13:20,354 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-01-14 21:13:20,409 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 21:13:20,409 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 21:13:20,410 INFO L168 Benchmark]: Toolchain (without parser) took 448626.26 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.9 MB). Free memory was 951.4 MB in the beginning and 814.7 MB in the end (delta: 136.7 MB). Peak memory consumption was 338.5 MB. Max. memory is 11.5 GB. [2019-01-14 21:13:20,412 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:13:20,413 INFO L168 Benchmark]: CACSL2BoogieTranslator took 676.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -172.7 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2019-01-14 21:13:20,413 INFO L168 Benchmark]: Boogie Preprocessor took 70.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 21:13:20,413 INFO L168 Benchmark]: RCFGBuilder took 807.28 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: 52.3 MB). Peak memory consumption was 52.3 MB. Max. memory is 11.5 GB. [2019-01-14 21:13:20,413 INFO L168 Benchmark]: TraceAbstraction took 446992.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 822.7 MB in the end (delta: 243.7 MB). Peak memory consumption was 306.6 MB. Max. memory is 11.5 GB. [2019-01-14 21:13:20,414 INFO L168 Benchmark]: Witness Printer took 73.77 ms. Allocated memory is still 1.2 GB. Free memory was 822.7 MB in the beginning and 814.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. [2019-01-14 21:13:20,416 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 676.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 946.0 MB in the beginning and 1.1 GB in the end (delta: -172.7 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 70.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 807.28 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: 52.3 MB). Peak memory consumption was 52.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 446992.69 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 822.7 MB in the end (delta: 243.7 MB). Peak memory consumption was 306.6 MB. Max. memory is 11.5 GB. * Witness Printer took 73.77 ms. Allocated memory is still 1.2 GB. Free memory was 822.7 MB in the beginning and 814.7 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 635]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 638]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 635]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 638]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 643]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 654]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 654]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 655]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 655]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 655]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 627]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 627]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 626]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 20 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 74 locations, 20 error locations. SAFE Result, 446.9s OverallTime, 21 OverallIterations, 5 TraceHistogramMax, 306.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1047 SDtfs, 5317 SDslu, 5269 SDs, 0 SdLazy, 18970 SolverSat, 1767 SolverUnsat, 56 SolverUnknown, 0 SolverNotchecked, 63.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1411 GetRequests, 555 SyntacticMatches, 75 SemanticMatches, 781 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15020 ImplicationChecksByTransitivity, 364.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=120occurred in iteration=19, 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.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 349 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 137.5s InterpolantComputationTime, 1922 NumberOfCodeBlocks, 1918 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 1890 ConstructedInterpolants, 122 QuantifiedInterpolants, 3969223 SizeOfPredicates, 237 NumberOfNonLiveVariables, 4345 ConjunctsInSsa, 947 ConjunctsInUnsatCore, 32 InterpolantComputations, 10 PerfectInterpolantSequences, 966/1650 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...