./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0019-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) 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/run_dir_9ade4f3e-a7a3-4d9d-b44a-3aa48b116400/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9ade4f3e-a7a3-4d9d-b44a-3aa48b116400/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9ade4f3e-a7a3-4d9d-b44a-3aa48b116400/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9ade4f3e-a7a3-4d9d-b44a-3aa48b116400/bin/uautomizer/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0019-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9ade4f3e-a7a3-4d9d-b44a-3aa48b116400/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9ade4f3e-a7a3-4d9d-b44a-3aa48b116400/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4494187e77773a0836e533a199cc56d858d4efc9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:38:11,810 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:38:11,811 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:38:11,828 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:38:11,828 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:38:11,830 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:38:11,832 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:38:11,841 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:38:11,846 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:38:11,850 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:38:11,852 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:38:11,854 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:38:11,855 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:38:11,857 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:38:11,858 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:38:11,859 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:38:11,860 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:38:11,860 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:38:11,863 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:38:11,867 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:38:11,870 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:38:11,872 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:38:11,876 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:38:11,876 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:38:11,879 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:38:11,879 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:38:11,880 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:38:11,881 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:38:11,883 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:38:11,884 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:38:11,884 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:38:11,884 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:38:11,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:38:11,886 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:38:11,887 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:38:11,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:38:11,888 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:38:11,888 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:38:11,888 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:38:11,889 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:38:11,890 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:38:11,891 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9ade4f3e-a7a3-4d9d-b44a-3aa48b116400/bin/uautomizer/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-15 22:38:11,916 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:38:11,917 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:38:11,918 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:38:11,918 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:38:11,919 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:38:11,919 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:38:11,919 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:38:11,919 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:38:11,920 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:38:11,920 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:38:11,921 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:38:11,921 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-15 22:38:11,921 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-15 22:38:11,922 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-15 22:38:11,922 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:38:11,922 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:38:11,922 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:38:11,923 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:38:11,923 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:38:11,923 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:38:11,923 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:38:11,924 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:38:11,924 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:38:11,924 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:38:11,925 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:38:11,925 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:38:11,925 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/run_dir_9ade4f3e-a7a3-4d9d-b44a-3aa48b116400/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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4494187e77773a0836e533a199cc56d858d4efc9 [2019-11-15 22:38:11,966 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:38:11,980 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:38:11,983 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:38:11,985 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:38:11,985 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:38:11,986 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9ade4f3e-a7a3-4d9d-b44a-3aa48b116400/bin/uautomizer/../../sv-benchmarks/c/memsafety/test-0019-1.i [2019-11-15 22:38:12,051 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9ade4f3e-a7a3-4d9d-b44a-3aa48b116400/bin/uautomizer/data/8a7c5d426/de426333bfcc4ecabeaf944f743081de/FLAG6d9731ea6 [2019-11-15 22:38:12,534 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:38:12,534 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9ade4f3e-a7a3-4d9d-b44a-3aa48b116400/sv-benchmarks/c/memsafety/test-0019-1.i [2019-11-15 22:38:12,547 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9ade4f3e-a7a3-4d9d-b44a-3aa48b116400/bin/uautomizer/data/8a7c5d426/de426333bfcc4ecabeaf944f743081de/FLAG6d9731ea6 [2019-11-15 22:38:12,930 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9ade4f3e-a7a3-4d9d-b44a-3aa48b116400/bin/uautomizer/data/8a7c5d426/de426333bfcc4ecabeaf944f743081de [2019-11-15 22:38:12,934 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:38:12,935 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-15 22:38:12,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:38:12,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:38:12,941 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:38:12,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:38:12" (1/1) ... [2019-11-15 22:38:12,947 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cafd39d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:38:12, skipping insertion in model container [2019-11-15 22:38:12,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:38:12" (1/1) ... [2019-11-15 22:38:12,957 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:38:13,004 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:38:13,465 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:38:13,477 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:38:13,550 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:38:13,613 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:38:13,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:38:13 WrapperNode [2019-11-15 22:38:13,614 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:38:13,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:38:13,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:38:13,615 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:38:13,631 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:38:13" (1/1) ... [2019-11-15 22:38:13,631 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:38:13" (1/1) ... [2019-11-15 22:38:13,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:38:13" (1/1) ... [2019-11-15 22:38:13,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:38:13" (1/1) ... [2019-11-15 22:38:13,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:38:13" (1/1) ... [2019-11-15 22:38:13,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:38:13" (1/1) ... [2019-11-15 22:38:13,684 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:38:13" (1/1) ... [2019-11-15 22:38:13,693 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:38:13,694 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:38:13,694 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:38:13,694 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:38:13,695 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:38:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9ade4f3e-a7a3-4d9d-b44a-3aa48b116400/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-11-15 22:38:13,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-15 22:38:13,783 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:38:13,783 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-15 22:38:13,783 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-15 22:38:13,783 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-15 22:38:13,784 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-15 22:38:13,785 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-15 22:38:13,785 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2019-11-15 22:38:13,786 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2019-11-15 22:38:13,786 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-15 22:38:13,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-15 22:38:13,787 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-15 22:38:13,788 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-15 22:38:13,788 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-15 22:38:13,788 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-15 22:38:13,788 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-15 22:38:13,789 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-15 22:38:13,789 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-15 22:38:13,791 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-15 22:38:13,791 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-15 22:38:13,792 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-15 22:38:13,792 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-15 22:38:13,792 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-15 22:38:13,792 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-15 22:38:13,792 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-15 22:38:13,793 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-15 22:38:13,793 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-15 22:38:13,793 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-15 22:38:13,793 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-15 22:38:13,794 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-15 22:38:13,794 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-15 22:38:13,794 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-15 22:38:13,794 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-15 22:38:13,795 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-15 22:38:13,795 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-15 22:38:13,795 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-15 22:38:13,795 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-15 22:38:13,796 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-15 22:38:13,796 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-15 22:38:13,796 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-15 22:38:13,796 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-15 22:38:13,796 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-15 22:38:13,797 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-15 22:38:13,797 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-15 22:38:13,797 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-15 22:38:13,797 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-15 22:38:13,797 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-15 22:38:13,798 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-15 22:38:13,798 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-15 22:38:13,798 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-15 22:38:13,798 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-15 22:38:13,798 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-15 22:38:13,799 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-15 22:38:13,799 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-15 22:38:13,799 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-15 22:38:13,799 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-15 22:38:13,800 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-15 22:38:13,800 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-15 22:38:13,800 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-15 22:38:13,800 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-15 22:38:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-15 22:38:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-15 22:38:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-15 22:38:13,801 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-15 22:38:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-15 22:38:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-15 22:38:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-15 22:38:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-15 22:38:13,802 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-15 22:38:13,803 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-15 22:38:13,803 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-15 22:38:13,804 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-15 22:38:13,804 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-15 22:38:13,804 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-15 22:38:13,805 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-15 22:38:13,805 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-15 22:38:13,806 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-15 22:38:13,807 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-15 22:38:13,807 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-15 22:38:13,807 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-15 22:38:13,807 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-15 22:38:13,808 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-15 22:38:13,808 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-15 22:38:13,808 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-15 22:38:13,809 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-15 22:38:13,809 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-15 22:38:13,809 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-15 22:38:13,810 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-15 22:38:13,810 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-15 22:38:13,810 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-15 22:38:13,810 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-15 22:38:13,810 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-15 22:38:13,811 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-15 22:38:13,811 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-15 22:38:13,811 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-15 22:38:13,811 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-15 22:38:13,811 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-15 22:38:13,812 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-15 22:38:13,812 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-15 22:38:13,812 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-15 22:38:13,812 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-15 22:38:13,812 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-15 22:38:13,813 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-15 22:38:13,813 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-15 22:38:13,813 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-15 22:38:13,813 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-15 22:38:13,813 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-15 22:38:13,814 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-15 22:38:13,814 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-15 22:38:13,814 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-15 22:38:13,814 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-15 22:38:13,814 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-15 22:38:13,815 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-15 22:38:13,815 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-15 22:38:13,815 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-15 22:38:13,815 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-15 22:38:13,816 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-15 22:38:13,816 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-15 22:38:13,816 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2019-11-15 22:38:13,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-15 22:38:13,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-15 22:38:13,817 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2019-11-15 22:38:13,817 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:38:13,818 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-15 22:38:13,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:38:13,818 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-15 22:38:13,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-15 22:38:13,819 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:38:14,576 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:38:14,577 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-15 22:38:14,579 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:38:14 BoogieIcfgContainer [2019-11-15 22:38:14,579 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:38:14,582 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:38:14,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:38:14,588 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:38:14,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:38:12" (1/3) ... [2019-11-15 22:38:14,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d5abc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:38:14, skipping insertion in model container [2019-11-15 22:38:14,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:38:13" (2/3) ... [2019-11-15 22:38:14,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52d5abc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:38:14, skipping insertion in model container [2019-11-15 22:38:14,592 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:38:14" (3/3) ... [2019-11-15 22:38:14,594 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0019-1.i [2019-11-15 22:38:14,605 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:38:14,617 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 23 error locations. [2019-11-15 22:38:14,627 INFO L249 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2019-11-15 22:38:14,646 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:38:14,646 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-15 22:38:14,646 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:38:14,647 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:38:14,647 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:38:14,647 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:38:14,647 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:38:14,648 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:38:14,664 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2019-11-15 22:38:14,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-15 22:38:14,674 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:38:14,674 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:38:14,677 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION]=== [2019-11-15 22:38:14,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:14,683 INFO L82 PathProgramCache]: Analyzing trace with hash 163875527, now seen corresponding path program 1 times [2019-11-15 22:38:14,693 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:38:14,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523965689] [2019-11-15 22:38:14,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:14,694 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:14,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:38:14,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:14,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:14,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:38:14,963 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523965689] [2019-11-15 22:38:14,964 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:38:14,964 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:38:14,965 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752825676] [2019-11-15 22:38:14,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:38:14,969 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:38:14,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:38:15,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:38:15,002 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 6 states. [2019-11-15 22:38:15,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:38:15,472 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-11-15 22:38:15,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:38:15,474 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-15 22:38:15,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:38:15,485 INFO L225 Difference]: With dead ends: 56 [2019-11-15 22:38:15,485 INFO L226 Difference]: Without dead ends: 53 [2019-11-15 22:38:15,487 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:38:15,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-15 22:38:15,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-11-15 22:38:15,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-15 22:38:15,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-11-15 22:38:15,532 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 9 [2019-11-15 22:38:15,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:38:15,533 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-11-15 22:38:15,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:38:15,534 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-11-15 22:38:15,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-15 22:38:15,534 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:38:15,535 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:38:15,535 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION]=== [2019-11-15 22:38:15,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:15,536 INFO L82 PathProgramCache]: Analyzing trace with hash 163875528, now seen corresponding path program 1 times [2019-11-15 22:38:15,536 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:38:15,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658712193] [2019-11-15 22:38:15,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:15,537 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:15,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:38:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:15,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:38:15,668 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658712193] [2019-11-15 22:38:15,669 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:38:15,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:38:15,669 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240994472] [2019-11-15 22:38:15,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:38:15,671 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:38:15,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:38:15,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:38:15,671 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 6 states. [2019-11-15 22:38:15,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:38:15,923 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2019-11-15 22:38:15,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:38:15,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-15 22:38:15,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:38:15,925 INFO L225 Difference]: With dead ends: 50 [2019-11-15 22:38:15,925 INFO L226 Difference]: Without dead ends: 50 [2019-11-15 22:38:15,926 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:38:15,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-15 22:38:15,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2019-11-15 22:38:15,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-11-15 22:38:15,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2019-11-15 22:38:15,932 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 9 [2019-11-15 22:38:15,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:38:15,933 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2019-11-15 22:38:15,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:38:15,933 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2019-11-15 22:38:15,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 22:38:15,934 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:38:15,934 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:38:15,935 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION]=== [2019-11-15 22:38:15,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:15,935 INFO L82 PathProgramCache]: Analyzing trace with hash -1429408695, now seen corresponding path program 1 times [2019-11-15 22:38:15,935 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:38:15,935 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563804650] [2019-11-15 22:38:15,935 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:15,936 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:15,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:38:15,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:16,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:38:16,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563804650] [2019-11-15 22:38:16,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:38:16,134 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:38:16,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582843449] [2019-11-15 22:38:16,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:38:16,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:38:16,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:38:16,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:38:16,140 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 8 states. [2019-11-15 22:38:16,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:38:16,444 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2019-11-15 22:38:16,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:38:16,445 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2019-11-15 22:38:16,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:38:16,446 INFO L225 Difference]: With dead ends: 49 [2019-11-15 22:38:16,446 INFO L226 Difference]: Without dead ends: 49 [2019-11-15 22:38:16,447 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:38:16,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-15 22:38:16,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-15 22:38:16,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-15 22:38:16,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-11-15 22:38:16,460 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 11 [2019-11-15 22:38:16,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:38:16,460 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-11-15 22:38:16,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:38:16,461 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-11-15 22:38:16,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 22:38:16,462 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:38:16,462 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:38:16,462 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION]=== [2019-11-15 22:38:16,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:16,463 INFO L82 PathProgramCache]: Analyzing trace with hash -2056472042, now seen corresponding path program 1 times [2019-11-15 22:38:16,463 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:38:16,463 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513681244] [2019-11-15 22:38:16,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:16,464 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:16,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:38:16,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:16,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:38:16,665 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513681244] [2019-11-15 22:38:16,665 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:38:16,665 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:38:16,666 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459492275] [2019-11-15 22:38:16,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:38:16,667 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:38:16,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:38:16,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:38:16,668 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 5 states. [2019-11-15 22:38:16,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:38:16,835 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-11-15 22:38:16,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:38:16,837 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-15 22:38:16,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:38:16,838 INFO L225 Difference]: With dead ends: 45 [2019-11-15 22:38:16,838 INFO L226 Difference]: Without dead ends: 45 [2019-11-15 22:38:16,839 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-11-15 22:38:16,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-15 22:38:16,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-11-15 22:38:16,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-15 22:38:16,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-11-15 22:38:16,844 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 18 [2019-11-15 22:38:16,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:38:16,845 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-11-15 22:38:16,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:38:16,845 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-11-15 22:38:16,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 22:38:16,846 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:38:16,846 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:38:16,846 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION]=== [2019-11-15 22:38:16,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:16,847 INFO L82 PathProgramCache]: Analyzing trace with hash -2056472043, now seen corresponding path program 1 times [2019-11-15 22:38:16,847 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:38:16,847 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329767838] [2019-11-15 22:38:16,847 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:16,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:16,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:38:16,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:16,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:16,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:38:16,928 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329767838] [2019-11-15 22:38:16,928 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:38:16,928 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:38:16,929 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100687691] [2019-11-15 22:38:16,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:38:16,929 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:38:16,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:38:16,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:38:16,930 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 5 states. [2019-11-15 22:38:17,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:38:17,085 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-11-15 22:38:17,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:38:17,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-15 22:38:17,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:38:17,087 INFO L225 Difference]: With dead ends: 41 [2019-11-15 22:38:17,087 INFO L226 Difference]: Without dead ends: 41 [2019-11-15 22:38:17,088 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-11-15 22:38:17,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-15 22:38:17,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-15 22:38:17,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-15 22:38:17,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-11-15 22:38:17,094 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 18 [2019-11-15 22:38:17,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:38:17,094 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-11-15 22:38:17,095 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:38:17,095 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-11-15 22:38:17,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 22:38:17,096 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:38:17,096 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:38:17,097 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION]=== [2019-11-15 22:38:17,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:17,098 INFO L82 PathProgramCache]: Analyzing trace with hash -1835398156, now seen corresponding path program 1 times [2019-11-15 22:38:17,098 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:38:17,098 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199856270] [2019-11-15 22:38:17,098 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:17,099 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:17,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:38:17,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:17,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:17,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:38:17,385 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199856270] [2019-11-15 22:38:17,386 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:38:17,386 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-15 22:38:17,386 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413596427] [2019-11-15 22:38:17,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 22:38:17,387 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:38:17,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 22:38:17,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:38:17,388 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 13 states. [2019-11-15 22:38:17,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:38:17,807 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-11-15 22:38:17,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 22:38:17,808 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2019-11-15 22:38:17,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:38:17,809 INFO L225 Difference]: With dead ends: 40 [2019-11-15 22:38:17,809 INFO L226 Difference]: Without dead ends: 40 [2019-11-15 22:38:17,810 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-11-15 22:38:17,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-15 22:38:17,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-15 22:38:17,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-15 22:38:17,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-11-15 22:38:17,816 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 25 [2019-11-15 22:38:17,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:38:17,816 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-11-15 22:38:17,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 22:38:17,817 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-11-15 22:38:17,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 22:38:17,818 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:38:17,818 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:38:17,818 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION]=== [2019-11-15 22:38:17,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:17,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1062767907, now seen corresponding path program 1 times [2019-11-15 22:38:17,819 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:38:17,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156242345] [2019-11-15 22:38:17,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:17,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:17,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:38:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:18,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:18,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:38:18,162 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156242345] [2019-11-15 22:38:18,162 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:38:18,162 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-15 22:38:18,163 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498547206] [2019-11-15 22:38:18,163 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-11-15 22:38:18,163 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:38:18,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 22:38:18,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:38:18,164 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 13 states. [2019-11-15 22:38:18,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:38:18,597 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-11-15 22:38:18,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 22:38:18,598 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 26 [2019-11-15 22:38:18,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:38:18,599 INFO L225 Difference]: With dead ends: 39 [2019-11-15 22:38:18,599 INFO L226 Difference]: Without dead ends: 39 [2019-11-15 22:38:18,600 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2019-11-15 22:38:18,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-15 22:38:18,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2019-11-15 22:38:18,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-15 22:38:18,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-11-15 22:38:18,604 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 26 [2019-11-15 22:38:18,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:38:18,607 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-11-15 22:38:18,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-11-15 22:38:18,608 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-11-15 22:38:18,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 22:38:18,609 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:38:18,609 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:38:18,610 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION]=== [2019-11-15 22:38:18,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:18,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1413933334, now seen corresponding path program 1 times [2019-11-15 22:38:18,611 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:38:18,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602979082] [2019-11-15 22:38:18,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:18,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:18,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:38:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:18,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:18,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:18,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:38:18,988 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602979082] [2019-11-15 22:38:18,988 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:38:18,988 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-15 22:38:18,988 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776941919] [2019-11-15 22:38:18,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 22:38:18,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:38:18,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 22:38:18,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:38:18,990 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 14 states. [2019-11-15 22:38:19,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:38:19,544 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-11-15 22:38:19,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 22:38:19,545 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-11-15 22:38:19,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:38:19,546 INFO L225 Difference]: With dead ends: 38 [2019-11-15 22:38:19,546 INFO L226 Difference]: Without dead ends: 38 [2019-11-15 22:38:19,546 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2019-11-15 22:38:19,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-15 22:38:19,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-15 22:38:19,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-15 22:38:19,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-11-15 22:38:19,550 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 27 [2019-11-15 22:38:19,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:38:19,551 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-11-15 22:38:19,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 22:38:19,551 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-11-15 22:38:19,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 22:38:19,552 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:38:19,552 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:38:19,552 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION]=== [2019-11-15 22:38:19,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:19,553 INFO L82 PathProgramCache]: Analyzing trace with hash 881682728, now seen corresponding path program 1 times [2019-11-15 22:38:19,553 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:38:19,553 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021208971] [2019-11-15 22:38:19,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:19,553 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:19,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:38:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:20,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:38:20,078 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021208971] [2019-11-15 22:38:20,078 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:38:20,078 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-11-15 22:38:20,078 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679560192] [2019-11-15 22:38:20,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-15 22:38:20,079 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:38:20,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-15 22:38:20,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2019-11-15 22:38:20,080 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 19 states. [2019-11-15 22:38:20,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:38:20,697 INFO L93 Difference]: Finished difference Result 40 states and 39 transitions. [2019-11-15 22:38:20,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 22:38:20,697 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 28 [2019-11-15 22:38:20,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:38:20,698 INFO L225 Difference]: With dead ends: 40 [2019-11-15 22:38:20,698 INFO L226 Difference]: Without dead ends: 38 [2019-11-15 22:38:20,699 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=109, Invalid=883, Unknown=0, NotChecked=0, Total=992 [2019-11-15 22:38:20,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-15 22:38:20,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-15 22:38:20,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-15 22:38:20,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 37 transitions. [2019-11-15 22:38:20,703 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 37 transitions. Word has length 28 [2019-11-15 22:38:20,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:38:20,704 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 37 transitions. [2019-11-15 22:38:20,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-15 22:38:20,704 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 37 transitions. [2019-11-15 22:38:20,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 22:38:20,705 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:38:20,705 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:38:20,705 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION]=== [2019-11-15 22:38:20,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:20,706 INFO L82 PathProgramCache]: Analyzing trace with hash 882260479, now seen corresponding path program 1 times [2019-11-15 22:38:20,706 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:38:20,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635016617] [2019-11-15 22:38:20,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:20,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:20,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:38:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:20,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:20,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:38:20,947 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635016617] [2019-11-15 22:38:20,947 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:38:20,947 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-15 22:38:20,947 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944710998] [2019-11-15 22:38:20,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 22:38:20,948 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:38:20,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 22:38:20,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:38:20,949 INFO L87 Difference]: Start difference. First operand 38 states and 37 transitions. Second operand 14 states. [2019-11-15 22:38:21,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:38:21,365 INFO L93 Difference]: Finished difference Result 37 states and 36 transitions. [2019-11-15 22:38:21,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 22:38:21,366 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 28 [2019-11-15 22:38:21,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:38:21,367 INFO L225 Difference]: With dead ends: 37 [2019-11-15 22:38:21,367 INFO L226 Difference]: Without dead ends: 37 [2019-11-15 22:38:21,367 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2019-11-15 22:38:21,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-15 22:38:21,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-11-15 22:38:21,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-15 22:38:21,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 36 transitions. [2019-11-15 22:38:21,371 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 36 transitions. Word has length 28 [2019-11-15 22:38:21,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:38:21,372 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 36 transitions. [2019-11-15 22:38:21,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 22:38:21,372 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 36 transitions. [2019-11-15 22:38:21,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 22:38:21,373 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:38:21,373 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:38:21,374 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION]=== [2019-11-15 22:38:21,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:21,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1580271160, now seen corresponding path program 1 times [2019-11-15 22:38:21,374 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:38:21,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807743026] [2019-11-15 22:38:21,375 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:21,375 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:21,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:38:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:21,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:38:21,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807743026] [2019-11-15 22:38:21,647 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:38:21,647 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-11-15 22:38:21,647 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770301928] [2019-11-15 22:38:21,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 22:38:21,648 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:38:21,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 22:38:21,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:38:21,649 INFO L87 Difference]: Start difference. First operand 37 states and 36 transitions. Second operand 14 states. [2019-11-15 22:38:22,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:38:22,218 INFO L93 Difference]: Finished difference Result 36 states and 35 transitions. [2019-11-15 22:38:22,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 22:38:22,219 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2019-11-15 22:38:22,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:38:22,220 INFO L225 Difference]: With dead ends: 36 [2019-11-15 22:38:22,220 INFO L226 Difference]: Without dead ends: 36 [2019-11-15 22:38:22,220 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2019-11-15 22:38:22,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-11-15 22:38:22,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-11-15 22:38:22,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-15 22:38:22,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 35 transitions. [2019-11-15 22:38:22,224 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 35 transitions. Word has length 29 [2019-11-15 22:38:22,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:38:22,224 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 35 transitions. [2019-11-15 22:38:22,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 22:38:22,229 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 35 transitions. [2019-11-15 22:38:22,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 22:38:22,232 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:38:22,232 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:38:22,232 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION]=== [2019-11-15 22:38:22,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:22,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1743765793, now seen corresponding path program 1 times [2019-11-15 22:38:22,234 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:38:22,234 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125945599] [2019-11-15 22:38:22,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:22,234 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:22,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:38:22,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:22,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:38:22,812 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125945599] [2019-11-15 22:38:22,812 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:38:22,812 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-11-15 22:38:22,812 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79989115] [2019-11-15 22:38:22,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-15 22:38:22,813 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:38:22,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-15 22:38:22,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=418, Unknown=0, NotChecked=0, Total=462 [2019-11-15 22:38:22,814 INFO L87 Difference]: Start difference. First operand 36 states and 35 transitions. Second operand 22 states. [2019-11-15 22:38:23,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:38:23,831 INFO L93 Difference]: Finished difference Result 35 states and 34 transitions. [2019-11-15 22:38:23,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-11-15 22:38:23,832 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-11-15 22:38:23,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:38:23,832 INFO L225 Difference]: With dead ends: 35 [2019-11-15 22:38:23,833 INFO L226 Difference]: Without dead ends: 35 [2019-11-15 22:38:23,833 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=164, Invalid=1318, Unknown=0, NotChecked=0, Total=1482 [2019-11-15 22:38:23,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-15 22:38:23,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2019-11-15 22:38:23,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-15 22:38:23,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 34 transitions. [2019-11-15 22:38:23,837 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 34 transitions. Word has length 30 [2019-11-15 22:38:23,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:38:23,837 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 34 transitions. [2019-11-15 22:38:23,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-15 22:38:23,837 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 34 transitions. [2019-11-15 22:38:23,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 22:38:23,838 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:38:23,838 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:38:23,838 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0REQUIRES_VIOLATION, mainErr4ENSURES_VIOLATIONMEMORY_LEAK, mainErr3REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr0REQUIRES_VIOLATION, free_dataErr10ASSERT_VIOLATIONMEMORY_FREE, free_dataErr2REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr1REQUIRES_VIOLATION, free_dataErr5REQUIRES_VIOLATION, free_dataErr13ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12ASSERT_VIOLATIONMEMORY_FREE, free_dataErr4REQUIRES_VIOLATION, free_dataErr11ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6REQUIRES_VIOLATION, free_dataErr7REQUIRES_VIOLATION]=== [2019-11-15 22:38:23,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:38:23,839 INFO L82 PathProgramCache]: Analyzing trace with hash 2049094415, now seen corresponding path program 1 times [2019-11-15 22:38:23,839 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:38:23,839 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484134746] [2019-11-15 22:38:23,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:23,839 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:38:23,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:38:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:24,117 WARN L191 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 40 [2019-11-15 22:38:24,280 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 35 [2019-11-15 22:38:24,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:24,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:24,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:38:25,515 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 30 [2019-11-15 22:38:25,682 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 29 [2019-11-15 22:38:26,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:38:26,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484134746] [2019-11-15 22:38:26,138 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:38:26,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-11-15 22:38:26,139 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975627224] [2019-11-15 22:38:26,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-15 22:38:26,140 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:38:26,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-15 22:38:26,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=642, Unknown=0, NotChecked=0, Total=702 [2019-11-15 22:38:26,141 INFO L87 Difference]: Start difference. First operand 35 states and 34 transitions. Second operand 27 states. [2019-11-15 22:38:26,730 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-11-15 22:38:27,122 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 67 [2019-11-15 22:38:27,721 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 42 [2019-11-15 22:38:28,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:38:28,017 INFO L93 Difference]: Finished difference Result 34 states and 33 transitions. [2019-11-15 22:38:28,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-11-15 22:38:28,017 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 34 [2019-11-15 22:38:28,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:38:28,018 INFO L225 Difference]: With dead ends: 34 [2019-11-15 22:38:28,018 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 22:38:28,019 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=147, Invalid=1335, Unknown=0, NotChecked=0, Total=1482 [2019-11-15 22:38:28,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 22:38:28,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 22:38:28,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 22:38:28,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 22:38:28,019 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2019-11-15 22:38:28,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:38:28,019 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:38:28,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-15 22:38:28,020 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:38:28,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 22:38:28,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:38:28 BoogieIcfgContainer [2019-11-15 22:38:28,025 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:38:28,026 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:38:28,026 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:38:28,026 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:38:28,027 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:38:14" (3/4) ... [2019-11-15 22:38:28,030 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 22:38:28,037 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-15 22:38:28,038 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-15 22:38:28,038 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-15 22:38:28,038 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-15 22:38:28,039 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-15 22:38:28,039 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure alloc_data [2019-11-15 22:38:28,039 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-15 22:38:28,039 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-15 22:38:28,039 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure free_data [2019-11-15 22:38:28,045 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 18 nodes and edges [2019-11-15 22:38:28,045 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-15 22:38:28,045 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-15 22:38:28,091 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9ade4f3e-a7a3-4d9d-b44a-3aa48b116400/bin/uautomizer/witness.graphml [2019-11-15 22:38:28,091 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:38:28,093 INFO L168 Benchmark]: Toolchain (without parser) took 15157.62 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 221.2 MB). Free memory was 939.4 MB in the beginning and 1.2 GB in the end (delta: -242.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:38:28,093 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:38:28,094 INFO L168 Benchmark]: CACSL2BoogieTranslator took 678.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -178.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-11-15 22:38:28,094 INFO L168 Benchmark]: Boogie Preprocessor took 78.58 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-11-15 22:38:28,095 INFO L168 Benchmark]: RCFGBuilder took 885.82 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: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:38:28,095 INFO L168 Benchmark]: TraceAbstraction took 13443.91 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 85.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -129.3 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:38:28,096 INFO L168 Benchmark]: Witness Printer took 65.28 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:38:28,098 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 678.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -178.7 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 78.58 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 885.82 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: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13443.91 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 85.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -129.3 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 65.28 ms. Allocated memory is still 1.3 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 533]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 533]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 533]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 533]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 519]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 518]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 527]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 527]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 527]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 521]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 528]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 523]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 528]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 524]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 23 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 75 locations, 23 error locations. Result: SAFE, OverallTime: 13.3s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 7.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 305 SDtfs, 368 SDslu, 1290 SDs, 0 SdLazy, 3076 SolverSat, 183 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 285 GetRequests, 43 SyntacticMatches, 8 SemanticMatches, 234 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 626 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred 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.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 292 NumberOfCodeBlocks, 292 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 279 ConstructedInterpolants, 0 QuantifiedInterpolants, 85221 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 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...