./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0019-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0019-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9fb1ca01555f439b860fec974f930b68e3dc780 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0019-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9fb1ca01555f439b860fec974f930b68e3dc780 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 20:07:14,665 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:07:14,668 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:07:14,685 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:07:14,686 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:07:14,688 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:07:14,690 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:07:14,700 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:07:14,705 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:07:14,708 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:07:14,710 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:07:14,712 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:07:14,712 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:07:14,715 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:07:14,716 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:07:14,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:07:14,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:07:14,721 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:07:14,723 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:07:14,727 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:07:14,731 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:07:14,735 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:07:14,736 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:07:14,738 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:07:14,741 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:07:14,741 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:07:14,742 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:07:14,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:07:14,744 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:07:14,745 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:07:14,745 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:07:14,746 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:07:14,747 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:07:14,748 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:07:14,749 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:07:14,750 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:07:14,751 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:07:14,751 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:07:14,751 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:07:14,752 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:07:14,753 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:07:14,754 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 20:07:14,788 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:07:14,792 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:07:14,793 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:07:14,794 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:07:14,794 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:07:14,794 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:07:14,794 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:07:14,797 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:07:14,797 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:07:14,797 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:07:14,797 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:07:14,798 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 20:07:14,798 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 20:07:14,798 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 20:07:14,799 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:07:14,799 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 20:07:14,800 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:07:14,800 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:07:14,800 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:07:14,801 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:07:14,801 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:07:14,801 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:07:14,801 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:07:14,802 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:07:14,802 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:07:14,803 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 20:07:14,803 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 20:07:14,803 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:07:14,804 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-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 -> a9fb1ca01555f439b860fec974f930b68e3dc780 [2019-11-28 20:07:15,142 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:07:15,163 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:07:15,168 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:07:15,169 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:07:15,170 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:07:15,172 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0019-2.i [2019-11-28 20:07:15,252 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ae4fc00f/0af8342ed5284366b89052b5ffefbddb/FLAG447f40f26 [2019-11-28 20:07:15,826 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:07:15,827 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0019-2.i [2019-11-28 20:07:15,838 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ae4fc00f/0af8342ed5284366b89052b5ffefbddb/FLAG447f40f26 [2019-11-28 20:07:16,113 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ae4fc00f/0af8342ed5284366b89052b5ffefbddb [2019-11-28 20:07:16,116 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:07:16,118 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 20:07:16,119 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:07:16,119 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:07:16,122 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:07:16,123 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:07:16" (1/1) ... [2019-11-28 20:07:16,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3bd431ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:16, skipping insertion in model container [2019-11-28 20:07:16,128 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:07:16" (1/1) ... [2019-11-28 20:07:16,136 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:07:16,178 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:07:16,671 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:07:16,681 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:07:16,744 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:07:16,804 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:07:16,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:16 WrapperNode [2019-11-28 20:07:16,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:07:16,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:07:16,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:07:16,807 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:07:16,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:16" (1/1) ... [2019-11-28 20:07:16,820 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:16" (1/1) ... [2019-11-28 20:07:16,836 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:16" (1/1) ... [2019-11-28 20:07:16,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:16" (1/1) ... [2019-11-28 20:07:16,853 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:16" (1/1) ... [2019-11-28 20:07:16,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:16" (1/1) ... [2019-11-28 20:07:16,858 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:16" (1/1) ... [2019-11-28 20:07:16,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:07:16,871 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:07:16,873 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:07:16,873 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:07:16,874 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:07:16,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 20:07:16,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:07:16,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-28 20:07:16,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-28 20:07:16,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-28 20:07:16,943 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-28 20:07:16,944 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-28 20:07:16,944 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2019-11-28 20:07:16,944 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2019-11-28 20:07:16,944 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 20:07:16,945 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 20:07:16,945 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 20:07:16,945 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 20:07:16,945 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 20:07:16,945 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 20:07:16,946 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 20:07:16,946 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 20:07:16,946 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 20:07:16,946 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 20:07:16,947 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 20:07:16,947 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 20:07:16,947 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 20:07:16,947 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 20:07:16,947 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 20:07:16,948 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 20:07:16,948 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 20:07:16,948 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 20:07:16,948 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-28 20:07:16,949 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-28 20:07:16,949 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-28 20:07:16,949 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-28 20:07:16,949 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-28 20:07:16,950 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 20:07:16,950 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 20:07:16,950 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 20:07:16,950 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 20:07:16,950 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 20:07:16,951 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 20:07:16,951 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 20:07:16,951 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 20:07:16,951 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 20:07:16,951 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 20:07:16,952 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 20:07:16,952 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 20:07:16,952 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 20:07:16,952 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 20:07:16,952 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 20:07:16,953 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 20:07:16,953 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 20:07:16,953 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 20:07:16,953 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 20:07:16,954 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 20:07:16,954 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 20:07:16,954 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 20:07:16,955 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 20:07:16,955 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 20:07:16,955 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 20:07:16,955 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 20:07:16,955 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 20:07:16,956 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 20:07:16,956 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 20:07:16,956 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 20:07:16,956 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 20:07:16,957 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 20:07:16,957 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 20:07:16,957 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 20:07:16,957 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 20:07:16,957 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 20:07:16,958 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 20:07:16,958 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 20:07:16,958 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 20:07:16,958 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 20:07:16,958 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 20:07:16,959 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 20:07:16,959 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 20:07:16,959 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 20:07:16,959 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 20:07:16,960 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 20:07:16,960 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 20:07:16,960 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 20:07:16,960 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 20:07:16,960 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 20:07:16,961 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 20:07:16,961 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 20:07:16,961 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 20:07:16,961 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 20:07:16,961 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 20:07:16,962 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 20:07:16,962 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 20:07:16,962 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 20:07:16,962 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 20:07:16,962 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 20:07:16,963 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 20:07:16,963 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 20:07:16,963 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 20:07:16,963 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 20:07:16,963 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 20:07:16,964 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 20:07:16,964 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 20:07:16,964 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 20:07:16,964 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 20:07:16,964 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 20:07:16,965 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 20:07:16,965 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 20:07:16,965 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 20:07:16,965 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 20:07:16,965 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 20:07:16,966 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 20:07:16,966 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 20:07:16,966 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 20:07:16,966 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 20:07:16,966 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 20:07:16,966 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 20:07:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 20:07:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 20:07:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 20:07:16,967 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 20:07:16,968 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 20:07:16,968 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2019-11-28 20:07:16,968 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 20:07:16,968 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 20:07:16,968 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2019-11-28 20:07:16,969 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 20:07:16,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:07:16,969 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 20:07:16,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:07:16,969 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 20:07:16,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:07:17,488 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:07:17,489 INFO L287 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-28 20:07:17,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:07:17 BoogieIcfgContainer [2019-11-28 20:07:17,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:07:17,492 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:07:17,492 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:07:17,495 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:07:17,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:07:16" (1/3) ... [2019-11-28 20:07:17,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e64f80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:07:17, skipping insertion in model container [2019-11-28 20:07:17,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:16" (2/3) ... [2019-11-28 20:07:17,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78e64f80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:07:17, skipping insertion in model container [2019-11-28 20:07:17,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:07:17" (3/3) ... [2019-11-28 20:07:17,500 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0019-2.i [2019-11-28 20:07:17,511 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:07:17,519 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-11-28 20:07:17,533 INFO L249 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-11-28 20:07:17,554 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:07:17,555 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 20:07:17,555 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:07:17,555 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:07:17,556 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:07:17,556 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:07:17,556 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:07:17,557 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:07:17,578 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2019-11-28 20:07:17,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 20:07:17,588 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:17,590 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:07:17,591 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 20:07:17,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:17,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1314455937, now seen corresponding path program 1 times [2019-11-28 20:07:17,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:17,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106570463] [2019-11-28 20:07:17,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:17,837 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-28 20:07:17,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106570463] [2019-11-28 20:07:17,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:17,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:07:17,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272597812] [2019-11-28 20:07:17,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:07:17,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:17,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:07:17,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:07:17,867 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 6 states. [2019-11-28 20:07:18,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:18,147 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-11-28 20:07:18,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:07:18,149 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-28 20:07:18,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:18,160 INFO L225 Difference]: With dead ends: 61 [2019-11-28 20:07:18,160 INFO L226 Difference]: Without dead ends: 58 [2019-11-28 20:07:18,162 INFO L630 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-28 20:07:18,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-11-28 20:07:18,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2019-11-28 20:07:18,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 20:07:18,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-11-28 20:07:18,209 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 9 [2019-11-28 20:07:18,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:18,210 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-11-28 20:07:18,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:07:18,210 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-11-28 20:07:18,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 20:07:18,211 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:18,211 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:07:18,212 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 20:07:18,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:18,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1314455936, now seen corresponding path program 1 times [2019-11-28 20:07:18,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:18,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519851442] [2019-11-28 20:07:18,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:18,327 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-28 20:07:18,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519851442] [2019-11-28 20:07:18,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:18,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:07:18,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472799623] [2019-11-28 20:07:18,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:07:18,331 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:18,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:07:18,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:07:18,332 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 6 states. [2019-11-28 20:07:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:18,603 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2019-11-28 20:07:18,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:07:18,604 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2019-11-28 20:07:18,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:18,606 INFO L225 Difference]: With dead ends: 57 [2019-11-28 20:07:18,607 INFO L226 Difference]: Without dead ends: 57 [2019-11-28 20:07:18,608 INFO L630 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-28 20:07:18,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-28 20:07:18,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2019-11-28 20:07:18,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 20:07:18,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-11-28 20:07:18,623 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 9 [2019-11-28 20:07:18,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:18,624 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-11-28 20:07:18,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:07:18,624 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-11-28 20:07:18,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:07:18,625 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:18,626 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:07:18,626 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 20:07:18,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:18,627 INFO L82 PathProgramCache]: Analyzing trace with hash -471770815, now seen corresponding path program 1 times [2019-11-28 20:07:18,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:18,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570605464] [2019-11-28 20:07:18,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:18,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:18,822 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-28 20:07:18,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570605464] [2019-11-28 20:07:18,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:18,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:07:18,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002583305] [2019-11-28 20:07:18,826 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:07:18,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:18,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:07:18,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:07:18,828 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 7 states. [2019-11-28 20:07:19,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:19,048 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-11-28 20:07:19,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 20:07:19,049 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2019-11-28 20:07:19,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:19,050 INFO L225 Difference]: With dead ends: 56 [2019-11-28 20:07:19,051 INFO L226 Difference]: Without dead ends: 56 [2019-11-28 20:07:19,051 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:07:19,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-28 20:07:19,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2019-11-28 20:07:19,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 20:07:19,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-11-28 20:07:19,058 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 11 [2019-11-28 20:07:19,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:19,059 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-11-28 20:07:19,059 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:07:19,059 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-11-28 20:07:19,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 20:07:19,060 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:19,060 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:07:19,061 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 20:07:19,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:19,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1394335238, now seen corresponding path program 1 times [2019-11-28 20:07:19,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:19,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155663058] [2019-11-28 20:07:19,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:19,218 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-28 20:07:19,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155663058] [2019-11-28 20:07:19,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:19,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-28 20:07:19,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268975755] [2019-11-28 20:07:19,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-28 20:07:19,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:19,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-28 20:07:19,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:07:19,221 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 9 states. [2019-11-28 20:07:19,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:19,593 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-11-28 20:07:19,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 20:07:19,598 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2019-11-28 20:07:19,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:19,599 INFO L225 Difference]: With dead ends: 51 [2019-11-28 20:07:19,600 INFO L226 Difference]: Without dead ends: 51 [2019-11-28 20:07:19,600 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-11-28 20:07:19,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-28 20:07:19,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2019-11-28 20:07:19,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 20:07:19,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2019-11-28 20:07:19,607 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 16 [2019-11-28 20:07:19,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:19,607 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2019-11-28 20:07:19,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-28 20:07:19,608 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2019-11-28 20:07:19,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 20:07:19,608 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:19,609 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:07:19,609 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 20:07:19,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:19,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1394335237, now seen corresponding path program 1 times [2019-11-28 20:07:19,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:19,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350722706] [2019-11-28 20:07:19,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:19,765 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-28 20:07:19,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350722706] [2019-11-28 20:07:19,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:19,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-28 20:07:19,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792034022] [2019-11-28 20:07:19,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 20:07:19,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:19,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 20:07:19,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:07:19,767 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 11 states. [2019-11-28 20:07:20,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:20,169 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-11-28 20:07:20,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:07:20,170 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2019-11-28 20:07:20,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:20,174 INFO L225 Difference]: With dead ends: 44 [2019-11-28 20:07:20,174 INFO L226 Difference]: Without dead ends: 44 [2019-11-28 20:07:20,175 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-11-28 20:07:20,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-28 20:07:20,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-11-28 20:07:20,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 20:07:20,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-11-28 20:07:20,210 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 16 [2019-11-28 20:07:20,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:20,211 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-11-28 20:07:20,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 20:07:20,211 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-11-28 20:07:20,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 20:07:20,214 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:20,214 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:07:20,214 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 20:07:20,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:20,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1141317818, now seen corresponding path program 1 times [2019-11-28 20:07:20,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:20,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034566300] [2019-11-28 20:07:20,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:20,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:20,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:20,435 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-28 20:07:20,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034566300] [2019-11-28 20:07:20,435 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:20,435 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 20:07:20,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928092679] [2019-11-28 20:07:20,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 20:07:20,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:20,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 20:07:20,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:07:20,437 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 12 states. [2019-11-28 20:07:20,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:20,833 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-11-28 20:07:20,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:07:20,834 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2019-11-28 20:07:20,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:20,835 INFO L225 Difference]: With dead ends: 43 [2019-11-28 20:07:20,835 INFO L226 Difference]: Without dead ends: 43 [2019-11-28 20:07:20,836 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-11-28 20:07:20,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-28 20:07:20,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-11-28 20:07:20,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-28 20:07:20,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-11-28 20:07:20,841 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 21 [2019-11-28 20:07:20,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:20,841 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-11-28 20:07:20,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 20:07:20,842 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-11-28 20:07:20,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 20:07:20,842 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:20,842 INFO L410 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] [2019-11-28 20:07:20,843 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 20:07:20,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:20,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1021113922, now seen corresponding path program 1 times [2019-11-28 20:07:20,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:20,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869630478] [2019-11-28 20:07:20,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:21,100 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-28 20:07:21,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869630478] [2019-11-28 20:07:21,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:21,102 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 20:07:21,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508229145] [2019-11-28 20:07:21,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 20:07:21,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:21,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 20:07:21,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:07:21,104 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 12 states. [2019-11-28 20:07:21,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:21,532 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-11-28 20:07:21,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 20:07:21,532 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-11-28 20:07:21,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:21,534 INFO L225 Difference]: With dead ends: 42 [2019-11-28 20:07:21,534 INFO L226 Difference]: Without dead ends: 42 [2019-11-28 20:07:21,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2019-11-28 20:07:21,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-28 20:07:21,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-11-28 20:07:21,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 20:07:21,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-11-28 20:07:21,541 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 22 [2019-11-28 20:07:21,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:21,541 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-11-28 20:07:21,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 20:07:21,541 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-11-28 20:07:21,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 20:07:21,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:21,542 INFO L410 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] [2019-11-28 20:07:21,543 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 20:07:21,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:21,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1589760440, now seen corresponding path program 1 times [2019-11-28 20:07:21,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:21,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261060971] [2019-11-28 20:07:21,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:21,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:21,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:21,743 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-28 20:07:21,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261060971] [2019-11-28 20:07:21,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:21,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-28 20:07:21,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909313801] [2019-11-28 20:07:21,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 20:07:21,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:21,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 20:07:21,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:07:21,747 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 12 states. [2019-11-28 20:07:22,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:22,145 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2019-11-28 20:07:22,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:07:22,146 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-11-28 20:07:22,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:22,147 INFO L225 Difference]: With dead ends: 41 [2019-11-28 20:07:22,147 INFO L226 Difference]: Without dead ends: 41 [2019-11-28 20:07:22,148 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2019-11-28 20:07:22,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-28 20:07:22,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2019-11-28 20:07:22,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-28 20:07:22,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-11-28 20:07:22,151 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 23 [2019-11-28 20:07:22,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:22,152 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-11-28 20:07:22,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 20:07:22,152 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-11-28 20:07:22,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 20:07:22,153 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:22,153 INFO L410 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] [2019-11-28 20:07:22,153 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 20:07:22,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:22,154 INFO L82 PathProgramCache]: Analyzing trace with hash -2037933312, now seen corresponding path program 1 times [2019-11-28 20:07:22,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:22,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431292897] [2019-11-28 20:07:22,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:22,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:22,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:22,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:22,230 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-28 20:07:22,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431292897] [2019-11-28 20:07:22,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:22,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 20:07:22,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191462994] [2019-11-28 20:07:22,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 20:07:22,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:22,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 20:07:22,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:07:22,233 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 6 states. [2019-11-28 20:07:22,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:22,378 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-11-28 20:07:22,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:07:22,378 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-28 20:07:22,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:22,379 INFO L225 Difference]: With dead ends: 40 [2019-11-28 20:07:22,379 INFO L226 Difference]: Without dead ends: 40 [2019-11-28 20:07:22,380 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:07:22,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-28 20:07:22,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-11-28 20:07:22,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 20:07:22,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-11-28 20:07:22,384 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 24 [2019-11-28 20:07:22,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:22,385 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-11-28 20:07:22,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 20:07:22,385 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-11-28 20:07:22,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 20:07:22,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:22,386 INFO L410 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-28 20:07:22,387 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 20:07:22,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:22,387 INFO L82 PathProgramCache]: Analyzing trace with hash 1248576842, now seen corresponding path program 1 times [2019-11-28 20:07:22,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:22,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130582732] [2019-11-28 20:07:22,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:22,457 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-28 20:07:22,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130582732] [2019-11-28 20:07:22,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:22,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-28 20:07:22,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510353468] [2019-11-28 20:07:22,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:07:22,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 20:07:22,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:07:22,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:07:22,460 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 7 states. [2019-11-28 20:07:22,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:22,619 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-11-28 20:07:22,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:07:22,620 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-11-28 20:07:22,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:22,621 INFO L225 Difference]: With dead ends: 39 [2019-11-28 20:07:22,621 INFO L226 Difference]: Without dead ends: 39 [2019-11-28 20:07:22,621 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:07:22,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-28 20:07:22,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-11-28 20:07:22,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 20:07:22,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-11-28 20:07:22,625 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 25 [2019-11-28 20:07:22,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:22,626 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-11-28 20:07:22,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:07:22,626 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-11-28 20:07:22,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 20:07:22,627 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:22,627 INFO L410 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-28 20:07:22,628 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 20:07:22,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:22,628 INFO L82 PathProgramCache]: Analyzing trace with hash 6486715, now seen corresponding path program 1 times [2019-11-28 20:07:22,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 20:07:22,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708637980] [2019-11-28 20:07:22,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 20:07:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:07:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:07:22,710 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 20:07:22,710 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 20:07:22,736 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-11-28 20:07:22,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:07:22 BoogieIcfgContainer [2019-11-28 20:07:22,760 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:07:22,761 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:07:22,761 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:07:22,762 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:07:22,762 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:07:17" (3/4) ... [2019-11-28 20:07:22,766 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 20:07:22,766 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:07:22,770 INFO L168 Benchmark]: Toolchain (without parser) took 6649.67 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 223.3 MB). Free memory was 957.7 MB in the beginning and 889.9 MB in the end (delta: 67.8 MB). Peak memory consumption was 291.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:22,771 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:07:22,772 INFO L168 Benchmark]: CACSL2BoogieTranslator took 687.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:22,777 INFO L168 Benchmark]: Boogie Preprocessor took 64.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:22,778 INFO L168 Benchmark]: RCFGBuilder took 619.07 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: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:22,779 INFO L168 Benchmark]: TraceAbstraction took 5268.99 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 889.9 MB in the end (delta: 192.6 MB). Peak memory consumption was 257.6 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:22,780 INFO L168 Benchmark]: Witness Printer took 4.63 ms. Allocated memory is still 1.3 GB. Free memory is still 889.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:07:22,793 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.34 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 687.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -182.0 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 64.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 619.07 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: 45.0 MB). Peak memory consumption was 45.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5268.99 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 889.9 MB in the end (delta: 192.6 MB). Peak memory consumption was 257.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.63 ms. Allocated memory is still 1.3 GB. Free memory is still 889.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 532]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 532. Possible FailurePath: [L533] TData data; VAL [data={2:0}] [L534] CALL alloc_data(&data) VAL [pdata={2:0}] [L518] pdata->lo = malloc(16) VAL [malloc(16)={-2:0}, pdata={2:0}, pdata={2:0}] [L519] pdata->hi = malloc(24) VAL [malloc(16)={-2:0}, malloc(24)={-1:0}, pdata={2:0}, pdata={2:0}] [L534] RET alloc_data(&data) VAL [data={2:0}] [L535] CALL free_data(&data) VAL [data={2:0}] [L523] EXPR data->lo VAL [data={2:0}, data={2:0}, data->lo={-2:0}] [L523] void *lo = data->lo; [L524] EXPR data->hi VAL [data={2:0}, data={2:0}, data->hi={-1:0}, lo={-2:0}] [L524] void *hi = data->hi; [L525] COND FALSE !(lo == hi) VAL [data={2:0}, data={2:0}, hi={-1:0}, lo={-2:0}] [L529] data->lo = (void *) 0 VAL [data={2:0}, data={2:0}, hi={-1:0}, lo={-2:0}] [L530] data->hi = (void *) 0 VAL [data={2:0}, data={2:0}, hi={-1:0}, lo={-2:0}] [L535] RET free_data(&data) VAL [data={2:0}] [L536] return 0; [L536] return 0; VAL [\result=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 10 procedures, 69 locations, 19 error locations. Result: UNSAFE, OverallTime: 5.1s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 245 SDtfs, 506 SDslu, 537 SDs, 0 SdLazy, 1653 SolverSat, 155 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 29 SyntacticMatches, 4 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred 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.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 51 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 15077 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-11-28 20:07:24,727 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 20:07:24,730 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 20:07:24,747 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 20:07:24,748 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 20:07:24,750 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 20:07:24,752 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 20:07:24,761 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 20:07:24,766 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 20:07:24,771 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 20:07:24,772 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 20:07:24,774 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 20:07:24,775 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 20:07:24,777 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 20:07:24,778 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 20:07:24,779 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 20:07:24,781 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 20:07:24,782 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 20:07:24,784 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 20:07:24,788 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 20:07:24,793 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 20:07:24,798 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 20:07:24,799 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 20:07:24,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 20:07:24,806 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 20:07:24,806 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 20:07:24,806 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 20:07:24,807 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 20:07:24,807 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 20:07:24,808 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 20:07:24,809 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 20:07:24,809 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 20:07:24,810 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 20:07:24,811 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 20:07:24,812 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 20:07:24,812 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 20:07:24,813 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 20:07:24,813 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 20:07:24,813 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 20:07:24,814 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 20:07:24,815 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 20:07:24,816 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-28 20:07:24,840 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 20:07:24,840 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 20:07:24,845 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 20:07:24,845 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 20:07:24,846 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 20:07:24,846 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 20:07:24,846 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 20:07:24,847 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 20:07:24,847 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 20:07:24,847 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 20:07:24,847 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 20:07:24,848 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 20:07:24,850 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 20:07:24,850 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 20:07:24,850 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 20:07:24,851 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 20:07:24,851 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-28 20:07:24,851 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-28 20:07:24,852 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 20:07:24,853 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 20:07:24,853 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 20:07:24,854 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 20:07:24,854 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 20:07:24,854 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 20:07:24,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:07:24,855 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 20:07:24,855 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 20:07:24,856 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-28 20:07:24,857 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-28 20:07:24,857 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 20:07:24,857 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-28 20:07:24,858 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a9fb1ca01555f439b860fec974f930b68e3dc780 [2019-11-28 20:07:25,188 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 20:07:25,207 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 20:07:25,212 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 20:07:25,214 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 20:07:25,215 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 20:07:25,216 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0019-2.i [2019-11-28 20:07:25,276 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20b16adf0/e9986dd337d54f478b28ac83932414da/FLAG553738700 [2019-11-28 20:07:25,795 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 20:07:25,799 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0019-2.i [2019-11-28 20:07:25,824 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20b16adf0/e9986dd337d54f478b28ac83932414da/FLAG553738700 [2019-11-28 20:07:26,096 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20b16adf0/e9986dd337d54f478b28ac83932414da [2019-11-28 20:07:26,099 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 20:07:26,100 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 20:07:26,101 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 20:07:26,101 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 20:07:26,105 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 20:07:26,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:07:26" (1/1) ... [2019-11-28 20:07:26,109 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a736f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:26, skipping insertion in model container [2019-11-28 20:07:26,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 08:07:26" (1/1) ... [2019-11-28 20:07:26,115 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 20:07:26,161 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 20:07:26,592 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:07:26,604 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 20:07:26,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 20:07:26,749 INFO L208 MainTranslator]: Completed translation [2019-11-28 20:07:26,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:26 WrapperNode [2019-11-28 20:07:26,751 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 20:07:26,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 20:07:26,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 20:07:26,754 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 20:07:26,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:26" (1/1) ... [2019-11-28 20:07:26,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:26" (1/1) ... [2019-11-28 20:07:26,791 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:26" (1/1) ... [2019-11-28 20:07:26,791 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:26" (1/1) ... [2019-11-28 20:07:26,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:26" (1/1) ... [2019-11-28 20:07:26,810 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:26" (1/1) ... [2019-11-28 20:07:26,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:26" (1/1) ... [2019-11-28 20:07:26,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 20:07:26,821 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 20:07:26,821 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 20:07:26,821 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 20:07:26,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 20:07:26,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 20:07:26,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 20:07:26,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-28 20:07:26,880 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-28 20:07:26,880 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-28 20:07:26,881 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-28 20:07:26,881 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-28 20:07:26,881 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-28 20:07:26,881 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2019-11-28 20:07:26,881 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2019-11-28 20:07:26,882 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 20:07:26,882 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 20:07:26,882 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 20:07:26,882 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 20:07:26,883 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 20:07:26,883 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 20:07:26,883 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 20:07:26,883 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 20:07:26,883 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 20:07:26,883 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 20:07:26,884 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 20:07:26,884 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 20:07:26,884 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 20:07:26,884 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 20:07:26,884 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 20:07:26,884 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 20:07:26,885 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 20:07:26,885 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 20:07:26,885 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-28 20:07:26,885 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-28 20:07:26,885 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-28 20:07:26,885 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-28 20:07:26,885 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-28 20:07:26,885 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 20:07:26,886 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 20:07:26,886 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 20:07:26,886 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 20:07:26,886 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 20:07:26,886 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 20:07:26,886 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 20:07:26,886 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 20:07:26,887 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 20:07:26,887 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 20:07:26,887 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 20:07:26,887 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 20:07:26,887 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 20:07:26,887 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 20:07:26,887 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 20:07:26,888 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 20:07:26,888 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 20:07:26,888 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 20:07:26,888 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 20:07:26,888 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 20:07:26,888 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 20:07:26,888 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 20:07:26,889 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 20:07:26,889 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 20:07:26,889 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 20:07:26,889 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 20:07:26,889 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 20:07:26,889 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 20:07:26,889 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 20:07:26,890 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 20:07:26,890 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 20:07:26,890 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 20:07:26,890 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 20:07:26,890 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 20:07:26,890 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 20:07:26,890 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 20:07:26,890 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 20:07:26,891 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 20:07:26,891 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 20:07:26,891 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 20:07:26,891 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 20:07:26,891 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 20:07:26,891 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 20:07:26,891 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 20:07:26,892 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 20:07:26,892 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 20:07:26,892 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 20:07:26,892 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 20:07:26,892 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 20:07:26,892 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 20:07:26,892 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 20:07:26,892 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 20:07:26,893 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 20:07:26,893 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 20:07:26,893 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 20:07:26,893 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 20:07:26,893 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 20:07:26,893 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 20:07:26,893 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 20:07:26,894 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 20:07:26,894 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 20:07:26,894 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 20:07:26,894 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 20:07:26,894 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 20:07:26,894 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 20:07:26,894 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 20:07:26,895 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 20:07:26,895 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 20:07:26,895 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 20:07:26,895 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 20:07:26,895 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 20:07:26,895 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 20:07:26,895 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 20:07:26,896 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 20:07:26,896 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 20:07:26,896 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 20:07:26,896 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 20:07:26,896 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 20:07:26,896 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 20:07:26,896 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 20:07:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 20:07:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 20:07:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 20:07:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 20:07:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 20:07:26,897 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 20:07:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2019-11-28 20:07:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 20:07:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 20:07:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2019-11-28 20:07:26,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 20:07:26,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 20:07:26,899 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 20:07:26,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 20:07:26,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 20:07:26,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 20:07:26,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-28 20:07:27,449 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 20:07:27,450 INFO L287 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-28 20:07:27,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:07:27 BoogieIcfgContainer [2019-11-28 20:07:27,451 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 20:07:27,453 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 20:07:27,453 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 20:07:27,456 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 20:07:27,457 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 08:07:26" (1/3) ... [2019-11-28 20:07:27,457 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc7f81e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:07:27, skipping insertion in model container [2019-11-28 20:07:27,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 08:07:26" (2/3) ... [2019-11-28 20:07:27,458 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc7f81e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 08:07:27, skipping insertion in model container [2019-11-28 20:07:27,458 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:07:27" (3/3) ... [2019-11-28 20:07:27,460 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0019-2.i [2019-11-28 20:07:27,471 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 20:07:27,480 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-11-28 20:07:27,492 INFO L249 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-11-28 20:07:27,511 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 20:07:27,511 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 20:07:27,512 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 20:07:27,512 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 20:07:27,512 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 20:07:27,512 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 20:07:27,512 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 20:07:27,512 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 20:07:27,527 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2019-11-28 20:07:27,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 20:07:27,535 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:27,536 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:07:27,537 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 20:07:27,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:27,541 INFO L82 PathProgramCache]: Analyzing trace with hash 259421077, now seen corresponding path program 1 times [2019-11-28 20:07:27,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 20:07:27,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [801925111] [2019-11-28 20:07:27,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-28 20:07:27,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:27,706 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 20:07:27,715 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:07:27,803 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 20:07:27,804 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:07:27,814 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:27,815 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:07:27,815 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 20:07:27,889 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:27,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 30 [2019-11-28 20:07:27,893 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:07:27,918 INFO L614 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2019-11-28 20:07:27,919 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:07:27,919 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:11 [2019-11-28 20:07:27,941 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-28 20:07:27,941 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 20:07:27,969 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-28 20:07:27,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [801925111] [2019-11-28 20:07:27,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:27,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-28 20:07:27,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249685119] [2019-11-28 20:07:27,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 20:07:27,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 20:07:27,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 20:07:27,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 20:07:27,996 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 5 states. [2019-11-28 20:07:28,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:28,221 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-11-28 20:07:28,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 20:07:28,224 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2019-11-28 20:07:28,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:28,236 INFO L225 Difference]: With dead ends: 52 [2019-11-28 20:07:28,236 INFO L226 Difference]: Without dead ends: 49 [2019-11-28 20:07:28,239 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 20:07:28,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-28 20:07:28,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-28 20:07:28,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-28 20:07:28,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2019-11-28 20:07:28,293 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 9 [2019-11-28 20:07:28,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:28,294 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2019-11-28 20:07:28,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 20:07:28,294 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2019-11-28 20:07:28,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 20:07:28,295 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:28,296 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:07:28,513 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-28 20:07:28,514 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 20:07:28,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:28,514 INFO L82 PathProgramCache]: Analyzing trace with hash 259421078, now seen corresponding path program 1 times [2019-11-28 20:07:28,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 20:07:28,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [317941356] [2019-11-28 20:07:28,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-28 20:07:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:28,627 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 20:07:28,629 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:07:28,645 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 20:07:28,645 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:07:28,659 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:28,664 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 20:07:28,664 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:07:28,674 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:28,675 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:07:28,675 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-28 20:07:28,748 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:28,749 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-28 20:07:28,750 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:07:28,768 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:28,777 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-28 20:07:28,780 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:07:28,801 INFO L614 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2019-11-28 20:07:28,802 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:07:28,802 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2019-11-28 20:07:28,826 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-28 20:07:28,826 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 20:07:28,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:07:29,142 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-28 20:07:29,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [317941356] [2019-11-28 20:07:29,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:29,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-28 20:07:29,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4094132] [2019-11-28 20:07:29,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 20:07:29,146 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 20:07:29,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 20:07:29,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-28 20:07:29,147 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 8 states. [2019-11-28 20:07:29,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:29,819 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2019-11-28 20:07:29,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:07:29,823 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-28 20:07:29,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:29,824 INFO L225 Difference]: With dead ends: 48 [2019-11-28 20:07:29,824 INFO L226 Difference]: Without dead ends: 48 [2019-11-28 20:07:29,825 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-28 20:07:29,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-28 20:07:29,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-11-28 20:07:29,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 20:07:29,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-11-28 20:07:29,832 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 9 [2019-11-28 20:07:29,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:29,832 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-11-28 20:07:29,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 20:07:29,833 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-11-28 20:07:29,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-28 20:07:29,833 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:29,833 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:07:30,042 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-28 20:07:30,044 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 20:07:30,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:30,045 INFO L82 PathProgramCache]: Analyzing trace with hash 195552151, now seen corresponding path program 1 times [2019-11-28 20:07:30,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 20:07:30,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1097681467] [2019-11-28 20:07:30,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-28 20:07:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:30,149 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 20:07:30,151 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:07:30,163 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 20:07:30,164 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:07:30,172 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:30,177 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 20:07:30,178 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:07:30,186 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:30,187 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:07:30,187 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-28 20:07:30,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:07:30,240 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-28 20:07:30,241 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:07:30,262 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:30,280 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 20:07:30,281 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 20:07:30,282 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:07:30,299 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:30,300 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:07:30,301 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:14 [2019-11-28 20:07:30,362 INFO L430 ElimStorePlain]: Different costs {1=[|v_#valid_55|], 3=[|v_#length_31|]} [2019-11-28 20:07:30,378 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:30,378 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 20:07:30,379 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:07:30,396 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:30,423 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:30,424 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 46 [2019-11-28 20:07:30,426 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:07:30,471 INFO L614 ElimStorePlain]: treesize reduction 24, result has 48.9 percent of original size [2019-11-28 20:07:30,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:07:30,474 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 20:07:30,474 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:23 [2019-11-28 20:07:30,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:07:30,508 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-28 20:07:30,508 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 20:07:30,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:07:30,685 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:07:30,716 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:30,716 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-28 20:07:30,717 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:07:30,738 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:30,739 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-28 20:07:30,740 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 20:07:30,767 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:30,769 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-28 20:07:30,769 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:22 [2019-11-28 20:07:30,830 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:07:31,056 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-28 20:07:31,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1097681467] [2019-11-28 20:07:31,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:31,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 10 [2019-11-28 20:07:31,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577664947] [2019-11-28 20:07:31,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 20:07:31,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 20:07:31,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 20:07:31,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:07:31,059 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 11 states. [2019-11-28 20:07:31,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:31,762 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-11-28 20:07:31,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 20:07:31,763 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-11-28 20:07:31,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:31,764 INFO L225 Difference]: With dead ends: 47 [2019-11-28 20:07:31,764 INFO L226 Difference]: Without dead ends: 47 [2019-11-28 20:07:31,765 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-28 20:07:31,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-28 20:07:31,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2019-11-28 20:07:31,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 20:07:31,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2019-11-28 20:07:31,772 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 11 [2019-11-28 20:07:31,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:31,772 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2019-11-28 20:07:31,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 20:07:31,773 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2019-11-28 20:07:31,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 20:07:31,773 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:31,774 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:07:31,977 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-28 20:07:31,978 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 20:07:31,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:31,979 INFO L82 PathProgramCache]: Analyzing trace with hash -2119895045, now seen corresponding path program 1 times [2019-11-28 20:07:31,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 20:07:31,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266739060] [2019-11-28 20:07:31,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-28 20:07:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:32,071 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-28 20:07:32,073 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:07:32,190 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-28 20:07:32,191 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 20:07:32,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:07:32,516 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-11-28 20:07:32,517 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:07:32,526 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-28 20:07:32,527 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:07:32,564 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:32,566 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-28 20:07:32,567 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:25 [2019-11-28 20:07:32,900 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:32,901 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2019-11-28 20:07:32,902 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:07:32,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:07:32,905 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 20:07:33,005 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:33,006 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:07:33,178 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:33,179 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2019-11-28 20:07:33,180 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:07:33,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:07:33,182 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 20:07:33,247 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:33,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:07:33,270 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:33,271 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2019-11-28 20:07:33,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:07:33,273 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:07:33,274 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 20:07:33,354 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:33,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:07:33,374 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2019-11-28 20:07:33,375 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:07:33,395 INFO L614 ElimStorePlain]: treesize reduction 30, result has 3.2 percent of original size [2019-11-28 20:07:33,395 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:07:33,396 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:1 [2019-11-28 20:07:33,402 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-28 20:07:33,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266739060] [2019-11-28 20:07:33,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:33,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 13 [2019-11-28 20:07:33,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668279989] [2019-11-28 20:07:33,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-28 20:07:33,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 20:07:33,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 20:07:33,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=147, Unknown=2, NotChecked=0, Total=182 [2019-11-28 20:07:33,405 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 14 states. [2019-11-28 20:07:34,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:34,271 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-11-28 20:07:34,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-28 20:07:34,272 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 16 [2019-11-28 20:07:34,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:34,273 INFO L225 Difference]: With dead ends: 43 [2019-11-28 20:07:34,273 INFO L226 Difference]: Without dead ends: 43 [2019-11-28 20:07:34,274 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=51, Invalid=218, Unknown=3, NotChecked=0, Total=272 [2019-11-28 20:07:34,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-28 20:07:34,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-28 20:07:34,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-28 20:07:34,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2019-11-28 20:07:34,280 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 16 [2019-11-28 20:07:34,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:34,280 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2019-11-28 20:07:34,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-28 20:07:34,281 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2019-11-28 20:07:34,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 20:07:34,281 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:34,282 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:07:34,484 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-28 20:07:34,485 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 20:07:34,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:34,486 INFO L82 PathProgramCache]: Analyzing trace with hash -2119895046, now seen corresponding path program 1 times [2019-11-28 20:07:34,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 20:07:34,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [723751647] [2019-11-28 20:07:34,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-28 20:07:34,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:34,573 INFO L264 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 20:07:34,576 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:07:34,618 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-28 20:07:34,618 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 20:07:34,661 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:34,661 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-11-28 20:07:34,662 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 20:07:34,663 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:07:34,665 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:34,666 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:07:34,666 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:3 [2019-11-28 20:07:34,672 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-28 20:07:34,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [723751647] [2019-11-28 20:07:34,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:34,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2019-11-28 20:07:34,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291021421] [2019-11-28 20:07:34,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 20:07:34,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 20:07:34,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 20:07:34,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 20:07:34,674 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 7 states. [2019-11-28 20:07:34,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:34,877 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-11-28 20:07:34,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 20:07:34,877 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2019-11-28 20:07:34,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:34,878 INFO L225 Difference]: With dead ends: 45 [2019-11-28 20:07:34,878 INFO L226 Difference]: Without dead ends: 45 [2019-11-28 20:07:34,879 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-28 20:07:34,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-28 20:07:34,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2019-11-28 20:07:34,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-28 20:07:34,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2019-11-28 20:07:34,887 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 16 [2019-11-28 20:07:34,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:34,888 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2019-11-28 20:07:34,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 20:07:34,888 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2019-11-28 20:07:34,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-28 20:07:34,888 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:34,889 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 20:07:35,098 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-28 20:07:35,099 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 20:07:35,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:35,099 INFO L82 PathProgramCache]: Analyzing trace with hash 227419100, now seen corresponding path program 1 times [2019-11-28 20:07:35,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 20:07:35,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1101298899] [2019-11-28 20:07:35,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-28 20:07:35,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:35,213 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-28 20:07:35,219 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:07:35,248 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 20:07:35,248 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:07:35,251 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:35,251 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:07:35,252 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-11-28 20:07:35,320 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-28 20:07:35,321 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:07:35,323 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:35,323 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:07:35,323 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-11-28 20:07:35,374 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-28 20:07:35,374 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 20:07:35,475 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2019-11-28 20:07:35,476 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-11-28 20:07:35,487 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:35,487 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-11-28 20:07:35,488 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:14 [2019-11-28 20:07:35,499 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-28 20:07:35,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1101298899] [2019-11-28 20:07:35,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:35,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 10 [2019-11-28 20:07:35,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639089730] [2019-11-28 20:07:35,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-28 20:07:35,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 20:07:35,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-28 20:07:35,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-11-28 20:07:35,502 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 11 states. [2019-11-28 20:07:36,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:36,066 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2019-11-28 20:07:36,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 20:07:36,067 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2019-11-28 20:07:36,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:36,070 INFO L225 Difference]: With dead ends: 42 [2019-11-28 20:07:36,071 INFO L226 Difference]: Without dead ends: 42 [2019-11-28 20:07:36,071 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2019-11-28 20:07:36,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-28 20:07:36,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2019-11-28 20:07:36,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-28 20:07:36,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2019-11-28 20:07:36,077 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 21 [2019-11-28 20:07:36,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:36,077 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2019-11-28 20:07:36,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-28 20:07:36,077 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2019-11-28 20:07:36,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 20:07:36,078 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:36,079 INFO L410 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] [2019-11-28 20:07:36,279 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-28 20:07:36,280 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 20:07:36,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:36,281 INFO L82 PathProgramCache]: Analyzing trace with hash -1539942402, now seen corresponding path program 1 times [2019-11-28 20:07:36,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 20:07:36,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [580484877] [2019-11-28 20:07:36,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-28 20:07:36,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:36,390 INFO L264 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-28 20:07:36,393 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:07:36,473 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 20:07:36,473 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:07:36,493 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:36,494 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:07:36,494 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2019-11-28 20:07:36,667 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-28 20:07:36,667 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:07:36,678 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:36,679 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:07:36,680 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:11 [2019-11-28 20:07:36,794 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-28 20:07:36,794 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 20:07:37,282 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2019-11-28 20:07:37,283 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:07:37,315 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:37,316 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:07:37,317 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:32 [2019-11-28 20:07:37,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 20:07:37,575 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-28 20:07:37,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [580484877] [2019-11-28 20:07:37,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:37,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11, 10] imperfect sequences [] total 20 [2019-11-28 20:07:37,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330324721] [2019-11-28 20:07:37,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-28 20:07:37,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 20:07:37,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-28 20:07:37,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2019-11-28 20:07:37,578 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 21 states. [2019-11-28 20:07:39,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:39,116 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2019-11-28 20:07:39,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-28 20:07:39,117 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 22 [2019-11-28 20:07:39,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:39,118 INFO L225 Difference]: With dead ends: 40 [2019-11-28 20:07:39,118 INFO L226 Difference]: Without dead ends: 40 [2019-11-28 20:07:39,119 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=117, Invalid=533, Unknown=0, NotChecked=0, Total=650 [2019-11-28 20:07:39,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-28 20:07:39,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-11-28 20:07:39,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 20:07:39,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-11-28 20:07:39,124 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 22 [2019-11-28 20:07:39,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:39,124 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-11-28 20:07:39,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-28 20:07:39,125 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-11-28 20:07:39,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 20:07:39,126 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:39,126 INFO L410 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] [2019-11-28 20:07:39,328 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-28 20:07:39,329 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 20:07:39,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:39,330 INFO L82 PathProgramCache]: Analyzing trace with hash -493574114, now seen corresponding path program 1 times [2019-11-28 20:07:39,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 20:07:39,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290661893] [2019-11-28 20:07:39,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-28 20:07:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 20:07:39,437 INFO L264 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 20:07:39,440 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 20:07:39,458 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 20:07:39,458 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:07:39,468 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:39,468 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:07:39,469 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-28 20:07:39,491 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 20:07:39,492 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:07:39,504 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:39,505 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:07:39,505 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:13 [2019-11-28 20:07:39,587 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-28 20:07:39,587 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 20:07:39,589 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:39,589 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 20:07:39,589 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:5 [2019-11-28 20:07:39,646 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-28 20:07:39,647 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 20:07:39,776 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2019-11-28 20:07:39,777 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:07:39,803 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 20:07:39,804 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 20:07:39,804 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:36 [2019-11-28 20:07:39,876 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-28 20:07:39,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290661893] [2019-11-28 20:07:39,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 20:07:39,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 11 [2019-11-28 20:07:39,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046749939] [2019-11-28 20:07:39,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 20:07:39,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 20:07:39,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 20:07:39,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-11-28 20:07:39,878 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 12 states. [2019-11-28 20:07:40,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 20:07:40,438 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-11-28 20:07:40,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-28 20:07:40,439 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-11-28 20:07:40,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 20:07:40,440 INFO L225 Difference]: With dead ends: 39 [2019-11-28 20:07:40,440 INFO L226 Difference]: Without dead ends: 39 [2019-11-28 20:07:40,443 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2019-11-28 20:07:40,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-28 20:07:40,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-11-28 20:07:40,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-11-28 20:07:40,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-11-28 20:07:40,450 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 23 [2019-11-28 20:07:40,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 20:07:40,451 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-11-28 20:07:40,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 20:07:40,451 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-11-28 20:07:40,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 20:07:40,452 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 20:07:40,452 INFO L410 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-28 20:07:40,659 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-28 20:07:40,660 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ENSURES_VIOLATIONMEMORY_LEAK, alloc_dataErr3REQUIRES_VIOLATION, alloc_dataErr2REQUIRES_VIOLATION, alloc_dataErr1REQUIRES_VIOLATION, alloc_dataErr0REQUIRES_VIOLATION, free_dataErr8ASSERT_VIOLATIONMEMORY_FREE, free_dataErr7ASSERT_VIOLATIONMEMORY_FREE, free_dataErr9ASSERT_VIOLATIONMEMORY_FREE, free_dataErr6ASSERT_VIOLATIONMEMORY_FREE, free_dataErr12REQUIRES_VIOLATION, free_dataErr1REQUIRES_VIOLATION, free_dataErr4ASSERT_VIOLATIONMEMORY_FREE, free_dataErr5ASSERT_VIOLATIONMEMORY_FREE, free_dataErr11REQUIRES_VIOLATION, free_dataErr0REQUIRES_VIOLATION, free_dataErr10REQUIRES_VIOLATION, free_dataErr3REQUIRES_VIOLATION, free_dataErr13REQUIRES_VIOLATION, free_dataErr2REQUIRES_VIOLATION]=== [2019-11-28 20:07:40,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 20:07:40,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1856994939, now seen corresponding path program 1 times [2019-11-28 20:07:40,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 20:07:40,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430037892] [2019-11-28 20:07:40,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-28 20:07:40,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:07:40,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 20:07:40,870 INFO L174 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2019-11-28 20:07:40,870 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 20:07:41,071 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-28 20:07:41,095 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2019-11-28 20:07:41,113 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 08:07:41 BoogieIcfgContainer [2019-11-28 20:07:41,113 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 20:07:41,113 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 20:07:41,113 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 20:07:41,114 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 20:07:41,114 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 08:07:27" (3/4) ... [2019-11-28 20:07:41,117 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 20:07:41,117 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 20:07:41,118 INFO L168 Benchmark]: Toolchain (without parser) took 15018.48 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 288.4 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -137.2 MB). Peak memory consumption was 151.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:41,119 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:07:41,119 INFO L168 Benchmark]: CACSL2BoogieTranslator took 649.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -148.9 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:41,120 INFO L168 Benchmark]: Boogie Preprocessor took 69.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:07:41,120 INFO L168 Benchmark]: RCFGBuilder took 630.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:41,121 INFO L168 Benchmark]: TraceAbstraction took 13660.26 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 157.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -45.6 MB). Peak memory consumption was 112.2 MB. Max. memory is 11.5 GB. [2019-11-28 20:07:41,121 INFO L168 Benchmark]: Witness Printer took 3.77 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 20:07:41,124 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 649.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -148.9 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 69.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 630.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13660.26 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 157.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -45.6 MB). Peak memory consumption was 112.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.77 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 532]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 532. Possible FailurePath: [L533] TData data; VAL [data={15:0}] [L534] CALL alloc_data(&data) VAL [pdata={15:0}] [L518] pdata->lo = malloc(16) VAL [malloc(16)={1:0}, pdata={15:0}, pdata={15:0}] [L519] pdata->hi = malloc(24) VAL [malloc(16)={1:0}, malloc(24)={3:0}, pdata={15:0}, pdata={15:0}] [L534] RET alloc_data(&data) VAL [data={15:0}] [L535] CALL free_data(&data) VAL [data={15:0}] [L523] EXPR data->lo VAL [data={15:0}, data={15:0}, data->lo={1:0}] [L523] void *lo = data->lo; [L524] EXPR data->hi VAL [data={15:0}, data={15:0}, data->hi={3:0}, lo={1:0}] [L524] void *hi = data->hi; [L525] COND FALSE !(lo == hi) VAL [data={15:0}, data={15:0}, hi={3:0}, lo={1:0}] [L529] data->lo = (void *) 0 VAL [data={15:0}, data={15:0}, hi={3:0}, lo={1:0}] [L530] data->hi = (void *) 0 VAL [data={15:0}, data={15:0}, hi={3:0}, lo={1:0}] [L535] RET free_data(&data) VAL [data={15:0}] [L536] return 0; [L536] return 0; VAL [\result=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 75 locations, 19 error locations. Result: UNSAFE, OverallTime: 13.5s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 239 SDtfs, 294 SDslu, 852 SDs, 0 SdLazy, 1204 SolverSat, 81 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 272 GetRequests, 166 SyntacticMatches, 7 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 4.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred 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, 8 MinimizatonAttempts, 13 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.0s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 238 ConstructedInterpolants, 32 QuantifiedInterpolants, 29205 SizeOfPredicates, 75 NumberOfNonLiveVariables, 636 ConjunctsInSsa, 110 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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 could not prove your program: unable to determine feasibility of some traces Received shutdown request...