./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 76d1c5e435c1ee1c0852e4a01b3ec32d520e70a3 ............................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 76d1c5e435c1ee1c0852e4a01b3ec32d520e70a3 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 14:43:12,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 14:43:12,220 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 14:43:12,234 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 14:43:12,235 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 14:43:12,236 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 14:43:12,237 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 14:43:12,239 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 14:43:12,241 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 14:43:12,242 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 14:43:12,243 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 14:43:12,245 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 14:43:12,245 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 14:43:12,246 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 14:43:12,247 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 14:43:12,248 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 14:43:12,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 14:43:12,250 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 14:43:12,252 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 14:43:12,255 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 14:43:12,256 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 14:43:12,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 14:43:12,259 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 14:43:12,260 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 14:43:12,262 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 14:43:12,262 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 14:43:12,263 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 14:43:12,264 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 14:43:12,264 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 14:43:12,265 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 14:43:12,265 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 14:43:12,266 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 14:43:12,267 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 14:43:12,268 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 14:43:12,269 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 14:43:12,269 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 14:43:12,270 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 14:43:12,270 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 14:43:12,271 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 14:43:12,272 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 14:43:12,273 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 14:43:12,273 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-11-28 14:43:12,287 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 14:43:12,288 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 14:43:12,290 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 14:43:12,290 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 14:43:12,290 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 14:43:12,291 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 14:43:12,291 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 14:43:12,291 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 14:43:12,291 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 14:43:12,291 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 14:43:12,292 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 14:43:12,292 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 14:43:12,292 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 14:43:12,292 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 14:43:12,293 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 14:43:12,293 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 14:43:12,293 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 14:43:12,293 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 14:43:12,294 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 14:43:12,295 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 14:43:12,295 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 14:43:12,295 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 14:43:12,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 14:43:12,296 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 14:43:12,296 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 14:43:12,296 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 14:43:12,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 14:43:12,297 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 14:43:12,297 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76d1c5e435c1ee1c0852e4a01b3ec32d520e70a3 [2019-11-28 14:43:12,579 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 14:43:12,593 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 14:43:12,596 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 14:43:12,598 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 14:43:12,598 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 14:43:12,599 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2019-11-28 14:43:12,678 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b4318b9a/02d2b8127ce64068a36b319abf388955/FLAG4bcff5064 [2019-11-28 14:43:13,171 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 14:43:13,172 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2019-11-28 14:43:13,188 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b4318b9a/02d2b8127ce64068a36b319abf388955/FLAG4bcff5064 [2019-11-28 14:43:13,634 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b4318b9a/02d2b8127ce64068a36b319abf388955 [2019-11-28 14:43:13,637 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 14:43:13,639 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 14:43:13,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 14:43:13,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 14:43:13,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 14:43:13,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:43:13" (1/1) ... [2019-11-28 14:43:13,646 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@550f4497 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:43:13, skipping insertion in model container [2019-11-28 14:43:13,647 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:43:13" (1/1) ... [2019-11-28 14:43:13,654 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 14:43:13,698 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 14:43:14,118 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 14:43:14,134 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2019-11-28 14:43:14,136 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4ccd2ef1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:43:14, skipping insertion in model container [2019-11-28 14:43:14,136 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 14:43:14,136 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-28 14:43:14,140 INFO L168 Benchmark]: Toolchain (without parser) took 499.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -167.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 14:43:14,141 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 14:43:14,142 INFO L168 Benchmark]: CACSL2BoogieTranslator took 496.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -167.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. [2019-11-28 14:43:14,145 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.30 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 496.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -167.6 MB). Peak memory consumption was 20.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 544]: Unsupported Syntax Found a cast between two array/pointer types where the value type is smaller than the cast-to type while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-11-28 14:43:15,738 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 14:43:15,740 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 14:43:15,752 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 14:43:15,753 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 14:43:15,754 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 14:43:15,755 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 14:43:15,757 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 14:43:15,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 14:43:15,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 14:43:15,761 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 14:43:15,762 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 14:43:15,763 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 14:43:15,764 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 14:43:15,765 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 14:43:15,766 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 14:43:15,767 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 14:43:15,768 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 14:43:15,770 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 14:43:15,772 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 14:43:15,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 14:43:15,775 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 14:43:15,776 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 14:43:15,777 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 14:43:15,780 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 14:43:15,780 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 14:43:15,781 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 14:43:15,782 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 14:43:15,782 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 14:43:15,783 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 14:43:15,784 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 14:43:15,785 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 14:43:15,786 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 14:43:15,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 14:43:15,788 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 14:43:15,788 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 14:43:15,789 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 14:43:15,789 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 14:43:15,789 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 14:43:15,790 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 14:43:15,791 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 14:43:15,793 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2019-11-28 14:43:15,821 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 14:43:15,822 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 14:43:15,823 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 14:43:15,824 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 14:43:15,824 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 14:43:15,824 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 14:43:15,824 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 14:43:15,825 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 14:43:15,825 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 14:43:15,825 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 14:43:15,826 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 14:43:15,827 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-28 14:43:15,827 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-28 14:43:15,828 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-28 14:43:15,828 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 14:43:15,828 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-28 14:43:15,828 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-28 14:43:15,829 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-28 14:43:15,829 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 14:43:15,829 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 14:43:15,830 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 14:43:15,830 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 14:43:15,830 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 14:43:15,831 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 14:43:15,831 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 14:43:15,831 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 14:43:15,831 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 14:43:15,832 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-28 14:43:15,832 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-28 14:43:15,832 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 14:43:15,833 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-28 14:43:15,833 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76d1c5e435c1ee1c0852e4a01b3ec32d520e70a3 [2019-11-28 14:43:16,118 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 14:43:16,131 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 14:43:16,135 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 14:43:16,136 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 14:43:16,137 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 14:43:16,137 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2019-11-28 14:43:16,210 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b53ed4dd4/e29c796fddf249219520212d3e73b74b/FLAGfd4428fb1 [2019-11-28 14:43:16,697 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 14:43:16,698 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2019-11-28 14:43:16,711 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b53ed4dd4/e29c796fddf249219520212d3e73b74b/FLAGfd4428fb1 [2019-11-28 14:43:17,057 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b53ed4dd4/e29c796fddf249219520212d3e73b74b [2019-11-28 14:43:17,061 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 14:43:17,063 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-28 14:43:17,064 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 14:43:17,064 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 14:43:17,074 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 14:43:17,075 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:43:17" (1/1) ... [2019-11-28 14:43:17,077 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d54c1ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:43:17, skipping insertion in model container [2019-11-28 14:43:17,077 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 02:43:17" (1/1) ... [2019-11-28 14:43:17,086 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 14:43:17,137 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 14:43:17,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 14:43:17,615 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-28 14:43:17,623 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 14:43:17,668 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 14:43:17,674 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 14:43:17,713 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 14:43:17,778 INFO L208 MainTranslator]: Completed translation [2019-11-28 14:43:17,779 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:43:17 WrapperNode [2019-11-28 14:43:17,779 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 14:43:17,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 14:43:17,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 14:43:17,780 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 14:43:17,795 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:43:17" (1/1) ... [2019-11-28 14:43:17,795 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:43:17" (1/1) ... [2019-11-28 14:43:17,826 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:43:17" (1/1) ... [2019-11-28 14:43:17,826 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:43:17" (1/1) ... [2019-11-28 14:43:17,850 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:43:17" (1/1) ... [2019-11-28 14:43:17,857 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:43:17" (1/1) ... [2019-11-28 14:43:17,862 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:43:17" (1/1) ... [2019-11-28 14:43:17,869 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 14:43:17,870 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 14:43:17,870 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 14:43:17,870 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 14:43:17,871 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:43:17" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 14:43:17,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-28 14:43:17,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 14:43:17,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-28 14:43:17,953 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-28 14:43:17,954 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-28 14:43:17,954 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2019-11-28 14:43:17,954 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2019-11-28 14:43:17,955 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-28 14:43:17,955 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-28 14:43:17,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-28 14:43:17,956 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-28 14:43:17,956 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-28 14:43:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-28 14:43:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-28 14:43:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-28 14:43:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-28 14:43:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-28 14:43:17,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-28 14:43:17,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-28 14:43:17,958 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-28 14:43:17,959 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-28 14:43:17,959 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-28 14:43:17,959 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-28 14:43:17,960 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-28 14:43:17,960 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-28 14:43:17,960 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-28 14:43:17,961 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-28 14:43:17,961 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-28 14:43:17,962 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-28 14:43:17,962 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-28 14:43:17,963 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-28 14:43:17,963 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-28 14:43:17,963 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-28 14:43:17,963 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-28 14:43:17,963 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-28 14:43:17,964 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-28 14:43:17,964 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-28 14:43:17,964 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-28 14:43:17,964 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-28 14:43:17,965 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-28 14:43:17,965 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-28 14:43:17,965 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-28 14:43:17,965 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-28 14:43:17,966 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-28 14:43:17,966 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-28 14:43:17,966 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-28 14:43:17,966 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-28 14:43:17,967 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-28 14:43:17,967 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-28 14:43:17,967 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-28 14:43:17,967 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-28 14:43:17,968 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-28 14:43:17,968 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-28 14:43:17,968 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-28 14:43:17,968 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-28 14:43:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-28 14:43:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-28 14:43:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-28 14:43:17,969 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-28 14:43:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-28 14:43:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-28 14:43:17,970 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-28 14:43:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-28 14:43:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-28 14:43:17,971 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-28 14:43:17,972 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-28 14:43:17,973 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-28 14:43:17,973 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-28 14:43:17,973 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-28 14:43:17,974 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-28 14:43:17,975 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-28 14:43:17,975 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-28 14:43:17,975 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-28 14:43:17,975 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-28 14:43:17,976 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-28 14:43:17,976 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-28 14:43:17,976 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-28 14:43:17,976 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-28 14:43:17,977 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-28 14:43:17,977 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-28 14:43:17,978 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-28 14:43:17,978 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-28 14:43:17,978 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-28 14:43:17,978 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-28 14:43:17,978 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-28 14:43:17,979 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-28 14:43:17,979 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-28 14:43:17,979 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-28 14:43:17,979 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-28 14:43:17,979 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-28 14:43:17,980 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-28 14:43:17,980 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-28 14:43:17,980 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-28 14:43:17,980 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-28 14:43:17,980 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-28 14:43:17,981 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-28 14:43:17,981 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-28 14:43:17,981 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-28 14:43:17,981 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-28 14:43:17,981 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-28 14:43:17,982 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-28 14:43:17,982 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-28 14:43:17,982 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-28 14:43:17,982 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-28 14:43:17,982 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-28 14:43:17,983 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-28 14:43:17,983 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-28 14:43:17,983 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-28 14:43:17,984 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-28 14:43:17,984 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-28 14:43:17,984 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-28 14:43:17,985 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-28 14:43:17,985 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-28 14:43:17,985 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-28 14:43:17,986 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-28 14:43:17,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-28 14:43:17,987 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2019-11-28 14:43:17,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 14:43:17,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 14:43:17,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 14:43:17,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-28 14:43:17,988 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2019-11-28 14:43:17,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 14:43:17,988 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-28 14:43:17,989 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-28 14:43:17,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 14:43:17,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-28 14:43:17,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-28 14:43:17,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 14:43:17,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-28 14:43:17,994 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-28 14:43:18,926 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 14:43:18,926 INFO L287 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-28 14:43:18,928 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:43:18 BoogieIcfgContainer [2019-11-28 14:43:18,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 14:43:18,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 14:43:18,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 14:43:18,933 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 14:43:18,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 02:43:17" (1/3) ... [2019-11-28 14:43:18,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@265185ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:43:18, skipping insertion in model container [2019-11-28 14:43:18,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 02:43:17" (2/3) ... [2019-11-28 14:43:18,936 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@265185ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 02:43:18, skipping insertion in model container [2019-11-28 14:43:18,936 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 02:43:18" (3/3) ... [2019-11-28 14:43:18,938 INFO L109 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-1.i [2019-11-28 14:43:18,948 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 14:43:18,956 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 46 error locations. [2019-11-28 14:43:18,970 INFO L249 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2019-11-28 14:43:18,991 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 14:43:18,992 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-28 14:43:18,992 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 14:43:18,992 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 14:43:18,993 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 14:43:18,993 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 14:43:18,993 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 14:43:18,994 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 14:43:19,014 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-11-28 14:43:19,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-28 14:43:19,025 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:43:19,026 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:43:19,026 INFO L410 AbstractCegarLoop]: === Iteration 1 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-28 14:43:19,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:43:19,033 INFO L82 PathProgramCache]: Analyzing trace with hash -13807983, now seen corresponding path program 1 times [2019-11-28 14:43:19,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:43:19,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1593799548] [2019-11-28 14:43:19,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-28 14:43:19,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:43:19,223 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-28 14:43:19,230 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:43:19,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:43:19,251 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:43:19,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:43:19,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1593799548] [2019-11-28 14:43:19,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:43:19,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-28 14:43:19,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278984886] [2019-11-28 14:43:19,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-28 14:43:19,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:43:19,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-28 14:43:19,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 14:43:19,301 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 2 states. [2019-11-28 14:43:19,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:43:19,325 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2019-11-28 14:43:19,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-28 14:43:19,327 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-28 14:43:19,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:43:19,338 INFO L225 Difference]: With dead ends: 110 [2019-11-28 14:43:19,338 INFO L226 Difference]: Without dead ends: 107 [2019-11-28 14:43:19,340 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-28 14:43:19,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-28 14:43:19,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-28 14:43:19,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-28 14:43:19,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2019-11-28 14:43:19,388 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 8 [2019-11-28 14:43:19,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:43:19,388 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2019-11-28 14:43:19,388 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-28 14:43:19,388 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2019-11-28 14:43:19,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 14:43:19,389 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:43:19,389 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:43:19,600 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-28 14:43:19,601 INFO L410 AbstractCegarLoop]: === Iteration 2 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-28 14:43:19,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:43:19,602 INFO L82 PathProgramCache]: Analyzing trace with hash -427980567, now seen corresponding path program 1 times [2019-11-28 14:43:19,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:43:19,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1486539219] [2019-11-28 14:43:19,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-28 14:43:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:43:19,760 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 14:43:19,763 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:43:19,820 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 14:43:19,820 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:43:19,825 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:43:19,825 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:43:19,826 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 14:43:19,892 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:43:19,893 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 41 [2019-11-28 14:43:19,896 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:43:19,932 INFO L614 ElimStorePlain]: treesize reduction 14, result has 51.7 percent of original size [2019-11-28 14:43:19,933 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 14:43:19,936 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:15 [2019-11-28 14:43:19,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:43:19,965 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:43:20,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:43:20,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1486539219] [2019-11-28 14:43:20,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:43:20,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-28 14:43:20,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545422652] [2019-11-28 14:43:20,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 14:43:20,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:43:20,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 14:43:20,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-28 14:43:20,075 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 8 states. [2019-11-28 14:43:20,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:43:20,817 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2019-11-28 14:43:20,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 14:43:20,818 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-28 14:43:20,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:43:20,825 INFO L225 Difference]: With dead ends: 116 [2019-11-28 14:43:20,825 INFO L226 Difference]: Without dead ends: 116 [2019-11-28 14:43:20,827 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-28 14:43:20,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-11-28 14:43:20,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 109. [2019-11-28 14:43:20,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-28 14:43:20,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 118 transitions. [2019-11-28 14:43:20,863 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 118 transitions. Word has length 9 [2019-11-28 14:43:20,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:43:20,867 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 118 transitions. [2019-11-28 14:43:20,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 14:43:20,867 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 118 transitions. [2019-11-28 14:43:20,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-28 14:43:20,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:43:20,868 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:43:21,071 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-28 14:43:21,072 INFO L410 AbstractCegarLoop]: === Iteration 3 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-28 14:43:21,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:43:21,073 INFO L82 PathProgramCache]: Analyzing trace with hash -427980566, now seen corresponding path program 1 times [2019-11-28 14:43:21,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:43:21,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2081311461] [2019-11-28 14:43:21,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-28 14:43:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:43:21,177 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-28 14:43:21,179 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:43:21,194 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 14:43:21,194 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:43:21,211 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:43:21,226 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 14:43:21,227 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 14:43:21,237 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:43:21,238 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:43:21,238 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-28 14:43:21,293 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 14:43:21,295 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-28 14:43:21,296 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:43:21,319 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:43:21,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 14:43:21,328 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 14:43:21,329 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 14:43:21,347 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:43:21,348 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 14:43:21,350 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:27, output treesize:16 [2019-11-28 14:43:21,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:43:21,373 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:43:21,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:43:21,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:43:21,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2081311461] [2019-11-28 14:43:21,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:43:21,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-28 14:43:21,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811705778] [2019-11-28 14:43:21,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-28 14:43:21,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:43:21,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-28 14:43:21,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-28 14:43:21,684 INFO L87 Difference]: Start difference. First operand 109 states and 118 transitions. Second operand 8 states. [2019-11-28 14:43:23,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:43:23,302 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2019-11-28 14:43:23,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 14:43:23,303 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-28 14:43:23,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:43:23,305 INFO L225 Difference]: With dead ends: 115 [2019-11-28 14:43:23,305 INFO L226 Difference]: Without dead ends: 115 [2019-11-28 14:43:23,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-11-28 14:43:23,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-28 14:43:23,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 109. [2019-11-28 14:43:23,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-28 14:43:23,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 117 transitions. [2019-11-28 14:43:23,315 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 117 transitions. Word has length 9 [2019-11-28 14:43:23,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:43:23,316 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 117 transitions. [2019-11-28 14:43:23,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-28 14:43:23,316 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 117 transitions. [2019-11-28 14:43:23,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 14:43:23,316 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:43:23,317 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:43:23,535 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-28 14:43:23,537 INFO L410 AbstractCegarLoop]: === Iteration 4 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-28 14:43:23,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:43:23,537 INFO L82 PathProgramCache]: Analyzing trace with hash -382495554, now seen corresponding path program 1 times [2019-11-28 14:43:23,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:43:23,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [409655953] [2019-11-28 14:43:23,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-28 14:43:23,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:43:23,635 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 14:43:23,636 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:43:23,646 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 14:43:23,646 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:43:23,649 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:43:23,649 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:43:23,650 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 14:43:23,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:43:23,655 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:43:23,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:43:23,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [409655953] [2019-11-28 14:43:23,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:43:23,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-28 14:43:23,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372553225] [2019-11-28 14:43:23,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 14:43:23,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:43:23,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 14:43:23,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 14:43:23,670 INFO L87 Difference]: Start difference. First operand 109 states and 117 transitions. Second operand 3 states. [2019-11-28 14:43:23,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:43:23,864 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2019-11-28 14:43:23,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 14:43:23,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-11-28 14:43:23,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:43:23,866 INFO L225 Difference]: With dead ends: 108 [2019-11-28 14:43:23,866 INFO L226 Difference]: Without dead ends: 108 [2019-11-28 14:43:23,867 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-28 14:43:23,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-28 14:43:23,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-11-28 14:43:23,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-28 14:43:23,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2019-11-28 14:43:23,882 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 10 [2019-11-28 14:43:23,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:43:23,882 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2019-11-28 14:43:23,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 14:43:23,883 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2019-11-28 14:43:23,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-28 14:43:23,886 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:43:23,886 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:43:24,086 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-28 14:43:24,089 INFO L410 AbstractCegarLoop]: === Iteration 5 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-28 14:43:24,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:43:24,089 INFO L82 PathProgramCache]: Analyzing trace with hash -382495553, now seen corresponding path program 1 times [2019-11-28 14:43:24,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:43:24,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62893416] [2019-11-28 14:43:24,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-28 14:43:24,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:43:24,187 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 14:43:24,189 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:43:24,202 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 14:43:24,203 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:43:24,209 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:43:24,210 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:43:24,210 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 14:43:24,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:43:24,220 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:43:24,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:43:24,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62893416] [2019-11-28 14:43:24,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:43:24,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-28 14:43:24,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117180197] [2019-11-28 14:43:24,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 14:43:24,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:43:24,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 14:43:24,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 14:43:24,270 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 4 states. [2019-11-28 14:43:24,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:43:24,686 INFO L93 Difference]: Finished difference Result 107 states and 115 transitions. [2019-11-28 14:43:24,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 14:43:24,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-28 14:43:24,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:43:24,690 INFO L225 Difference]: With dead ends: 107 [2019-11-28 14:43:24,690 INFO L226 Difference]: Without dead ends: 107 [2019-11-28 14:43:24,690 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 14:43:24,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-28 14:43:24,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-28 14:43:24,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-28 14:43:24,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 115 transitions. [2019-11-28 14:43:24,707 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 115 transitions. Word has length 10 [2019-11-28 14:43:24,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:43:24,707 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 115 transitions. [2019-11-28 14:43:24,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 14:43:24,707 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 115 transitions. [2019-11-28 14:43:24,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 14:43:24,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:43:24,709 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:43:24,920 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-28 14:43:24,922 INFO L410 AbstractCegarLoop]: === Iteration 6 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-28 14:43:24,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:43:24,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1207846002, now seen corresponding path program 1 times [2019-11-28 14:43:24,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:43:24,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913605384] [2019-11-28 14:43:24,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-28 14:43:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:43:25,022 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 14:43:25,023 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:43:25,033 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 14:43:25,033 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:43:25,038 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:43:25,039 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:43:25,039 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 14:43:25,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:43:25,044 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:43:25,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:43:25,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [913605384] [2019-11-28 14:43:25,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:43:25,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-28 14:43:25,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400148144] [2019-11-28 14:43:25,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 14:43:25,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:43:25,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 14:43:25,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 14:43:25,053 INFO L87 Difference]: Start difference. First operand 107 states and 115 transitions. Second operand 3 states. [2019-11-28 14:43:25,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:43:25,227 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2019-11-28 14:43:25,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 14:43:25,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-28 14:43:25,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:43:25,229 INFO L225 Difference]: With dead ends: 105 [2019-11-28 14:43:25,230 INFO L226 Difference]: Without dead ends: 105 [2019-11-28 14:43:25,230 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 28 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-28 14:43:25,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-28 14:43:25,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2019-11-28 14:43:25,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-28 14:43:25,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-11-28 14:43:25,236 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 15 [2019-11-28 14:43:25,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:43:25,236 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-11-28 14:43:25,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 14:43:25,237 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-11-28 14:43:25,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 14:43:25,237 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:43:25,237 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:43:25,454 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-28 14:43:25,455 INFO L410 AbstractCegarLoop]: === Iteration 7 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-28 14:43:25,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:43:25,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1207846001, now seen corresponding path program 1 times [2019-11-28 14:43:25,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:43:25,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958361469] [2019-11-28 14:43:25,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-28 14:43:25,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:43:25,557 INFO L264 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 14:43:25,559 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:43:25,575 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 14:43:25,575 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:43:25,584 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:43:25,585 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:43:25,585 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 14:43:25,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:43:25,595 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:43:25,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:43:25,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1958361469] [2019-11-28 14:43:25,643 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:43:25,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-28 14:43:25,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143836133] [2019-11-28 14:43:25,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 14:43:25,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:43:25,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 14:43:25,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 14:43:25,645 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 4 states. [2019-11-28 14:43:25,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:43:25,906 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-11-28 14:43:25,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 14:43:25,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-28 14:43:25,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:43:25,908 INFO L225 Difference]: With dead ends: 106 [2019-11-28 14:43:25,908 INFO L226 Difference]: Without dead ends: 106 [2019-11-28 14:43:25,909 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 14:43:25,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-28 14:43:25,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2019-11-28 14:43:25,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-28 14:43:25,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2019-11-28 14:43:25,915 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 15 [2019-11-28 14:43:25,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:43:25,915 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2019-11-28 14:43:25,915 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 14:43:25,915 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2019-11-28 14:43:25,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 14:43:25,916 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:43:25,916 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:43:26,121 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-28 14:43:26,126 INFO L410 AbstractCegarLoop]: === Iteration 8 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-28 14:43:26,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:43:26,127 INFO L82 PathProgramCache]: Analyzing trace with hash 1211461638, now seen corresponding path program 1 times [2019-11-28 14:43:26,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:43:26,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2022136415] [2019-11-28 14:43:26,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-28 14:43:26,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:43:26,217 INFO L264 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-28 14:43:26,219 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:43:26,223 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 14:43:26,224 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:43:26,227 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:43:26,227 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:43:26,227 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 14:43:26,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:43:26,247 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:43:26,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:43:26,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2022136415] [2019-11-28 14:43:26,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:43:26,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-28 14:43:26,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355476501] [2019-11-28 14:43:26,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 14:43:26,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:43:26,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 14:43:26,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 14:43:26,294 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand 5 states. [2019-11-28 14:43:26,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:43:26,668 INFO L93 Difference]: Finished difference Result 135 states and 145 transitions. [2019-11-28 14:43:26,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 14:43:26,668 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-11-28 14:43:26,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:43:26,670 INFO L225 Difference]: With dead ends: 135 [2019-11-28 14:43:26,670 INFO L226 Difference]: Without dead ends: 135 [2019-11-28 14:43:26,670 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 14:43:26,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2019-11-28 14:43:26,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 100. [2019-11-28 14:43:26,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-28 14:43:26,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2019-11-28 14:43:26,683 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 16 [2019-11-28 14:43:26,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:43:26,683 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2019-11-28 14:43:26,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 14:43:26,683 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2019-11-28 14:43:26,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 14:43:26,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:43:26,686 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:43:26,886 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-28 14:43:26,887 INFO L410 AbstractCegarLoop]: === Iteration 9 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-28 14:43:26,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:43:26,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1211461639, now seen corresponding path program 1 times [2019-11-28 14:43:26,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:43:26,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553646877] [2019-11-28 14:43:26,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-28 14:43:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:43:26,985 INFO L264 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 14:43:26,987 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:43:26,992 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 14:43:26,993 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:43:26,997 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:43:26,997 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:43:26,997 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 14:43:27,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:43:27,015 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:43:27,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:43:27,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:43:27,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553646877] [2019-11-28 14:43:27,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:43:27,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-28 14:43:27,102 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957304616] [2019-11-28 14:43:27,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-28 14:43:27,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:43:27,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-28 14:43:27,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 14:43:27,103 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 6 states. [2019-11-28 14:43:27,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:43:27,652 INFO L93 Difference]: Finished difference Result 109 states and 118 transitions. [2019-11-28 14:43:27,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 14:43:27,655 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-28 14:43:27,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:43:27,657 INFO L225 Difference]: With dead ends: 109 [2019-11-28 14:43:27,657 INFO L226 Difference]: Without dead ends: 109 [2019-11-28 14:43:27,657 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-28 14:43:27,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-28 14:43:27,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 103. [2019-11-28 14:43:27,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-11-28 14:43:27,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2019-11-28 14:43:27,662 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 16 [2019-11-28 14:43:27,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:43:27,662 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2019-11-28 14:43:27,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-28 14:43:27,663 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2019-11-28 14:43:27,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 14:43:27,663 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:43:27,663 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:43:27,873 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-28 14:43:27,874 INFO L410 AbstractCegarLoop]: === Iteration 10 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-28 14:43:27,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:43:27,875 INFO L82 PathProgramCache]: Analyzing trace with hash 278501480, now seen corresponding path program 1 times [2019-11-28 14:43:27,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:43:27,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [193778706] [2019-11-28 14:43:27,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-28 14:43:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:43:27,985 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 14:43:27,988 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:43:28,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:43:28,030 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:43:28,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:43:28,125 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:43:28,139 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-11-28 14:43:28,140 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 14:43:28,155 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:43:28,155 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 14:43:28,156 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:12 [2019-11-28 14:43:28,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:43:28,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [193778706] [2019-11-28 14:43:28,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:43:28,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 11 [2019-11-28 14:43:28,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086819191] [2019-11-28 14:43:28,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-28 14:43:28,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:43:28,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-28 14:43:28,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-11-28 14:43:28,279 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand 12 states. [2019-11-28 14:43:29,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:43:29,303 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2019-11-28 14:43:29,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 14:43:29,304 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-11-28 14:43:29,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:43:29,304 INFO L225 Difference]: With dead ends: 106 [2019-11-28 14:43:29,305 INFO L226 Difference]: Without dead ends: 106 [2019-11-28 14:43:29,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-11-28 14:43:29,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-28 14:43:29,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2019-11-28 14:43:29,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-28 14:43:29,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 114 transitions. [2019-11-28 14:43:29,311 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 114 transitions. Word has length 18 [2019-11-28 14:43:29,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:43:29,312 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 114 transitions. [2019-11-28 14:43:29,312 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-28 14:43:29,312 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 114 transitions. [2019-11-28 14:43:29,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 14:43:29,313 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:43:29,313 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:43:29,515 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-28 14:43:29,516 INFO L410 AbstractCegarLoop]: === Iteration 11 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-28 14:43:29,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:43:29,516 INFO L82 PathProgramCache]: Analyzing trace with hash 278501479, now seen corresponding path program 1 times [2019-11-28 14:43:29,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:43:29,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785639384] [2019-11-28 14:43:29,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-28 14:43:29,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:43:29,621 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 14:43:29,623 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:43:29,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:43:29,651 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:43:29,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:43:29,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1785639384] [2019-11-28 14:43:29,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:43:29,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-28 14:43:29,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594791280] [2019-11-28 14:43:29,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 14:43:29,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:43:29,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 14:43:29,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 14:43:29,685 INFO L87 Difference]: Start difference. First operand 105 states and 114 transitions. Second operand 5 states. [2019-11-28 14:43:30,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:43:30,080 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2019-11-28 14:43:30,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 14:43:30,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-28 14:43:30,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:43:30,082 INFO L225 Difference]: With dead ends: 137 [2019-11-28 14:43:30,082 INFO L226 Difference]: Without dead ends: 137 [2019-11-28 14:43:30,082 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-28 14:43:30,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-28 14:43:30,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 104. [2019-11-28 14:43:30,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-28 14:43:30,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 112 transitions. [2019-11-28 14:43:30,088 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 112 transitions. Word has length 18 [2019-11-28 14:43:30,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:43:30,088 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 112 transitions. [2019-11-28 14:43:30,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 14:43:30,089 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 112 transitions. [2019-11-28 14:43:30,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 14:43:30,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:43:30,089 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:43:30,301 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-28 14:43:30,301 INFO L410 AbstractCegarLoop]: === Iteration 12 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-28 14:43:30,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:43:30,302 INFO L82 PathProgramCache]: Analyzing trace with hash 271010156, now seen corresponding path program 1 times [2019-11-28 14:43:30,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:43:30,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967876473] [2019-11-28 14:43:30,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-28 14:43:30,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:43:30,403 INFO L264 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 14:43:30,404 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:43:30,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:43:30,416 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:43:30,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:43:30,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967876473] [2019-11-28 14:43:30,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:43:30,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-28 14:43:30,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796480329] [2019-11-28 14:43:30,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 14:43:30,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:43:30,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 14:43:30,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 14:43:30,428 INFO L87 Difference]: Start difference. First operand 104 states and 112 transitions. Second operand 4 states. [2019-11-28 14:43:30,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:43:30,483 INFO L93 Difference]: Finished difference Result 112 states and 120 transitions. [2019-11-28 14:43:30,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 14:43:30,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-28 14:43:30,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:43:30,486 INFO L225 Difference]: With dead ends: 112 [2019-11-28 14:43:30,486 INFO L226 Difference]: Without dead ends: 112 [2019-11-28 14:43:30,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-28 14:43:30,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-28 14:43:30,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-11-28 14:43:30,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-28 14:43:30,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2019-11-28 14:43:30,491 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 18 [2019-11-28 14:43:30,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:43:30,492 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2019-11-28 14:43:30,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 14:43:30,492 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2019-11-28 14:43:30,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 14:43:30,493 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:43:30,493 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-28 14:43:30,704 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-28 14:43:30,704 INFO L410 AbstractCegarLoop]: === Iteration 13 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-28 14:43:30,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:43:30,705 INFO L82 PathProgramCache]: Analyzing trace with hash -188618374, now seen corresponding path program 1 times [2019-11-28 14:43:30,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:43:30,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [471454939] [2019-11-28 14:43:30,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-28 14:43:30,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:43:30,816 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 14:43:30,817 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:43:30,830 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 14:43:30,830 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:43:30,835 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:43:30,836 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:43:30,836 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-28 14:43:30,853 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 14:43:30,853 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:43:30,870 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:43:30,876 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 14:43:30,876 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 14:43:30,887 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:43:30,888 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:43:30,888 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:23 [2019-11-28 14:43:30,941 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-28 14:43:30,942 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:43:30,961 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:43:30,965 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-11-28 14:43:30,966 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 14:43:30,973 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:43:30,974 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:43:30,974 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:44, output treesize:14 [2019-11-28 14:43:30,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:43:30,991 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:43:31,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:43:31,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [471454939] [2019-11-28 14:43:31,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:43:31,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-28 14:43:31,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253592512] [2019-11-28 14:43:31,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 14:43:31,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:43:31,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 14:43:31,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-28 14:43:31,291 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand 10 states. [2019-11-28 14:43:32,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:43:32,729 INFO L93 Difference]: Finished difference Result 114 states and 122 transitions. [2019-11-28 14:43:32,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 14:43:32,730 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-28 14:43:32,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:43:32,731 INFO L225 Difference]: With dead ends: 114 [2019-11-28 14:43:32,731 INFO L226 Difference]: Without dead ends: 114 [2019-11-28 14:43:32,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2019-11-28 14:43:32,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-28 14:43:32,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 110. [2019-11-28 14:43:32,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-28 14:43:32,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 119 transitions. [2019-11-28 14:43:32,735 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 119 transitions. Word has length 19 [2019-11-28 14:43:32,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:43:32,736 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 119 transitions. [2019-11-28 14:43:32,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 14:43:32,736 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 119 transitions. [2019-11-28 14:43:32,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 14:43:32,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:43:32,737 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-28 14:43:32,937 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-28 14:43:32,938 INFO L410 AbstractCegarLoop]: === Iteration 14 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-28 14:43:32,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:43:32,938 INFO L82 PathProgramCache]: Analyzing trace with hash -188618375, now seen corresponding path program 1 times [2019-11-28 14:43:32,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:43:32,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1265995479] [2019-11-28 14:43:32,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-11-28 14:43:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:43:33,038 INFO L264 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 14:43:33,040 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:43:33,048 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 14:43:33,049 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:43:33,050 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:43:33,050 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:43:33,050 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 14:43:33,062 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 14:43:33,063 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:43:33,069 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:43:33,070 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:43:33,070 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2019-11-28 14:43:33,080 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2019-11-28 14:43:33,081 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:43:33,088 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:43:33,088 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:43:33,089 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:7 [2019-11-28 14:43:33,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:43:33,097 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:43:33,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:43:33,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1265995479] [2019-11-28 14:43:33,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:43:33,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-28 14:43:33,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661726142] [2019-11-28 14:43:33,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-28 14:43:33,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:43:33,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 14:43:33,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 14:43:33,122 INFO L87 Difference]: Start difference. First operand 110 states and 119 transitions. Second operand 5 states. [2019-11-28 14:43:33,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:43:33,441 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2019-11-28 14:43:33,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 14:43:33,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-28 14:43:33,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:43:33,443 INFO L225 Difference]: With dead ends: 113 [2019-11-28 14:43:33,443 INFO L226 Difference]: Without dead ends: 113 [2019-11-28 14:43:33,444 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-28 14:43:33,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-28 14:43:33,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2019-11-28 14:43:33,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-28 14:43:33,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2019-11-28 14:43:33,449 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 19 [2019-11-28 14:43:33,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:43:33,449 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2019-11-28 14:43:33,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-28 14:43:33,449 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2019-11-28 14:43:33,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-28 14:43:33,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:43:33,450 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:43:33,654 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-28 14:43:33,654 INFO L410 AbstractCegarLoop]: === Iteration 15 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-28 14:43:33,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:43:33,655 INFO L82 PathProgramCache]: Analyzing trace with hash 818029954, now seen corresponding path program 1 times [2019-11-28 14:43:33,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:43:33,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [448513872] [2019-11-28 14:43:33,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-11-28 14:43:33,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:43:33,779 INFO L264 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-28 14:43:33,780 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:43:33,787 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 14:43:33,788 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:43:33,797 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:43:33,800 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 14:43:33,801 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 14:43:33,808 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:43:33,809 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:43:33,809 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-28 14:43:33,873 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 14:43:33,875 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2019-11-28 14:43:33,876 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:43:33,894 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:43:33,910 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:43:33,911 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 14:43:33,911 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 14:43:33,926 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:43:33,927 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 14:43:33,927 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:20 [2019-11-28 14:43:33,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:43:33,960 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:43:34,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:43:34,119 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:43:34,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:43:34,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:43:36,917 WARN L192 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-11-28 14:43:36,933 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:43:39,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:43:39,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [448513872] [2019-11-28 14:43:39,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:43:39,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-28 14:43:39,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837435857] [2019-11-28 14:43:39,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 14:43:39,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:43:39,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 14:43:39,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=66, Unknown=1, NotChecked=0, Total=90 [2019-11-28 14:43:39,429 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 10 states. [2019-11-28 14:43:49,775 WARN L192 SmtUtils]: Spent 6.15 s on a formula simplification that was a NOOP. DAG size: 49 [2019-11-28 14:44:08,584 WARN L192 SmtUtils]: Spent 6.09 s on a formula simplification that was a NOOP. DAG size: 38 [2019-11-28 14:44:20,463 WARN L192 SmtUtils]: Spent 4.31 s on a formula simplification that was a NOOP. DAG size: 39 [2019-11-28 14:44:42,848 WARN L192 SmtUtils]: Spent 482.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2019-11-28 14:45:09,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:45:09,799 INFO L93 Difference]: Finished difference Result 129 states and 139 transitions. [2019-11-28 14:45:09,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 14:45:09,801 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-28 14:45:09,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:45:09,803 INFO L225 Difference]: With dead ends: 129 [2019-11-28 14:45:09,803 INFO L226 Difference]: Without dead ends: 129 [2019-11-28 14:45:09,803 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 38.8s TimeCoverageRelationStatistics Valid=66, Invalid=168, Unknown=6, NotChecked=0, Total=240 [2019-11-28 14:45:09,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-28 14:45:09,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 114. [2019-11-28 14:45:09,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-28 14:45:09,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 122 transitions. [2019-11-28 14:45:09,809 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 122 transitions. Word has length 20 [2019-11-28 14:45:09,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:45:09,809 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 122 transitions. [2019-11-28 14:45:09,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 14:45:09,809 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 122 transitions. [2019-11-28 14:45:09,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 14:45:09,810 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:45:09,811 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:45:10,013 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-28 14:45:10,014 INFO L410 AbstractCegarLoop]: === Iteration 16 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-28 14:45:10,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:45:10,014 INFO L82 PathProgramCache]: Analyzing trace with hash 2147358802, now seen corresponding path program 1 times [2019-11-28 14:45:10,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:45:10,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1459436269] [2019-11-28 14:45:10,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-11-28 14:45:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:45:10,130 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 14:45:10,132 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:45:10,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:45:10,166 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:45:10,255 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:45:10,255 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 12 treesize of output 16 [2019-11-28 14:45:10,256 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:45:10,256 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:45:10,261 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:45:10,261 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:45:10,261 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2019-11-28 14:45:10,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:45:10,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1459436269] [2019-11-28 14:45:10,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:45:10,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 6 [2019-11-28 14:45:10,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702787981] [2019-11-28 14:45:10,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-28 14:45:10,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:45:10,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 14:45:10,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-28 14:45:10,268 INFO L87 Difference]: Start difference. First operand 114 states and 122 transitions. Second operand 7 states. [2019-11-28 14:45:10,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:45:10,984 INFO L93 Difference]: Finished difference Result 147 states and 157 transitions. [2019-11-28 14:45:10,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-28 14:45:10,985 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-11-28 14:45:10,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:45:10,987 INFO L225 Difference]: With dead ends: 147 [2019-11-28 14:45:10,987 INFO L226 Difference]: Without dead ends: 147 [2019-11-28 14:45:10,987 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-28 14:45:10,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2019-11-28 14:45:10,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 115. [2019-11-28 14:45:10,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-28 14:45:10,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 123 transitions. [2019-11-28 14:45:10,993 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 123 transitions. Word has length 22 [2019-11-28 14:45:10,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:45:10,995 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 123 transitions. [2019-11-28 14:45:10,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-28 14:45:10,995 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 123 transitions. [2019-11-28 14:45:10,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 14:45:11,002 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:45:11,002 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:45:11,202 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-28 14:45:11,203 INFO L410 AbstractCegarLoop]: === Iteration 17 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-28 14:45:11,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:45:11,203 INFO L82 PathProgramCache]: Analyzing trace with hash 2147358803, now seen corresponding path program 1 times [2019-11-28 14:45:11,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:45:11,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [722875720] [2019-11-28 14:45:11,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-11-28 14:45:11,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:45:11,310 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-28 14:45:11,311 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:45:11,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:45:11,361 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:45:11,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:45:11,483 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-11-28 14:45:11,484 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 14:45:11,502 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:45:11,503 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 14:45:11,503 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:12 [2019-11-28 14:45:11,621 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:45:11,621 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2019-11-28 14:45:11,622 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:45:11,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:45:11,624 INFO L534 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 14:45:11,655 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:45:11,655 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:45:11,657 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 14:45:11,657 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:26 [2019-11-28 14:45:11,657 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:45:11,730 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:45:11,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:45:11,960 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:45:12,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:45:12,240 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:45:12,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:45:12,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:45:12,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [722875720] [2019-11-28 14:45:12,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:45:12,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-28 14:45:12,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163628385] [2019-11-28 14:45:12,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-28 14:45:12,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:45:12,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 14:45:12,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-28 14:45:12,505 INFO L87 Difference]: Start difference. First operand 115 states and 123 transitions. Second operand 10 states. [2019-11-28 14:45:13,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:45:13,036 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2019-11-28 14:45:13,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-28 14:45:13,037 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-28 14:45:13,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:45:13,039 INFO L225 Difference]: With dead ends: 110 [2019-11-28 14:45:13,039 INFO L226 Difference]: Without dead ends: 110 [2019-11-28 14:45:13,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-28 14:45:13,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-28 14:45:13,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2019-11-28 14:45:13,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-28 14:45:13,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2019-11-28 14:45:13,043 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 22 [2019-11-28 14:45:13,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:45:13,043 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2019-11-28 14:45:13,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-28 14:45:13,043 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2019-11-28 14:45:13,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 14:45:13,044 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:45:13,044 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:45:13,249 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-28 14:45:13,249 INFO L410 AbstractCegarLoop]: === Iteration 18 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-28 14:45:13,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:45:13,250 INFO L82 PathProgramCache]: Analyzing trace with hash 147774243, now seen corresponding path program 1 times [2019-11-28 14:45:13,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:45:13,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183527522] [2019-11-28 14:45:13,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-11-28 14:45:13,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:45:13,379 INFO L264 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-28 14:45:13,381 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:45:13,394 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 14:45:13,394 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:45:13,400 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:45:13,400 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 14:45:13,400 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:10, output treesize:9 [2019-11-28 14:45:13,508 INFO L430 ElimStorePlain]: Different costs {1=[|v_old(#valid)_AFTER_CALL_64|], 3=[|v_#length_BEFORE_CALL_12|]} [2019-11-28 14:45:13,523 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:45:13,524 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 14:45:13,524 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:45:13,551 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:45:13,586 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:45:13,587 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 48 [2019-11-28 14:45:13,588 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 14:45:13,651 INFO L614 ElimStorePlain]: treesize reduction 24, result has 51.0 percent of original size [2019-11-28 14:45:13,652 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 14:45:13,652 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:25 [2019-11-28 14:45:13,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:45:13,722 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:45:13,816 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:45:13,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:45:13,949 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:45:13,950 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:45:16,687 WARN L192 SmtUtils]: Spent 493.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-11-28 14:45:16,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:45:18,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:45:18,116 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 14:45:18,128 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 14:45:18,129 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 14:45:18,129 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:45:18,142 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:45:18,143 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-28 14:45:18,143 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 14:45:18,168 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:45:18,168 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 14:45:18,169 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:58, output treesize:14 [2019-11-28 14:45:18,264 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2019-11-28 14:45:18,264 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-28 14:45:18,322 INFO L614 ElimStorePlain]: treesize reduction 11, result has 60.7 percent of original size [2019-11-28 14:45:18,322 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:45:18,322 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:17, output treesize:5 [2019-11-28 14:45:18,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:45:18,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183527522] [2019-11-28 14:45:18,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-28 14:45:18,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-11-28 14:45:18,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492105750] [2019-11-28 14:45:18,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 14:45:18,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:45:18,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 14:45:18,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=196, Unknown=1, NotChecked=0, Total=240 [2019-11-28 14:45:18,451 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand 16 states. [2019-11-28 14:45:31,104 WARN L192 SmtUtils]: Spent 6.22 s on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-11-28 14:45:44,131 WARN L192 SmtUtils]: Spent 12.81 s on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-11-28 14:46:00,718 WARN L192 SmtUtils]: Spent 2.07 s on a formula simplification that was a NOOP. DAG size: 38 [2019-11-28 14:46:10,623 WARN L192 SmtUtils]: Spent 4.27 s on a formula simplification that was a NOOP. DAG size: 39 [2019-11-28 14:46:29,691 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-11-28 14:46:53,004 WARN L192 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2019-11-28 14:47:13,124 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2019-11-28 14:47:28,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:47:28,814 INFO L93 Difference]: Finished difference Result 121 states and 130 transitions. [2019-11-28 14:47:28,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 14:47:28,814 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-11-28 14:47:28,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:47:28,815 INFO L225 Difference]: With dead ends: 121 [2019-11-28 14:47:28,815 INFO L226 Difference]: Without dead ends: 121 [2019-11-28 14:47:28,816 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 42.6s TimeCoverageRelationStatistics Valid=127, Invalid=469, Unknown=4, NotChecked=0, Total=600 [2019-11-28 14:47:28,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-28 14:47:28,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 104. [2019-11-28 14:47:28,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-28 14:47:28,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2019-11-28 14:47:28,820 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 22 [2019-11-28 14:47:28,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:47:28,821 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2019-11-28 14:47:28,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-28 14:47:28,821 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2019-11-28 14:47:28,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 14:47:28,822 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:47:28,822 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:47:29,025 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-28 14:47:29,025 INFO L410 AbstractCegarLoop]: === Iteration 19 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-28 14:47:29,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:47:29,026 INFO L82 PathProgramCache]: Analyzing trace with hash 2027630961, now seen corresponding path program 1 times [2019-11-28 14:47:29,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:47:29,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807187077] [2019-11-28 14:47:29,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-11-28 14:47:29,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:47:29,146 INFO L264 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-28 14:47:29,148 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:47:29,156 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 14:47:29,156 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:47:29,168 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:47:29,169 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 14:47:29,169 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:12 [2019-11-28 14:47:29,375 INFO L430 ElimStorePlain]: Different costs {1=[|v_#valid_197|], 3=[|v_#length_122|]} [2019-11-28 14:47:29,391 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:47:29,392 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-28 14:47:29,392 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:47:29,415 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:47:29,446 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:47:29,447 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 46 [2019-11-28 14:47:29,448 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 14:47:29,496 INFO L614 ElimStorePlain]: treesize reduction 24, result has 51.0 percent of original size [2019-11-28 14:47:29,497 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-28 14:47:29,497 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:34, output treesize:25 [2019-11-28 14:47:29,565 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:47:29,565 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:47:29,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:47:30,046 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:47:30,077 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 14:47:30,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-28 14:47:30,083 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-11-28 14:47:30,084 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:47:30,099 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:47:30,100 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-28 14:47:30,100 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 14:47:30,128 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:47:30,134 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 24 treesize of output 22 [2019-11-28 14:47:30,135 INFO L534 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-11-28 14:47:30,214 INFO L614 ElimStorePlain]: treesize reduction 11, result has 64.5 percent of original size [2019-11-28 14:47:30,214 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:47:30,215 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:67, output treesize:5 [2019-11-28 14:47:30,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:47:32,668 WARN L838 $PredicateComparison]: unable to prove that (and (or (forall ((v_append_~pointerToList.base_BEFORE_CALL_10 (_ BitVec 32)) (v_append_~pointerToList.offset_BEFORE_CALL_8 (_ BitVec 32))) (not (bvule (bvadd v_append_~pointerToList.offset_BEFORE_CALL_8 (_ bv4 32)) (select |c_#length| v_append_~pointerToList.base_BEFORE_CALL_10)))) (forall ((|v_append_#in~pointerToList.base_BEFORE_CALL_6| (_ BitVec 32)) (v_prenex_11 (_ BitVec 32)) (|v_append_#in~pointerToList.offset_BEFORE_CALL_4| (_ BitVec 32))) (let ((.cse0 (bvadd |v_append_#in~pointerToList.offset_BEFORE_CALL_4| (_ bv4 32)))) (or (not (bvule |v_append_#in~pointerToList.offset_BEFORE_CALL_4| .cse0)) (bvule .cse0 (select (store |c_#length| v_prenex_11 (_ bv8 32)) |v_append_#in~pointerToList.base_BEFORE_CALL_6|)) (not (= (_ bv0 1) (select |c_#valid| v_prenex_11))) (exists ((v_prenex_12 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| v_prenex_12)) (not (bvule (bvadd |v_append_#in~pointerToList.offset_BEFORE_CALL_4| (_ bv4 32)) (select (store |c_old(#length)| v_prenex_12 (_ bv8 32)) |v_append_#in~pointerToList.base_BEFORE_CALL_6|))))))))) (or (forall ((v_append_~pointerToList.base_BEFORE_CALL_10 (_ BitVec 32)) (v_append_~pointerToList.offset_BEFORE_CALL_8 (_ BitVec 32))) (let ((.cse1 (bvadd v_append_~pointerToList.offset_BEFORE_CALL_8 (_ bv4 32)))) (or (not (bvule .cse1 (select |c_#length| v_append_~pointerToList.base_BEFORE_CALL_10))) (bvule .cse1 (select |c_old(#length)| v_append_~pointerToList.base_BEFORE_CALL_10))))) (forall ((|v_append_#in~pointerToList.base_BEFORE_CALL_6| (_ BitVec 32)) (v_prenex_11 (_ BitVec 32)) (|v_append_#in~pointerToList.offset_BEFORE_CALL_4| (_ BitVec 32))) (let ((.cse2 (bvadd |v_append_#in~pointerToList.offset_BEFORE_CALL_4| (_ bv4 32)))) (or (not (bvule |v_append_#in~pointerToList.offset_BEFORE_CALL_4| .cse2)) (bvule .cse2 (select (store |c_#length| v_prenex_11 (_ bv8 32)) |v_append_#in~pointerToList.base_BEFORE_CALL_6|)) (not (= (_ bv0 1) (select |c_#valid| v_prenex_11)))))))) is different from false [2019-11-28 14:47:32,682 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 25 [2019-11-28 14:47:47,185 WARN L192 SmtUtils]: Spent 4.54 s on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-11-28 14:47:47,188 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 20 [2019-11-28 14:47:47,223 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:47:47,223 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-28 14:47:47,223 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:47:47,248 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:47:47,249 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 14:47:47,250 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:28 [2019-11-28 14:47:47,427 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-28 14:47:47,436 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 46 treesize of output 42 [2019-11-28 14:47:47,436 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:47:47,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:47:47,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:47:47,438 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:47:47,438 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 14:47:47,450 INFO L614 ElimStorePlain]: treesize reduction 50, result has 2.0 percent of original size [2019-11-28 14:47:47,451 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:47:47,451 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:34, output treesize:1 [2019-11-28 14:47:47,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:47:47,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807187077] [2019-11-28 14:47:47,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 14:47:47,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2019-11-28 14:47:47,459 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908210450] [2019-11-28 14:47:47,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-11-28 14:47:47,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:47:47,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-11-28 14:47:47,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=250, Unknown=5, NotChecked=32, Total=342 [2019-11-28 14:47:47,460 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 19 states. [2019-11-28 14:47:48,391 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2019-11-28 14:47:50,168 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2019-11-28 14:47:55,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 14:47:55,738 INFO L93 Difference]: Finished difference Result 159 states and 175 transitions. [2019-11-28 14:47:55,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-28 14:47:55,739 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 24 [2019-11-28 14:47:55,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 14:47:55,740 INFO L225 Difference]: With dead ends: 159 [2019-11-28 14:47:55,740 INFO L226 Difference]: Without dead ends: 159 [2019-11-28 14:47:55,741 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=132, Invalid=517, Unknown=5, NotChecked=48, Total=702 [2019-11-28 14:47:55,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-28 14:47:55,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 100. [2019-11-28 14:47:55,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-11-28 14:47:55,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2019-11-28 14:47:55,747 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 24 [2019-11-28 14:47:55,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 14:47:55,747 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2019-11-28 14:47:55,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-11-28 14:47:55,748 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2019-11-28 14:47:55,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 14:47:55,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 14:47:55,749 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 14:47:55,959 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-28 14:47:55,960 INFO L410 AbstractCegarLoop]: === Iteration 20 === [create_dataErr3REQUIRES_VIOLATION, create_dataErr8REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr4REQUIRES_VIOLATION, create_dataErr9REQUIRES_VIOLATION, create_dataErr0REQUIRES_VIOLATION, create_dataErr5REQUIRES_VIOLATION, create_dataErr7REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr6REQUIRES_VIOLATION, freeDataErr6ASSERT_VIOLATIONMEMORY_FREE, freeDataErr1REQUIRES_VIOLATION, freeDataErr5ASSERT_VIOLATIONMEMORY_FREE, freeDataErr7ASSERT_VIOLATIONMEMORY_FREE, freeDataErr0REQUIRES_VIOLATION, freeDataErr4ASSERT_VIOLATIONMEMORY_FREE, freeDataErr8ASSERT_VIOLATIONMEMORY_FREE, freeDataErr2REQUIRES_VIOLATION, freeDataErr9ASSERT_VIOLATIONMEMORY_FREE, freeDataErr3REQUIRES_VIOLATION, mainErr8REQUIRES_VIOLATION, mainErr14ASSERT_VIOLATIONMEMORY_FREE, mainErr9REQUIRES_VIOLATION, mainErr13ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr12ASSERT_VIOLATIONMEMORY_FREE, mainErr16REQUIRES_VIOLATION, mainErr6REQUIRES_VIOLATION, mainErr7REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr15REQUIRES_VIOLATION, mainErr4REQUIRES_VIOLATION, mainErr10REQUIRES_VIOLATION, mainErr11REQUIRES_VIOLATION, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr17ENSURES_VIOLATIONMEMORY_LEAK, appendErr5REQUIRES_VIOLATION, appendErr3REQUIRES_VIOLATION, appendErr6REQUIRES_VIOLATION, appendErr2REQUIRES_VIOLATION, appendErr7REQUIRES_VIOLATION, appendErr1REQUIRES_VIOLATION, appendErr0REQUIRES_VIOLATION, appendErr4REQUIRES_VIOLATION]=== [2019-11-28 14:47:55,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 14:47:55,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1181322069, now seen corresponding path program 1 times [2019-11-28 14:47:55,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-28 14:47:55,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664532725] [2019-11-28 14:47:55,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-11-28 14:47:56,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 14:47:56,106 INFO L264 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-28 14:47:56,107 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 14:47:56,113 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 14:47:56,113 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:47:56,115 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:47:56,115 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:47:56,115 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-28 14:47:56,119 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_138|], 1=[|v_#valid_215|]} [2019-11-28 14:47:56,125 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-28 14:47:56,125 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:47:56,135 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:47:56,143 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:47:56,144 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-11-28 14:47:56,144 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 14:47:56,152 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:47:56,153 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:47:56,153 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:22, output treesize:13 [2019-11-28 14:47:56,176 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-28 14:47:56,176 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:47:56,198 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:47:56,203 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-28 14:47:56,203 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 14:47:56,219 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:47:56,219 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:47:56,220 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:33 [2019-11-28 14:48:35,387 WARN L192 SmtUtils]: Spent 39.03 s on a formula simplification. DAG size of input: 83 DAG size of output: 53 [2019-11-28 14:48:35,387 INFO L343 Elim1Store]: treesize reduction 453, result has 33.6 percent of original size [2019-11-28 14:48:35,388 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 4 case distinctions, treesize of input 244 treesize of output 338 [2019-11-28 14:48:35,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:48:35,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:48:35,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:48:35,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-28 14:48:35,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-28 14:48:35,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:48:35,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-28 14:48:35,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-28 14:48:35,392 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-28 14:48:35,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:48:35,393 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:48:35,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-28 14:48:35,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-28 14:48:35,395 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:48:35,396 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-28 14:48:35,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-28 14:48:35,398 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-11-28 14:48:35,400 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 15 xjuncts. [2019-11-28 14:48:36,608 WARN L192 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 75 DAG size of output: 44 [2019-11-28 14:48:36,609 INFO L614 ElimStorePlain]: treesize reduction 4233, result has 3.3 percent of original size [2019-11-28 14:48:36,626 INFO L343 Elim1Store]: treesize reduction 331, result has 0.3 percent of original size [2019-11-28 14:48:36,627 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 3 case distinctions, treesize of input 120 treesize of output 13 [2019-11-28 14:48:36,627 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 14:48:36,645 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:48:36,645 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:48:36,645 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:256, output treesize:34 [2019-11-28 14:48:36,707 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 33 treesize of output 15 [2019-11-28 14:48:36,707 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:48:36,726 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:48:36,730 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 [2019-11-28 14:48:36,730 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 14:48:36,741 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 14:48:36,741 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 14:48:36,742 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:56, output treesize:16 [2019-11-28 14:48:36,765 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:48:36,765 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-11-28 14:48:37,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:48:37,210 INFO L534 ElimStorePlain]: Start of recursive call 2: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 14:48:37,229 INFO L534 ElimStorePlain]: Start of recursive call 3: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 14:48:37,910 WARN L192 SmtUtils]: Spent 680.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 67 [2019-11-28 14:48:37,913 INFO L614 ElimStorePlain]: treesize reduction 262, result has 54.0 percent of original size [2019-11-28 14:48:37,955 INFO L534 ElimStorePlain]: Start of recursive call 4: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 14:48:37,967 INFO L534 ElimStorePlain]: Start of recursive call 5: 4 dim-0 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-28 14:48:38,408 WARN L192 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2019-11-28 14:48:38,409 INFO L614 ElimStorePlain]: treesize reduction 264, result has 42.1 percent of original size [2019-11-28 14:48:38,409 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 14 dim-0 vars, and 2 xjuncts. [2019-11-28 14:48:38,410 INFO L239 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:350, output treesize:192 [2019-11-28 14:48:42,686 WARN L192 SmtUtils]: Spent 305.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2019-11-28 14:48:49,721 WARN L192 SmtUtils]: Spent 2.18 s on a formula simplification that was a NOOP. DAG size: 69 [2019-11-28 14:48:52,504 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2019-11-28 14:48:52,530 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 14:48:56,662 WARN L192 SmtUtils]: Spent 4.13 s on a formula simplification. DAG size of input: 176 DAG size of output: 98 [2019-11-28 14:48:56,662 INFO L614 ElimStorePlain]: treesize reduction 10058, result has 4.6 percent of original size [2019-11-28 14:48:56,703 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 14:49:04,037 WARN L192 SmtUtils]: Spent 7.33 s on a formula simplification. DAG size of input: 620 DAG size of output: 91 [2019-11-28 14:49:04,038 INFO L614 ElimStorePlain]: treesize reduction 20937, result has 1.1 percent of original size [2019-11-28 14:49:04,071 INFO L534 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-28 14:49:12,151 WARN L192 SmtUtils]: Spent 8.08 s on a formula simplification. DAG size of input: 328 DAG size of output: 112 [2019-11-28 14:49:12,152 INFO L614 ElimStorePlain]: treesize reduction 31583, result has 0.8 percent of original size [2019-11-28 14:49:12,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:49:12,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:49:12,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,159 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:49:12,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:49:12,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:49:12,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:49:12,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:49:12,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:49:12,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:49:12,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:49:12,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,270 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:49:12,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:49:12,274 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:49:12,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:49:12,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:49:12,293 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,298 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:49:12,301 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 14:49:12,308 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-28 14:49:12,320 INFO L534 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 3 dim-2 vars, End of recursive call: 64 dim-0 vars, and 13 xjuncts. [2019-11-28 14:49:12,321 INFO L239 ElimStorePlain]: Needed 4 recursive calls to eliminate 19 variables, input treesize:211, output treesize:971 [2019-11-28 14:49:13,733 WARN L192 SmtUtils]: Spent 656.00 ms on a formula simplification. DAG size of input: 298 DAG size of output: 14 [2019-11-28 14:49:13,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 14:49:13,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664532725] [2019-11-28 14:49:13,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 14:49:13,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 15 [2019-11-28 14:49:13,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125763820] [2019-11-28 14:49:13,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-28 14:49:13,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-28 14:49:13,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-28 14:49:13,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=189, Unknown=1, NotChecked=0, Total=240 [2019-11-28 14:49:13,749 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 16 states. [2019-11-28 14:49:17,261 WARN L192 SmtUtils]: Spent 487.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 70 [2019-11-28 14:49:24,348 WARN L192 SmtUtils]: Spent 4.22 s on a formula simplification. DAG size of input: 97 DAG size of output: 77 [2019-11-28 14:49:34,561 WARN L192 SmtUtils]: Spent 8.23 s on a formula simplification. DAG size of input: 133 DAG size of output: 101 [2019-11-28 14:49:39,131 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-11-28 14:49:39,133 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:100) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.pop(ManagedScript.java:130) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:660) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:264) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:279) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ProtectiveHoareTripleChecker.releaseLock(ProtectiveHoareTripleChecker.java:92) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.EfficientHoareTripleChecker.releaseLock(EfficientHoareTripleChecker.java:161) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.computeAutomataDifference(BasicCegarLoop.java:714) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.refineAbstraction(BasicCegarLoop.java:627) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:454) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:139) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: java.io.IOException: Stream closed at java.lang.ProcessBuilder$NullOutputStream.write(ProcessBuilder.java:433) at java.io.OutputStream.write(OutputStream.java:116) at java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:82) at java.io.BufferedOutputStream.flush(BufferedOutputStream.java:140) at sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:297) at sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:141) at java.io.OutputStreamWriter.flush(OutputStreamWriter.java:229) at java.io.BufferedWriter.flush(BufferedWriter.java:254) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:120) ... 31 more [2019-11-28 14:49:39,140 INFO L168 Benchmark]: Toolchain (without parser) took 382077.72 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 230.2 MB). Free memory was 961.7 MB in the beginning and 974.9 MB in the end (delta: -13.1 MB). Peak memory consumption was 217.0 MB. Max. memory is 11.5 GB. [2019-11-28 14:49:39,140 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 14:49:39,141 INFO L168 Benchmark]: CACSL2BoogieTranslator took 715.48 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -122.2 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. [2019-11-28 14:49:39,141 INFO L168 Benchmark]: Boogie Preprocessor took 89.37 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-11-28 14:49:39,142 INFO L168 Benchmark]: RCFGBuilder took 1058.99 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: 66.3 MB). Peak memory consumption was 66.3 MB. Max. memory is 11.5 GB. [2019-11-28 14:49:39,142 INFO L168 Benchmark]: TraceAbstraction took 380208.65 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 125.8 MB). Free memory was 1.0 GB in the beginning and 974.9 MB in the end (delta: 30.6 MB). Peak memory consumption was 156.5 MB. Max. memory is 11.5 GB. [2019-11-28 14:49:39,149 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 715.48 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -122.2 MB). Peak memory consumption was 15.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 89.37 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: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1058.99 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: 66.3 MB). Peak memory consumption was 66.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 380208.65 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 125.8 MB). Free memory was 1.0 GB in the beginning and 974.9 MB in the end (delta: 30.6 MB). Peak memory consumption was 156.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:123) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...