./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 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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 e0c6505355e23ab050a0b1754726876dca60bcf4 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 -Xmx15G -Xms4m -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 e0c6505355e23ab050a0b1754726876dca60bcf4 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 05:53:52,736 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 05:53:52,739 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 05:53:52,781 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 05:53:52,781 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 05:53:52,794 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 05:53:52,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 05:53:52,799 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 05:53:52,802 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 05:53:52,804 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 05:53:52,806 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 05:53:52,809 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 05:53:52,809 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 05:53:52,813 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 05:53:52,815 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 05:53:52,818 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 05:53:52,820 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 05:53:52,822 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 05:53:52,825 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 05:53:52,830 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 05:53:52,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 05:53:52,836 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 05:53:52,838 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 05:53:52,839 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 05:53:52,844 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 05:53:52,844 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 05:53:52,844 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 05:53:52,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 05:53:52,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 05:53:52,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 05:53:52,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 05:53:52,851 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 05:53:52,852 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 05:53:52,853 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 05:53:52,854 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 05:53:52,854 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 05:53:52,855 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 05:53:52,856 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 05:53:52,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 05:53:52,857 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 05:53:52,858 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 05:53:52,859 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2020-10-20 05:53:52,917 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 05:53:52,918 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 05:53:52,921 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 05:53:52,921 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 05:53:52,922 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 05:53:52,922 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 05:53:52,922 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 05:53:52,923 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 05:53:52,923 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 05:53:52,923 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 05:53:52,924 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 05:53:52,925 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-10-20 05:53:52,925 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-10-20 05:53:52,926 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-10-20 05:53:52,926 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 05:53:52,926 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-10-20 05:53:52,926 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 05:53:52,926 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 05:53:52,927 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 05:53:52,927 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 05:53:52,927 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 05:53:52,928 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 05:53:52,928 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 05:53:52,928 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 05:53:52,928 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 05:53:52,929 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 05:53:52,929 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-20 05:53:52,929 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 05:53:52,929 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 -> e0c6505355e23ab050a0b1754726876dca60bcf4 [2020-10-20 05:53:53,192 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 05:53:53,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 05:53:53,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 05:53:53,223 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 05:53:53,223 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 05:53:53,224 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0019-2.i [2020-10-20 05:53:53,303 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/004b92975/4ebb0b0c83134815958b02ac779a7755/FLAG99060f1e8 [2020-10-20 05:53:53,879 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 05:53:53,880 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0019-2.i [2020-10-20 05:53:53,893 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/004b92975/4ebb0b0c83134815958b02ac779a7755/FLAG99060f1e8 [2020-10-20 05:53:54,153 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/004b92975/4ebb0b0c83134815958b02ac779a7755 [2020-10-20 05:53:54,156 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 05:53:54,162 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-20 05:53:54,163 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 05:53:54,164 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 05:53:54,167 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 05:53:54,168 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 05:53:54" (1/1) ... [2020-10-20 05:53:54,171 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e5e83ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:53:54, skipping insertion in model container [2020-10-20 05:53:54,172 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 05:53:54" (1/1) ... [2020-10-20 05:53:54,180 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 05:53:54,228 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 05:53:54,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 05:53:54,664 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 05:53:54,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 05:53:54,763 INFO L208 MainTranslator]: Completed translation [2020-10-20 05:53:54,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:53:54 WrapperNode [2020-10-20 05:53:54,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 05:53:54,765 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 05:53:54,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 05:53:54,765 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 05:53:54,779 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:53:54" (1/1) ... [2020-10-20 05:53:54,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:53:54" (1/1) ... [2020-10-20 05:53:54,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:53:54" (1/1) ... [2020-10-20 05:53:54,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:53:54" (1/1) ... [2020-10-20 05:53:54,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:53:54" (1/1) ... [2020-10-20 05:53:54,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:53:54" (1/1) ... [2020-10-20 05:53:54,830 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:53:54" (1/1) ... [2020-10-20 05:53:54,845 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 05:53:54,846 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 05:53:54,846 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 05:53:54,847 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 05:53:54,848 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:53:54" (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 [2020-10-20 05:53:54,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-20 05:53:54,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 05:53:54,910 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-20 05:53:54,910 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-10-20 05:53:54,911 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-10-20 05:53:54,911 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-10-20 05:53:54,911 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-10-20 05:53:54,911 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-10-20 05:53:54,911 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2020-10-20 05:53:54,912 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2020-10-20 05:53:54,912 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-20 05:53:54,912 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-20 05:53:54,912 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-20 05:53:54,912 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-10-20 05:53:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-10-20 05:53:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-20 05:53:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 05:53:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-10-20 05:53:54,913 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-10-20 05:53:54,914 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-10-20 05:53:54,914 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-10-20 05:53:54,914 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-10-20 05:53:54,914 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-10-20 05:53:54,914 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-10-20 05:53:54,915 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-10-20 05:53:54,915 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-10-20 05:53:54,915 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-10-20 05:53:54,916 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-10-20 05:53:54,916 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-10-20 05:53:54,916 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-10-20 05:53:54,916 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-10-20 05:53:54,916 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-10-20 05:53:54,916 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-10-20 05:53:54,917 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-10-20 05:53:54,917 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-10-20 05:53:54,917 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-10-20 05:53:54,917 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-10-20 05:53:54,917 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-10-20 05:53:54,917 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-10-20 05:53:54,918 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-10-20 05:53:54,918 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-10-20 05:53:54,918 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-10-20 05:53:54,918 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-10-20 05:53:54,918 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-10-20 05:53:54,919 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-10-20 05:53:54,919 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-10-20 05:53:54,919 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-10-20 05:53:54,919 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-10-20 05:53:54,919 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-10-20 05:53:54,919 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-10-20 05:53:54,920 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-10-20 05:53:54,920 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-10-20 05:53:54,920 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-10-20 05:53:54,920 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-10-20 05:53:54,920 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-10-20 05:53:54,920 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-10-20 05:53:54,921 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-10-20 05:53:54,921 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-10-20 05:53:54,921 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-10-20 05:53:54,921 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-10-20 05:53:54,921 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-10-20 05:53:54,921 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-10-20 05:53:54,922 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-10-20 05:53:54,922 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-10-20 05:53:54,922 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-10-20 05:53:54,922 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-10-20 05:53:54,922 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-10-20 05:53:54,924 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-10-20 05:53:54,924 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-10-20 05:53:54,924 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-10-20 05:53:54,924 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-10-20 05:53:54,925 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-10-20 05:53:54,925 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-10-20 05:53:54,925 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-10-20 05:53:54,925 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-10-20 05:53:54,925 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-10-20 05:53:54,925 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-10-20 05:53:54,925 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-10-20 05:53:54,926 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-10-20 05:53:54,926 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-10-20 05:53:54,926 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-10-20 05:53:54,926 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-10-20 05:53:54,926 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-10-20 05:53:54,926 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-20 05:53:54,927 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-10-20 05:53:54,927 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-10-20 05:53:54,927 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-10-20 05:53:54,927 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-10-20 05:53:54,927 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-10-20 05:53:54,927 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-10-20 05:53:54,927 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-10-20 05:53:54,928 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-10-20 05:53:54,928 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-10-20 05:53:54,928 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-10-20 05:53:54,929 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-10-20 05:53:54,929 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-10-20 05:53:54,929 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-10-20 05:53:54,929 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-10-20 05:53:54,929 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-10-20 05:53:54,929 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-10-20 05:53:54,930 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-10-20 05:53:54,930 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-10-20 05:53:54,930 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-10-20 05:53:54,930 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-10-20 05:53:54,930 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-10-20 05:53:54,930 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-10-20 05:53:54,930 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-10-20 05:53:54,931 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-10-20 05:53:54,931 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-10-20 05:53:54,931 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-10-20 05:53:54,931 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-10-20 05:53:54,931 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-10-20 05:53:54,931 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-10-20 05:53:54,931 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-10-20 05:53:54,932 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-10-20 05:53:54,932 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-10-20 05:53:54,932 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-10-20 05:53:54,932 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-10-20 05:53:54,932 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-10-20 05:53:54,932 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-10-20 05:53:54,932 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-10-20 05:53:54,933 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-10-20 05:53:54,933 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-10-20 05:53:54,933 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2020-10-20 05:53:54,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-20 05:53:54,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-20 05:53:54,933 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2020-10-20 05:53:54,933 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-20 05:53:54,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 05:53:54,934 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-20 05:53:54,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-20 05:53:54,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 05:53:54,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 05:53:54,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 05:53:54,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 05:53:55,501 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 05:53:55,502 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-20 05:53:55,504 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 05:53:55 BoogieIcfgContainer [2020-10-20 05:53:55,504 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 05:53:55,506 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 05:53:55,506 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 05:53:55,509 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 05:53:55,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 05:53:54" (1/3) ... [2020-10-20 05:53:55,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba15e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 05:53:55, skipping insertion in model container [2020-10-20 05:53:55,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:53:54" (2/3) ... [2020-10-20 05:53:55,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ba15e0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 05:53:55, skipping insertion in model container [2020-10-20 05:53:55,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 05:53:55" (3/3) ... [2020-10-20 05:53:55,514 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0019-2.i [2020-10-20 05:53:55,527 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 05:53:55,536 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2020-10-20 05:53:55,552 INFO L253 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2020-10-20 05:53:55,575 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 05:53:55,576 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-20 05:53:55,576 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 05:53:55,576 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 05:53:55,577 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 05:53:55,577 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 05:53:55,577 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 05:53:55,577 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 05:53:55,597 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2020-10-20 05:53:55,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-20 05:53:55,608 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:53:55,609 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:53:55,610 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-20 05:53:55,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:53:55,617 INFO L82 PathProgramCache]: Analyzing trace with hash 2062563848, now seen corresponding path program 1 times [2020-10-20 05:53:55,628 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:53:55,629 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929935610] [2020-10-20 05:53:55,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:53:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:53:55,942 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:53:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:53:55,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:53:55,960 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929935610] [2020-10-20 05:53:55,961 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:53:55,961 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 05:53:55,962 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264668571] [2020-10-20 05:53:55,968 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 05:53:55,968 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:53:55,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 05:53:55,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 05:53:55,986 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 6 states. [2020-10-20 05:53:56,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:53:56,289 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2020-10-20 05:53:56,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 05:53:56,291 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-10-20 05:53:56,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:53:56,302 INFO L225 Difference]: With dead ends: 61 [2020-10-20 05:53:56,302 INFO L226 Difference]: Without dead ends: 58 [2020-10-20 05:53:56,304 INFO L677 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 [2020-10-20 05:53:56,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-10-20 05:53:56,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2020-10-20 05:53:56,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-10-20 05:53:56,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2020-10-20 05:53:56,348 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 9 [2020-10-20 05:53:56,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:53:56,348 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2020-10-20 05:53:56,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 05:53:56,348 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2020-10-20 05:53:56,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-20 05:53:56,349 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:53:56,349 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:53:56,350 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-20 05:53:56,350 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-20 05:53:56,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:53:56,350 INFO L82 PathProgramCache]: Analyzing trace with hash 2062563849, now seen corresponding path program 1 times [2020-10-20 05:53:56,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:53:56,361 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161232804] [2020-10-20 05:53:56,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:53:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:53:56,529 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:53:56,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:53:56,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:53:56,553 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161232804] [2020-10-20 05:53:56,554 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:53:56,555 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 05:53:56,555 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201638256] [2020-10-20 05:53:56,557 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 05:53:56,557 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:53:56,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 05:53:56,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 05:53:56,559 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 6 states. [2020-10-20 05:53:56,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:53:56,814 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2020-10-20 05:53:56,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 05:53:56,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-10-20 05:53:56,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:53:56,816 INFO L225 Difference]: With dead ends: 57 [2020-10-20 05:53:56,817 INFO L226 Difference]: Without dead ends: 57 [2020-10-20 05:53:56,819 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-10-20 05:53:56,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-10-20 05:53:56,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 48. [2020-10-20 05:53:56,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-20 05:53:56,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2020-10-20 05:53:56,833 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 9 [2020-10-20 05:53:56,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:53:56,834 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2020-10-20 05:53:56,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 05:53:56,834 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2020-10-20 05:53:56,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 05:53:56,835 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:53:56,836 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:53:56,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-20 05:53:56,837 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-20 05:53:56,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:53:56,837 INFO L82 PathProgramCache]: Analyzing trace with hash 2143934378, now seen corresponding path program 1 times [2020-10-20 05:53:56,838 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:53:56,838 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288953657] [2020-10-20 05:53:56,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:53:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:53:57,088 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:53:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:53:57,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:53:57,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288953657] [2020-10-20 05:53:57,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:53:57,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-20 05:53:57,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025811997] [2020-10-20 05:53:57,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 05:53:57,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:53:57,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 05:53:57,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-20 05:53:57,111 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 7 states. [2020-10-20 05:53:57,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:53:57,365 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2020-10-20 05:53:57,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 05:53:57,365 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 11 [2020-10-20 05:53:57,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:53:57,367 INFO L225 Difference]: With dead ends: 56 [2020-10-20 05:53:57,367 INFO L226 Difference]: Without dead ends: 56 [2020-10-20 05:53:57,367 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-10-20 05:53:57,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2020-10-20 05:53:57,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2020-10-20 05:53:57,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-20 05:53:57,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2020-10-20 05:53:57,374 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 11 [2020-10-20 05:53:57,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:53:57,374 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2020-10-20 05:53:57,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 05:53:57,375 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2020-10-20 05:53:57,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 05:53:57,375 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:53:57,375 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:53:57,376 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-20 05:53:57,376 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-20 05:53:57,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:53:57,376 INFO L82 PathProgramCache]: Analyzing trace with hash -129348870, now seen corresponding path program 1 times [2020-10-20 05:53:57,377 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:53:57,380 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909402687] [2020-10-20 05:53:57,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:53:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:53:57,441 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:53:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:53:57,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 05:53:57,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:53:57,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:53:57,497 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909402687] [2020-10-20 05:53:57,497 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:53:57,497 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-10-20 05:53:57,497 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349737152] [2020-10-20 05:53:57,498 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-20 05:53:57,498 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:53:57,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 05:53:57,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2020-10-20 05:53:57,499 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 9 states. [2020-10-20 05:53:57,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:53:57,895 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2020-10-20 05:53:57,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-10-20 05:53:57,896 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2020-10-20 05:53:57,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:53:57,898 INFO L225 Difference]: With dead ends: 51 [2020-10-20 05:53:57,898 INFO L226 Difference]: Without dead ends: 51 [2020-10-20 05:53:57,899 INFO L677 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 [2020-10-20 05:53:57,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-10-20 05:53:57,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2020-10-20 05:53:57,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-20 05:53:57,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-10-20 05:53:57,908 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 16 [2020-10-20 05:53:57,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:53:57,909 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-10-20 05:53:57,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-20 05:53:57,909 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-10-20 05:53:57,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 05:53:57,909 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:53:57,910 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:53:57,910 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-20 05:53:57,910 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-20 05:53:57,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:53:57,911 INFO L82 PathProgramCache]: Analyzing trace with hash -129348869, now seen corresponding path program 1 times [2020-10-20 05:53:57,911 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:53:57,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908580764] [2020-10-20 05:53:57,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:53:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:53:57,993 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:53:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:53:58,028 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 05:53:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:53:58,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:53:58,105 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908580764] [2020-10-20 05:53:58,105 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:53:58,106 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-10-20 05:53:58,106 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030639783] [2020-10-20 05:53:58,106 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 05:53:58,106 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:53:58,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 05:53:58,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2020-10-20 05:53:58,107 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 11 states. [2020-10-20 05:53:58,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:53:58,554 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2020-10-20 05:53:58,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 05:53:58,555 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 16 [2020-10-20 05:53:58,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:53:58,558 INFO L225 Difference]: With dead ends: 44 [2020-10-20 05:53:58,558 INFO L226 Difference]: Without dead ends: 44 [2020-10-20 05:53:58,559 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2020-10-20 05:53:58,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2020-10-20 05:53:58,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2020-10-20 05:53:58,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-20 05:53:58,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2020-10-20 05:53:58,564 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 16 [2020-10-20 05:53:58,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:53:58,565 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2020-10-20 05:53:58,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 05:53:58,565 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2020-10-20 05:53:58,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-20 05:53:58,566 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:53:58,566 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:53:58,566 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-20 05:53:58,566 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-20 05:53:58,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:53:58,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1752734705, now seen corresponding path program 1 times [2020-10-20 05:53:58,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:53:58,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884298208] [2020-10-20 05:53:58,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:53:58,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:53:58,680 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:53:58,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:53:58,705 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 05:53:58,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:53:58,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:53:58,772 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884298208] [2020-10-20 05:53:58,772 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:53:58,772 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-20 05:53:58,772 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649062173] [2020-10-20 05:53:58,773 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 05:53:58,773 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:53:58,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 05:53:58,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-10-20 05:53:58,774 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 12 states. [2020-10-20 05:53:59,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:53:59,230 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2020-10-20 05:53:59,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-20 05:53:59,231 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2020-10-20 05:53:59,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:53:59,232 INFO L225 Difference]: With dead ends: 43 [2020-10-20 05:53:59,232 INFO L226 Difference]: Without dead ends: 43 [2020-10-20 05:53:59,232 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2020-10-20 05:53:59,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-10-20 05:53:59,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2020-10-20 05:53:59,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-10-20 05:53:59,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2020-10-20 05:53:59,237 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 21 [2020-10-20 05:53:59,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:53:59,238 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2020-10-20 05:53:59,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 05:53:59,238 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2020-10-20 05:53:59,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 05:53:59,239 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:53:59,239 INFO L422 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] [2020-10-20 05:53:59,239 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-20 05:53:59,240 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-20 05:53:59,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:53:59,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1499799070, now seen corresponding path program 1 times [2020-10-20 05:53:59,240 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:53:59,240 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864056036] [2020-10-20 05:53:59,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:53:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:53:59,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:53:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:53:59,358 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 05:53:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:53:59,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:53:59,460 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864056036] [2020-10-20 05:53:59,461 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:53:59,461 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-20 05:53:59,461 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101758746] [2020-10-20 05:53:59,461 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 05:53:59,462 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:53:59,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 05:53:59,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-10-20 05:53:59,464 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 12 states. [2020-10-20 05:53:59,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:53:59,934 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-10-20 05:53:59,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 05:53:59,935 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-10-20 05:53:59,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:53:59,936 INFO L225 Difference]: With dead ends: 42 [2020-10-20 05:53:59,936 INFO L226 Difference]: Without dead ends: 42 [2020-10-20 05:53:59,936 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2020-10-20 05:53:59,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-10-20 05:53:59,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2020-10-20 05:53:59,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-20 05:53:59,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2020-10-20 05:53:59,944 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 22 [2020-10-20 05:53:59,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:53:59,944 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2020-10-20 05:53:59,944 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 05:53:59,945 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2020-10-20 05:53:59,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-20 05:53:59,947 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:53:59,948 INFO L422 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] [2020-10-20 05:53:59,948 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-20 05:53:59,948 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-20 05:53:59,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:53:59,949 INFO L82 PathProgramCache]: Analyzing trace with hash -750869007, now seen corresponding path program 1 times [2020-10-20 05:53:59,949 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:53:59,950 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003954412] [2020-10-20 05:53:59,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:53:59,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:00,029 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:54:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:00,049 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 05:54:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:00,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:54:00,128 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003954412] [2020-10-20 05:54:00,129 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:00,129 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-10-20 05:54:00,129 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674076784] [2020-10-20 05:54:00,130 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 05:54:00,130 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:54:00,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 05:54:00,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2020-10-20 05:54:00,131 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 12 states. [2020-10-20 05:54:00,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:00,568 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2020-10-20 05:54:00,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 05:54:00,568 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-20 05:54:00,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:00,569 INFO L225 Difference]: With dead ends: 41 [2020-10-20 05:54:00,569 INFO L226 Difference]: Without dead ends: 41 [2020-10-20 05:54:00,570 INFO L677 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 [2020-10-20 05:54:00,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-10-20 05:54:00,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2020-10-20 05:54:00,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-10-20 05:54:00,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2020-10-20 05:54:00,574 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 23 [2020-10-20 05:54:00,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:00,574 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2020-10-20 05:54:00,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 05:54:00,574 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2020-10-20 05:54:00,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-20 05:54:00,575 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:00,575 INFO L422 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] [2020-10-20 05:54:00,576 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-20 05:54:00,576 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-20 05:54:00,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:00,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1802102656, now seen corresponding path program 1 times [2020-10-20 05:54:00,576 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:54:00,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122873946] [2020-10-20 05:54:00,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:54:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:00,635 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:54:00,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:00,653 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 05:54:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:00,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:54:00,660 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122873946] [2020-10-20 05:54:00,660 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:00,660 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 05:54:00,661 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413352814] [2020-10-20 05:54:00,661 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 05:54:00,661 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:54:00,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 05:54:00,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 05:54:00,662 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 6 states. [2020-10-20 05:54:00,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:00,821 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2020-10-20 05:54:00,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 05:54:00,822 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2020-10-20 05:54:00,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:00,823 INFO L225 Difference]: With dead ends: 40 [2020-10-20 05:54:00,823 INFO L226 Difference]: Without dead ends: 40 [2020-10-20 05:54:00,823 INFO L677 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 [2020-10-20 05:54:00,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-10-20 05:54:00,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2020-10-20 05:54:00,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-20 05:54:00,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2020-10-20 05:54:00,828 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 24 [2020-10-20 05:54:00,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:00,829 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2020-10-20 05:54:00,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 05:54:00,829 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2020-10-20 05:54:00,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-10-20 05:54:00,830 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:00,830 INFO L422 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] [2020-10-20 05:54:00,830 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-20 05:54:00,831 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-20 05:54:00,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:00,831 INFO L82 PathProgramCache]: Analyzing trace with hash -30607405, now seen corresponding path program 1 times [2020-10-20 05:54:00,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:54:00,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919743572] [2020-10-20 05:54:00,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:54:00,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:00,886 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-10-20 05:54:00,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:00,903 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-10-20 05:54:00,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:00,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:54:00,910 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919743572] [2020-10-20 05:54:00,910 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:00,910 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 05:54:00,911 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301530373] [2020-10-20 05:54:00,911 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-20 05:54:00,912 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 05:54:00,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 05:54:00,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-10-20 05:54:00,913 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 6 states. [2020-10-20 05:54:01,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:01,075 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2020-10-20 05:54:01,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 05:54:01,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2020-10-20 05:54:01,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:01,077 INFO L225 Difference]: With dead ends: 39 [2020-10-20 05:54:01,077 INFO L226 Difference]: Without dead ends: 39 [2020-10-20 05:54:01,078 INFO L677 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 [2020-10-20 05:54:01,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-10-20 05:54:01,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2020-10-20 05:54:01,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-20 05:54:01,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2020-10-20 05:54:01,085 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 25 [2020-10-20 05:54:01,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:01,085 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2020-10-20 05:54:01,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-20 05:54:01,086 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2020-10-20 05:54:01,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-20 05:54:01,086 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:01,086 INFO L422 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] [2020-10-20 05:54:01,087 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-20 05:54:01,088 INFO L429 AbstractCegarLoop]: === Iteration 11 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-20 05:54:01,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:01,088 INFO L82 PathProgramCache]: Analyzing trace with hash -993519269, now seen corresponding path program 1 times [2020-10-20 05:54:01,089 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 05:54:01,089 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768245322] [2020-10-20 05:54:01,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 05:54:01,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 05:54:01,133 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 05:54:01,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 05:54:01,177 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 05:54:01,231 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 05:54:01,232 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 05:54:01,232 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-20 05:54:01,294 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2020-10-20 05:54:01,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 05:54:01 BoogieIcfgContainer [2020-10-20 05:54:01,328 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 05:54:01,328 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 05:54:01,328 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 05:54:01,329 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 05:54:01,329 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 05:53:55" (3/4) ... [2020-10-20 05:54:01,334 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 05:54:01,334 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 05:54:01,337 INFO L168 Benchmark]: Toolchain (without parser) took 7178.18 ms. Allocated memory was 34.1 MB in the beginning and 88.6 MB in the end (delta: 54.5 MB). Free memory was 6.6 MB in the beginning and 16.7 MB in the end (delta: -10.1 MB). Peak memory consumption was 44.4 MB. Max. memory is 14.3 GB. [2020-10-20 05:54:01,337 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 33.6 MB. Free memory is still 12.4 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 05:54:01,338 INFO L168 Benchmark]: CACSL2BoogieTranslator took 601.10 ms. Allocated memory was 34.1 MB in the beginning and 45.1 MB in the end (delta: 11.0 MB). Free memory was 5.7 MB in the beginning and 15.6 MB in the end (delta: -9.9 MB). Peak memory consumption was 7.3 MB. Max. memory is 14.3 GB. [2020-10-20 05:54:01,344 INFO L168 Benchmark]: Boogie Preprocessor took 81.03 ms. Allocated memory was 45.1 MB in the beginning and 46.7 MB in the end (delta: 1.6 MB). Free memory was 15.6 MB in the beginning and 28.8 MB in the end (delta: -13.2 MB). Peak memory consumption was 3.1 MB. Max. memory is 14.3 GB. [2020-10-20 05:54:01,346 INFO L168 Benchmark]: RCFGBuilder took 658.16 ms. Allocated memory was 46.7 MB in the beginning and 49.8 MB in the end (delta: 3.1 MB). Free memory was 28.8 MB in the beginning and 21.4 MB in the end (delta: 7.4 MB). Peak memory consumption was 19.1 MB. Max. memory is 14.3 GB. [2020-10-20 05:54:01,347 INFO L168 Benchmark]: TraceAbstraction took 5822.44 ms. Allocated memory was 49.8 MB in the beginning and 88.6 MB in the end (delta: 38.8 MB). Free memory was 21.0 MB in the beginning and 16.7 MB in the end (delta: 4.3 MB). Peak memory consumption was 43.1 MB. Max. memory is 14.3 GB. [2020-10-20 05:54:01,352 INFO L168 Benchmark]: Witness Printer took 5.35 ms. Allocated memory is still 88.6 MB. Free memory is still 16.7 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 05:54:01,360 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 33.6 MB. Free memory is still 12.4 MB. There was no memory consumed. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 601.10 ms. Allocated memory was 34.1 MB in the beginning and 45.1 MB in the end (delta: 11.0 MB). Free memory was 5.7 MB in the beginning and 15.6 MB in the end (delta: -9.9 MB). Peak memory consumption was 7.3 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 81.03 ms. Allocated memory was 45.1 MB in the beginning and 46.7 MB in the end (delta: 1.6 MB). Free memory was 15.6 MB in the beginning and 28.8 MB in the end (delta: -13.2 MB). Peak memory consumption was 3.1 MB. Max. memory is 14.3 GB. * RCFGBuilder took 658.16 ms. Allocated memory was 46.7 MB in the beginning and 49.8 MB in the end (delta: 3.1 MB). Free memory was 28.8 MB in the beginning and 21.4 MB in the end (delta: 7.4 MB). Peak memory consumption was 19.1 MB. Max. memory is 14.3 GB. * TraceAbstraction took 5822.44 ms. Allocated memory was 49.8 MB in the beginning and 88.6 MB in the end (delta: 38.8 MB). Free memory was 21.0 MB in the beginning and 16.7 MB in the end (delta: 4.3 MB). Peak memory consumption was 43.1 MB. Max. memory is 14.3 GB. * Witness Printer took 5.35 ms. Allocated memory is still 88.6 MB. Free memory is still 16.7 MB. There was no memory consumed. Max. memory is 14.3 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: 543]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 543. Possible FailurePath: [L544] TData data; VAL [data={3:0}] [L545] CALL alloc_data(&data) VAL [pdata={3:0}] [L529] pdata->lo = malloc(16) VAL [malloc(16)={-1:0}, pdata={3:0}, pdata={3:0}] [L530] pdata->hi = malloc(24) VAL [malloc(16)={-1:0}, malloc(24)={-2:0}, pdata={3:0}, pdata={3:0}] [L545] RET alloc_data(&data) VAL [data={3:0}] [L546] CALL free_data(&data) VAL [data={3:0}] [L534] EXPR data->lo VAL [data={3:0}, data={3:0}, data->lo={-1:0}] [L534] void *lo = data->lo; [L535] EXPR data->hi VAL [data={3:0}, data={3:0}, data->hi={-2:0}, lo={-1:0}] [L535] void *hi = data->hi; [L536] COND FALSE !(lo == hi) VAL [data={3:0}, data={3:0}, hi={-2:0}, lo={-1:0}] [L540] data->lo = (void *) 0 VAL [data={3:0}, data={3:0}, hi={-2:0}, lo={-1:0}] [L541] data->hi = (void *) 0 VAL [data={3:0}, data={3:0}, hi={-2:0}, lo={-1:0}] [L546] RET free_data(&data) VAL [data={3:0}] [L547] return 0; [L547] return 0; VAL [\result=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 11 procedures, 74 locations, 20 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 5.6s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 233 SDtfs, 505 SDslu, 541 SDs, 0 SdLazy, 1660 SolverSat, 152 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 149 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 2.2s 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, 10 MinimizatonAttempts, 51 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 202 NumberOfCodeBlocks, 202 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 166 ConstructedInterpolants, 0 QuantifiedInterpolants, 17891 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, ACCELERATED_INTERPOLATION: 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-9a8b2e8 [2020-10-20 05:54:03,532 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 05:54:03,534 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 05:54:03,560 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 05:54:03,561 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 05:54:03,562 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 05:54:03,563 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 05:54:03,565 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 05:54:03,566 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 05:54:03,571 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 05:54:03,572 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 05:54:03,576 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 05:54:03,577 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 05:54:03,579 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 05:54:03,582 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 05:54:03,584 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 05:54:03,586 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 05:54:03,590 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 05:54:03,593 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 05:54:03,598 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 05:54:03,600 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 05:54:03,603 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 05:54:03,604 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 05:54:03,607 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 05:54:03,612 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 05:54:03,614 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 05:54:03,614 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 05:54:03,616 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 05:54:03,617 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 05:54:03,618 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 05:54:03,618 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 05:54:03,619 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 05:54:03,620 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 05:54:03,621 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 05:54:03,629 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 05:54:03,630 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 05:54:03,634 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 05:54:03,635 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 05:54:03,635 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 05:54:03,636 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 05:54:03,637 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 05:54:03,640 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2020-10-20 05:54:03,677 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 05:54:03,678 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 05:54:03,679 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 05:54:03,679 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 05:54:03,680 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 05:54:03,680 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 05:54:03,680 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 05:54:03,680 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 05:54:03,681 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 05:54:03,681 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 05:54:03,681 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 05:54:03,681 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2020-10-20 05:54:03,682 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2020-10-20 05:54:03,682 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2020-10-20 05:54:03,682 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-20 05:54:03,683 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2020-10-20 05:54:03,683 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-10-20 05:54:03,683 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-10-20 05:54:03,683 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 05:54:03,684 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 05:54:03,684 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 05:54:03,684 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 05:54:03,685 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-20 05:54:03,685 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-20 05:54:03,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-20 05:54:03,685 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 05:54:03,686 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-20 05:54:03,686 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-10-20 05:54:03,686 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-10-20 05:54:03,686 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 05:54:03,687 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-20 05:54:03,687 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 -> e0c6505355e23ab050a0b1754726876dca60bcf4 [2020-10-20 05:54:03,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 05:54:03,918 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 05:54:03,922 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 05:54:03,924 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 05:54:03,924 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 05:54:03,925 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0019-2.i [2020-10-20 05:54:03,989 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2381cc675/d3996e91ba17491c86362a46d1a85792/FLAGd0fd64691 [2020-10-20 05:54:04,533 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 05:54:04,534 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0019-2.i [2020-10-20 05:54:04,551 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2381cc675/d3996e91ba17491c86362a46d1a85792/FLAGd0fd64691 [2020-10-20 05:54:04,780 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2381cc675/d3996e91ba17491c86362a46d1a85792 [2020-10-20 05:54:04,786 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 05:54:04,793 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-20 05:54:04,794 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 05:54:04,795 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 05:54:04,799 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 05:54:04,800 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 05:54:04" (1/1) ... [2020-10-20 05:54:04,803 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cde9458 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:04, skipping insertion in model container [2020-10-20 05:54:04,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 05:54:04" (1/1) ... [2020-10-20 05:54:04,812 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 05:54:04,862 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 05:54:05,309 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 05:54:05,331 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 05:54:05,417 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 05:54:05,495 INFO L208 MainTranslator]: Completed translation [2020-10-20 05:54:05,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:05 WrapperNode [2020-10-20 05:54:05,496 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 05:54:05,497 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 05:54:05,497 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 05:54:05,499 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 05:54:05,514 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:05" (1/1) ... [2020-10-20 05:54:05,514 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:05" (1/1) ... [2020-10-20 05:54:05,536 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:05" (1/1) ... [2020-10-20 05:54:05,536 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:05" (1/1) ... [2020-10-20 05:54:05,556 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:05" (1/1) ... [2020-10-20 05:54:05,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:05" (1/1) ... [2020-10-20 05:54:05,562 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:05" (1/1) ... [2020-10-20 05:54:05,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 05:54:05,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 05:54:05,571 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 05:54:05,571 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 05:54:05,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:05" (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 [2020-10-20 05:54:05,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-10-20 05:54:05,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 05:54:05,646 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2020-10-20 05:54:05,646 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-10-20 05:54:05,646 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2020-10-20 05:54:05,646 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2020-10-20 05:54:05,646 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2020-10-20 05:54:05,646 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2020-10-20 05:54:05,646 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2020-10-20 05:54:05,647 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_data [2020-10-20 05:54:05,647 INFO L138 BoogieDeclarations]: Found implementation of procedure free_data [2020-10-20 05:54:05,647 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-10-20 05:54:05,647 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-10-20 05:54:05,647 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-10-20 05:54:05,647 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-10-20 05:54:05,647 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-10-20 05:54:05,648 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-10-20 05:54:05,648 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 05:54:05,648 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2020-10-20 05:54:05,648 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2020-10-20 05:54:05,648 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2020-10-20 05:54:05,648 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2020-10-20 05:54:05,648 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2020-10-20 05:54:05,649 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2020-10-20 05:54:05,649 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2020-10-20 05:54:05,649 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2020-10-20 05:54:05,649 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2020-10-20 05:54:05,649 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2020-10-20 05:54:05,649 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2020-10-20 05:54:05,649 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2020-10-20 05:54:05,650 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2020-10-20 05:54:05,650 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2020-10-20 05:54:05,650 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2020-10-20 05:54:05,650 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2020-10-20 05:54:05,650 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2020-10-20 05:54:05,650 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2020-10-20 05:54:05,650 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2020-10-20 05:54:05,651 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2020-10-20 05:54:05,651 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2020-10-20 05:54:05,651 INFO L130 BoogieDeclarations]: Found specification of procedure select [2020-10-20 05:54:05,651 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2020-10-20 05:54:05,651 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2020-10-20 05:54:05,651 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2020-10-20 05:54:05,651 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2020-10-20 05:54:05,652 INFO L130 BoogieDeclarations]: Found specification of procedure random [2020-10-20 05:54:05,652 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2020-10-20 05:54:05,652 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2020-10-20 05:54:05,652 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2020-10-20 05:54:05,652 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2020-10-20 05:54:05,652 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2020-10-20 05:54:05,652 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2020-10-20 05:54:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2020-10-20 05:54:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2020-10-20 05:54:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2020-10-20 05:54:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2020-10-20 05:54:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2020-10-20 05:54:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2020-10-20 05:54:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2020-10-20 05:54:05,653 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2020-10-20 05:54:05,654 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2020-10-20 05:54:05,654 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2020-10-20 05:54:05,654 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2020-10-20 05:54:05,654 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2020-10-20 05:54:05,654 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2020-10-20 05:54:05,654 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2020-10-20 05:54:05,654 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2020-10-20 05:54:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2020-10-20 05:54:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2020-10-20 05:54:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2020-10-20 05:54:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2020-10-20 05:54:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2020-10-20 05:54:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2020-10-20 05:54:05,655 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2020-10-20 05:54:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-10-20 05:54:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-10-20 05:54:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2020-10-20 05:54:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-10-20 05:54:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2020-10-20 05:54:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2020-10-20 05:54:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2020-10-20 05:54:05,656 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2020-10-20 05:54:05,657 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2020-10-20 05:54:05,657 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2020-10-20 05:54:05,657 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2020-10-20 05:54:05,657 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2020-10-20 05:54:05,657 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2020-10-20 05:54:05,657 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2020-10-20 05:54:05,657 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2020-10-20 05:54:05,657 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2020-10-20 05:54:05,658 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2020-10-20 05:54:05,658 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2020-10-20 05:54:05,658 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2020-10-20 05:54:05,658 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2020-10-20 05:54:05,658 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2020-10-20 05:54:05,658 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2020-10-20 05:54:05,658 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2020-10-20 05:54:05,659 INFO L130 BoogieDeclarations]: Found specification of procedure system [2020-10-20 05:54:05,659 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2020-10-20 05:54:05,659 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2020-10-20 05:54:05,659 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2020-10-20 05:54:05,659 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2020-10-20 05:54:05,659 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2020-10-20 05:54:05,659 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2020-10-20 05:54:05,659 INFO L130 BoogieDeclarations]: Found specification of procedure div [2020-10-20 05:54:05,660 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2020-10-20 05:54:05,660 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2020-10-20 05:54:05,660 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2020-10-20 05:54:05,660 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2020-10-20 05:54:05,660 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2020-10-20 05:54:05,660 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2020-10-20 05:54:05,660 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2020-10-20 05:54:05,660 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2020-10-20 05:54:05,661 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2020-10-20 05:54:05,661 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2020-10-20 05:54:05,661 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2020-10-20 05:54:05,661 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2020-10-20 05:54:05,661 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2020-10-20 05:54:05,661 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2020-10-20 05:54:05,661 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2020-10-20 05:54:05,662 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2020-10-20 05:54:05,662 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2020-10-20 05:54:05,662 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2020-10-20 05:54:05,662 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2020-10-20 05:54:05,662 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2020-10-20 05:54:05,662 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_data [2020-10-20 05:54:05,662 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-10-20 05:54:05,662 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-10-20 05:54:05,663 INFO L130 BoogieDeclarations]: Found specification of procedure free_data [2020-10-20 05:54:05,663 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-10-20 05:54:05,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 05:54:05,663 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-10-20 05:54:05,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-10-20 05:54:05,663 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2020-10-20 05:54:05,663 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 05:54:05,664 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2020-10-20 05:54:05,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2020-10-20 05:54:05,664 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2020-10-20 05:54:06,333 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 05:54:06,333 INFO L298 CfgBuilder]: Removed 0 assume(true) statements. [2020-10-20 05:54:06,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 05:54:06 BoogieIcfgContainer [2020-10-20 05:54:06,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 05:54:06,337 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-20 05:54:06,337 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-20 05:54:06,341 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-20 05:54:06,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.10 05:54:04" (1/3) ... [2020-10-20 05:54:06,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13f31711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 05:54:06, skipping insertion in model container [2020-10-20 05:54:06,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 05:54:05" (2/3) ... [2020-10-20 05:54:06,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@13f31711 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.10 05:54:06, skipping insertion in model container [2020-10-20 05:54:06,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 05:54:06" (3/3) ... [2020-10-20 05:54:06,345 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0019-2.i [2020-10-20 05:54:06,379 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-20 05:54:06,402 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2020-10-20 05:54:06,439 INFO L253 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2020-10-20 05:54:06,484 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-20 05:54:06,484 INFO L378 AbstractCegarLoop]: Hoare is false [2020-10-20 05:54:06,485 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-20 05:54:06,485 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 05:54:06,485 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 05:54:06,486 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-20 05:54:06,486 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 05:54:06,488 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-20 05:54:06,522 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2020-10-20 05:54:06,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-20 05:54:06,532 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:06,533 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:54:06,533 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-20 05:54:06,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:06,540 INFO L82 PathProgramCache]: Analyzing trace with hash -658526433, now seen corresponding path program 1 times [2020-10-20 05:54:06,550 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:54:06,560 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [294559047] [2020-10-20 05:54:06,562 INFO L95 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 [2020-10-20 05:54:06,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:06,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-20 05:54:06,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:54:06,882 INFO L384 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 [2020-10-20 05:54:06,882 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:06,899 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:06,905 INFO L384 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 [2020-10-20 05:54:06,906 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:06,919 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:06,919 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:06,920 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2020-10-20 05:54:07,013 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:07,013 INFO L384 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 [2020-10-20 05:54:07,015 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:07,028 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:07,036 INFO L384 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 [2020-10-20 05:54:07,037 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:07,080 INFO L625 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2020-10-20 05:54:07,081 INFO L545 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. [2020-10-20 05:54:07,082 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2020-10-20 05:54:07,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:54:07,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:54:07,200 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:54:09,087 WARN L193 SmtUtils]: Spent 1.55 s on a formula simplification that was a NOOP. DAG size: 21 [2020-10-20 05:54:09,842 WARN L193 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2020-10-20 05:54:09,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:54:09,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [294559047] [2020-10-20 05:54:09,866 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:09,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2020-10-20 05:54:09,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084166492] [2020-10-20 05:54:09,873 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-20 05:54:09,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:54:09,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-20 05:54:09,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-20 05:54:09,892 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 8 states. [2020-10-20 05:54:10,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:10,899 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2020-10-20 05:54:10,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 05:54:10,902 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2020-10-20 05:54:10,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:10,912 INFO L225 Difference]: With dead ends: 53 [2020-10-20 05:54:10,912 INFO L226 Difference]: Without dead ends: 50 [2020-10-20 05:54:10,914 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-20 05:54:10,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-10-20 05:54:10,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-10-20 05:54:10,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-10-20 05:54:10,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2020-10-20 05:54:10,955 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 9 [2020-10-20 05:54:10,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:10,956 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2020-10-20 05:54:10,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-20 05:54:10,956 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2020-10-20 05:54:10,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-20 05:54:10,957 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:10,957 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:54:11,174 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-10-20 05:54:11,175 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-20 05:54:11,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:11,176 INFO L82 PathProgramCache]: Analyzing trace with hash -658526434, now seen corresponding path program 1 times [2020-10-20 05:54:11,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:54:11,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423864837] [2020-10-20 05:54:11,183 INFO L95 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 [2020-10-20 05:54:11,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:11,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 05:54:11,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:54:11,351 INFO L384 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 [2020-10-20 05:54:11,352 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:11,353 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:11,354 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:11,354 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2020-10-20 05:54:11,392 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:11,393 INFO L384 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 12 treesize of output 28 [2020-10-20 05:54:11,394 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:11,413 INFO L625 ElimStorePlain]: treesize reduction 14, result has 44.0 percent of original size [2020-10-20 05:54:11,415 INFO L545 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. [2020-10-20 05:54:11,415 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:11 [2020-10-20 05:54:11,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:54:11,431 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:54:11,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:54:11,463 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423864837] [2020-10-20 05:54:11,464 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:11,464 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2020-10-20 05:54:11,464 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063262488] [2020-10-20 05:54:11,466 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-20 05:54:11,466 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:54:11,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 05:54:11,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 05:54:11,467 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 5 states. [2020-10-20 05:54:11,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:11,671 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2020-10-20 05:54:11,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 05:54:11,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-10-20 05:54:11,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:11,673 INFO L225 Difference]: With dead ends: 48 [2020-10-20 05:54:11,673 INFO L226 Difference]: Without dead ends: 48 [2020-10-20 05:54:11,674 INFO L677 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 [2020-10-20 05:54:11,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-10-20 05:54:11,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2020-10-20 05:54:11,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-20 05:54:11,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2020-10-20 05:54:11,694 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 9 [2020-10-20 05:54:11,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:11,694 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2020-10-20 05:54:11,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-20 05:54:11,695 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2020-10-20 05:54:11,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-20 05:54:11,695 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:11,696 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:54:11,898 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-10-20 05:54:11,899 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-20 05:54:11,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:11,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1483709952, now seen corresponding path program 1 times [2020-10-20 05:54:11,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:54:11,902 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451189090] [2020-10-20 05:54:11,902 INFO L95 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 [2020-10-20 05:54:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:12,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-20 05:54:12,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:54:12,075 INFO L384 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 [2020-10-20 05:54:12,075 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:12,083 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:12,088 INFO L384 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 [2020-10-20 05:54:12,089 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:12,096 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:12,097 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:12,097 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2020-10-20 05:54:12,186 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:12,186 INFO L384 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 [2020-10-20 05:54:12,187 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:12,202 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:12,207 INFO L384 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 [2020-10-20 05:54:12,208 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:12,226 INFO L625 ElimStorePlain]: treesize reduction 4, result has 77.8 percent of original size [2020-10-20 05:54:12,227 INFO L545 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. [2020-10-20 05:54:12,228 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:14 [2020-10-20 05:54:12,289 INFO L441 ElimStorePlain]: Different costs {1=[|v_#valid_57|], 3=[|v_#length_42|]} [2020-10-20 05:54:12,304 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:12,305 INFO L384 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 [2020-10-20 05:54:12,306 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:12,326 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:12,354 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:12,355 INFO L384 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 [2020-10-20 05:54:12,356 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:12,407 INFO L625 ElimStorePlain]: treesize reduction 24, result has 51.0 percent of original size [2020-10-20 05:54:12,416 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:54:12,416 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:16 [2020-10-20 05:54:12,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:54:12,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:54:12,550 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:54:15,977 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2020-10-20 05:54:15,983 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:54:16,020 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:16,020 INFO L384 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 [2020-10-20 05:54:16,022 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:16,033 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:16,034 INFO L384 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 [2020-10-20 05:54:16,035 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:16,063 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:16,077 INFO L545 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. [2020-10-20 05:54:16,077 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:22 [2020-10-20 05:54:16,180 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:54:17,055 WARN L193 SmtUtils]: Spent 417.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2020-10-20 05:54:20,042 WARN L193 SmtUtils]: Spent 2.71 s on a formula simplification that was a NOOP. DAG size: 27 [2020-10-20 05:54:20,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:54:20,057 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451189090] [2020-10-20 05:54:20,057 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:20,057 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [] total 10 [2020-10-20 05:54:20,057 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274683195] [2020-10-20 05:54:20,059 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 05:54:20,059 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:54:20,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 05:54:20,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=81, Unknown=1, NotChecked=0, Total=110 [2020-10-20 05:54:20,060 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 11 states. [2020-10-20 05:54:21,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:21,060 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2020-10-20 05:54:21,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 05:54:21,061 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2020-10-20 05:54:21,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:21,062 INFO L225 Difference]: With dead ends: 47 [2020-10-20 05:54:21,062 INFO L226 Difference]: Without dead ends: 47 [2020-10-20 05:54:21,062 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=43, Invalid=112, Unknown=1, NotChecked=0, Total=156 [2020-10-20 05:54:21,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2020-10-20 05:54:21,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2020-10-20 05:54:21,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-20 05:54:21,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2020-10-20 05:54:21,069 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 11 [2020-10-20 05:54:21,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:21,070 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2020-10-20 05:54:21,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 05:54:21,070 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2020-10-20 05:54:21,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 05:54:21,071 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:21,071 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:54:21,274 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-10-20 05:54:21,275 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-20 05:54:21,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:21,276 INFO L82 PathProgramCache]: Analyzing trace with hash -854908678, now seen corresponding path program 1 times [2020-10-20 05:54:21,276 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:54:21,276 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1468124919] [2020-10-20 05:54:21,276 INFO L95 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 [2020-10-20 05:54:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:21,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 05:54:21,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:54:21,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:54:21,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:54:21,490 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:21,491 INFO L384 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 12 treesize of output 16 [2020-10-20 05:54:21,493 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:54:21,495 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:21,498 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:21,498 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:21,498 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2020-10-20 05:54:21,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:54:21,508 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1468124919] [2020-10-20 05:54:21,508 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:21,508 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 6 [2020-10-20 05:54:21,508 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642705611] [2020-10-20 05:54:21,509 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-20 05:54:21,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:54:21,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 05:54:21,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-10-20 05:54:21,510 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 7 states. [2020-10-20 05:54:21,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:21,785 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2020-10-20 05:54:21,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 05:54:21,786 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 16 [2020-10-20 05:54:21,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:21,787 INFO L225 Difference]: With dead ends: 51 [2020-10-20 05:54:21,788 INFO L226 Difference]: Without dead ends: 51 [2020-10-20 05:54:21,788 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-10-20 05:54:21,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2020-10-20 05:54:21,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2020-10-20 05:54:21,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-20 05:54:21,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2020-10-20 05:54:21,797 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 16 [2020-10-20 05:54:21,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:21,797 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2020-10-20 05:54:21,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-20 05:54:21,798 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2020-10-20 05:54:21,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-20 05:54:21,798 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:21,799 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:54:22,000 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-10-20 05:54:22,001 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-20 05:54:22,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:22,002 INFO L82 PathProgramCache]: Analyzing trace with hash -854908677, now seen corresponding path program 1 times [2020-10-20 05:54:22,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:54:22,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014060264] [2020-10-20 05:54:22,004 INFO L95 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 [2020-10-20 05:54:22,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:22,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 05:54:22,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:54:22,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:54:22,228 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:54:22,485 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:54:22,498 INFO L384 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 [2020-10-20 05:54:22,499 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:54:22,513 INFO L384 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 [2020-10-20 05:54:22,514 INFO L545 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:54:22,543 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:22,544 INFO L545 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. [2020-10-20 05:54:22,544 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:25 [2020-10-20 05:54:22,887 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:22,887 INFO L384 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 [2020-10-20 05:54:22,888 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:54:22,891 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:54:22,892 INFO L545 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 05:54:22,919 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:22,920 INFO L384 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 [2020-10-20 05:54:22,922 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:54:22,924 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:54:22,925 INFO L545 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 05:54:23,028 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 35 [2020-10-20 05:54:23,029 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:23,030 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:54:23,033 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:54:23,034 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2020-10-20 05:54:23,034 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:56, output treesize:64 [2020-10-20 05:54:23,035 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:54:23,036 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:54:23,039 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:54:23,040 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:54:23,674 WARN L193 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 29 [2020-10-20 05:54:23,678 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:54:24,202 WARN L193 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 27 [2020-10-20 05:54:24,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:54:24,600 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1014060264] [2020-10-20 05:54:24,600 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:24,601 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 8] imperfect sequences [] total 14 [2020-10-20 05:54:24,601 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016654668] [2020-10-20 05:54:24,601 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-10-20 05:54:24,601 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:54:24,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-10-20 05:54:24,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2020-10-20 05:54:24,603 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 15 states. [2020-10-20 05:54:25,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:25,649 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2020-10-20 05:54:25,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 05:54:25,651 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 16 [2020-10-20 05:54:25,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:25,652 INFO L225 Difference]: With dead ends: 41 [2020-10-20 05:54:25,652 INFO L226 Difference]: Without dead ends: 41 [2020-10-20 05:54:25,652 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2020-10-20 05:54:25,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-10-20 05:54:25,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-10-20 05:54:25,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-10-20 05:54:25,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2020-10-20 05:54:25,658 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 16 [2020-10-20 05:54:25,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:25,658 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2020-10-20 05:54:25,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-10-20 05:54:25,659 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2020-10-20 05:54:25,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-20 05:54:25,660 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:25,660 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 05:54:25,861 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-10-20 05:54:25,861 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-20 05:54:25,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:25,862 INFO L82 PathProgramCache]: Analyzing trace with hash -383997787, now seen corresponding path program 1 times [2020-10-20 05:54:25,862 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:54:25,862 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429447020] [2020-10-20 05:54:25,862 INFO L95 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 [2020-10-20 05:54:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:25,987 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-20 05:54:25,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:54:26,026 INFO L384 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 [2020-10-20 05:54:26,027 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:26,031 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:26,031 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:26,031 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2020-10-20 05:54:26,124 INFO L384 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 [2020-10-20 05:54:26,124 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:26,127 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:26,127 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:26,127 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2020-10-20 05:54:26,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:54:26,182 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:54:26,291 INFO L384 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 [2020-10-20 05:54:26,292 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2020-10-20 05:54:26,300 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:26,300 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2020-10-20 05:54:26,301 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:14 [2020-10-20 05:54:26,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:54:26,308 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429447020] [2020-10-20 05:54:26,308 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:26,308 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 10 [2020-10-20 05:54:26,308 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394724144] [2020-10-20 05:54:26,309 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-20 05:54:26,309 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:54:26,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 05:54:26,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-10-20 05:54:26,310 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 11 states. [2020-10-20 05:54:26,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:26,972 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2020-10-20 05:54:26,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-10-20 05:54:26,974 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 21 [2020-10-20 05:54:26,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:26,977 INFO L225 Difference]: With dead ends: 42 [2020-10-20 05:54:26,977 INFO L226 Difference]: Without dead ends: 42 [2020-10-20 05:54:26,978 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2020-10-20 05:54:26,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2020-10-20 05:54:26,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 39. [2020-10-20 05:54:26,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-20 05:54:26,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2020-10-20 05:54:26,983 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 21 [2020-10-20 05:54:26,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:26,983 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2020-10-20 05:54:26,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-20 05:54:26,983 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2020-10-20 05:54:26,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-10-20 05:54:26,984 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:26,984 INFO L422 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] [2020-10-20 05:54:27,184 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-10-20 05:54:27,185 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-20 05:54:27,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:27,186 INFO L82 PathProgramCache]: Analyzing trace with hash 980970590, now seen corresponding path program 1 times [2020-10-20 05:54:27,186 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:54:27,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [749460766] [2020-10-20 05:54:27,187 INFO L95 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 [2020-10-20 05:54:27,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:27,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 19 conjunts are in the unsatisfiable core [2020-10-20 05:54:27,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:54:27,326 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [749460766] [2020-10-20 05:54:27,327 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: no int: (_ BitVec 32) [2020-10-20 05:54:27,328 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1282823074] [2020-10-20 05:54:27,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2020-10-20 05:54:27,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:27,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 19 conjunts are in the unsatisfiable core [2020-10-20 05:54:27,580 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:54:27,639 INFO L384 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 [2020-10-20 05:54:27,640 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:27,654 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:27,654 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:27,655 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:9 [2020-10-20 05:54:27,858 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:27,859 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2020-10-20 05:54:27,862 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:27,866 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:27,867 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:27,867 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:3 [2020-10-20 05:54:27,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:54:27,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:54:28,514 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-10-20 05:54:28,515 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 140 treesize of output 114 [2020-10-20 05:54:28,518 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:54:28,518 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:54:28,519 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 05:54:28,543 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:54:28,544 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:54:28,545 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 05:54:28,548 INFO L545 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 05:54:28,751 WARN L193 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 37 [2020-10-20 05:54:28,751 INFO L625 ElimStorePlain]: treesize reduction 22, result has 80.7 percent of original size [2020-10-20 05:54:28,753 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:54:28,754 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:54:28,754 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 05:54:28,755 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-20 05:54:28,756 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:54, output treesize:92 [2020-10-20 05:54:28,756 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:54:28,757 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:54:28,760 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 05:54:28,885 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 05:54:28,885 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-20 05:54:28,887 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 05:54:28,889 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:54:28,890 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 05:54:28,890 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 3 conjuncts [2020-10-20 05:54:28,891 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 05:54:28,892 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 05:54:28,893 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2020-10-20 05:54:28,894 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 05:54:28,910 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 05:54:28,911 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:54:28,911 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 05:54:28,917 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 05:54:28,919 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 05:54:28,921 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 05:54:28,922 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:54:28,922 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 05:54:28,927 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 05:54:28,928 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 05:54:28,931 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:54:28,932 INFO L603 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2020-10-20 05:54:28,932 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 05:54:29,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:54:29,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:29,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13, 12] imperfect sequences [] total 23 [2020-10-20 05:54:29,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849238595] [2020-10-20 05:54:29,077 INFO L461 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-10-20 05:54:29,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:54:29,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-10-20 05:54:29,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=517, Unknown=0, NotChecked=0, Total=600 [2020-10-20 05:54:29,079 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 24 states. [2020-10-20 05:54:31,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:31,099 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2020-10-20 05:54:31,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-20 05:54:31,101 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 22 [2020-10-20 05:54:31,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:31,101 INFO L225 Difference]: With dead ends: 40 [2020-10-20 05:54:31,102 INFO L226 Difference]: Without dead ends: 40 [2020-10-20 05:54:31,102 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=198, Invalid=924, Unknown=0, NotChecked=0, Total=1122 [2020-10-20 05:54:31,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-10-20 05:54:31,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2020-10-20 05:54:31,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-10-20 05:54:31,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2020-10-20 05:54:31,107 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 22 [2020-10-20 05:54:31,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:31,108 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2020-10-20 05:54:31,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-10-20 05:54:31,108 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2020-10-20 05:54:31,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-20 05:54:31,109 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:31,109 INFO L422 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] [2020-10-20 05:54:31,511 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk,8 mathsat -unsat_core_generation=3 [2020-10-20 05:54:31,512 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-20 05:54:31,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:31,513 INFO L82 PathProgramCache]: Analyzing trace with hash 345317319, now seen corresponding path program 1 times [2020-10-20 05:54:31,513 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:54:31,514 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1390093656] [2020-10-20 05:54:31,514 INFO L95 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 [2020-10-20 05:54:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:31,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 18 conjunts are in the unsatisfiable core [2020-10-20 05:54:31,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:54:31,649 INFO L384 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 [2020-10-20 05:54:31,650 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:31,658 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:31,659 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:31,659 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-10-20 05:54:31,681 INFO L384 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 [2020-10-20 05:54:31,681 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:31,693 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:31,694 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:31,694 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:13 [2020-10-20 05:54:31,762 INFO L384 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 21 treesize of output 9 [2020-10-20 05:54:31,763 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:31,764 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:31,764 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:31,765 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2020-10-20 05:54:31,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:54:31,827 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:54:31,963 INFO L384 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 46 treesize of output 40 [2020-10-20 05:54:31,965 INFO L545 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:54:31,991 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:31,992 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:54:31,992 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:40 [2020-10-20 05:54:32,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:54:32,084 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1390093656] [2020-10-20 05:54:32,085 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:32,085 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 11 [2020-10-20 05:54:32,085 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248810530] [2020-10-20 05:54:32,085 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-20 05:54:32,085 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:54:32,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-20 05:54:32,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-10-20 05:54:32,086 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 12 states. [2020-10-20 05:54:32,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:32,823 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2020-10-20 05:54:32,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 05:54:32,825 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2020-10-20 05:54:32,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:32,826 INFO L225 Difference]: With dead ends: 39 [2020-10-20 05:54:32,826 INFO L226 Difference]: Without dead ends: 39 [2020-10-20 05:54:32,826 INFO L677 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 [2020-10-20 05:54:32,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-10-20 05:54:32,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2020-10-20 05:54:32,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-10-20 05:54:32,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2020-10-20 05:54:32,830 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 23 [2020-10-20 05:54:32,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:32,830 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2020-10-20 05:54:32,831 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-20 05:54:32,831 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2020-10-20 05:54:32,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-20 05:54:32,832 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:32,832 INFO L422 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] [2020-10-20 05:54:33,035 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2020-10-20 05:54:33,036 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-20 05:54:33,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:33,037 INFO L82 PathProgramCache]: Analyzing trace with hash 901678754, now seen corresponding path program 1 times [2020-10-20 05:54:33,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:54:33,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1493695996] [2020-10-20 05:54:33,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2020-10-20 05:54:33,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 05:54:33,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 19 conjunts are in the unsatisfiable core [2020-10-20 05:54:33,168 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 05:54:33,174 INFO L384 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 [2020-10-20 05:54:33,175 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:33,183 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:33,183 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:33,183 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2020-10-20 05:54:33,201 INFO L384 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 11 treesize of output 7 [2020-10-20 05:54:33,202 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:33,212 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:33,213 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:33,213 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:18 [2020-10-20 05:54:33,251 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:33,251 INFO L384 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 17 treesize of output 21 [2020-10-20 05:54:33,252 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:33,265 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:33,265 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:33,266 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:15 [2020-10-20 05:54:33,312 INFO L350 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2020-10-20 05:54:33,312 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 21 [2020-10-20 05:54:33,313 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:33,323 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:33,324 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:33,324 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:14 [2020-10-20 05:54:33,498 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-10-20 05:54:33,499 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 31 treesize of output 11 [2020-10-20 05:54:33,499 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 05:54:33,504 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 05:54:33,504 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-20 05:54:33,504 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:4 [2020-10-20 05:54:33,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:54:33,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-10-20 05:54:35,994 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-10-20 05:54:35,995 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 826 treesize of output 746 [2020-10-20 05:54:36,002 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-10-20 05:54:36,229 WARN L193 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 21 [2020-10-20 05:54:36,230 INFO L625 ElimStorePlain]: treesize reduction 655, result has 3.2 percent of original size [2020-10-20 05:54:36,231 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 05:54:36,231 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-20 05:54:36,232 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:22 [2020-10-20 05:54:36,232 INFO L603 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2020-10-20 05:54:36,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 05:54:36,331 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1493695996] [2020-10-20 05:54:36,331 INFO L219 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-10-20 05:54:36,331 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13, 13] imperfect sequences [] total 18 [2020-10-20 05:54:36,331 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80544114] [2020-10-20 05:54:36,332 INFO L461 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-10-20 05:54:36,332 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-10-20 05:54:36,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-10-20 05:54:36,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=265, Unknown=1, NotChecked=0, Total=306 [2020-10-20 05:54:36,333 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 18 states. [2020-10-20 05:54:37,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 05:54:37,359 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2020-10-20 05:54:37,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-20 05:54:37,359 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2020-10-20 05:54:37,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-20 05:54:37,360 INFO L225 Difference]: With dead ends: 27 [2020-10-20 05:54:37,360 INFO L226 Difference]: Without dead ends: 27 [2020-10-20 05:54:37,361 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=107, Invalid=594, Unknown=1, NotChecked=0, Total=702 [2020-10-20 05:54:37,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-10-20 05:54:37,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-10-20 05:54:37,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-10-20 05:54:37,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2020-10-20 05:54:37,364 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 26 [2020-10-20 05:54:37,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-20 05:54:37,364 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2020-10-20 05:54:37,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-10-20 05:54:37,365 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2020-10-20 05:54:37,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-10-20 05:54:37,365 INFO L414 BasicCegarLoop]: Found error trace [2020-10-20 05:54:37,366 INFO L422 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] [2020-10-20 05:54:37,570 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2020-10-20 05:54:37,570 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONMEMORY_LEAK, 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]=== [2020-10-20 05:54:37,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 05:54:37,571 INFO L82 PathProgramCache]: Analyzing trace with hash 856988955, now seen corresponding path program 1 times [2020-10-20 05:54:37,572 INFO L162 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-10-20 05:54:37,572 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1997844692] [2020-10-20 05:54:37,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2020-10-20 05:54:37,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 05:54:37,707 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 05:54:37,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 05:54:37,772 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 05:54:37,808 INFO L173 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2020-10-20 05:54:37,809 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-20 05:54:38,017 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2020-10-20 05:54:38,046 WARN L417 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2020-10-20 05:54:38,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.10 05:54:38 BoogieIcfgContainer [2020-10-20 05:54:38,072 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-20 05:54:38,073 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 05:54:38,073 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 05:54:38,073 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 05:54:38,074 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 05:54:06" (3/4) ... [2020-10-20 05:54:38,077 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 05:54:38,077 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 05:54:38,079 INFO L168 Benchmark]: Toolchain (without parser) took 33291.59 ms. Allocated memory was 35.7 MB in the beginning and 87.6 MB in the end (delta: 51.9 MB). Free memory was 8.3 MB in the beginning and 45.6 MB in the end (delta: -37.4 MB). Peak memory consumption was 14.6 MB. Max. memory is 14.3 GB. [2020-10-20 05:54:38,079 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 35.7 MB. Free memory is still 14.7 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 05:54:38,079 INFO L168 Benchmark]: CACSL2BoogieTranslator took 702.30 ms. Allocated memory was 35.7 MB in the beginning and 46.7 MB in the end (delta: 11.0 MB). Free memory was 7.4 MB in the beginning and 29.2 MB in the end (delta: -21.9 MB). Peak memory consumption was 9.0 MB. Max. memory is 14.3 GB. [2020-10-20 05:54:38,080 INFO L168 Benchmark]: Boogie Preprocessor took 72.94 ms. Allocated memory is still 46.7 MB. Free memory was 29.2 MB in the beginning and 26.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 14.3 GB. [2020-10-20 05:54:38,080 INFO L168 Benchmark]: RCFGBuilder took 764.90 ms. Allocated memory was 46.7 MB in the beginning and 50.9 MB in the end (delta: 4.2 MB). Free memory was 25.9 MB in the beginning and 17.1 MB in the end (delta: 8.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 14.3 GB. [2020-10-20 05:54:38,080 INFO L168 Benchmark]: TraceAbstraction took 31735.69 ms. Allocated memory was 50.9 MB in the beginning and 87.6 MB in the end (delta: 36.7 MB). Free memory was 16.8 MB in the beginning and 46.8 MB in the end (delta: -30.0 MB). Peak memory consumption was 6.7 MB. Max. memory is 14.3 GB. [2020-10-20 05:54:38,081 INFO L168 Benchmark]: Witness Printer took 4.50 ms. Allocated memory is still 87.6 MB. Free memory was 46.8 MB in the beginning and 45.6 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 14.3 GB. [2020-10-20 05:54:38,083 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 35.7 MB. Free memory is still 14.7 MB. There was no memory consumed. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 702.30 ms. Allocated memory was 35.7 MB in the beginning and 46.7 MB in the end (delta: 11.0 MB). Free memory was 7.4 MB in the beginning and 29.2 MB in the end (delta: -21.9 MB). Peak memory consumption was 9.0 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 72.94 ms. Allocated memory is still 46.7 MB. Free memory was 29.2 MB in the beginning and 26.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 14.3 GB. * RCFGBuilder took 764.90 ms. Allocated memory was 46.7 MB in the beginning and 50.9 MB in the end (delta: 4.2 MB). Free memory was 25.9 MB in the beginning and 17.1 MB in the end (delta: 8.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 14.3 GB. * TraceAbstraction took 31735.69 ms. Allocated memory was 50.9 MB in the beginning and 87.6 MB in the end (delta: 36.7 MB). Free memory was 16.8 MB in the beginning and 46.8 MB in the end (delta: -30.0 MB). Peak memory consumption was 6.7 MB. Max. memory is 14.3 GB. * Witness Printer took 4.50 ms. Allocated memory is still 87.6 MB. Free memory was 46.8 MB in the beginning and 45.6 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 14.3 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: 543]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 543. Possible FailurePath: [L544] TData data; VAL [data={15:0}] [L545] CALL alloc_data(&data) VAL [pdata={15:0}] [L529] pdata->lo = malloc(16) VAL [malloc(16)={1:0}, pdata={15:0}, pdata={15:0}] [L530] pdata->hi = malloc(24) VAL [malloc(16)={1:0}, malloc(24)={2:0}, pdata={15:0}, pdata={15:0}] [L545] RET alloc_data(&data) VAL [data={15:0}] [L546] CALL free_data(&data) VAL [data={15:0}] [L534] EXPR data->lo VAL [data={15:0}, data={15:0}, data->lo={1:0}] [L534] void *lo = data->lo; [L535] EXPR data->hi VAL [data={15:0}, data={15:0}, data->hi={2:0}, lo={1:0}] [L535] void *hi = data->hi; [L536] COND FALSE !(lo == hi) VAL [data={15:0}, data={15:0}, hi={2:0}, lo={1:0}] [L540] data->lo = (void *) 0 VAL [data={15:0}, data={15:0}, hi={2:0}, lo={1:0}] [L541] data->hi = (void *) 0 VAL [data={15:0}, data={15:0}, hi={2:0}, lo={1:0}] [L546] RET free_data(&data) VAL [data={15:0}] [L547] return 0; [L547] return 0; VAL [\result=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 12 procedures, 80 locations, 20 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 31.5s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 8.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 255 SDtfs, 346 SDslu, 1077 SDs, 0 SdLazy, 1436 SolverSat, 106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 343 GetRequests, 201 SyntacticMatches, 9 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 18.4s 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, 9 MinimizatonAttempts, 15 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 19.2s InterpolantComputationTime, 179 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 288 ConstructedInterpolants, 19 QuantifiedInterpolants, 39827 SizeOfPredicates, 88 NumberOfNonLiveVariables, 993 ConjunctsInSsa, 129 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: 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...