./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/list-ext-properties/simple-ext.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 3d056a1f Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/simple-ext.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e1c4f57eca82444dbac59d6fae1e4e6e28bb6c95 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-3d056a1 [2019-11-22 14:30:28,752 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 14:30:28,757 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 14:30:28,774 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 14:30:28,775 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 14:30:28,777 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 14:30:28,780 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 14:30:28,791 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 14:30:28,794 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 14:30:28,797 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 14:30:28,799 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 14:30:28,802 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 14:30:28,802 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 14:30:28,807 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 14:30:28,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 14:30:28,812 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 14:30:28,814 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 14:30:28,817 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 14:30:28,820 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 14:30:28,827 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 14:30:28,834 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 14:30:28,839 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 14:30:28,840 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 14:30:28,842 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 14:30:28,845 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 14:30:28,846 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 14:30:28,846 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 14:30:28,848 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 14:30:28,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 14:30:28,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 14:30:28,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 14:30:28,851 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 14:30:28,852 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 14:30:28,853 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 14:30:28,854 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 14:30:28,855 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 14:30:28,856 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 14:30:28,856 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 14:30:28,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 14:30:28,857 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 14:30:28,859 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 14:30:28,860 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2019-11-22 14:30:28,895 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 14:30:28,898 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 14:30:28,899 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 14:30:28,900 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 14:30:28,900 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 14:30:28,903 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 14:30:28,903 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-22 14:30:28,903 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 14:30:28,904 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 14:30:28,904 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-22 14:30:28,904 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 14:30:28,904 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 14:30:28,905 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 14:30:28,905 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 14:30:28,905 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 14:30:28,905 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-22 14:30:28,906 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 14:30:28,907 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 14:30:28,907 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 14:30:28,907 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 14:30:28,907 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 14:30:28,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 14:30:28,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 14:30:28,909 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 14:30:28,909 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-22 14:30:28,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-22 14:30:28,910 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e1c4f57eca82444dbac59d6fae1e4e6e28bb6c95 [2019-11-22 14:30:29,244 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 14:30:29,266 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 14:30:29,270 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 14:30:29,272 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 14:30:29,272 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 14:30:29,273 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/simple-ext.i [2019-11-22 14:30:29,344 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32dab96aa/a6f7dd4fa4c843308060a1c50858adc6/FLAGae25ffae7 [2019-11-22 14:30:29,841 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 14:30:29,842 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/simple-ext.i [2019-11-22 14:30:29,855 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32dab96aa/a6f7dd4fa4c843308060a1c50858adc6/FLAGae25ffae7 [2019-11-22 14:30:30,152 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/32dab96aa/a6f7dd4fa4c843308060a1c50858adc6 [2019-11-22 14:30:30,155 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 14:30:30,157 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 14:30:30,158 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 14:30:30,158 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 14:30:30,161 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 14:30:30,162 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:30:30" (1/1) ... [2019-11-22 14:30:30,165 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2af74f04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:30, skipping insertion in model container [2019-11-22 14:30:30,165 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:30:30" (1/1) ... [2019-11-22 14:30:30,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 14:30:30,222 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 14:30:30,617 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 14:30:30,627 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 14:30:30,676 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 14:30:30,747 INFO L208 MainTranslator]: Completed translation [2019-11-22 14:30:30,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:30 WrapperNode [2019-11-22 14:30:30,748 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 14:30:30,749 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 14:30:30,749 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 14:30:30,749 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 14:30:30,762 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:30" (1/1) ... [2019-11-22 14:30:30,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:30" (1/1) ... [2019-11-22 14:30:30,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:30" (1/1) ... [2019-11-22 14:30:30,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:30" (1/1) ... [2019-11-22 14:30:30,801 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:30" (1/1) ... [2019-11-22 14:30:30,807 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:30" (1/1) ... [2019-11-22 14:30:30,810 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:30" (1/1) ... [2019-11-22 14:30:30,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 14:30:30,818 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 14:30:30,818 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 14:30:30,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 14:30:30,819 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 14:30:30,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 14:30:30,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 14:30:30,873 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-22 14:30:30,873 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-22 14:30:30,873 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint16_identity [2019-11-22 14:30:30,873 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint32_identity [2019-11-22 14:30:30,874 INFO L138 BoogieDeclarations]: Found implementation of procedure __uint64_identity [2019-11-22 14:30:30,874 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2019-11-22 14:30:30,874 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 14:30:30,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-22 14:30:30,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-22 14:30:30,883 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-22 14:30:30,883 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-22 14:30:30,883 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-22 14:30:30,884 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-22 14:30:30,884 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-22 14:30:30,884 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-22 14:30:30,884 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-22 14:30:30,885 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-22 14:30:30,885 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-22 14:30:30,885 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-22 14:30:30,885 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-22 14:30:30,886 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-22 14:30:30,886 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-22 14:30:30,886 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-22 14:30:30,886 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-22 14:30:30,886 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-22 14:30:30,887 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-22 14:30:30,887 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-22 14:30:30,887 INFO L130 BoogieDeclarations]: Found specification of procedure __uint16_identity [2019-11-22 14:30:30,887 INFO L130 BoogieDeclarations]: Found specification of procedure __uint32_identity [2019-11-22 14:30:30,888 INFO L130 BoogieDeclarations]: Found specification of procedure __uint64_identity [2019-11-22 14:30:30,888 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-22 14:30:30,888 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-22 14:30:30,888 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-22 14:30:30,888 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-22 14:30:30,889 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-22 14:30:30,889 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-22 14:30:30,889 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-22 14:30:30,889 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-22 14:30:30,890 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-22 14:30:30,890 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-22 14:30:30,890 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-22 14:30:30,890 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-22 14:30:30,890 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-22 14:30:30,891 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-22 14:30:30,891 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-22 14:30:30,891 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-22 14:30:30,891 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-22 14:30:30,892 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-22 14:30:30,892 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-22 14:30:30,892 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-22 14:30:30,892 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-22 14:30:30,892 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-22 14:30:30,893 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-22 14:30:30,893 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-22 14:30:30,893 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-22 14:30:30,893 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-22 14:30:30,894 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-22 14:30:30,894 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-22 14:30:30,894 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-22 14:30:30,894 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-22 14:30:30,894 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-22 14:30:30,895 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-22 14:30:30,895 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-22 14:30:30,895 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-22 14:30:30,895 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-22 14:30:30,895 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 14:30:30,896 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-22 14:30:30,896 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 14:30:30,896 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-22 14:30:30,896 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-22 14:30:30,896 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-22 14:30:30,896 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-22 14:30:30,897 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-22 14:30:30,897 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-22 14:30:30,897 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-22 14:30:30,897 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-22 14:30:30,898 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-22 14:30:30,898 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-22 14:30:30,898 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-22 14:30:30,898 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-22 14:30:30,898 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-22 14:30:30,899 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-22 14:30:30,899 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-22 14:30:30,899 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-22 14:30:30,899 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-22 14:30:30,899 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-22 14:30:30,900 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-22 14:30:30,900 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-22 14:30:30,900 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-22 14:30:30,900 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-22 14:30:30,900 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-22 14:30:30,901 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-22 14:30:30,901 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-22 14:30:30,901 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-22 14:30:30,901 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-22 14:30:30,901 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-22 14:30:30,901 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-22 14:30:30,901 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-22 14:30:30,901 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-22 14:30:30,901 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-22 14:30:30,901 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-22 14:30:30,902 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-22 14:30:30,902 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-22 14:30:30,902 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-22 14:30:30,902 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-22 14:30:30,902 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-22 14:30:30,902 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-22 14:30:30,902 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-22 14:30:30,902 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-22 14:30:30,902 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-22 14:30:30,903 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-22 14:30:30,903 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-22 14:30:30,903 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-22 14:30:30,903 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-22 14:30:30,903 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-22 14:30:30,903 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-22 14:30:30,903 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2019-11-22 14:30:30,904 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 14:30:30,904 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 14:30:30,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-22 14:30:30,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-22 14:30:30,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-22 14:30:30,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-22 14:30:30,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 14:30:30,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 14:30:30,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 14:30:31,223 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2019-11-22 14:30:31,526 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 14:30:31,526 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-22 14:30:31,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:30:31 BoogieIcfgContainer [2019-11-22 14:30:31,528 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 14:30:31,529 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 14:30:31,529 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 14:30:31,532 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 14:30:31,532 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:30:30" (1/3) ... [2019-11-22 14:30:31,533 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c7bfc1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:30:31, skipping insertion in model container [2019-11-22 14:30:31,533 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:30:30" (2/3) ... [2019-11-22 14:30:31,534 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c7bfc1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:30:31, skipping insertion in model container [2019-11-22 14:30:31,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:30:31" (3/3) ... [2019-11-22 14:30:31,536 INFO L109 eAbstractionObserver]: Analyzing ICFG simple-ext.i [2019-11-22 14:30:31,545 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 14:30:31,553 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 20 error locations. [2019-11-22 14:30:31,564 INFO L249 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2019-11-22 14:30:31,585 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 14:30:31,592 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 14:30:31,592 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 14:30:31,593 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 14:30:31,593 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 14:30:31,593 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 14:30:31,593 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 14:30:31,593 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 14:30:31,608 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states. [2019-11-22 14:30:31,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 14:30:31,618 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:31,619 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:31,619 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-22 14:30:31,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:31,624 INFO L82 PathProgramCache]: Analyzing trace with hash -746638641, now seen corresponding path program 1 times [2019-11-22 14:30:31,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:31,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954370238] [2019-11-22 14:30:31,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:31,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:31,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:31,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954370238] [2019-11-22 14:30:31,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:30:31,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-22 14:30:31,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679912753] [2019-11-22 14:30:31,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 14:30:31,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:31,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 14:30:31,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 14:30:31,816 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 3 states. [2019-11-22 14:30:31,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:31,994 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2019-11-22 14:30:31,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 14:30:31,997 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-22 14:30:31,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:32,006 INFO L225 Difference]: With dead ends: 62 [2019-11-22 14:30:32,006 INFO L226 Difference]: Without dead ends: 54 [2019-11-22 14:30:32,008 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 14:30:32,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-11-22 14:30:32,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2019-11-22 14:30:32,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-11-22 14:30:32,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 57 transitions. [2019-11-22 14:30:32,049 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 57 transitions. Word has length 10 [2019-11-22 14:30:32,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:32,050 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 57 transitions. [2019-11-22 14:30:32,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 14:30:32,050 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 57 transitions. [2019-11-22 14:30:32,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-22 14:30:32,051 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:32,051 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:32,051 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-22 14:30:32,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:32,052 INFO L82 PathProgramCache]: Analyzing trace with hash -261147736, now seen corresponding path program 1 times [2019-11-22 14:30:32,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:32,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540802861] [2019-11-22 14:30:32,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:32,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:32,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540802861] [2019-11-22 14:30:32,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:30:32,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-22 14:30:32,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867384991] [2019-11-22 14:30:32,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 14:30:32,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:32,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 14:30:32,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-22 14:30:32,170 INFO L87 Difference]: Start difference. First operand 54 states and 57 transitions. Second operand 5 states. [2019-11-22 14:30:32,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:32,378 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2019-11-22 14:30:32,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 14:30:32,378 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-22 14:30:32,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:32,380 INFO L225 Difference]: With dead ends: 72 [2019-11-22 14:30:32,380 INFO L226 Difference]: Without dead ends: 72 [2019-11-22 14:30:32,381 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-22 14:30:32,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-11-22 14:30:32,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 58. [2019-11-22 14:30:32,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-11-22 14:30:32,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 69 transitions. [2019-11-22 14:30:32,389 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 69 transitions. Word has length 12 [2019-11-22 14:30:32,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:32,390 INFO L462 AbstractCegarLoop]: Abstraction has 58 states and 69 transitions. [2019-11-22 14:30:32,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 14:30:32,390 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 69 transitions. [2019-11-22 14:30:32,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-22 14:30:32,391 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:32,391 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:32,391 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-22 14:30:32,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:32,392 INFO L82 PathProgramCache]: Analyzing trace with hash -261147735, now seen corresponding path program 1 times [2019-11-22 14:30:32,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:32,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865647839] [2019-11-22 14:30:32,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:32,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:32,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865647839] [2019-11-22 14:30:32,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:30:32,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-22 14:30:32,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621384779] [2019-11-22 14:30:32,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 14:30:32,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:32,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 14:30:32,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-22 14:30:32,519 INFO L87 Difference]: Start difference. First operand 58 states and 69 transitions. Second operand 5 states. [2019-11-22 14:30:32,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:32,734 INFO L93 Difference]: Finished difference Result 77 states and 83 transitions. [2019-11-22 14:30:32,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 14:30:32,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2019-11-22 14:30:32,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:32,736 INFO L225 Difference]: With dead ends: 77 [2019-11-22 14:30:32,736 INFO L226 Difference]: Without dead ends: 77 [2019-11-22 14:30:32,737 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-22 14:30:32,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-22 14:30:32,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 67. [2019-11-22 14:30:32,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-22 14:30:32,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 74 transitions. [2019-11-22 14:30:32,745 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 74 transitions. Word has length 12 [2019-11-22 14:30:32,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:32,745 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 74 transitions. [2019-11-22 14:30:32,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 14:30:32,746 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 74 transitions. [2019-11-22 14:30:32,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 14:30:32,747 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:32,747 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:32,747 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-22 14:30:32,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:32,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1733653831, now seen corresponding path program 1 times [2019-11-22 14:30:32,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:32,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130185212] [2019-11-22 14:30:32,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:32,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:32,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:32,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130185212] [2019-11-22 14:30:32,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:30:32,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 14:30:32,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615978059] [2019-11-22 14:30:32,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 14:30:32,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:32,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 14:30:32,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-22 14:30:32,873 INFO L87 Difference]: Start difference. First operand 67 states and 74 transitions. Second operand 6 states. [2019-11-22 14:30:33,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:33,039 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2019-11-22 14:30:33,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 14:30:33,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-11-22 14:30:33,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:33,041 INFO L225 Difference]: With dead ends: 73 [2019-11-22 14:30:33,041 INFO L226 Difference]: Without dead ends: 73 [2019-11-22 14:30:33,042 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-22 14:30:33,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2019-11-22 14:30:33,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2019-11-22 14:30:33,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-22 14:30:33,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2019-11-22 14:30:33,048 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 19 [2019-11-22 14:30:33,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:33,049 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2019-11-22 14:30:33,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 14:30:33,049 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2019-11-22 14:30:33,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-22 14:30:33,050 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:33,051 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:33,051 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-22 14:30:33,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:33,052 INFO L82 PathProgramCache]: Analyzing trace with hash 838007822, now seen corresponding path program 1 times [2019-11-22 14:30:33,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:33,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754288710] [2019-11-22 14:30:33,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:33,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:33,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:33,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:33,189 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754288710] [2019-11-22 14:30:33,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:30:33,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-22 14:30:33,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977182132] [2019-11-22 14:30:33,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 14:30:33,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:33,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 14:30:33,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-22 14:30:33,191 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 8 states. [2019-11-22 14:30:33,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:33,460 INFO L93 Difference]: Finished difference Result 82 states and 88 transitions. [2019-11-22 14:30:33,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 14:30:33,461 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 21 [2019-11-22 14:30:33,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:33,462 INFO L225 Difference]: With dead ends: 82 [2019-11-22 14:30:33,462 INFO L226 Difference]: Without dead ends: 76 [2019-11-22 14:30:33,463 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-22 14:30:33,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-11-22 14:30:33,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 65. [2019-11-22 14:30:33,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-11-22 14:30:33,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2019-11-22 14:30:33,469 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 21 [2019-11-22 14:30:33,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:33,470 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2019-11-22 14:30:33,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 14:30:33,470 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2019-11-22 14:30:33,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-22 14:30:33,471 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:33,472 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:33,472 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-22 14:30:33,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:33,473 INFO L82 PathProgramCache]: Analyzing trace with hash -2032942662, now seen corresponding path program 1 times [2019-11-22 14:30:33,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:33,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619783410] [2019-11-22 14:30:33,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:33,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:33,543 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:33,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619783410] [2019-11-22 14:30:33,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:30:33,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 14:30:33,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558435625] [2019-11-22 14:30:33,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 14:30:33,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:33,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 14:30:33,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 14:30:33,545 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 7 states. [2019-11-22 14:30:33,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:33,731 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2019-11-22 14:30:33,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-22 14:30:33,732 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-22 14:30:33,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:33,733 INFO L225 Difference]: With dead ends: 66 [2019-11-22 14:30:33,733 INFO L226 Difference]: Without dead ends: 66 [2019-11-22 14:30:33,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-22 14:30:33,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-22 14:30:33,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2019-11-22 14:30:33,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-22 14:30:33,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 67 transitions. [2019-11-22 14:30:33,738 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 67 transitions. Word has length 21 [2019-11-22 14:30:33,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:33,739 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 67 transitions. [2019-11-22 14:30:33,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 14:30:33,739 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 67 transitions. [2019-11-22 14:30:33,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-22 14:30:33,739 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:33,740 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:33,740 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-22 14:30:33,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:33,740 INFO L82 PathProgramCache]: Analyzing trace with hash -2032942661, now seen corresponding path program 1 times [2019-11-22 14:30:33,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:33,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21443279] [2019-11-22 14:30:33,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:33,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:33,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:33,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21443279] [2019-11-22 14:30:33,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-22 14:30:33,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-22 14:30:33,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216697143] [2019-11-22 14:30:33,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-22 14:30:33,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:33,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-22 14:30:33,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-22 14:30:33,843 INFO L87 Difference]: Start difference. First operand 63 states and 67 transitions. Second operand 7 states. [2019-11-22 14:30:34,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:34,122 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2019-11-22 14:30:34,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 14:30:34,125 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-22 14:30:34,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:34,126 INFO L225 Difference]: With dead ends: 59 [2019-11-22 14:30:34,127 INFO L226 Difference]: Without dead ends: 59 [2019-11-22 14:30:34,127 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-22 14:30:34,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-22 14:30:34,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2019-11-22 14:30:34,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-22 14:30:34,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 57 transitions. [2019-11-22 14:30:34,132 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 57 transitions. Word has length 21 [2019-11-22 14:30:34,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:34,132 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 57 transitions. [2019-11-22 14:30:34,132 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-22 14:30:34,132 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 57 transitions. [2019-11-22 14:30:34,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-22 14:30:34,133 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:34,134 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:34,134 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-22 14:30:34,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:34,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1979195964, now seen corresponding path program 1 times [2019-11-22 14:30:34,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:34,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672650293] [2019-11-22 14:30:34,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:34,390 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:34,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672650293] [2019-11-22 14:30:34,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848373556] [2019-11-22 14:30:34,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:30:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:34,551 INFO L255 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 33 conjunts are in the unsatisfiable core [2019-11-22 14:30:34,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:30:34,656 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 14:30:34,656 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:34,669 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:34,670 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:34,670 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 14:30:34,746 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-22 14:30:34,746 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:34,757 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:34,758 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:34,758 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2019-11-22 14:30:34,826 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:34,827 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-22 14:30:34,828 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:34,843 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:34,844 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:34,844 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:24 [2019-11-22 14:30:34,893 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.base_14|], 2=[|v_#memory_int_13|]} [2019-11-22 14:30:34,900 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-22 14:30:34,900 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:34,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:34,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:30:34,931 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 11 [2019-11-22 14:30:34,932 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:34,948 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:34,949 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:34,949 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:30 [2019-11-22 14:30:34,990 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-22 14:30:34,991 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:35,001 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:35,001 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:35,002 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:18 [2019-11-22 14:30:35,076 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 19 treesize of output 18 [2019-11-22 14:30:35,077 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:35,087 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:35,088 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:35,088 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:18 [2019-11-22 14:30:35,100 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 11 [2019-11-22 14:30:35,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:35,108 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:35,109 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:35,109 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:37, output treesize:14 [2019-11-22 14:30:35,177 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-11-22 14:30:35,178 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:35,194 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:35,195 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:35,196 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:3 [2019-11-22 14:30:35,219 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:35,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:30:35,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2019-11-22 14:30:35,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786122952] [2019-11-22 14:30:35,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-22 14:30:35,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:35,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-22 14:30:35,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2019-11-22 14:30:35,222 INFO L87 Difference]: Start difference. First operand 53 states and 57 transitions. Second operand 22 states. [2019-11-22 14:30:35,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:35,903 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2019-11-22 14:30:35,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-22 14:30:35,904 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 30 [2019-11-22 14:30:35,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:35,905 INFO L225 Difference]: With dead ends: 83 [2019-11-22 14:30:35,905 INFO L226 Difference]: Without dead ends: 77 [2019-11-22 14:30:35,906 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=171, Invalid=641, Unknown=0, NotChecked=0, Total=812 [2019-11-22 14:30:35,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-11-22 14:30:35,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 62. [2019-11-22 14:30:35,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-11-22 14:30:35,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2019-11-22 14:30:35,918 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 30 [2019-11-22 14:30:35,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:35,919 INFO L462 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2019-11-22 14:30:35,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-22 14:30:35,919 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2019-11-22 14:30:35,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-22 14:30:35,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:30:35,920 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 14:30:36,128 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:30:36,129 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr8REQUIRES_VIOLATION, mainErr9REQUIRES_VIOLATION, mainErr5REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr17ASSERT_VIOLATIONMEMORY_FREE, mainErr16ASSERT_VIOLATIONMEMORY_FREE, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr18ASSERT_VIOLATIONMEMORY_FREE, mainErr13REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr14REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr12REQUIRES_VIOLATION, mainErr19ENSURES_VIOLATIONMEMORY_LEAK]=== [2019-11-22 14:30:36,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:30:36,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1282404402, now seen corresponding path program 2 times [2019-11-22 14:30:36,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-22 14:30:36,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380096718] [2019-11-22 14:30:36,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-22 14:30:36,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:36,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:30:36,451 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:36,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380096718] [2019-11-22 14:30:36,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720019212] [2019-11-22 14:30:36,452 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:30:36,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-22 14:30:36,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-22 14:30:36,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 45 conjunts are in the unsatisfiable core [2019-11-22 14:30:36,567 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:30:36,579 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 14:30:36,580 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:36,589 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:36,589 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:36,590 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 14:30:36,648 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:36,648 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-22 14:30:36,649 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:36,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:36,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:36,657 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:14 [2019-11-22 14:30:36,698 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-22 14:30:36,698 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:36,709 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:36,710 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:36,711 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:32, output treesize:25 [2019-11-22 14:30:36,837 INFO L343 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2019-11-22 14:30:36,838 INFO L377 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 35 treesize of output 27 [2019-11-22 14:30:36,839 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:36,856 INFO L567 ElimStorePlain]: treesize reduction 10, result has 68.8 percent of original size [2019-11-22 14:30:36,857 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:36,857 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:43, output treesize:22 [2019-11-22 14:30:36,892 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:36,893 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-22 14:30:36,893 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:36,901 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:36,902 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:36,902 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:27 [2019-11-22 14:30:36,964 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:36,965 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 33 treesize of output 60 [2019-11-22 14:30:36,966 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:36,998 INFO L567 ElimStorePlain]: treesize reduction 34, result has 50.7 percent of original size [2019-11-22 14:30:36,999 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:36,999 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:45, output treesize:32 [2019-11-22 14:30:37,226 INFO L343 Elim1Store]: treesize reduction 48, result has 53.4 percent of original size [2019-11-22 14:30:37,227 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 74 [2019-11-22 14:30:37,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:30:37,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:37,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:37,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:30:37,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:37,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:37,243 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 14:30:37,294 INFO L567 ElimStorePlain]: treesize reduction 26, result has 63.4 percent of original size [2019-11-22 14:30:37,296 INFO L496 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. [2019-11-22 14:30:37,296 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:71, output treesize:54 [2019-11-22 14:30:37,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:37,423 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:37,424 INFO L377 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 68 [2019-11-22 14:30:37,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:30:37,427 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:37,429 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:37,491 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:37,492 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 134 [2019-11-22 14:30:37,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:30:37,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:37,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:37,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:37,498 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:37,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:37,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:37,501 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:37,502 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:30:37,503 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:37,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:37,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:37,507 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:37,508 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:37,533 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:37,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:37,536 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:37,537 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:30:37,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:37,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:37,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:37,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:37,545 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:37,546 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:37,548 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:37,551 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:37,553 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:37,685 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 33 [2019-11-22 14:30:37,687 INFO L567 ElimStorePlain]: treesize reduction 1285, result has 7.4 percent of original size [2019-11-22 14:30:37,689 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-11-22 14:30:37,689 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:129, output treesize:103 [2019-11-22 14:30:37,899 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:30:37,903 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 6=[v_prenex_4]} [2019-11-22 14:30:37,911 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:37,912 INFO L377 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 33 [2019-11-22 14:30:37,913 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:37,947 INFO L567 ElimStorePlain]: treesize reduction 14, result has 83.1 percent of original size [2019-11-22 14:30:37,970 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:30:37,971 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 70 [2019-11-22 14:30:37,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:30:37,973 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:30:37,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:30:37,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:30:37,975 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-22 14:30:37,976 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 14:30:38,006 INFO L567 ElimStorePlain]: treesize reduction 83, result has 20.2 percent of original size [2019-11-22 14:30:38,007 INFO L496 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:30:38,007 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 7 variables, input treesize:97, output treesize:5 [2019-11-22 14:30:38,069 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 14:30:38,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-22 14:30:38,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2019-11-22 14:30:38,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104226018] [2019-11-22 14:30:38,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-11-22 14:30:38,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-22 14:30:38,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-11-22 14:30:38,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2019-11-22 14:30:38,072 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 31 states. [2019-11-22 14:30:39,429 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2019-11-22 14:30:39,631 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 52 [2019-11-22 14:30:39,940 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 55 [2019-11-22 14:30:40,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:30:40,514 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2019-11-22 14:30:40,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-22 14:30:40,515 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 39 [2019-11-22 14:30:40,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:30:40,516 INFO L225 Difference]: With dead ends: 56 [2019-11-22 14:30:40,516 INFO L226 Difference]: Without dead ends: 0 [2019-11-22 14:30:40,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 25 SyntacticMatches, 3 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 388 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=391, Invalid=2261, Unknown=0, NotChecked=0, Total=2652 [2019-11-22 14:30:40,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-22 14:30:40,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-22 14:30:40,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-22 14:30:40,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-22 14:30:40,520 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2019-11-22 14:30:40,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:30:40,520 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-22 14:30:40,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-11-22 14:30:40,520 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-22 14:30:40,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-22 14:30:40,721 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-22 14:30:40,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:30:40 BoogieIcfgContainer [2019-11-22 14:30:40,728 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-22 14:30:40,728 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-22 14:30:40,728 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-22 14:30:40,729 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-22 14:30:40,729 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:30:31" (3/4) ... [2019-11-22 14:30:40,733 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-22 14:30:40,740 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2019-11-22 14:30:40,740 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure myexit [2019-11-22 14:30:40,740 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_32 [2019-11-22 14:30:40,741 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __bswap_64 [2019-11-22 14:30:40,741 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint16_identity [2019-11-22 14:30:40,741 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint64_identity [2019-11-22 14:30:40,741 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2019-11-22 14:30:40,742 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __uint32_identity [2019-11-22 14:30:40,753 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2019-11-22 14:30:40,753 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-22 14:30:40,753 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-22 14:30:40,754 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-22 14:30:40,804 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-22 14:30:40,805 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-22 14:30:40,806 INFO L168 Benchmark]: Toolchain (without parser) took 10650.11 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 298.3 MB). Free memory was 960.4 MB in the beginning and 896.7 MB in the end (delta: 63.7 MB). Peak memory consumption was 362.0 MB. Max. memory is 11.5 GB. [2019-11-22 14:30:40,807 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 14:30:40,807 INFO L168 Benchmark]: CACSL2BoogieTranslator took 590.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -142.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2019-11-22 14:30:40,808 INFO L168 Benchmark]: Boogie Preprocessor took 68.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. [2019-11-22 14:30:40,808 INFO L168 Benchmark]: RCFGBuilder took 710.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. [2019-11-22 14:30:40,809 INFO L168 Benchmark]: TraceAbstraction took 9199.42 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 183.0 MB). Free memory was 1.0 GB in the beginning and 906.2 MB in the end (delta: 129.7 MB). Peak memory consumption was 312.6 MB. Max. memory is 11.5 GB. [2019-11-22 14:30:40,809 INFO L168 Benchmark]: Witness Printer took 76.57 ms. Allocated memory is still 1.3 GB. Free memory was 906.2 MB in the beginning and 896.7 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. [2019-11-22 14:30:40,811 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 590.61 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -142.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.87 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.6 MB). Peak memory consumption was 8.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 710.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.9 MB). Peak memory consumption was 45.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9199.42 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 183.0 MB). Free memory was 1.0 GB in the beginning and 906.2 MB in the end (delta: 129.7 MB). Peak memory consumption was 312.6 MB. Max. memory is 11.5 GB. * Witness Printer took 76.57 ms. Allocated memory is still 1.3 GB. Free memory was 906.2 MB in the beginning and 896.7 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 535]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 535]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 531]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 534]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 534]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 548]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 530]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 530]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 548]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 547]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 531]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 539]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 539]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 527]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 527]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 542]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 520]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 20 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 78 locations, 20 error locations. Result: SAFE, OverallTime: 9.1s, OverallIterations: 9, TraceHistogramMax: 3, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 290 SDtfs, 679 SDslu, 919 SDs, 0 SdLazy, 1964 SolverSat, 210 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 3.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=3, 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, 65 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 254 NumberOfCodeBlocks, 254 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 243 ConstructedInterpolants, 11 QuantifiedInterpolants, 93365 SizeOfPredicates, 33 NumberOfNonLiveVariables, 345 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 11 InterpolantComputations, 7 PerfectInterpolantSequences, 14/52 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...