./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/heap-manipulation/merge_sort-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 3c39aff9 Calling Ultimate with: /usr/bin/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 ../sv-benchmarks/c/heap-manipulation/merge_sort-1.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 534681b11e8e68e6058985d885b01f2cbfa43e5b .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.1.24-3c39aff [2019-11-27 19:12:51,652 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 19:12:51,654 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 19:12:51,666 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 19:12:51,666 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 19:12:51,667 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 19:12:51,669 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 19:12:51,671 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 19:12:51,673 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 19:12:51,674 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 19:12:51,675 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 19:12:51,676 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 19:12:51,676 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 19:12:51,677 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 19:12:51,678 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 19:12:51,680 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 19:12:51,681 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 19:12:51,682 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 19:12:51,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 19:12:51,686 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 19:12:51,688 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 19:12:51,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 19:12:51,691 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 19:12:51,694 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 19:12:51,699 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 19:12:51,699 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 19:12:51,700 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 19:12:51,701 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 19:12:51,701 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 19:12:51,702 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 19:12:51,703 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 19:12:51,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 19:12:51,708 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 19:12:51,709 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 19:12:51,713 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 19:12:51,713 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 19:12:51,714 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 19:12:51,714 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 19:12:51,714 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 19:12:51,717 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 19:12:51,718 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 19:12:51,722 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-11-27 19:12:51,750 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 19:12:51,750 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 19:12:51,752 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 19:12:51,753 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 19:12:51,753 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 19:12:51,753 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 19:12:51,754 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 19:12:51,754 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-27 19:12:51,754 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 19:12:51,754 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 19:12:51,756 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 19:12:51,756 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-27 19:12:51,757 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-27 19:12:51,757 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 19:12:51,757 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-27 19:12:51,758 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 19:12:51,758 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 19:12:51,758 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 19:12:51,759 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 19:12:51,759 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 19:12:51,760 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 19:12:51,760 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 19:12:51,760 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 19:12:51,760 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 19:12:51,761 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 19:12:51,761 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 19:12:51,761 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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 -> 534681b11e8e68e6058985d885b01f2cbfa43e5b [2019-11-27 19:12:52,082 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 19:12:52,096 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 19:12:52,099 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 19:12:52,101 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 19:12:52,101 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 19:12:52,102 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2019-11-27 19:12:52,163 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3dac6da1/31bf3ed0af2b421b86d1440223c65d3a/FLAG797308217 [2019-11-27 19:12:52,697 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 19:12:52,698 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2019-11-27 19:12:52,717 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3dac6da1/31bf3ed0af2b421b86d1440223c65d3a/FLAG797308217 [2019-11-27 19:12:52,992 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a3dac6da1/31bf3ed0af2b421b86d1440223c65d3a [2019-11-27 19:12:52,995 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 19:12:52,997 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-27 19:12:52,998 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 19:12:52,998 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 19:12:53,001 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 19:12:53,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:12:52" (1/1) ... [2019-11-27 19:12:53,005 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3122eb54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:12:53, skipping insertion in model container [2019-11-27 19:12:53,005 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:12:52" (1/1) ... [2019-11-27 19:12:53,013 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 19:12:53,053 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 19:12:53,518 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 19:12:53,532 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 19:12:53,598 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 19:12:53,651 INFO L208 MainTranslator]: Completed translation [2019-11-27 19:12:53,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:12:53 WrapperNode [2019-11-27 19:12:53,652 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 19:12:53,653 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 19:12:53,653 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 19:12:53,654 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 19:12:53,667 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:12:53" (1/1) ... [2019-11-27 19:12:53,667 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:12:53" (1/1) ... [2019-11-27 19:12:53,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:12:53" (1/1) ... [2019-11-27 19:12:53,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:12:53" (1/1) ... [2019-11-27 19:12:53,716 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:12:53" (1/1) ... [2019-11-27 19:12:53,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:12:53" (1/1) ... [2019-11-27 19:12:53,738 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:12:53" (1/1) ... [2019-11-27 19:12:53,746 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 19:12:53,747 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 19:12:53,747 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 19:12:53,747 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 19:12:53,748 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:12:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 19:12:53,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-27 19:12:53,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 19:12:53,804 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-27 19:12:53,805 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-27 19:12:53,805 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2019-11-27 19:12:53,805 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2019-11-27 19:12:53,806 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2019-11-27 19:12:53,807 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2019-11-27 19:12:53,807 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2019-11-27 19:12:53,807 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2019-11-27 19:12:53,808 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-27 19:12:53,808 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-27 19:12:53,809 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-27 19:12:53,810 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-27 19:12:53,810 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-27 19:12:53,810 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-27 19:12:53,810 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-27 19:12:53,811 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-27 19:12:53,813 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-27 19:12:53,813 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-27 19:12:53,814 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-27 19:12:53,814 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-27 19:12:53,814 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-27 19:12:53,814 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-27 19:12:53,815 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-27 19:12:53,815 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-27 19:12:53,815 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-27 19:12:53,815 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-27 19:12:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-27 19:12:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-27 19:12:53,816 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-27 19:12:53,817 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-27 19:12:53,817 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-27 19:12:53,817 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-27 19:12:53,817 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-27 19:12:53,818 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-27 19:12:53,818 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-27 19:12:53,818 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-27 19:12:53,818 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-27 19:12:53,818 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-27 19:12:53,819 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-27 19:12:53,819 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-27 19:12:53,819 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-27 19:12:53,820 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-27 19:12:53,820 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-27 19:12:53,821 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-27 19:12:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-27 19:12:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-27 19:12:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-27 19:12:53,822 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-27 19:12:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-27 19:12:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-27 19:12:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-27 19:12:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-27 19:12:53,823 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-27 19:12:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-27 19:12:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-27 19:12:53,824 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-27 19:12:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-27 19:12:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-27 19:12:53,825 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-27 19:12:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-27 19:12:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-27 19:12:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-27 19:12:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-27 19:12:53,826 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-27 19:12:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-27 19:12:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-27 19:12:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-27 19:12:53,827 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-27 19:12:53,828 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-27 19:12:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-27 19:12:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-27 19:12:53,829 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-27 19:12:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-27 19:12:53,830 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-27 19:12:53,831 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-27 19:12:53,832 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-27 19:12:53,832 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-27 19:12:53,832 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-27 19:12:53,833 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-27 19:12:53,833 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-27 19:12:53,833 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-27 19:12:53,833 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-27 19:12:53,834 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-27 19:12:53,834 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-27 19:12:53,834 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-27 19:12:53,834 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-27 19:12:53,834 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-27 19:12:53,834 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-27 19:12:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-27 19:12:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-27 19:12:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-27 19:12:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-27 19:12:53,835 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-27 19:12:53,836 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-27 19:12:53,836 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-27 19:12:53,836 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-27 19:12:53,836 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-27 19:12:53,837 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-27 19:12:53,837 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-27 19:12:53,837 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-27 19:12:53,837 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-27 19:12:53,837 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-27 19:12:53,838 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-27 19:12:53,838 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-27 19:12:53,838 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-27 19:12:53,838 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-27 19:12:53,838 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-27 19:12:53,838 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-27 19:12:53,839 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-27 19:12:53,839 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-27 19:12:53,839 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-27 19:12:53,839 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-27 19:12:53,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-27 19:12:53,840 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2019-11-27 19:12:53,840 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2019-11-27 19:12:53,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-27 19:12:53,841 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-27 19:12:53,841 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2019-11-27 19:12:53,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 19:12:53,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-27 19:12:53,841 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 19:12:53,842 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2019-11-27 19:12:53,842 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2019-11-27 19:12:53,843 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2019-11-27 19:12:53,843 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-27 19:12:53,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-27 19:12:53,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-27 19:12:53,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-27 19:12:53,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 19:12:54,929 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 19:12:54,930 INFO L287 CfgBuilder]: Removed 33 assume(true) statements. [2019-11-27 19:12:54,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:12:54 BoogieIcfgContainer [2019-11-27 19:12:54,935 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 19:12:54,937 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 19:12:54,937 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 19:12:54,941 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 19:12:54,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 07:12:52" (1/3) ... [2019-11-27 19:12:54,945 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c83ef36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:12:54, skipping insertion in model container [2019-11-27 19:12:54,945 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:12:53" (2/3) ... [2019-11-27 19:12:54,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c83ef36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:12:54, skipping insertion in model container [2019-11-27 19:12:54,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:12:54" (3/3) ... [2019-11-27 19:12:54,948 INFO L109 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2019-11-27 19:12:54,959 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 19:12:54,971 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 105 error locations. [2019-11-27 19:12:54,995 INFO L249 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2019-11-27 19:12:55,014 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 19:12:55,014 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-27 19:12:55,014 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 19:12:55,014 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 19:12:55,015 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 19:12:55,015 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 19:12:55,015 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 19:12:55,015 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 19:12:55,043 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states. [2019-11-27 19:12:55,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-27 19:12:55,052 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:12:55,053 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:12:55,054 INFO L410 AbstractCegarLoop]: === Iteration 1 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-27 19:12:55,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:12:55,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1848291795, now seen corresponding path program 1 times [2019-11-27 19:12:55,070 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:12:55,070 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103437567] [2019-11-27 19:12:55,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:12:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:12:55,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:12:55,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:12:55,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103437567] [2019-11-27 19:12:55,248 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:12:55,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 19:12:55,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370735435] [2019-11-27 19:12:55,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 19:12:55,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:12:55,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 19:12:55,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 19:12:55,276 INFO L87 Difference]: Start difference. First operand 279 states. Second operand 3 states. [2019-11-27 19:12:55,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:12:55,804 INFO L93 Difference]: Finished difference Result 319 states and 354 transitions. [2019-11-27 19:12:55,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 19:12:55,808 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-11-27 19:12:55,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:12:55,843 INFO L225 Difference]: With dead ends: 319 [2019-11-27 19:12:55,843 INFO L226 Difference]: Without dead ends: 315 [2019-11-27 19:12:55,846 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-11-27 19:12:55,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-27 19:12:55,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 277. [2019-11-27 19:12:55,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-11-27 19:12:55,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 303 transitions. [2019-11-27 19:12:55,961 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 303 transitions. Word has length 9 [2019-11-27 19:12:55,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:12:55,961 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 303 transitions. [2019-11-27 19:12:55,962 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 19:12:55,962 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 303 transitions. [2019-11-27 19:12:55,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-27 19:12:55,963 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:12:55,963 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:12:55,964 INFO L410 AbstractCegarLoop]: === Iteration 2 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-27 19:12:55,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:12:55,964 INFO L82 PathProgramCache]: Analyzing trace with hash 1461424039, now seen corresponding path program 1 times [2019-11-27 19:12:55,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:12:55,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875184328] [2019-11-27 19:12:55,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:12:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:12:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:12:56,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:12:56,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875184328] [2019-11-27 19:12:56,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:12:56,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 19:12:56,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299030012] [2019-11-27 19:12:56,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 19:12:56,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:12:56,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 19:12:56,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 19:12:56,085 INFO L87 Difference]: Start difference. First operand 277 states and 303 transitions. Second operand 4 states. [2019-11-27 19:12:56,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:12:56,834 INFO L93 Difference]: Finished difference Result 332 states and 369 transitions. [2019-11-27 19:12:56,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 19:12:56,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-27 19:12:56,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:12:56,839 INFO L225 Difference]: With dead ends: 332 [2019-11-27 19:12:56,839 INFO L226 Difference]: Without dead ends: 332 [2019-11-27 19:12:56,840 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 19:12:56,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2019-11-27 19:12:56,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 275. [2019-11-27 19:12:56,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-11-27 19:12:56,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 301 transitions. [2019-11-27 19:12:56,857 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 301 transitions. Word has length 10 [2019-11-27 19:12:56,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:12:56,858 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 301 transitions. [2019-11-27 19:12:56,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 19:12:56,858 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 301 transitions. [2019-11-27 19:12:56,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-27 19:12:56,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:12:56,859 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:12:56,860 INFO L410 AbstractCegarLoop]: === Iteration 3 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-27 19:12:56,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:12:56,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1461424040, now seen corresponding path program 1 times [2019-11-27 19:12:56,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:12:56,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024664125] [2019-11-27 19:12:56,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:12:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:12:56,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:12:56,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:12:56,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024664125] [2019-11-27 19:12:56,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:12:56,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 19:12:56,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776364097] [2019-11-27 19:12:56,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 19:12:56,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:12:56,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 19:12:56,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 19:12:56,942 INFO L87 Difference]: Start difference. First operand 275 states and 301 transitions. Second operand 4 states. [2019-11-27 19:12:57,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:12:57,614 INFO L93 Difference]: Finished difference Result 341 states and 379 transitions. [2019-11-27 19:12:57,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 19:12:57,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-27 19:12:57,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:12:57,618 INFO L225 Difference]: With dead ends: 341 [2019-11-27 19:12:57,618 INFO L226 Difference]: Without dead ends: 341 [2019-11-27 19:12:57,618 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 19:12:57,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-11-27 19:12:57,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 273. [2019-11-27 19:12:57,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2019-11-27 19:12:57,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 299 transitions. [2019-11-27 19:12:57,633 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 299 transitions. Word has length 10 [2019-11-27 19:12:57,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:12:57,633 INFO L462 AbstractCegarLoop]: Abstraction has 273 states and 299 transitions. [2019-11-27 19:12:57,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 19:12:57,633 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 299 transitions. [2019-11-27 19:12:57,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-27 19:12:57,634 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:12:57,634 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:12:57,635 INFO L410 AbstractCegarLoop]: === Iteration 4 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-27 19:12:57,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:12:57,635 INFO L82 PathProgramCache]: Analyzing trace with hash 180424867, now seen corresponding path program 1 times [2019-11-27 19:12:57,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:12:57,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924984347] [2019-11-27 19:12:57,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:12:57,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:12:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:12:57,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:12:57,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924984347] [2019-11-27 19:12:57,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:12:57,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-27 19:12:57,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233837009] [2019-11-27 19:12:57,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 19:12:57,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:12:57,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 19:12:57,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 19:12:57,679 INFO L87 Difference]: Start difference. First operand 273 states and 299 transitions. Second operand 4 states. [2019-11-27 19:12:58,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:12:58,199 INFO L93 Difference]: Finished difference Result 308 states and 335 transitions. [2019-11-27 19:12:58,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 19:12:58,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-27 19:12:58,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:12:58,201 INFO L225 Difference]: With dead ends: 308 [2019-11-27 19:12:58,202 INFO L226 Difference]: Without dead ends: 307 [2019-11-27 19:12:58,202 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-27 19:12:58,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-27 19:12:58,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 272. [2019-11-27 19:12:58,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2019-11-27 19:12:58,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 297 transitions. [2019-11-27 19:12:58,213 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 297 transitions. Word has length 14 [2019-11-27 19:12:58,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:12:58,213 INFO L462 AbstractCegarLoop]: Abstraction has 272 states and 297 transitions. [2019-11-27 19:12:58,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 19:12:58,213 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 297 transitions. [2019-11-27 19:12:58,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 19:12:58,214 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:12:58,214 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:12:58,215 INFO L410 AbstractCegarLoop]: === Iteration 5 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-27 19:12:58,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:12:58,215 INFO L82 PathProgramCache]: Analyzing trace with hash 438887496, now seen corresponding path program 1 times [2019-11-27 19:12:58,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:12:58,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125338476] [2019-11-27 19:12:58,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:12:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:12:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:12:58,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:12:58,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125338476] [2019-11-27 19:12:58,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:12:58,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 19:12:58,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628921366] [2019-11-27 19:12:58,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 19:12:58,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:12:58,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 19:12:58,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 19:12:58,293 INFO L87 Difference]: Start difference. First operand 272 states and 297 transitions. Second operand 4 states. [2019-11-27 19:12:58,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:12:58,877 INFO L93 Difference]: Finished difference Result 314 states and 345 transitions. [2019-11-27 19:12:58,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 19:12:58,878 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-27 19:12:58,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:12:58,880 INFO L225 Difference]: With dead ends: 314 [2019-11-27 19:12:58,881 INFO L226 Difference]: Without dead ends: 314 [2019-11-27 19:12:58,881 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 19:12:58,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-11-27 19:12:58,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 270. [2019-11-27 19:12:58,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-11-27 19:12:58,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 295 transitions. [2019-11-27 19:12:58,891 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 295 transitions. Word has length 15 [2019-11-27 19:12:58,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:12:58,891 INFO L462 AbstractCegarLoop]: Abstraction has 270 states and 295 transitions. [2019-11-27 19:12:58,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 19:12:58,891 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 295 transitions. [2019-11-27 19:12:58,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 19:12:58,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:12:58,892 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:12:58,893 INFO L410 AbstractCegarLoop]: === Iteration 6 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-27 19:12:58,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:12:58,893 INFO L82 PathProgramCache]: Analyzing trace with hash 438887497, now seen corresponding path program 1 times [2019-11-27 19:12:58,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:12:58,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194625849] [2019-11-27 19:12:58,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:12:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:12:58,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:12:58,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:12:58,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194625849] [2019-11-27 19:12:58,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:12:58,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 19:12:58,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977712708] [2019-11-27 19:12:58,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-27 19:12:58,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:12:58,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-27 19:12:58,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 19:12:58,985 INFO L87 Difference]: Start difference. First operand 270 states and 295 transitions. Second operand 4 states. [2019-11-27 19:12:59,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:12:59,599 INFO L93 Difference]: Finished difference Result 323 states and 355 transitions. [2019-11-27 19:12:59,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-27 19:12:59,599 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-27 19:12:59,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:12:59,602 INFO L225 Difference]: With dead ends: 323 [2019-11-27 19:12:59,602 INFO L226 Difference]: Without dead ends: 323 [2019-11-27 19:12:59,603 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-27 19:12:59,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-11-27 19:12:59,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 268. [2019-11-27 19:12:59,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-11-27 19:12:59,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 293 transitions. [2019-11-27 19:12:59,615 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 293 transitions. Word has length 15 [2019-11-27 19:12:59,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:12:59,615 INFO L462 AbstractCegarLoop]: Abstraction has 268 states and 293 transitions. [2019-11-27 19:12:59,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-27 19:12:59,616 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 293 transitions. [2019-11-27 19:12:59,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-27 19:12:59,617 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:12:59,617 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:12:59,618 INFO L410 AbstractCegarLoop]: === Iteration 7 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-27 19:12:59,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:12:59,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1724277052, now seen corresponding path program 1 times [2019-11-27 19:12:59,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:12:59,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838282011] [2019-11-27 19:12:59,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:12:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:12:59,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:12:59,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:12:59,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838282011] [2019-11-27 19:12:59,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:12:59,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-27 19:12:59,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27843179] [2019-11-27 19:12:59,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-27 19:12:59,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:12:59,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-27 19:12:59,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-27 19:12:59,681 INFO L87 Difference]: Start difference. First operand 268 states and 293 transitions. Second operand 5 states. [2019-11-27 19:13:00,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:13:00,297 INFO L93 Difference]: Finished difference Result 327 states and 359 transitions. [2019-11-27 19:13:00,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-27 19:13:00,297 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-11-27 19:13:00,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:13:00,300 INFO L225 Difference]: With dead ends: 327 [2019-11-27 19:13:00,300 INFO L226 Difference]: Without dead ends: 327 [2019-11-27 19:13:00,300 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-27 19:13:00,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-11-27 19:13:00,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 268. [2019-11-27 19:13:00,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 268 states. [2019-11-27 19:13:00,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 292 transitions. [2019-11-27 19:13:00,314 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 292 transitions. Word has length 21 [2019-11-27 19:13:00,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:13:00,315 INFO L462 AbstractCegarLoop]: Abstraction has 268 states and 292 transitions. [2019-11-27 19:13:00,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-27 19:13:00,315 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 292 transitions. [2019-11-27 19:13:00,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 19:13:00,316 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:13:00,317 INFO L410 BasicCegarLoop]: trace histogram [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-11-27 19:13:00,317 INFO L410 AbstractCegarLoop]: === Iteration 8 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-27 19:13:00,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:13:00,318 INFO L82 PathProgramCache]: Analyzing trace with hash 410367502, now seen corresponding path program 1 times [2019-11-27 19:13:00,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:13:00,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800198195] [2019-11-27 19:13:00,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:13:00,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:13:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:13:00,430 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:13:00,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800198195] [2019-11-27 19:13:00,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:13:00,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-27 19:13:00,431 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751398419] [2019-11-27 19:13:00,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 19:13:00,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:13:00,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 19:13:00,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-27 19:13:00,432 INFO L87 Difference]: Start difference. First operand 268 states and 292 transitions. Second operand 7 states. [2019-11-27 19:13:01,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:13:01,369 INFO L93 Difference]: Finished difference Result 382 states and 420 transitions. [2019-11-27 19:13:01,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 19:13:01,373 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-27 19:13:01,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:13:01,375 INFO L225 Difference]: With dead ends: 382 [2019-11-27 19:13:01,376 INFO L226 Difference]: Without dead ends: 382 [2019-11-27 19:13:01,378 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-27 19:13:01,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-27 19:13:01,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 271. [2019-11-27 19:13:01,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-11-27 19:13:01,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 297 transitions. [2019-11-27 19:13:01,388 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 297 transitions. Word has length 25 [2019-11-27 19:13:01,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:13:01,389 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 297 transitions. [2019-11-27 19:13:01,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 19:13:01,389 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 297 transitions. [2019-11-27 19:13:01,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 19:13:01,390 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:13:01,390 INFO L410 BasicCegarLoop]: trace histogram [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-11-27 19:13:01,390 INFO L410 AbstractCegarLoop]: === Iteration 9 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-27 19:13:01,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:13:01,391 INFO L82 PathProgramCache]: Analyzing trace with hash 410353194, now seen corresponding path program 1 times [2019-11-27 19:13:01,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:13:01,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590041117] [2019-11-27 19:13:01,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:13:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:13:01,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:13:01,477 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:13:01,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590041117] [2019-11-27 19:13:01,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:13:01,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-27 19:13:01,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280866539] [2019-11-27 19:13:01,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 19:13:01,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:13:01,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 19:13:01,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-27 19:13:01,480 INFO L87 Difference]: Start difference. First operand 271 states and 297 transitions. Second operand 7 states. [2019-11-27 19:13:02,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:13:02,564 INFO L93 Difference]: Finished difference Result 310 states and 341 transitions. [2019-11-27 19:13:02,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-27 19:13:02,565 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-27 19:13:02,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:13:02,567 INFO L225 Difference]: With dead ends: 310 [2019-11-27 19:13:02,567 INFO L226 Difference]: Without dead ends: 310 [2019-11-27 19:13:02,568 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-27 19:13:02,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2019-11-27 19:13:02,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 263. [2019-11-27 19:13:02,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2019-11-27 19:13:02,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 289 transitions. [2019-11-27 19:13:02,584 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 289 transitions. Word has length 25 [2019-11-27 19:13:02,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:13:02,587 INFO L462 AbstractCegarLoop]: Abstraction has 263 states and 289 transitions. [2019-11-27 19:13:02,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 19:13:02,588 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 289 transitions. [2019-11-27 19:13:02,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-27 19:13:02,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:13:02,589 INFO L410 BasicCegarLoop]: trace histogram [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-11-27 19:13:02,589 INFO L410 AbstractCegarLoop]: === Iteration 10 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-27 19:13:02,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:13:02,590 INFO L82 PathProgramCache]: Analyzing trace with hash 410353195, now seen corresponding path program 1 times [2019-11-27 19:13:02,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:13:02,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428580197] [2019-11-27 19:13:02,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:13:02,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:13:02,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:13:02,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:13:02,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428580197] [2019-11-27 19:13:02,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:13:02,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-27 19:13:02,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309899755] [2019-11-27 19:13:02,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-27 19:13:02,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:13:02,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-27 19:13:02,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-27 19:13:02,737 INFO L87 Difference]: Start difference. First operand 263 states and 289 transitions. Second operand 7 states. [2019-11-27 19:13:03,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:13:03,945 INFO L93 Difference]: Finished difference Result 351 states and 388 transitions. [2019-11-27 19:13:03,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-27 19:13:03,946 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-27 19:13:03,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:13:03,949 INFO L225 Difference]: With dead ends: 351 [2019-11-27 19:13:03,950 INFO L226 Difference]: Without dead ends: 351 [2019-11-27 19:13:03,950 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-27 19:13:03,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-11-27 19:13:03,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 288. [2019-11-27 19:13:03,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-11-27 19:13:03,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 321 transitions. [2019-11-27 19:13:03,960 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 321 transitions. Word has length 25 [2019-11-27 19:13:03,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:13:03,960 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 321 transitions. [2019-11-27 19:13:03,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-27 19:13:03,960 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 321 transitions. [2019-11-27 19:13:03,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-27 19:13:03,961 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:13:03,962 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:13:03,962 INFO L410 AbstractCegarLoop]: === Iteration 11 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-27 19:13:03,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:13:03,963 INFO L82 PathProgramCache]: Analyzing trace with hash -576712388, now seen corresponding path program 1 times [2019-11-27 19:13:03,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:13:03,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055585865] [2019-11-27 19:13:03,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:13:03,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:13:04,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:13:04,041 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 19:13:04,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055585865] [2019-11-27 19:13:04,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:13:04,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-27 19:13:04,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719094953] [2019-11-27 19:13:04,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 19:13:04,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:13:04,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 19:13:04,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-27 19:13:04,044 INFO L87 Difference]: Start difference. First operand 288 states and 321 transitions. Second operand 6 states. [2019-11-27 19:13:04,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:13:04,804 INFO L93 Difference]: Finished difference Result 307 states and 341 transitions. [2019-11-27 19:13:04,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 19:13:04,805 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-27 19:13:04,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:13:04,808 INFO L225 Difference]: With dead ends: 307 [2019-11-27 19:13:04,809 INFO L226 Difference]: Without dead ends: 307 [2019-11-27 19:13:04,809 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-27 19:13:04,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-11-27 19:13:04,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 287. [2019-11-27 19:13:04,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-27 19:13:04,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 318 transitions. [2019-11-27 19:13:04,825 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 318 transitions. Word has length 32 [2019-11-27 19:13:04,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:13:04,826 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 318 transitions. [2019-11-27 19:13:04,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 19:13:04,826 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 318 transitions. [2019-11-27 19:13:04,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-27 19:13:04,834 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:13:04,834 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:13:04,835 INFO L410 AbstractCegarLoop]: === Iteration 12 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-27 19:13:04,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:13:04,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1257129466, now seen corresponding path program 1 times [2019-11-27 19:13:04,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:13:04,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783395544] [2019-11-27 19:13:04,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:13:04,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:13:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:13:04,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-27 19:13:04,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783395544] [2019-11-27 19:13:04,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:13:04,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-27 19:13:04,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033044342] [2019-11-27 19:13:04,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-27 19:13:04,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:13:04,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-27 19:13:04,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-27 19:13:04,932 INFO L87 Difference]: Start difference. First operand 287 states and 318 transitions. Second operand 6 states. [2019-11-27 19:13:05,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:13:05,692 INFO L93 Difference]: Finished difference Result 306 states and 338 transitions. [2019-11-27 19:13:05,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 19:13:05,692 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-11-27 19:13:05,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:13:05,695 INFO L225 Difference]: With dead ends: 306 [2019-11-27 19:13:05,695 INFO L226 Difference]: Without dead ends: 306 [2019-11-27 19:13:05,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-11-27 19:13:05,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2019-11-27 19:13:05,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 286. [2019-11-27 19:13:05,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-11-27 19:13:05,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 315 transitions. [2019-11-27 19:13:05,704 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 315 transitions. Word has length 32 [2019-11-27 19:13:05,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:13:05,704 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 315 transitions. [2019-11-27 19:13:05,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-27 19:13:05,705 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 315 transitions. [2019-11-27 19:13:05,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-27 19:13:05,706 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:13:05,706 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:13:05,706 INFO L410 AbstractCegarLoop]: === Iteration 13 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-27 19:13:05,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:13:05,707 INFO L82 PathProgramCache]: Analyzing trace with hash -1283785288, now seen corresponding path program 1 times [2019-11-27 19:13:05,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:13:05,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311169357] [2019-11-27 19:13:05,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:13:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:13:05,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:13:05,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:13:05,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311169357] [2019-11-27 19:13:05,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:13:05,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-27 19:13:05,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83691646] [2019-11-27 19:13:05,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-27 19:13:05,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:13:05,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-27 19:13:05,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-27 19:13:05,843 INFO L87 Difference]: Start difference. First operand 286 states and 315 transitions. Second operand 9 states. [2019-11-27 19:13:07,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:13:07,003 INFO L93 Difference]: Finished difference Result 341 states and 373 transitions. [2019-11-27 19:13:07,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 19:13:07,003 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-11-27 19:13:07,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:13:07,008 INFO L225 Difference]: With dead ends: 341 [2019-11-27 19:13:07,008 INFO L226 Difference]: Without dead ends: 341 [2019-11-27 19:13:07,009 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-27 19:13:07,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-11-27 19:13:07,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 286. [2019-11-27 19:13:07,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-11-27 19:13:07,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 314 transitions. [2019-11-27 19:13:07,024 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 314 transitions. Word has length 35 [2019-11-27 19:13:07,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:13:07,026 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 314 transitions. [2019-11-27 19:13:07,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-27 19:13:07,026 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 314 transitions. [2019-11-27 19:13:07,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-27 19:13:07,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:13:07,030 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:13:07,030 INFO L410 AbstractCegarLoop]: === Iteration 14 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-27 19:13:07,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:13:07,031 INFO L82 PathProgramCache]: Analyzing trace with hash 584864395, now seen corresponding path program 1 times [2019-11-27 19:13:07,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:13:07,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406690654] [2019-11-27 19:13:07,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:13:07,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:13:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:13:07,164 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:13:07,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406690654] [2019-11-27 19:13:07,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:13:07,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-27 19:13:07,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162801164] [2019-11-27 19:13:07,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-27 19:13:07,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:13:07,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-27 19:13:07,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-27 19:13:07,166 INFO L87 Difference]: Start difference. First operand 286 states and 314 transitions. Second operand 9 states. [2019-11-27 19:13:08,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:13:08,342 INFO L93 Difference]: Finished difference Result 340 states and 371 transitions. [2019-11-27 19:13:08,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 19:13:08,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-11-27 19:13:08,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:13:08,345 INFO L225 Difference]: With dead ends: 340 [2019-11-27 19:13:08,346 INFO L226 Difference]: Without dead ends: 340 [2019-11-27 19:13:08,346 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-27 19:13:08,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-11-27 19:13:08,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 286. [2019-11-27 19:13:08,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-11-27 19:13:08,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 313 transitions. [2019-11-27 19:13:08,354 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 313 transitions. Word has length 35 [2019-11-27 19:13:08,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:13:08,354 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 313 transitions. [2019-11-27 19:13:08,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-27 19:13:08,355 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 313 transitions. [2019-11-27 19:13:08,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-27 19:13:08,356 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:13:08,356 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:13:08,356 INFO L410 AbstractCegarLoop]: === Iteration 15 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-27 19:13:08,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:13:08,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1142948309, now seen corresponding path program 1 times [2019-11-27 19:13:08,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:13:08,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812779606] [2019-11-27 19:13:08,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:13:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:13:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:13:08,503 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:13:08,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812779606] [2019-11-27 19:13:08,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:13:08,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-27 19:13:08,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81340409] [2019-11-27 19:13:08,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-27 19:13:08,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:13:08,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-27 19:13:08,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-27 19:13:08,507 INFO L87 Difference]: Start difference. First operand 286 states and 313 transitions. Second operand 11 states. [2019-11-27 19:13:10,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:13:10,199 INFO L93 Difference]: Finished difference Result 354 states and 389 transitions. [2019-11-27 19:13:10,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 19:13:10,200 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-11-27 19:13:10,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:13:10,203 INFO L225 Difference]: With dead ends: 354 [2019-11-27 19:13:10,203 INFO L226 Difference]: Without dead ends: 354 [2019-11-27 19:13:10,203 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-11-27 19:13:10,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-11-27 19:13:10,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 287. [2019-11-27 19:13:10,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-27 19:13:10,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 315 transitions. [2019-11-27 19:13:10,212 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 315 transitions. Word has length 36 [2019-11-27 19:13:10,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:13:10,212 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 315 transitions. [2019-11-27 19:13:10,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-27 19:13:10,213 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 315 transitions. [2019-11-27 19:13:10,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-27 19:13:10,213 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:13:10,214 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:13:10,214 INFO L410 AbstractCegarLoop]: === Iteration 16 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-27 19:13:10,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:13:10,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1142948308, now seen corresponding path program 1 times [2019-11-27 19:13:10,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:13:10,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852154232] [2019-11-27 19:13:10,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:13:10,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:13:10,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:13:10,346 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:13:10,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852154232] [2019-11-27 19:13:10,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:13:10,350 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-27 19:13:10,350 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715044935] [2019-11-27 19:13:10,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-27 19:13:10,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:13:10,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-27 19:13:10,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-27 19:13:10,351 INFO L87 Difference]: Start difference. First operand 287 states and 315 transitions. Second operand 9 states. [2019-11-27 19:13:11,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:13:11,942 INFO L93 Difference]: Finished difference Result 338 states and 369 transitions. [2019-11-27 19:13:11,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 19:13:11,943 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-11-27 19:13:11,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:13:11,945 INFO L225 Difference]: With dead ends: 338 [2019-11-27 19:13:11,946 INFO L226 Difference]: Without dead ends: 338 [2019-11-27 19:13:11,946 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-27 19:13:11,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-11-27 19:13:11,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 287. [2019-11-27 19:13:11,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-27 19:13:11,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 314 transitions. [2019-11-27 19:13:11,955 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 314 transitions. Word has length 36 [2019-11-27 19:13:11,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:13:11,956 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 314 transitions. [2019-11-27 19:13:11,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-27 19:13:11,956 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 314 transitions. [2019-11-27 19:13:11,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-27 19:13:11,957 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:13:11,957 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:13:11,958 INFO L410 AbstractCegarLoop]: === Iteration 17 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-27 19:13:11,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:13:11,959 INFO L82 PathProgramCache]: Analyzing trace with hash 950542285, now seen corresponding path program 1 times [2019-11-27 19:13:11,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:13:11,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196272227] [2019-11-27 19:13:11,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:13:11,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:13:12,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:13:12,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:13:12,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196272227] [2019-11-27 19:13:12,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:13:12,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-27 19:13:12,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479374023] [2019-11-27 19:13:12,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-27 19:13:12,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:13:12,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-27 19:13:12,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-27 19:13:12,134 INFO L87 Difference]: Start difference. First operand 287 states and 314 transitions. Second operand 11 states. [2019-11-27 19:13:13,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:13:13,852 INFO L93 Difference]: Finished difference Result 352 states and 387 transitions. [2019-11-27 19:13:13,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 19:13:13,853 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-11-27 19:13:13,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:13:13,856 INFO L225 Difference]: With dead ends: 352 [2019-11-27 19:13:13,856 INFO L226 Difference]: Without dead ends: 352 [2019-11-27 19:13:13,857 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2019-11-27 19:13:13,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2019-11-27 19:13:13,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 287. [2019-11-27 19:13:13,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-27 19:13:13,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 313 transitions. [2019-11-27 19:13:13,868 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 313 transitions. Word has length 36 [2019-11-27 19:13:13,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:13:13,868 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 313 transitions. [2019-11-27 19:13:13,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-27 19:13:13,869 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 313 transitions. [2019-11-27 19:13:13,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-27 19:13:13,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:13:13,869 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:13:13,870 INFO L410 AbstractCegarLoop]: === Iteration 18 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-27 19:13:13,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:13:13,872 INFO L82 PathProgramCache]: Analyzing trace with hash 950542286, now seen corresponding path program 1 times [2019-11-27 19:13:13,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:13:13,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346327042] [2019-11-27 19:13:13,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:13:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:13:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 19:13:14,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 19:13:14,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346327042] [2019-11-27 19:13:14,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 19:13:14,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-27 19:13:14,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723214476] [2019-11-27 19:13:14,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-27 19:13:14,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 19:13:14,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-27 19:13:14,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-27 19:13:14,073 INFO L87 Difference]: Start difference. First operand 287 states and 313 transitions. Second operand 9 states. [2019-11-27 19:13:15,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 19:13:15,497 INFO L93 Difference]: Finished difference Result 336 states and 367 transitions. [2019-11-27 19:13:15,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-27 19:13:15,497 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-11-27 19:13:15,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 19:13:15,500 INFO L225 Difference]: With dead ends: 336 [2019-11-27 19:13:15,500 INFO L226 Difference]: Without dead ends: 336 [2019-11-27 19:13:15,501 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-11-27 19:13:15,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-11-27 19:13:15,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 287. [2019-11-27 19:13:15,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2019-11-27 19:13:15,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 312 transitions. [2019-11-27 19:13:15,508 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 312 transitions. Word has length 36 [2019-11-27 19:13:15,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 19:13:15,509 INFO L462 AbstractCegarLoop]: Abstraction has 287 states and 312 transitions. [2019-11-27 19:13:15,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-27 19:13:15,509 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 312 transitions. [2019-11-27 19:13:15,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-27 19:13:15,510 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 19:13:15,510 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 19:13:15,510 INFO L410 AbstractCegarLoop]: === Iteration 19 === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr16REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr9REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION]=== [2019-11-27 19:13:15,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 19:13:15,511 INFO L82 PathProgramCache]: Analyzing trace with hash 927806725, now seen corresponding path program 1 times [2019-11-27 19:13:15,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 19:13:15,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923412736] [2019-11-27 19:13:15,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 19:13:15,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 19:13:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 19:13:15,570 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 19:13:15,570 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 19:13:15,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 07:13:15 BoogieIcfgContainer [2019-11-27 19:13:15,607 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 19:13:15,607 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 19:13:15,607 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 19:13:15,608 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 19:13:15,608 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:12:54" (3/4) ... [2019-11-27 19:13:15,612 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-27 19:13:15,705 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-27 19:13:15,706 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 19:13:15,708 INFO L168 Benchmark]: Toolchain (without parser) took 22710.83 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 378.0 MB). Free memory was 946.9 MB in the beginning and 812.7 MB in the end (delta: 134.3 MB). Peak memory consumption was 512.3 MB. Max. memory is 11.5 GB. [2019-11-27 19:13:15,709 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 19:13:15,709 INFO L168 Benchmark]: CACSL2BoogieTranslator took 655.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -151.6 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-27 19:13:15,710 INFO L168 Benchmark]: Boogie Preprocessor took 93.43 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-11-27 19:13:15,710 INFO L168 Benchmark]: RCFGBuilder took 1188.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.0 MB). Peak memory consumption was 97.0 MB. Max. memory is 11.5 GB. [2019-11-27 19:13:15,711 INFO L168 Benchmark]: TraceAbstraction took 20670.06 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 248.0 MB). Free memory was 1.0 GB in the beginning and 816.6 MB in the end (delta: 184.9 MB). Peak memory consumption was 432.9 MB. Max. memory is 11.5 GB. [2019-11-27 19:13:15,712 INFO L168 Benchmark]: Witness Printer took 98.57 ms. Allocated memory is still 1.4 GB. Free memory was 816.6 MB in the beginning and 812.7 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 11.5 GB. [2019-11-27 19:13:15,714 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 655.08 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.0 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -151.6 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 93.43 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 1188.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 97.0 MB). Peak memory consumption was 97.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20670.06 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 248.0 MB). Free memory was 1.0 GB in the beginning and 816.6 MB in the end (delta: 184.9 MB). Peak memory consumption was 432.9 MB. Max. memory is 11.5 GB. * Witness Printer took 98.57 ms. Allocated memory is still 1.4 GB. Free memory was 816.6 MB in the beginning and 812.7 MB in the end (delta: 3.9 MB). Peak memory consumption was 3.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 554]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L627] struct list *data = ((void *)0); VAL [data={0:0}] [L628] COND TRUE __VERIFIER_nondet_int() [L629] struct node *node = malloc(sizeof *node); VAL [data={0:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L630] COND FALSE !(!node) VAL [data={0:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L632] node->next = node VAL [data={0:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L633] node->value = __VERIFIER_nondet_int() VAL [__VERIFIER_nondet_int()=0, data={0:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L634] struct list *item = malloc(sizeof *item); VAL [data={0:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L635] COND FALSE !(!item) VAL [data={0:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L637] item->slist = node VAL [data={0:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L638] item->next = data VAL [data={0:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L639] data = item VAL [data={-2:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) VAL [data={-2:0}, item={-2:0}, malloc(sizeof *item)={-2:0}, malloc(sizeof *node)={-1:0}, node={-1:0}] [L643] CALL inspect_before(data) VAL [shape={-2:0}] [L604] COND FALSE !(!(shape)) VAL [shape={-2:0}, shape={-2:0}] [L605] shape->next VAL [shape={-2:0}, shape={-2:0}, shape->next={0:0}] [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) VAL [shape={-2:0}, shape={-2:0}] [L612] EXPR shape->next VAL [shape={-2:0}, shape={-2:0}, shape->next={0:0}] [L612] COND FALSE !(!(shape->next == ((void *)0))) [L613] EXPR shape->slist VAL [shape={-2:0}, shape={-2:0}, shape->slist={-1:0}] [L613] COND FALSE !(!(shape->slist)) [L614] EXPR shape->slist VAL [shape={-2:0}, shape={-2:0}, shape->slist={-1:0}] [L614] EXPR shape->slist->next VAL [shape={-2:0}, shape={-2:0}, shape->slist={-1:0}, shape->slist->next={-1:0}] [L614] COND TRUE !(shape->slist->next == ((void *)0)) [L614] CALL fail() [L554] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 285 locations, 105 error locations. Result: UNSAFE, OverallTime: 20.5s, OverallIterations: 19, TraceHistogramMax: 2, AutomataDifference: 17.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3941 SDtfs, 5118 SDslu, 5522 SDs, 0 SdLazy, 15502 SolverSat, 622 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 56 SyntacticMatches, 9 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=288occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 958 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 486 NumberOfCodeBlocks, 486 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 429 ConstructedInterpolants, 0 QuantifiedInterpolants, 85308 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 24/24 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...