./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4ea935fa-f2ae-45aa-a4de-22c09b5694e4/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4ea935fa-f2ae-45aa-a4de-22c09b5694e4/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4ea935fa-f2ae-45aa-a4de-22c09b5694e4/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4ea935fa-f2ae-45aa-a4de-22c09b5694e4/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4ea935fa-f2ae-45aa-a4de-22c09b5694e4/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4ea935fa-f2ae-45aa-a4de-22c09b5694e4/bin/uautomizer --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 Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:54:47,947 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:47,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:47,960 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:47,961 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:47,962 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:47,963 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:47,969 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:47,970 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:47,971 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:47,972 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:47,973 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:47,973 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:47,974 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:47,975 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:47,976 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:47,977 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:47,977 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:47,979 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:47,981 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:47,982 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:47,983 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:47,984 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:47,985 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:47,987 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:47,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:47,991 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:47,992 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:47,992 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:47,993 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:47,993 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:47,994 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:47,994 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:47,997 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:47,998 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:47,998 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:47,999 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:47,999 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:47,999 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:48,000 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:48,001 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:48,001 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4ea935fa-f2ae-45aa-a4de-22c09b5694e4/bin/uautomizer/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-10-22 08:54:48,020 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:48,020 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:48,021 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:48,022 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:48,022 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:48,022 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:48,022 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:54:48,022 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 08:54:48,023 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:54:48,023 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:54:48,026 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:48,026 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-10-22 08:54:48,026 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-10-22 08:54:48,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:54:48,026 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:54:48,027 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:48,027 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:48,027 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:48,027 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:54:48,028 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:54:48,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:54:48,028 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:48,028 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:54:48,028 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:54:48,029 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:54:48,029 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_4ea935fa-f2ae-45aa-a4de-22c09b5694e4/bin/uautomizer 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-10-22 08:54:48,072 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:48,095 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:48,098 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:48,102 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:48,103 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:48,103 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4ea935fa-f2ae-45aa-a4de-22c09b5694e4/bin/uautomizer/../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2019-10-22 08:54:48,166 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4ea935fa-f2ae-45aa-a4de-22c09b5694e4/bin/uautomizer/data/b3e120ddb/f5f20a1ff2d14b7d8a45f69ca2827909/FLAGe8d05d4e2 [2019-10-22 08:54:48,680 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:48,681 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4ea935fa-f2ae-45aa-a4de-22c09b5694e4/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2019-10-22 08:54:48,694 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4ea935fa-f2ae-45aa-a4de-22c09b5694e4/bin/uautomizer/data/b3e120ddb/f5f20a1ff2d14b7d8a45f69ca2827909/FLAGe8d05d4e2 [2019-10-22 08:54:48,922 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4ea935fa-f2ae-45aa-a4de-22c09b5694e4/bin/uautomizer/data/b3e120ddb/f5f20a1ff2d14b7d8a45f69ca2827909 [2019-10-22 08:54:48,925 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:48,926 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-10-22 08:54:48,927 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:48,928 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:48,933 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:48,934 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:48" (1/1) ... [2019-10-22 08:54:48,937 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dc8848c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:48, skipping insertion in model container [2019-10-22 08:54:48,937 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:48" (1/1) ... [2019-10-22 08:54:48,946 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:49,002 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:49,451 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:49,467 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:49,558 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:49,606 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:49,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49 WrapperNode [2019-10-22 08:54:49,607 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:49,608 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:49,608 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:49,608 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:49,624 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49" (1/1) ... [2019-10-22 08:54:49,624 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49" (1/1) ... [2019-10-22 08:54:49,645 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49" (1/1) ... [2019-10-22 08:54:49,645 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49" (1/1) ... [2019-10-22 08:54:49,680 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49" (1/1) ... [2019-10-22 08:54:49,690 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49" (1/1) ... [2019-10-22 08:54:49,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49" (1/1) ... [2019-10-22 08:54:49,701 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:49,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:49,702 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:49,702 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:49,703 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4ea935fa-f2ae-45aa-a4de-22c09b5694e4/bin/uautomizer/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-10-22 08:54:49,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-22 08:54:49,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:54:49,757 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-10-22 08:54:49,758 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-10-22 08:54:49,758 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2019-10-22 08:54:49,758 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2019-10-22 08:54:49,758 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_pair [2019-10-22 08:54:49,758 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_sort_core [2019-10-22 08:54:49,758 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_before [2019-10-22 08:54:49,759 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect_after [2019-10-22 08:54:49,759 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-22 08:54:49,759 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-22 08:54:49,759 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-10-22 08:54:49,760 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-10-22 08:54:49,760 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-22 08:54:49,760 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-22 08:54:49,760 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-22 08:54:49,760 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-22 08:54:49,761 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-22 08:54:49,761 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-22 08:54:49,761 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-22 08:54:49,761 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-22 08:54:49,762 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-22 08:54:49,762 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-22 08:54:49,762 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-22 08:54:49,762 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-22 08:54:49,762 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-22 08:54:49,762 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-22 08:54:49,763 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-22 08:54:49,763 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-22 08:54:49,763 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-22 08:54:49,763 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-22 08:54:49,763 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-22 08:54:49,763 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-22 08:54:49,763 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-22 08:54:49,764 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-22 08:54:49,764 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-22 08:54:49,764 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-22 08:54:49,764 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-22 08:54:49,764 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-22 08:54:49,764 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-22 08:54:49,764 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-22 08:54:49,765 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-22 08:54:49,765 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-22 08:54:49,765 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-22 08:54:49,765 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-22 08:54:49,765 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-22 08:54:49,766 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-22 08:54:49,766 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-22 08:54:49,766 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-22 08:54:49,766 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-22 08:54:49,766 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-22 08:54:49,766 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-22 08:54:49,767 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-22 08:54:49,767 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-22 08:54:49,767 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-22 08:54:49,768 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-22 08:54:49,768 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-22 08:54:49,768 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-22 08:54:49,768 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-22 08:54:49,769 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-22 08:54:49,769 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-22 08:54:49,769 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-22 08:54:49,769 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-22 08:54:49,769 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-22 08:54:49,769 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-22 08:54:49,769 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-22 08:54:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-22 08:54:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-22 08:54:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-22 08:54:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-22 08:54:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-22 08:54:49,770 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-22 08:54:49,771 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-22 08:54:49,771 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-22 08:54:49,771 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-22 08:54:49,772 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-22 08:54:49,772 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-22 08:54:49,772 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-22 08:54:49,772 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-22 08:54:49,772 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-22 08:54:49,772 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-22 08:54:49,773 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-22 08:54:49,773 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-22 08:54:49,773 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-22 08:54:49,773 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-22 08:54:49,773 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-22 08:54:49,773 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-22 08:54:49,773 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-22 08:54:49,774 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-22 08:54:49,774 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-22 08:54:49,774 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-22 08:54:49,774 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-22 08:54:49,774 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-22 08:54:49,774 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-22 08:54:49,774 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-22 08:54:49,775 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-22 08:54:49,775 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-22 08:54:49,775 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-22 08:54:49,775 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-22 08:54:49,776 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-22 08:54:49,776 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-22 08:54:49,776 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-22 08:54:49,776 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-22 08:54:49,776 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-22 08:54:49,776 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-22 08:54:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-22 08:54:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-22 08:54:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-22 08:54:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-22 08:54:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-22 08:54:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-22 08:54:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-22 08:54:49,777 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-22 08:54:49,778 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-22 08:54:49,778 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2019-10-22 08:54:49,778 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2019-10-22 08:54:49,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 08:54:49,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 08:54:49,778 INFO L130 BoogieDeclarations]: Found specification of procedure merge_pair [2019-10-22 08:54:49,779 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:54:49,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:54:49,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:54:49,779 INFO L130 BoogieDeclarations]: Found specification of procedure seq_sort_core [2019-10-22 08:54:49,780 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_before [2019-10-22 08:54:49,780 INFO L130 BoogieDeclarations]: Found specification of procedure inspect_after [2019-10-22 08:54:49,780 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-22 08:54:49,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 08:54:49,780 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:54:49,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-22 08:54:49,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:50,908 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:54:50,908 INFO L284 CfgBuilder]: Removed 33 assume(true) statements. [2019-10-22 08:54:50,910 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:50 BoogieIcfgContainer [2019-10-22 08:54:50,910 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:54:50,911 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:54:50,911 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:54:50,914 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:54:50,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:54:48" (1/3) ... [2019-10-22 08:54:50,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7aa81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:54:50, skipping insertion in model container [2019-10-22 08:54:50,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:49" (2/3) ... [2019-10-22 08:54:50,916 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7aa81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:54:50, skipping insertion in model container [2019-10-22 08:54:50,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:50" (3/3) ... [2019-10-22 08:54:50,918 INFO L109 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2019-10-22 08:54:50,926 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:54:50,935 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 104 error locations. [2019-10-22 08:54:50,943 INFO L249 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2019-10-22 08:54:50,959 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:54:50,960 INFO L374 AbstractCegarLoop]: Hoare is false [2019-10-22 08:54:50,960 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:54:50,960 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:54:50,960 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:54:50,960 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:54:50,960 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:54:50,960 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:54:50,987 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states. [2019-10-22 08:54:50,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-10-22 08:54:50,997 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:50,998 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:51,000 INFO L410 AbstractCegarLoop]: === Iteration 1 === [merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION]=== [2019-10-22 08:54:51,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:51,006 INFO L82 PathProgramCache]: Analyzing trace with hash 995848786, now seen corresponding path program 1 times [2019-10-22 08:54:51,015 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:51,016 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502806388] [2019-10-22 08:54:51,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,016 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:51,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502806388] [2019-10-22 08:54:51,168 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:51,168 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:51,169 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145821556] [2019-10-22 08:54:51,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:51,173 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:51,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:51,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:51,191 INFO L87 Difference]: Start difference. First operand 278 states. Second operand 3 states. [2019-10-22 08:54:51,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:51,735 INFO L93 Difference]: Finished difference Result 318 states and 353 transitions. [2019-10-22 08:54:51,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:51,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-10-22 08:54:51,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:51,755 INFO L225 Difference]: With dead ends: 318 [2019-10-22 08:54:51,758 INFO L226 Difference]: Without dead ends: 300 [2019-10-22 08:54:51,760 INFO L600 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-10-22 08:54:51,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-10-22 08:54:51,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 262. [2019-10-22 08:54:51,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-10-22 08:54:51,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 276 transitions. [2019-10-22 08:54:51,858 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 276 transitions. Word has length 9 [2019-10-22 08:54:51,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:51,859 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 276 transitions. [2019-10-22 08:54:51,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:51,859 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 276 transitions. [2019-10-22 08:54:51,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 08:54:51,860 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:51,860 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:51,861 INFO L410 AbstractCegarLoop]: === Iteration 2 === [merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION]=== [2019-10-22 08:54:51,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:51,861 INFO L82 PathProgramCache]: Analyzing trace with hash 805494535, now seen corresponding path program 1 times [2019-10-22 08:54:51,861 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:51,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100210513] [2019-10-22 08:54:51,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:51,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:51,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:51,939 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100210513] [2019-10-22 08:54:51,939 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:51,939 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:51,940 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784647066] [2019-10-22 08:54:51,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:54:51,942 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:51,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:51,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:51,943 INFO L87 Difference]: Start difference. First operand 262 states and 276 transitions. Second operand 4 states. [2019-10-22 08:54:52,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:52,651 INFO L93 Difference]: Finished difference Result 317 states and 342 transitions. [2019-10-22 08:54:52,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:54:52,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-22 08:54:52,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:52,654 INFO L225 Difference]: With dead ends: 317 [2019-10-22 08:54:52,654 INFO L226 Difference]: Without dead ends: 317 [2019-10-22 08:54:52,655 INFO L600 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-10-22 08:54:52,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-10-22 08:54:52,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 260. [2019-10-22 08:54:52,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-22 08:54:52,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 274 transitions. [2019-10-22 08:54:52,672 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 274 transitions. Word has length 10 [2019-10-22 08:54:52,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:52,673 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 274 transitions. [2019-10-22 08:54:52,673 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:54:52,673 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 274 transitions. [2019-10-22 08:54:52,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 08:54:52,673 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:52,674 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:52,674 INFO L410 AbstractCegarLoop]: === Iteration 3 === [merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION]=== [2019-10-22 08:54:52,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:52,675 INFO L82 PathProgramCache]: Analyzing trace with hash 805494536, now seen corresponding path program 1 times [2019-10-22 08:54:52,675 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:52,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092546266] [2019-10-22 08:54:52,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:52,675 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:52,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:52,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:52,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:52,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092546266] [2019-10-22 08:54:52,766 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:52,766 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:52,767 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412536191] [2019-10-22 08:54:52,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:54:52,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:52,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:52,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:52,773 INFO L87 Difference]: Start difference. First operand 260 states and 274 transitions. Second operand 4 states. [2019-10-22 08:54:53,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:53,353 INFO L93 Difference]: Finished difference Result 326 states and 352 transitions. [2019-10-22 08:54:53,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:54:53,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-22 08:54:53,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:53,355 INFO L225 Difference]: With dead ends: 326 [2019-10-22 08:54:53,355 INFO L226 Difference]: Without dead ends: 326 [2019-10-22 08:54:53,356 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-10-22 08:54:53,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-10-22 08:54:53,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 258. [2019-10-22 08:54:53,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-10-22 08:54:53,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 272 transitions. [2019-10-22 08:54:53,388 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 272 transitions. Word has length 10 [2019-10-22 08:54:53,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:53,388 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 272 transitions. [2019-10-22 08:54:53,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:54:53,389 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 272 transitions. [2019-10-22 08:54:53,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 08:54:53,389 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:53,389 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:53,390 INFO L410 AbstractCegarLoop]: === Iteration 4 === [merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION]=== [2019-10-22 08:54:53,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:53,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1991342111, now seen corresponding path program 1 times [2019-10-22 08:54:53,391 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:53,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138383276] [2019-10-22 08:54:53,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:53,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:53,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:53,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:53,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:53,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:53,452 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138383276] [2019-10-22 08:54:53,453 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:53,453 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:54:53,458 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477507415] [2019-10-22 08:54:53,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:54:53,459 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:53,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:53,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:53,459 INFO L87 Difference]: Start difference. First operand 258 states and 272 transitions. Second operand 4 states. [2019-10-22 08:54:53,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:53,873 INFO L93 Difference]: Finished difference Result 293 states and 308 transitions. [2019-10-22 08:54:53,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:54:53,873 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-22 08:54:53,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:53,875 INFO L225 Difference]: With dead ends: 293 [2019-10-22 08:54:53,875 INFO L226 Difference]: Without dead ends: 292 [2019-10-22 08:54:53,875 INFO L600 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-10-22 08:54:53,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2019-10-22 08:54:53,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 257. [2019-10-22 08:54:53,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-10-22 08:54:53,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 270 transitions. [2019-10-22 08:54:53,886 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 270 transitions. Word has length 14 [2019-10-22 08:54:53,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:53,886 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 270 transitions. [2019-10-22 08:54:53,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:54:53,886 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 270 transitions. [2019-10-22 08:54:53,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 08:54:53,887 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:53,887 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:53,888 INFO L410 AbstractCegarLoop]: === Iteration 5 === [merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION]=== [2019-10-22 08:54:53,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:53,888 INFO L82 PathProgramCache]: Analyzing trace with hash 742236455, now seen corresponding path program 1 times [2019-10-22 08:54:53,888 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:53,888 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458502121] [2019-10-22 08:54:53,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:53,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:53,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:53,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:53,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:53,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:53,955 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458502121] [2019-10-22 08:54:53,955 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:53,955 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:53,956 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321370552] [2019-10-22 08:54:53,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:54:53,956 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:53,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:53,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:53,957 INFO L87 Difference]: Start difference. First operand 257 states and 270 transitions. Second operand 4 states. [2019-10-22 08:54:54,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:54,484 INFO L93 Difference]: Finished difference Result 299 states and 318 transitions. [2019-10-22 08:54:54,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:54:54,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-22 08:54:54,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:54,486 INFO L225 Difference]: With dead ends: 299 [2019-10-22 08:54:54,486 INFO L226 Difference]: Without dead ends: 299 [2019-10-22 08:54:54,487 INFO L600 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-10-22 08:54:54,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2019-10-22 08:54:54,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 255. [2019-10-22 08:54:54,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-10-22 08:54:54,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 268 transitions. [2019-10-22 08:54:54,496 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 268 transitions. Word has length 15 [2019-10-22 08:54:54,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:54,497 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 268 transitions. [2019-10-22 08:54:54,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:54:54,497 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 268 transitions. [2019-10-22 08:54:54,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-22 08:54:54,498 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:54,498 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:54,498 INFO L410 AbstractCegarLoop]: === Iteration 6 === [merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION]=== [2019-10-22 08:54:54,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:54,499 INFO L82 PathProgramCache]: Analyzing trace with hash 742236456, now seen corresponding path program 1 times [2019-10-22 08:54:54,499 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:54,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425570745] [2019-10-22 08:54:54,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:54,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:54,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:54,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:54,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:54,565 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425570745] [2019-10-22 08:54:54,566 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:54,566 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:54,566 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271295070] [2019-10-22 08:54:54,566 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:54:54,566 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:54,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:54,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:54,567 INFO L87 Difference]: Start difference. First operand 255 states and 268 transitions. Second operand 4 states. [2019-10-22 08:54:55,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:55,048 INFO L93 Difference]: Finished difference Result 308 states and 328 transitions. [2019-10-22 08:54:55,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:54:55,049 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-22 08:54:55,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:55,050 INFO L225 Difference]: With dead ends: 308 [2019-10-22 08:54:55,050 INFO L226 Difference]: Without dead ends: 308 [2019-10-22 08:54:55,050 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-10-22 08:54:55,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-10-22 08:54:55,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 253. [2019-10-22 08:54:55,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-10-22 08:54:55,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 266 transitions. [2019-10-22 08:54:55,059 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 266 transitions. Word has length 15 [2019-10-22 08:54:55,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:55,061 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 266 transitions. [2019-10-22 08:54:55,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:54:55,061 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 266 transitions. [2019-10-22 08:54:55,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 08:54:55,062 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:55,062 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:55,063 INFO L410 AbstractCegarLoop]: === Iteration 7 === [merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION]=== [2019-10-22 08:54:55,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:55,063 INFO L82 PathProgramCache]: Analyzing trace with hash -224686077, now seen corresponding path program 1 times [2019-10-22 08:54:55,063 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:55,064 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392305042] [2019-10-22 08:54:55,064 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:55,064 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:55,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:55,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:55,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:55,184 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392305042] [2019-10-22 08:54:55,184 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:55,184 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:54:55,184 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765367550] [2019-10-22 08:54:55,184 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:54:55,185 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:55,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:54:55,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:54:55,185 INFO L87 Difference]: Start difference. First operand 253 states and 266 transitions. Second operand 5 states. [2019-10-22 08:54:55,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:55,712 INFO L93 Difference]: Finished difference Result 312 states and 332 transitions. [2019-10-22 08:54:55,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:54:55,723 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-10-22 08:54:55,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:55,725 INFO L225 Difference]: With dead ends: 312 [2019-10-22 08:54:55,725 INFO L226 Difference]: Without dead ends: 312 [2019-10-22 08:54:55,726 INFO L600 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-10-22 08:54:55,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-10-22 08:54:55,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 253. [2019-10-22 08:54:55,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-10-22 08:54:55,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 265 transitions. [2019-10-22 08:54:55,734 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 265 transitions. Word has length 21 [2019-10-22 08:54:55,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:55,734 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 265 transitions. [2019-10-22 08:54:55,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:54:55,735 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 265 transitions. [2019-10-22 08:54:55,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 08:54:55,735 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:55,736 INFO L380 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-10-22 08:54:55,736 INFO L410 AbstractCegarLoop]: === Iteration 8 === [merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION]=== [2019-10-22 08:54:55,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:55,737 INFO L82 PathProgramCache]: Analyzing trace with hash 552515561, now seen corresponding path program 1 times [2019-10-22 08:54:55,737 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:55,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373953358] [2019-10-22 08:54:55,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:55,737 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:55,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:55,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:55,808 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373953358] [2019-10-22 08:54:55,808 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:55,808 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:54:55,808 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479941277] [2019-10-22 08:54:55,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:54:55,809 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:55,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:54:55,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:54:55,809 INFO L87 Difference]: Start difference. First operand 253 states and 265 transitions. Second operand 7 states. [2019-10-22 08:54:56,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:56,732 INFO L93 Difference]: Finished difference Result 293 states and 312 transitions. [2019-10-22 08:54:56,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:54:56,733 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-10-22 08:54:56,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:56,735 INFO L225 Difference]: With dead ends: 293 [2019-10-22 08:54:56,735 INFO L226 Difference]: Without dead ends: 293 [2019-10-22 08:54:56,735 INFO L600 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-10-22 08:54:56,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2019-10-22 08:54:56,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 246. [2019-10-22 08:54:56,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2019-10-22 08:54:56,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 260 transitions. [2019-10-22 08:54:56,745 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 260 transitions. Word has length 25 [2019-10-22 08:54:56,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:56,745 INFO L462 AbstractCegarLoop]: Abstraction has 246 states and 260 transitions. [2019-10-22 08:54:56,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:54:56,745 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 260 transitions. [2019-10-22 08:54:56,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 08:54:56,746 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:56,746 INFO L380 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-10-22 08:54:56,746 INFO L410 AbstractCegarLoop]: === Iteration 9 === [merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION]=== [2019-10-22 08:54:56,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:56,747 INFO L82 PathProgramCache]: Analyzing trace with hash 552515562, now seen corresponding path program 1 times [2019-10-22 08:54:56,747 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:56,748 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684271927] [2019-10-22 08:54:56,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:56,748 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:56,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:56,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:56,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:56,910 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684271927] [2019-10-22 08:54:56,910 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:56,911 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:54:56,911 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359416839] [2019-10-22 08:54:56,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:54:56,911 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:56,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:54:56,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:54:56,912 INFO L87 Difference]: Start difference. First operand 246 states and 260 transitions. Second operand 7 states. [2019-10-22 08:54:57,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:57,647 INFO L93 Difference]: Finished difference Result 331 states and 351 transitions. [2019-10-22 08:54:57,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:54:57,648 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-10-22 08:54:57,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:57,649 INFO L225 Difference]: With dead ends: 331 [2019-10-22 08:54:57,650 INFO L226 Difference]: Without dead ends: 331 [2019-10-22 08:54:57,650 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:54:57,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-10-22 08:54:57,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 274. [2019-10-22 08:54:57,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-10-22 08:54:57,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 291 transitions. [2019-10-22 08:54:57,658 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 291 transitions. Word has length 25 [2019-10-22 08:54:57,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:57,659 INFO L462 AbstractCegarLoop]: Abstraction has 274 states and 291 transitions. [2019-10-22 08:54:57,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:54:57,659 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 291 transitions. [2019-10-22 08:54:57,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 08:54:57,660 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:57,660 INFO L380 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-10-22 08:54:57,661 INFO L410 AbstractCegarLoop]: === Iteration 10 === [merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION]=== [2019-10-22 08:54:57,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:57,661 INFO L82 PathProgramCache]: Analyzing trace with hash 690194188, now seen corresponding path program 1 times [2019-10-22 08:54:57,661 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:57,661 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007978124] [2019-10-22 08:54:57,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:57,662 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:57,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:57,844 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:57,844 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007978124] [2019-10-22 08:54:57,844 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:57,845 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 08:54:57,845 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563912353] [2019-10-22 08:54:57,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-22 08:54:57,845 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:57,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 08:54:57,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-22 08:54:57,846 INFO L87 Difference]: Start difference. First operand 274 states and 291 transitions. Second operand 11 states. [2019-10-22 08:54:59,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:59,216 INFO L93 Difference]: Finished difference Result 340 states and 364 transitions. [2019-10-22 08:54:59,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 08:54:59,217 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-10-22 08:54:59,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:59,219 INFO L225 Difference]: With dead ends: 340 [2019-10-22 08:54:59,219 INFO L226 Difference]: Without dead ends: 340 [2019-10-22 08:54:59,220 INFO L600 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-10-22 08:54:59,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2019-10-22 08:54:59,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 275. [2019-10-22 08:54:59,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-10-22 08:54:59,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 293 transitions. [2019-10-22 08:54:59,228 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 293 transitions. Word has length 36 [2019-10-22 08:54:59,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:59,228 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 293 transitions. [2019-10-22 08:54:59,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-22 08:54:59,228 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 293 transitions. [2019-10-22 08:54:59,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 08:54:59,229 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:59,229 INFO L380 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-10-22 08:54:59,230 INFO L410 AbstractCegarLoop]: === Iteration 11 === [merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION]=== [2019-10-22 08:54:59,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:59,230 INFO L82 PathProgramCache]: Analyzing trace with hash 690194189, now seen corresponding path program 1 times [2019-10-22 08:54:59,230 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:59,230 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955077923] [2019-10-22 08:54:59,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:59,231 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:59,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:59,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:59,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:59,439 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:59,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955077923] [2019-10-22 08:54:59,440 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:59,440 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 08:54:59,440 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045366521] [2019-10-22 08:54:59,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 08:54:59,441 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:59,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 08:54:59,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:54:59,441 INFO L87 Difference]: Start difference. First operand 275 states and 293 transitions. Second operand 10 states. [2019-10-22 08:55:00,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:00,453 INFO L93 Difference]: Finished difference Result 324 states and 344 transitions. [2019-10-22 08:55:00,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:55:00,453 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2019-10-22 08:55:00,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:00,455 INFO L225 Difference]: With dead ends: 324 [2019-10-22 08:55:00,455 INFO L226 Difference]: Without dead ends: 324 [2019-10-22 08:55:00,455 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2019-10-22 08:55:00,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-10-22 08:55:00,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 275. [2019-10-22 08:55:00,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-10-22 08:55:00,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 292 transitions. [2019-10-22 08:55:00,466 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 292 transitions. Word has length 36 [2019-10-22 08:55:00,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:00,466 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 292 transitions. [2019-10-22 08:55:00,466 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 08:55:00,466 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 292 transitions. [2019-10-22 08:55:00,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 08:55:00,467 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:00,467 INFO L380 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-10-22 08:55:00,467 INFO L410 AbstractCegarLoop]: === Iteration 12 === [merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION]=== [2019-10-22 08:55:00,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:00,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1511282514, now seen corresponding path program 1 times [2019-10-22 08:55:00,468 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:00,468 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616590518] [2019-10-22 08:55:00,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:00,468 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:00,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:00,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:00,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:00,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616590518] [2019-10-22 08:55:00,611 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:00,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 08:55:00,611 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649106228] [2019-10-22 08:55:00,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-22 08:55:00,612 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:00,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 08:55:00,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-22 08:55:00,612 INFO L87 Difference]: Start difference. First operand 275 states and 292 transitions. Second operand 11 states. [2019-10-22 08:55:01,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:01,700 INFO L93 Difference]: Finished difference Result 338 states and 362 transitions. [2019-10-22 08:55:01,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 08:55:01,701 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-10-22 08:55:01,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:01,703 INFO L225 Difference]: With dead ends: 338 [2019-10-22 08:55:01,703 INFO L226 Difference]: Without dead ends: 338 [2019-10-22 08:55:01,703 INFO L600 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-10-22 08:55:01,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-10-22 08:55:01,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 275. [2019-10-22 08:55:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-10-22 08:55:01,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 291 transitions. [2019-10-22 08:55:01,713 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 291 transitions. Word has length 36 [2019-10-22 08:55:01,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:01,714 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 291 transitions. [2019-10-22 08:55:01,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-22 08:55:01,714 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 291 transitions. [2019-10-22 08:55:01,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 08:55:01,716 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:01,716 INFO L380 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-10-22 08:55:01,717 INFO L410 AbstractCegarLoop]: === Iteration 13 === [merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION]=== [2019-10-22 08:55:01,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:01,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1511282513, now seen corresponding path program 1 times [2019-10-22 08:55:01,717 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:01,717 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188956855] [2019-10-22 08:55:01,717 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:01,718 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:01,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:01,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:01,885 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188956855] [2019-10-22 08:55:01,885 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:01,885 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 08:55:01,886 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315420510] [2019-10-22 08:55:01,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 08:55:01,887 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:01,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 08:55:01,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:55:01,888 INFO L87 Difference]: Start difference. First operand 275 states and 291 transitions. Second operand 9 states. [2019-10-22 08:55:02,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:02,880 INFO L93 Difference]: Finished difference Result 322 states and 342 transitions. [2019-10-22 08:55:02,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:55:02,881 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-10-22 08:55:02,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:02,882 INFO L225 Difference]: With dead ends: 322 [2019-10-22 08:55:02,882 INFO L226 Difference]: Without dead ends: 322 [2019-10-22 08:55:02,882 INFO L600 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-10-22 08:55:02,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-10-22 08:55:02,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 275. [2019-10-22 08:55:02,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2019-10-22 08:55:02,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 290 transitions. [2019-10-22 08:55:02,891 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 290 transitions. Word has length 36 [2019-10-22 08:55:02,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:02,891 INFO L462 AbstractCegarLoop]: Abstraction has 275 states and 290 transitions. [2019-10-22 08:55:02,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 08:55:02,891 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 290 transitions. [2019-10-22 08:55:02,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-22 08:55:02,892 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:02,892 INFO L380 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, 1, 1] [2019-10-22 08:55:02,892 INFO L410 AbstractCegarLoop]: === Iteration 14 === [merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION]=== [2019-10-22 08:55:02,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:02,893 INFO L82 PathProgramCache]: Analyzing trace with hash 801871937, now seen corresponding path program 1 times [2019-10-22 08:55:02,893 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:02,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430953157] [2019-10-22 08:55:02,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:02,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:02,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:02,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:03,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:03,073 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:03,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430953157] [2019-10-22 08:55:03,074 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:03,074 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-10-22 08:55:03,074 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384133999] [2019-10-22 08:55:03,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-22 08:55:03,075 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:03,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-22 08:55:03,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2019-10-22 08:55:03,075 INFO L87 Difference]: Start difference. First operand 275 states and 290 transitions. Second operand 13 states. [2019-10-22 08:55:04,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:04,175 INFO L93 Difference]: Finished difference Result 276 states and 294 transitions. [2019-10-22 08:55:04,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 08:55:04,175 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 41 [2019-10-22 08:55:04,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:04,176 INFO L225 Difference]: With dead ends: 276 [2019-10-22 08:55:04,176 INFO L226 Difference]: Without dead ends: 265 [2019-10-22 08:55:04,176 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2019-10-22 08:55:04,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-10-22 08:55:04,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 223. [2019-10-22 08:55:04,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-10-22 08:55:04,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 236 transitions. [2019-10-22 08:55:04,181 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 236 transitions. Word has length 41 [2019-10-22 08:55:04,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:04,181 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 236 transitions. [2019-10-22 08:55:04,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-22 08:55:04,181 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 236 transitions. [2019-10-22 08:55:04,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-22 08:55:04,182 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:04,182 INFO L380 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:04,182 INFO L410 AbstractCegarLoop]: === Iteration 15 === [merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION]=== [2019-10-22 08:55:04,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:04,183 INFO L82 PathProgramCache]: Analyzing trace with hash 257285329, now seen corresponding path program 1 times [2019-10-22 08:55:04,183 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:04,183 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080965730] [2019-10-22 08:55:04,183 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:04,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:04,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:04,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:04,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:04,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:04,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080965730] [2019-10-22 08:55:04,248 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:04,249 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:55:04,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170585531] [2019-10-22 08:55:04,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:55:04,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:04,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:55:04,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:55:04,250 INFO L87 Difference]: Start difference. First operand 223 states and 236 transitions. Second operand 7 states. [2019-10-22 08:55:04,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:04,718 INFO L93 Difference]: Finished difference Result 266 states and 287 transitions. [2019-10-22 08:55:04,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:55:04,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2019-10-22 08:55:04,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:04,720 INFO L225 Difference]: With dead ends: 266 [2019-10-22 08:55:04,720 INFO L226 Difference]: Without dead ends: 266 [2019-10-22 08:55:04,720 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 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-10-22 08:55:04,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-10-22 08:55:04,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 223. [2019-10-22 08:55:04,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2019-10-22 08:55:04,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 238 transitions. [2019-10-22 08:55:04,725 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 238 transitions. Word has length 46 [2019-10-22 08:55:04,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:04,725 INFO L462 AbstractCegarLoop]: Abstraction has 223 states and 238 transitions. [2019-10-22 08:55:04,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:55:04,726 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 238 transitions. [2019-10-22 08:55:04,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-22 08:55:04,726 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:04,726 INFO L380 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:04,727 INFO L410 AbstractCegarLoop]: === Iteration 16 === [merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION]=== [2019-10-22 08:55:04,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:04,727 INFO L82 PathProgramCache]: Analyzing trace with hash 257285330, now seen corresponding path program 1 times [2019-10-22 08:55:04,727 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:04,728 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322183791] [2019-10-22 08:55:04,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:04,728 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:04,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:04,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:04,815 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:04,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322183791] [2019-10-22 08:55:04,816 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:04,816 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:55:04,816 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161442877] [2019-10-22 08:55:04,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:55:04,817 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:04,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:55:04,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:55:04,817 INFO L87 Difference]: Start difference. First operand 223 states and 238 transitions. Second operand 7 states. [2019-10-22 08:55:05,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:05,374 INFO L93 Difference]: Finished difference Result 281 states and 301 transitions. [2019-10-22 08:55:05,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:55:05,374 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2019-10-22 08:55:05,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:05,375 INFO L225 Difference]: With dead ends: 281 [2019-10-22 08:55:05,375 INFO L226 Difference]: Without dead ends: 281 [2019-10-22 08:55:05,375 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 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-10-22 08:55:05,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2019-10-22 08:55:05,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 242. [2019-10-22 08:55:05,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-10-22 08:55:05,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 262 transitions. [2019-10-22 08:55:05,382 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 262 transitions. Word has length 46 [2019-10-22 08:55:05,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:05,382 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 262 transitions. [2019-10-22 08:55:05,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:55:05,383 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 262 transitions. [2019-10-22 08:55:05,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-22 08:55:05,383 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:05,383 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:05,384 INFO L410 AbstractCegarLoop]: === Iteration 17 === [merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION]=== [2019-10-22 08:55:05,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:05,384 INFO L82 PathProgramCache]: Analyzing trace with hash -679135460, now seen corresponding path program 1 times [2019-10-22 08:55:05,384 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:05,384 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040545513] [2019-10-22 08:55:05,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:05,385 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:05,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:05,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:05,448 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 08:55:05,448 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040545513] [2019-10-22 08:55:05,448 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:05,449 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:55:05,449 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282486413] [2019-10-22 08:55:05,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:55:05,449 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:05,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:55:05,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:55:05,450 INFO L87 Difference]: Start difference. First operand 242 states and 262 transitions. Second operand 6 states. [2019-10-22 08:55:05,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:05,812 INFO L93 Difference]: Finished difference Result 248 states and 267 transitions. [2019-10-22 08:55:05,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:55:05,812 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-10-22 08:55:05,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:05,813 INFO L225 Difference]: With dead ends: 248 [2019-10-22 08:55:05,813 INFO L226 Difference]: Without dead ends: 248 [2019-10-22 08:55:05,814 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:55:05,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-10-22 08:55:05,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 239. [2019-10-22 08:55:05,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2019-10-22 08:55:05,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 259 transitions. [2019-10-22 08:55:05,818 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 259 transitions. Word has length 47 [2019-10-22 08:55:05,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:05,818 INFO L462 AbstractCegarLoop]: Abstraction has 239 states and 259 transitions. [2019-10-22 08:55:05,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:55:05,818 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 259 transitions. [2019-10-22 08:55:05,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-22 08:55:05,819 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:05,819 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:05,820 INFO L410 AbstractCegarLoop]: === Iteration 18 === [merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION]=== [2019-10-22 08:55:05,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:05,820 INFO L82 PathProgramCache]: Analyzing trace with hash -679135459, now seen corresponding path program 1 times [2019-10-22 08:55:05,820 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:05,820 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891923909] [2019-10-22 08:55:05,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:05,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:05,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:05,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:05,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:05,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:05,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891923909] [2019-10-22 08:55:05,902 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:05,902 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:55:05,902 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762810884] [2019-10-22 08:55:05,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:55:05,902 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:05,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:55:05,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:55:05,903 INFO L87 Difference]: Start difference. First operand 239 states and 259 transitions. Second operand 7 states. [2019-10-22 08:55:06,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:06,522 INFO L93 Difference]: Finished difference Result 300 states and 319 transitions. [2019-10-22 08:55:06,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:55:06,524 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2019-10-22 08:55:06,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:06,525 INFO L225 Difference]: With dead ends: 300 [2019-10-22 08:55:06,525 INFO L226 Difference]: Without dead ends: 300 [2019-10-22 08:55:06,525 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 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-10-22 08:55:06,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-10-22 08:55:06,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 260. [2019-10-22 08:55:06,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-22 08:55:06,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 286 transitions. [2019-10-22 08:55:06,533 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 286 transitions. Word has length 47 [2019-10-22 08:55:06,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:06,533 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 286 transitions. [2019-10-22 08:55:06,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:55:06,533 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 286 transitions. [2019-10-22 08:55:06,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-22 08:55:06,534 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:06,534 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:06,534 INFO L410 AbstractCegarLoop]: === Iteration 19 === [merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION]=== [2019-10-22 08:55:06,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:06,534 INFO L82 PathProgramCache]: Analyzing trace with hash -2077484617, now seen corresponding path program 1 times [2019-10-22 08:55:06,534 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:06,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520320168] [2019-10-22 08:55:06,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:06,535 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:06,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:06,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:06,615 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520320168] [2019-10-22 08:55:06,615 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:06,615 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 08:55:06,615 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916557205] [2019-10-22 08:55:06,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 08:55:06,616 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:06,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 08:55:06,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:55:06,616 INFO L87 Difference]: Start difference. First operand 260 states and 286 transitions. Second operand 8 states. [2019-10-22 08:55:07,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:07,259 INFO L93 Difference]: Finished difference Result 310 states and 334 transitions. [2019-10-22 08:55:07,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 08:55:07,260 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 50 [2019-10-22 08:55:07,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:07,261 INFO L225 Difference]: With dead ends: 310 [2019-10-22 08:55:07,261 INFO L226 Difference]: Without dead ends: 307 [2019-10-22 08:55:07,261 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-10-22 08:55:07,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-10-22 08:55:07,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 260. [2019-10-22 08:55:07,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-10-22 08:55:07,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 285 transitions. [2019-10-22 08:55:07,267 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 285 transitions. Word has length 50 [2019-10-22 08:55:07,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:07,268 INFO L462 AbstractCegarLoop]: Abstraction has 260 states and 285 transitions. [2019-10-22 08:55:07,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 08:55:07,268 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 285 transitions. [2019-10-22 08:55:07,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-22 08:55:07,268 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:07,268 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:07,269 INFO L410 AbstractCegarLoop]: === Iteration 20 === [merge_pairErr16REQUIRES_VIOLATION, merge_pairErr5REQUIRES_VIOLATION, merge_pairErr15REQUIRES_VIOLATION, merge_pairErr17REQUIRES_VIOLATION, merge_pairErr6REQUIRES_VIOLATION, merge_pairErr8REQUIRES_VIOLATION, merge_pairErr18REQUIRES_VIOLATION, merge_pairErr7REQUIRES_VIOLATION, merge_pairErr20REQUIRES_VIOLATION, merge_pairErr9REQUIRES_VIOLATION, merge_pairErr19REQUIRES_VIOLATION, merge_pairErr0REQUIRES_VIOLATION, merge_pairErr10REQUIRES_VIOLATION, merge_pairErr12REQUIRES_VIOLATION, merge_pairErr1REQUIRES_VIOLATION, merge_pairErr21REQUIRES_VIOLATION, merge_pairErr11REQUIRES_VIOLATION, merge_pairErr13REQUIRES_VIOLATION, merge_pairErr2REQUIRES_VIOLATION, merge_pairErr4REQUIRES_VIOLATION, merge_pairErr14REQUIRES_VIOLATION, merge_pairErr3REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr12REQUIRES_VIOLATION, merge_single_nodeErr11REQUIRES_VIOLATION, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr10REQUIRES_VIOLATION, merge_single_nodeErr9REQUIRES_VIOLATION, merge_single_nodeErr8REQUIRES_VIOLATION, merge_single_nodeErr7REQUIRES_VIOLATION, merge_single_nodeErr6REQUIRES_VIOLATION, merge_single_nodeErr5REQUIRES_VIOLATION, merge_single_nodeErr4REQUIRES_VIOLATION, merge_single_nodeErr3REQUIRES_VIOLATION, merge_single_nodeErr13REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION, seq_sort_coreErr5REQUIRES_VIOLATION, seq_sort_coreErr6REQUIRES_VIOLATION, seq_sort_coreErr2REQUIRES_VIOLATION, seq_sort_coreErr4REQUIRES_VIOLATION, seq_sort_coreErr3REQUIRES_VIOLATION, seq_sort_coreErr0REQUIRES_VIOLATION, seq_sort_coreErr10REQUIRES_VIOLATION, seq_sort_coreErr12ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr1REQUIRES_VIOLATION, seq_sort_coreErr11REQUIRES_VIOLATION, seq_sort_coreErr8REQUIRES_VIOLATION, seq_sort_coreErr14ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr7REQUIRES_VIOLATION, seq_sort_coreErr13ASSERT_VIOLATIONMEMORY_FREE, seq_sort_coreErr9REQUIRES_VIOLATION, inspect_beforeErr18REQUIRES_VIOLATION, inspect_beforeErr7REQUIRES_VIOLATION, inspect_beforeErr8REQUIRES_VIOLATION, inspect_beforeErr19REQUIRES_VIOLATION, inspect_beforeErr9REQUIRES_VIOLATION, inspect_beforeErr10REQUIRES_VIOLATION, inspect_beforeErr0REQUIRES_VIOLATION, inspect_beforeErr11REQUIRES_VIOLATION, inspect_beforeErr12REQUIRES_VIOLATION, inspect_beforeErr1REQUIRES_VIOLATION, inspect_beforeErr2REQUIRES_VIOLATION, inspect_beforeErr13REQUIRES_VIOLATION, inspect_beforeErr14REQUIRES_VIOLATION, inspect_beforeErr3REQUIRES_VIOLATION, inspect_beforeErr4REQUIRES_VIOLATION, inspect_beforeErr15REQUIRES_VIOLATION, inspect_beforeErr16REQUIRES_VIOLATION, inspect_beforeErr5REQUIRES_VIOLATION, inspect_beforeErr6REQUIRES_VIOLATION, inspect_beforeErr17REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr11REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr4REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr16REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr20ENSURES_VIOLATIONMEMORY_LEAK, mainErr7REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr19ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, inspect_afterErr4REQUIRES_VIOLATION, inspect_afterErr10REQUIRES_VIOLATION, inspect_afterErr3REQUIRES_VIOLATION, inspect_afterErr11REQUIRES_VIOLATION, inspect_afterErr2REQUIRES_VIOLATION, inspect_afterErr7REQUIRES_VIOLATION, inspect_afterErr1REQUIRES_VIOLATION, inspect_afterErr6REQUIRES_VIOLATION, inspect_afterErr8REQUIRES_VIOLATION, inspect_afterErr0REQUIRES_VIOLATION, inspect_afterErr5REQUIRES_VIOLATION, inspect_afterErr9REQUIRES_VIOLATION]=== [2019-10-22 08:55:07,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:07,270 INFO L82 PathProgramCache]: Analyzing trace with hash -2056453987, now seen corresponding path program 1 times [2019-10-22 08:55:07,270 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:55:07,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528862527] [2019-10-22 08:55:07,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:07,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:55:07,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:55:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:07,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:07,492 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528862527] [2019-10-22 08:55:07,492 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:07,492 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-10-22 08:55:07,492 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796705591] [2019-10-22 08:55:07,493 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-22 08:55:07,493 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:55:07,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 08:55:07,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2019-10-22 08:55:07,493 INFO L87 Difference]: Start difference. First operand 260 states and 285 transitions. Second operand 15 states. [2019-10-22 08:55:08,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:08,083 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-10-22 08:55:08,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-22 08:55:08,083 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2019-10-22 08:55:08,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:08,083 INFO L225 Difference]: With dead ends: 44 [2019-10-22 08:55:08,083 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 08:55:08,084 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2019-10-22 08:55:08,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 08:55:08,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 08:55:08,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 08:55:08,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:55:08,084 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2019-10-22 08:55:08,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:08,084 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:08,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-22 08:55:08,084 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:55:08,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 08:55:08,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:55:08 BoogieIcfgContainer [2019-10-22 08:55:08,089 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:55:08,089 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:55:08,089 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:55:08,089 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:55:08,090 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:50" (3/4) ... [2019-10-22 08:55:08,094 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 08:55:08,105 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure fail [2019-10-22 08:55:08,105 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-10-22 08:55:08,106 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure merge_pair [2019-10-22 08:55:08,106 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure merge_single_node [2019-10-22 08:55:08,106 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-10-22 08:55:08,106 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure seq_sort_core [2019-10-22 08:55:08,106 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-10-22 08:55:08,108 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure inspect_before [2019-10-22 08:55:08,109 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-10-22 08:55:08,109 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure inspect_after [2019-10-22 08:55:08,119 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2019-10-22 08:55:08,125 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2019-10-22 08:55:08,125 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-10-22 08:55:08,209 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_4ea935fa-f2ae-45aa-a4de-22c09b5694e4/bin/uautomizer/witness.graphml [2019-10-22 08:55:08,212 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:55:08,214 INFO L168 Benchmark]: Toolchain (without parser) took 19287.58 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 389.5 MB). Free memory was 944.7 MB in the beginning and 1.4 GB in the end (delta: -407.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:08,214 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:08,215 INFO L168 Benchmark]: CACSL2BoogieTranslator took 680.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:08,215 INFO L168 Benchmark]: Boogie Preprocessor took 93.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:08,215 INFO L168 Benchmark]: RCFGBuilder took 1208.56 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: 98.5 MB). Peak memory consumption was 98.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:08,215 INFO L168 Benchmark]: TraceAbstraction took 17178.04 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 267.9 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -366.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:08,216 INFO L168 Benchmark]: Witness Printer took 122.85 ms. Allocated memory is still 1.4 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:08,217 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 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 680.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -159.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 93.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1208.56 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: 98.5 MB). Peak memory consumption was 98.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 17178.04 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 267.9 MB). Free memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: -366.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 122.85 ms. Allocated memory is still 1.4 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 14.8 MB). Peak memory consumption was 14.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 577]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 578]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 573]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 567]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 570]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 569]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 571]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 568]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 590]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 588]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 597]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 594]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 598]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 595]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 614]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 609]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 609]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 614]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 609]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 605]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 605]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 605]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 612]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 605]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 612]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 613]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 607]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 613]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 614]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 608]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 609]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 614]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 647]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 632]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 647]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 632]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 633]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 648]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 648]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 637]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 650]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 638]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 625]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 638]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 644]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 651]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 644]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 620]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 623]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 620]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 619]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 622]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 104 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 284 locations, 104 error locations. Result: SAFE, OverallTime: 17.1s, OverallIterations: 20, TraceHistogramMax: 2, AutomataDifference: 14.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3612 SDtfs, 4702 SDslu, 5545 SDs, 0 SdLazy, 16197 SolverSat, 481 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 261 GetRequests, 81 SyntacticMatches, 4 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=278occurred in iteration=0, 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, 20 MinimizatonAttempts, 904 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 615 NumberOfCodeBlocks, 615 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 595 ConstructedInterpolants, 0 QuantifiedInterpolants, 140306 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 30/30 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 correct! Received shutdown request...