./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 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3d056a1f Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --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-64bit-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 64bit --witnessprinter.graph.data.programhash 76d1c5e435c1ee1c0852e4a01b3ec32d520e70a3 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported --- Real Ultimate output --- This is Ultimate 0.1.24-3d056a1 [2019-11-22 13:56:01,462 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 13:56:01,465 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 13:56:01,484 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 13:56:01,485 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 13:56:01,487 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 13:56:01,489 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 13:56:01,498 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 13:56:01,503 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 13:56:01,507 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 13:56:01,508 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 13:56:01,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 13:56:01,510 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 13:56:01,513 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 13:56:01,514 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 13:56:01,516 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 13:56:01,517 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 13:56:01,518 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 13:56:01,521 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 13:56:01,524 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 13:56:01,525 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 13:56:01,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 13:56:01,527 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 13:56:01,528 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 13:56:01,530 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 13:56:01,530 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 13:56:01,531 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 13:56:01,532 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 13:56:01,532 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 13:56:01,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 13:56:01,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 13:56:01,534 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 13:56:01,534 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 13:56:01,535 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 13:56:01,536 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 13:56:01,536 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 13:56:01,538 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 13:56:01,539 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 13:56:01,539 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 13:56:01,541 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 13:56:01,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 13:56:01,543 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2019-11-22 13:56:01,577 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 13:56:01,579 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 13:56:01,580 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 13:56:01,582 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 13:56:01,582 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 13:56:01,582 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 13:56:01,584 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 13:56:01,585 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 13:56:01,585 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 13:56:01,585 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 13:56:01,585 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 13:56:01,586 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 13:56:01,586 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 13:56:01,587 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 13:56:01,588 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 13:56:01,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 13:56:01,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 13:56:01,589 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 13:56:01,589 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 13:56:01,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 13:56:01,590 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 13:56:01,590 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 13:56:01,590 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-22 13:56:01,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-22 13:56:01,591 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76d1c5e435c1ee1c0852e4a01b3ec32d520e70a3 [2019-11-22 13:56:01,877 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 13:56:01,897 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 13:56:01,900 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 13:56:01,902 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 13:56:01,902 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 13:56:01,903 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-22 13:56:01,980 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/773660537/7436abef665341e99102033645febc6f/FLAG52c9c5ec2 [2019-11-22 13:56:02,504 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 13:56:02,505 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2019-11-22 13:56:02,518 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/773660537/7436abef665341e99102033645febc6f/FLAG52c9c5ec2 [2019-11-22 13:56:02,818 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/773660537/7436abef665341e99102033645febc6f [2019-11-22 13:56:02,823 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 13:56:02,825 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 13:56:02,829 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 13:56:02,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 13:56:02,833 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 13:56:02,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:56:02" (1/1) ... [2019-11-22 13:56:02,837 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7475fdf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:56:02, skipping insertion in model container [2019-11-22 13:56:02,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:56:02" (1/1) ... [2019-11-22 13:56:02,846 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 13:56:02,906 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 13:56:03,305 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 13:56:03,320 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-22 13:56:03,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@6b4df8a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:56:03, skipping insertion in model container [2019-11-22 13:56:03,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 13:56:03,321 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.preprocessor [2019-11-22 13:56:03,325 INFO L168 Benchmark]: Toolchain (without parser) took 498.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -188.6 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-11-22 13:56:03,326 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 13:56:03,327 INFO L168 Benchmark]: CACSL2BoogieTranslator took 492.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -188.6 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-11-22 13:56:03,329 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 492.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 154.1 MB). Free memory was 955.0 MB in the beginning and 1.1 GB in the end (delta: -188.6 MB). Peak memory consumption was 21.9 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.24-3d056a1 [2019-11-22 13:56:05,097 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-22 13:56:05,099 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-22 13:56:05,112 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-22 13:56:05,112 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-22 13:56:05,113 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-22 13:56:05,115 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-22 13:56:05,117 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-22 13:56:05,119 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-22 13:56:05,120 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-22 13:56:05,121 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-22 13:56:05,122 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-22 13:56:05,123 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-22 13:56:05,124 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-22 13:56:05,125 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-22 13:56:05,126 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-22 13:56:05,127 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-22 13:56:05,128 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-22 13:56:05,130 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-22 13:56:05,132 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-22 13:56:05,134 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-22 13:56:05,135 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-22 13:56:05,136 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-22 13:56:05,137 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-22 13:56:05,139 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-22 13:56:05,140 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-22 13:56:05,140 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-22 13:56:05,141 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-22 13:56:05,141 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-22 13:56:05,143 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-22 13:56:05,143 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-22 13:56:05,144 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-22 13:56:05,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-22 13:56:05,145 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-22 13:56:05,146 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-22 13:56:05,147 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-22 13:56:05,147 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-22 13:56:05,148 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-22 13:56:05,148 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-22 13:56:05,149 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-22 13:56:05,150 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-22 13:56:05,151 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2019-11-22 13:56:05,165 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-22 13:56:05,165 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-22 13:56:05,167 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-22 13:56:05,167 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-22 13:56:05,167 INFO L138 SettingsManager]: * Use SBE=true [2019-11-22 13:56:05,168 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-22 13:56:05,168 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-22 13:56:05,168 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-22 13:56:05,168 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-22 13:56:05,169 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-11-22 13:56:05,169 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-11-22 13:56:05,169 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-11-22 13:56:05,169 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-22 13:56:05,170 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-22 13:56:05,170 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-22 13:56:05,170 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-22 13:56:05,171 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-22 13:56:05,171 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-22 13:56:05,171 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-22 13:56:05,171 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-22 13:56:05,172 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-22 13:56:05,172 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 13:56:05,172 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-22 13:56:05,173 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-22 13:56:05,173 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-22 13:56:05,173 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-22 13:56:05,174 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-22 13:56:05,174 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76d1c5e435c1ee1c0852e4a01b3ec32d520e70a3 [2019-11-22 13:56:05,493 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-22 13:56:05,506 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-22 13:56:05,509 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-22 13:56:05,511 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-22 13:56:05,511 INFO L275 PluginConnector]: CDTParser initialized [2019-11-22 13:56:05,512 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-22 13:56:05,573 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14e6aa5c9/fa4269e0fecc4773b8e3348fe2b294cf/FLAG20c73f558 [2019-11-22 13:56:06,082 INFO L306 CDTParser]: Found 1 translation units. [2019-11-22 13:56:06,083 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-1.i [2019-11-22 13:56:06,097 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14e6aa5c9/fa4269e0fecc4773b8e3348fe2b294cf/FLAG20c73f558 [2019-11-22 13:56:06,395 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/14e6aa5c9/fa4269e0fecc4773b8e3348fe2b294cf [2019-11-22 13:56:06,399 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-22 13:56:06,402 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-22 13:56:06,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-22 13:56:06,405 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-22 13:56:06,409 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-22 13:56:06,410 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:56:06" (1/1) ... [2019-11-22 13:56:06,413 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ce44dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:56:06, skipping insertion in model container [2019-11-22 13:56:06,413 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:56:06" (1/1) ... [2019-11-22 13:56:06,422 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-22 13:56:06,463 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 13:56:07,034 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 13:56:07,057 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-11-22 13:56:07,074 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-22 13:56:07,111 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 13:56:07,118 INFO L203 MainTranslator]: Completed pre-run [2019-11-22 13:56:07,155 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-22 13:56:07,227 INFO L208 MainTranslator]: Completed translation [2019-11-22 13:56:07,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:56:07 WrapperNode [2019-11-22 13:56:07,228 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-22 13:56:07,229 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-22 13:56:07,229 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-22 13:56:07,229 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-22 13:56:07,243 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:56:07" (1/1) ... [2019-11-22 13:56:07,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:56:07" (1/1) ... [2019-11-22 13:56:07,263 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:56:07" (1/1) ... [2019-11-22 13:56:07,264 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:56:07" (1/1) ... [2019-11-22 13:56:07,304 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:56:07" (1/1) ... [2019-11-22 13:56:07,312 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:56:07" (1/1) ... [2019-11-22 13:56:07,318 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:56:07" (1/1) ... [2019-11-22 13:56:07,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-22 13:56:07,335 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-22 13:56:07,335 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-22 13:56:07,335 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-22 13:56:07,336 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:56:07" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-22 13:56:07,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-22 13:56:07,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-22 13:56:07,401 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 13:56:07,401 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2019-11-22 13:56:07,401 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2019-11-22 13:56:07,401 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2019-11-22 13:56:07,402 INFO L138 BoogieDeclarations]: Found implementation of procedure freeData [2019-11-22 13:56:07,402 INFO L138 BoogieDeclarations]: Found implementation of procedure append [2019-11-22 13:56:07,403 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-22 13:56:07,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-22 13:56:07,404 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-22 13:56:07,404 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-22 13:56:07,404 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-22 13:56:07,404 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-22 13:56:07,405 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-22 13:56:07,405 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-22 13:56:07,406 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-22 13:56:07,407 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-22 13:56:07,407 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-22 13:56:07,408 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-22 13:56:07,408 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-22 13:56:07,408 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-22 13:56:07,408 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-22 13:56:07,409 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-22 13:56:07,409 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-22 13:56:07,410 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-22 13:56:07,410 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2019-11-22 13:56:07,411 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2019-11-22 13:56:07,411 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-22 13:56:07,411 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-22 13:56:07,411 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-22 13:56:07,411 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-22 13:56:07,412 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-22 13:56:07,412 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-22 13:56:07,412 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-22 13:56:07,412 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-22 13:56:07,412 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-22 13:56:07,412 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-22 13:56:07,412 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-22 13:56:07,412 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-22 13:56:07,412 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-22 13:56:07,413 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-22 13:56:07,414 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-22 13:56:07,414 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-22 13:56:07,414 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-22 13:56:07,414 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-22 13:56:07,414 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-22 13:56:07,414 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-22 13:56:07,414 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-22 13:56:07,414 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-22 13:56:07,414 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-22 13:56:07,415 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-22 13:56:07,415 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-22 13:56:07,415 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-22 13:56:07,415 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-22 13:56:07,415 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-22 13:56:07,416 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-22 13:56:07,416 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-22 13:56:07,416 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-22 13:56:07,416 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-22 13:56:07,416 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-22 13:56:07,416 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-22 13:56:07,416 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-22 13:56:07,416 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-22 13:56:07,417 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-22 13:56:07,417 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-22 13:56:07,418 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-22 13:56:07,418 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-22 13:56:07,418 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-22 13:56:07,418 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-22 13:56:07,418 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-22 13:56:07,418 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-22 13:56:07,418 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-22 13:56:07,419 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-22 13:56:07,419 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-22 13:56:07,419 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-22 13:56:07,419 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-22 13:56:07,419 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-22 13:56:07,419 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-22 13:56:07,419 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-22 13:56:07,420 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-22 13:56:07,420 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-22 13:56:07,420 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-22 13:56:07,420 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-22 13:56:07,420 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-22 13:56:07,420 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-22 13:56:07,420 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-22 13:56:07,420 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-22 13:56:07,421 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-22 13:56:07,421 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-22 13:56:07,421 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-22 13:56:07,421 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-22 13:56:07,421 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-22 13:56:07,421 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-22 13:56:07,421 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-22 13:56:07,421 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-22 13:56:07,421 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-22 13:56:07,422 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-22 13:56:07,422 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-22 13:56:07,422 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-22 13:56:07,422 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-22 13:56:07,422 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-22 13:56:07,422 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-22 13:56:07,422 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-22 13:56:07,422 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-22 13:56:07,422 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-22 13:56:07,423 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-22 13:56:07,423 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-22 13:56:07,423 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-22 13:56:07,423 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-22 13:56:07,423 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-22 13:56:07,423 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-22 13:56:07,423 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-22 13:56:07,423 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-22 13:56:07,423 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-22 13:56:07,424 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-22 13:56:07,424 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2019-11-22 13:56:07,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-22 13:56:07,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-22 13:56:07,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-22 13:56:07,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-22 13:56:07,426 INFO L130 BoogieDeclarations]: Found specification of procedure freeData [2019-11-22 13:56:07,426 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-22 13:56:07,426 INFO L130 BoogieDeclarations]: Found specification of procedure append [2019-11-22 13:56:07,426 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-22 13:56:07,426 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-22 13:56:07,426 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-22 13:56:07,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-22 13:56:07,427 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-22 13:56:07,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.setCurrentRoundingMode [2019-11-22 13:56:07,431 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-22 13:56:08,293 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-22 13:56:08,294 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-22 13:56:08,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:56:08 BoogieIcfgContainer [2019-11-22 13:56:08,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-22 13:56:08,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-22 13:56:08,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-22 13:56:08,300 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-22 13:56:08,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:56:06" (1/3) ... [2019-11-22 13:56:08,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b22a2c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:56:08, skipping insertion in model container [2019-11-22 13:56:08,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:56:07" (2/3) ... [2019-11-22 13:56:08,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b22a2c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:56:08, skipping insertion in model container [2019-11-22 13:56:08,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:56:08" (3/3) ... [2019-11-22 13:56:08,306 INFO L109 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-1.i [2019-11-22 13:56:08,317 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-22 13:56:08,326 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 46 error locations. [2019-11-22 13:56:08,337 INFO L249 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2019-11-22 13:56:08,359 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-22 13:56:08,359 INFO L374 AbstractCegarLoop]: Hoare is false [2019-11-22 13:56:08,359 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-22 13:56:08,360 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-22 13:56:08,360 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-22 13:56:08,360 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-22 13:56:08,360 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-22 13:56:08,360 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-22 13:56:08,386 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-11-22 13:56:08,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-22 13:56:08,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:56:08,398 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:56:08,399 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-22 13:56:08,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:56:08,405 INFO L82 PathProgramCache]: Analyzing trace with hash -13807983, now seen corresponding path program 1 times [2019-11-22 13:56:08,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 13:56:08,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [375158291] [2019-11-22 13:56:08,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:56:08,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:08,614 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-22 13:56:08,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:56:08,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:08,637 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 13:56:08,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:08,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [375158291] [2019-11-22 13:56:08,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:56:08,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-22 13:56:08,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78749686] [2019-11-22 13:56:08,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-22 13:56:08,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 13:56:08,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-22 13:56:08,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-22 13:56:08,675 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 2 states. [2019-11-22 13:56:08,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:56:08,698 INFO L93 Difference]: Finished difference Result 110 states and 116 transitions. [2019-11-22 13:56:08,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-22 13:56:08,699 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-22 13:56:08,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:56:08,710 INFO L225 Difference]: With dead ends: 110 [2019-11-22 13:56:08,710 INFO L226 Difference]: Without dead ends: 107 [2019-11-22 13:56:08,712 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-22 13:56:08,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-22 13:56:08,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-22 13:56:08,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-22 13:56:08,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2019-11-22 13:56:08,758 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 8 [2019-11-22 13:56:08,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:56:08,758 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2019-11-22 13:56:08,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-22 13:56:08,759 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2019-11-22 13:56:08,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 13:56:08,759 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:56:08,760 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:56:08,964 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:56:08,965 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-22 13:56:08,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:56:08,966 INFO L82 PathProgramCache]: Analyzing trace with hash -427980567, now seen corresponding path program 1 times [2019-11-22 13:56:08,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 13:56:08,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [589019290] [2019-11-22 13:56:08,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:56:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:09,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-22 13:56:09,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:56:09,205 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 13:56:09,206 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:09,218 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:09,219 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:56:09,219 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 13:56:09,268 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:09,271 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 14 treesize of output 16 [2019-11-22 13:56:09,272 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:09,290 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:09,291 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 13:56:09,292 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:17 [2019-11-22 13:56:09,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:09,316 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 13:56:09,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:09,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [589019290] [2019-11-22 13:56:09,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:56:09,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 13:56:09,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318718413] [2019-11-22 13:56:09,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 13:56:09,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 13:56:09,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 13:56:09,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-22 13:56:09,405 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 8 states. [2019-11-22 13:56:10,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:56:10,568 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2019-11-22 13:56:10,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-22 13:56:10,570 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-22 13:56:10,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:56:10,574 INFO L225 Difference]: With dead ends: 119 [2019-11-22 13:56:10,575 INFO L226 Difference]: Without dead ends: 119 [2019-11-22 13:56:10,575 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-22 13:56:10,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-22 13:56:10,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 110. [2019-11-22 13:56:10,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-22 13:56:10,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 118 transitions. [2019-11-22 13:56:10,592 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 118 transitions. Word has length 9 [2019-11-22 13:56:10,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:56:10,593 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 118 transitions. [2019-11-22 13:56:10,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 13:56:10,593 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 118 transitions. [2019-11-22 13:56:10,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-22 13:56:10,594 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:56:10,594 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:56:10,806 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:56:10,808 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-22 13:56:10,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:56:10,809 INFO L82 PathProgramCache]: Analyzing trace with hash -427980566, now seen corresponding path program 1 times [2019-11-22 13:56:10,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 13:56:10,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2103429063] [2019-11-22 13:56:10,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:56:11,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:11,043 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 13:56:11,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:56:11,054 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 13:56:11,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:11,064 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:11,065 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:56:11,065 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-22 13:56:11,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:11,115 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 14 treesize of output 16 [2019-11-22 13:56:11,116 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:11,138 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:11,139 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 13:56:11,139 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:22 [2019-11-22 13:56:11,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:11,163 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 13:56:11,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:11,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:11,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2103429063] [2019-11-22 13:56:11,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:56:11,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-11-22 13:56:11,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810029040] [2019-11-22 13:56:11,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-22 13:56:11,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 13:56:11,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-22 13:56:11,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-22 13:56:11,431 INFO L87 Difference]: Start difference. First operand 110 states and 118 transitions. Second operand 8 states. [2019-11-22 13:56:12,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:56:12,574 INFO L93 Difference]: Finished difference Result 115 states and 123 transitions. [2019-11-22 13:56:12,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 13:56:12,574 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-11-22 13:56:12,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:56:12,576 INFO L225 Difference]: With dead ends: 115 [2019-11-22 13:56:12,576 INFO L226 Difference]: Without dead ends: 115 [2019-11-22 13:56:12,577 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-22 13:56:12,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-22 13:56:12,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2019-11-22 13:56:12,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-11-22 13:56:12,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 117 transitions. [2019-11-22 13:56:12,589 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 117 transitions. Word has length 9 [2019-11-22 13:56:12,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:56:12,589 INFO L462 AbstractCegarLoop]: Abstraction has 110 states and 117 transitions. [2019-11-22 13:56:12,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-22 13:56:12,590 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 117 transitions. [2019-11-22 13:56:12,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 13:56:12,590 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:56:12,590 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:56:12,793 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:56:12,794 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-22 13:56:12,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:56:12,794 INFO L82 PathProgramCache]: Analyzing trace with hash -382495554, now seen corresponding path program 1 times [2019-11-22 13:56:12,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 13:56:12,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1954616325] [2019-11-22 13:56:12,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:56:12,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:12,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 13:56:12,971 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:56:12,978 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 13:56:12,979 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:12,983 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:12,983 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:56:12,984 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-22 13:56:13,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:13,013 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 13:56:13,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-22 13:56:13,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1954616325] [2019-11-22 13:56:13,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:56:13,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 3] imperfect sequences [] total 3 [2019-11-22 13:56:13,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817558465] [2019-11-22 13:56:13,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 13:56:13,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 13:56:13,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 13:56:13,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 13:56:13,047 INFO L87 Difference]: Start difference. First operand 110 states and 117 transitions. Second operand 4 states. [2019-11-22 13:56:13,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:56:13,283 INFO L93 Difference]: Finished difference Result 109 states and 116 transitions. [2019-11-22 13:56:13,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 13:56:13,284 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-22 13:56:13,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:56:13,285 INFO L225 Difference]: With dead ends: 109 [2019-11-22 13:56:13,285 INFO L226 Difference]: Without dead ends: 109 [2019-11-22 13:56:13,286 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 13:56:13,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2019-11-22 13:56:13,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2019-11-22 13:56:13,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2019-11-22 13:56:13,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2019-11-22 13:56:13,309 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 10 [2019-11-22 13:56:13,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:56:13,310 INFO L462 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2019-11-22 13:56:13,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 13:56:13,310 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2019-11-22 13:56:13,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-22 13:56:13,310 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:56:13,310 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:56:13,516 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:56:13,516 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-22 13:56:13,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:56:13,517 INFO L82 PathProgramCache]: Analyzing trace with hash -382495553, now seen corresponding path program 1 times [2019-11-22 13:56:13,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 13:56:13,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [555518728] [2019-11-22 13:56:13,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:56:13,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:13,700 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 13:56:13,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:56:13,709 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 13:56:13,709 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:13,718 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:13,718 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:56:13,719 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 13:56:13,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:13,730 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 13:56:13,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:13,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [555518728] [2019-11-22 13:56:13,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:56:13,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-22 13:56:13,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173228505] [2019-11-22 13:56:13,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 13:56:13,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 13:56:13,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 13:56:13,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 13:56:13,800 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand 4 states. [2019-11-22 13:56:14,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:56:14,062 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2019-11-22 13:56:14,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 13:56:14,062 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-22 13:56:14,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:56:14,063 INFO L225 Difference]: With dead ends: 108 [2019-11-22 13:56:14,064 INFO L226 Difference]: Without dead ends: 108 [2019-11-22 13:56:14,064 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-22 13:56:14,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-22 13:56:14,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-11-22 13:56:14,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-11-22 13:56:14,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 115 transitions. [2019-11-22 13:56:14,081 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 115 transitions. Word has length 10 [2019-11-22 13:56:14,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:56:14,081 INFO L462 AbstractCegarLoop]: Abstraction has 108 states and 115 transitions. [2019-11-22 13:56:14,081 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 13:56:14,081 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 115 transitions. [2019-11-22 13:56:14,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-22 13:56:14,082 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:56:14,084 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:56:14,284 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:56:14,286 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-22 13:56:14,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:56:14,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1207846002, now seen corresponding path program 1 times [2019-11-22 13:56:14,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 13:56:14,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1377934753] [2019-11-22 13:56:14,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:56:14,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:14,466 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 13:56:14,468 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:56:14,477 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 13:56:14,477 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:14,479 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:14,479 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:56:14,479 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-22 13:56:14,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:14,488 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 13:56:14,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:14,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1377934753] [2019-11-22 13:56:14,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:56:14,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-22 13:56:14,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867009018] [2019-11-22 13:56:14,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-22 13:56:14,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 13:56:14,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-22 13:56:14,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-22 13:56:14,500 INFO L87 Difference]: Start difference. First operand 108 states and 115 transitions. Second operand 3 states. [2019-11-22 13:56:14,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:56:14,641 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2019-11-22 13:56:14,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-22 13:56:14,641 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-22 13:56:14,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:56:14,642 INFO L225 Difference]: With dead ends: 106 [2019-11-22 13:56:14,642 INFO L226 Difference]: Without dead ends: 106 [2019-11-22 13:56:14,643 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-22 13:56:14,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-11-22 13:56:14,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 104. [2019-11-22 13:56:14,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-22 13:56:14,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2019-11-22 13:56:14,649 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 15 [2019-11-22 13:56:14,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:56:14,649 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2019-11-22 13:56:14,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-22 13:56:14,649 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2019-11-22 13:56:14,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-22 13:56:14,650 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:56:14,650 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:56:14,852 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:56:14,854 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-22 13:56:14,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:56:14,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1207846001, now seen corresponding path program 1 times [2019-11-22 13:56:14,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 13:56:14,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2122835098] [2019-11-22 13:56:14,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:56:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:15,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 13:56:15,055 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:56:15,065 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 13:56:15,065 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:15,069 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:15,069 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:56:15,070 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 13:56:15,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:15,077 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 13:56:15,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:15,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2122835098] [2019-11-22 13:56:15,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:56:15,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-11-22 13:56:15,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835166453] [2019-11-22 13:56:15,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 13:56:15,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 13:56:15,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 13:56:15,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 13:56:15,119 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 4 states. [2019-11-22 13:56:15,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:56:15,376 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2019-11-22 13:56:15,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 13:56:15,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-22 13:56:15,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:56:15,379 INFO L225 Difference]: With dead ends: 107 [2019-11-22 13:56:15,379 INFO L226 Difference]: Without dead ends: 107 [2019-11-22 13:56:15,379 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-22 13:56:15,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-22 13:56:15,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 102. [2019-11-22 13:56:15,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-11-22 13:56:15,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 109 transitions. [2019-11-22 13:56:15,387 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 109 transitions. Word has length 15 [2019-11-22 13:56:15,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:56:15,387 INFO L462 AbstractCegarLoop]: Abstraction has 102 states and 109 transitions. [2019-11-22 13:56:15,387 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 13:56:15,387 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 109 transitions. [2019-11-22 13:56:15,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-22 13:56:15,388 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:56:15,388 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:56:15,590 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:56:15,591 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-22 13:56:15,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:56:15,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1211461638, now seen corresponding path program 1 times [2019-11-22 13:56:15,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 13:56:15,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [150673431] [2019-11-22 13:56:15,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:56:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:15,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-22 13:56:15,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:56:15,789 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 13:56:15,790 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:15,791 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:15,791 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:56:15,792 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-22 13:56:15,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:15,821 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 13:56:15,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:15,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [150673431] [2019-11-22 13:56:15,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:56:15,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 4] imperfect sequences [] total 5 [2019-11-22 13:56:15,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844722728] [2019-11-22 13:56:15,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 13:56:15,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 13:56:15,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 13:56:15,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-22 13:56:15,882 INFO L87 Difference]: Start difference. First operand 102 states and 109 transitions. Second operand 6 states. [2019-11-22 13:56:16,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:56:16,327 INFO L93 Difference]: Finished difference Result 140 states and 150 transitions. [2019-11-22 13:56:16,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 13:56:16,328 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-22 13:56:16,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:56:16,329 INFO L225 Difference]: With dead ends: 140 [2019-11-22 13:56:16,329 INFO L226 Difference]: Without dead ends: 140 [2019-11-22 13:56:16,330 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-22 13:56:16,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-22 13:56:16,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 101. [2019-11-22 13:56:16,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-11-22 13:56:16,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2019-11-22 13:56:16,336 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 16 [2019-11-22 13:56:16,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:56:16,336 INFO L462 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2019-11-22 13:56:16,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 13:56:16,336 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2019-11-22 13:56:16,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-22 13:56:16,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:56:16,337 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:56:16,539 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:56:16,540 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-22 13:56:16,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:56:16,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1211461639, now seen corresponding path program 1 times [2019-11-22 13:56:16,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 13:56:16,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [85125546] [2019-11-22 13:56:16,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:56:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:16,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-22 13:56:16,745 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:56:16,752 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 13:56:16,752 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:16,780 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:16,780 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:56:16,780 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 13:56:16,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:16,815 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 13:56:16,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:16,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:16,895 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [85125546] [2019-11-22 13:56:16,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:56:16,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2019-11-22 13:56:16,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135142431] [2019-11-22 13:56:16,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-22 13:56:16,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 13:56:16,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-22 13:56:16,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-22 13:56:16,896 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand 6 states. [2019-11-22 13:56:17,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:56:17,586 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2019-11-22 13:56:17,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 13:56:17,587 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-22 13:56:17,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:56:17,588 INFO L225 Difference]: With dead ends: 110 [2019-11-22 13:56:17,588 INFO L226 Difference]: Without dead ends: 110 [2019-11-22 13:56:17,589 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-22 13:56:17,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-11-22 13:56:17,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 104. [2019-11-22 13:56:17,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-11-22 13:56:17,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 111 transitions. [2019-11-22 13:56:17,594 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 111 transitions. Word has length 16 [2019-11-22 13:56:17,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:56:17,594 INFO L462 AbstractCegarLoop]: Abstraction has 104 states and 111 transitions. [2019-11-22 13:56:17,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-22 13:56:17,594 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 111 transitions. [2019-11-22 13:56:17,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 13:56:17,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:56:17,595 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-22 13:56:17,803 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:56:17,804 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-22 13:56:17,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:56:17,805 INFO L82 PathProgramCache]: Analyzing trace with hash 278501480, now seen corresponding path program 1 times [2019-11-22 13:56:17,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 13:56:17,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2137231346] [2019-11-22 13:56:17,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:56:18,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:18,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 13:56:18,029 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:56:18,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:18,087 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 13:56:18,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:18,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:18,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2137231346] [2019-11-22 13:56:18,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:56:18,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-22 13:56:18,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933203331] [2019-11-22 13:56:18,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 13:56:18,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 13:56:18,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 13:56:18,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-22 13:56:18,153 INFO L87 Difference]: Start difference. First operand 104 states and 111 transitions. Second operand 5 states. [2019-11-22 13:56:18,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:56:18,618 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2019-11-22 13:56:18,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 13:56:18,618 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-22 13:56:18,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:56:18,619 INFO L225 Difference]: With dead ends: 107 [2019-11-22 13:56:18,619 INFO L226 Difference]: Without dead ends: 107 [2019-11-22 13:56:18,620 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-22 13:56:18,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-22 13:56:18,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2019-11-22 13:56:18,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-11-22 13:56:18,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 114 transitions. [2019-11-22 13:56:18,625 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 114 transitions. Word has length 18 [2019-11-22 13:56:18,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:56:18,626 INFO L462 AbstractCegarLoop]: Abstraction has 106 states and 114 transitions. [2019-11-22 13:56:18,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 13:56:18,626 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 114 transitions. [2019-11-22 13:56:18,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 13:56:18,626 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:56:18,627 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-22 13:56:18,830 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:56:18,831 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-22 13:56:18,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:56:18,832 INFO L82 PathProgramCache]: Analyzing trace with hash 278501479, now seen corresponding path program 1 times [2019-11-22 13:56:18,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 13:56:18,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [105055278] [2019-11-22 13:56:18,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:56:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:19,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-22 13:56:19,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:56:19,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-22 13:56:19,044 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 13:56:19,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:19,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [105055278] [2019-11-22 13:56:19,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:56:19,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-22 13:56:19,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465349413] [2019-11-22 13:56:19,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 13:56:19,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 13:56:19,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 13:56:19,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-22 13:56:19,082 INFO L87 Difference]: Start difference. First operand 106 states and 114 transitions. Second operand 5 states. [2019-11-22 13:56:19,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:56:19,472 INFO L93 Difference]: Finished difference Result 142 states and 152 transitions. [2019-11-22 13:56:19,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 13:56:19,474 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2019-11-22 13:56:19,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:56:19,476 INFO L225 Difference]: With dead ends: 142 [2019-11-22 13:56:19,476 INFO L226 Difference]: Without dead ends: 142 [2019-11-22 13:56:19,476 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-22 13:56:19,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2019-11-22 13:56:19,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 105. [2019-11-22 13:56:19,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-22 13:56:19,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 112 transitions. [2019-11-22 13:56:19,480 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 112 transitions. Word has length 18 [2019-11-22 13:56:19,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:56:19,481 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 112 transitions. [2019-11-22 13:56:19,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 13:56:19,481 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 112 transitions. [2019-11-22 13:56:19,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-22 13:56:19,482 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:56:19,482 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-22 13:56:19,682 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:56:19,683 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-22 13:56:19,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:56:19,684 INFO L82 PathProgramCache]: Analyzing trace with hash 271010156, now seen corresponding path program 1 times [2019-11-22 13:56:19,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 13:56:19,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1713700862] [2019-11-22 13:56:19,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:56:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:19,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-22 13:56:19,884 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:56:19,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:19,891 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 13:56:19,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:19,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1713700862] [2019-11-22 13:56:19,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:56:19,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-22 13:56:19,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170025857] [2019-11-22 13:56:19,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-22 13:56:19,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 13:56:19,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-22 13:56:19,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-22 13:56:19,904 INFO L87 Difference]: Start difference. First operand 105 states and 112 transitions. Second operand 4 states. [2019-11-22 13:56:19,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:56:19,980 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2019-11-22 13:56:19,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-22 13:56:19,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-22 13:56:19,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:56:19,982 INFO L225 Difference]: With dead ends: 113 [2019-11-22 13:56:19,982 INFO L226 Difference]: Without dead ends: 113 [2019-11-22 13:56:19,983 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-22 13:56:19,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-22 13:56:19,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2019-11-22 13:56:19,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-22 13:56:19,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 120 transitions. [2019-11-22 13:56:19,987 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 120 transitions. Word has length 18 [2019-11-22 13:56:19,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:56:19,988 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 120 transitions. [2019-11-22 13:56:19,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-22 13:56:19,988 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 120 transitions. [2019-11-22 13:56:19,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 13:56:19,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:56:19,989 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:56:20,191 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:56:20,192 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-22 13:56:20,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:56:20,193 INFO L82 PathProgramCache]: Analyzing trace with hash -188618374, now seen corresponding path program 1 times [2019-11-22 13:56:20,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 13:56:20,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [490564909] [2019-11-22 13:56:20,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:56:20,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:20,555 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-22 13:56:20,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:56:20,572 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 13:56:20,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:20,580 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:20,581 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:56:20,581 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 13:56:20,605 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-22 13:56:20,606 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:20,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:20,638 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-22 13:56:20,638 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:20,658 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:20,659 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:56:20,660 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:21 [2019-11-22 13:56:20,726 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 21 treesize of output 9 [2019-11-22 13:56:20,727 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:20,746 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:20,752 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-22 13:56:20,752 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:20,762 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:20,762 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:56:20,762 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:42, output treesize:12 [2019-11-22 13:56:20,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:20,792 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 13:56:21,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:21,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [490564909] [2019-11-22 13:56:21,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:56:21,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-22 13:56:21,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132775871] [2019-11-22 13:56:21,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 13:56:21,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 13:56:21,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 13:56:21,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-22 13:56:21,188 INFO L87 Difference]: Start difference. First operand 111 states and 120 transitions. Second operand 10 states. [2019-11-22 13:56:21,992 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 37 [2019-11-22 13:56:22,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:56:22,842 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2019-11-22 13:56:22,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-22 13:56:22,843 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2019-11-22 13:56:22,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:56:22,844 INFO L225 Difference]: With dead ends: 120 [2019-11-22 13:56:22,844 INFO L226 Difference]: Without dead ends: 120 [2019-11-22 13:56:22,844 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2019-11-22 13:56:22,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2019-11-22 13:56:22,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2019-11-22 13:56:22,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-11-22 13:56:22,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2019-11-22 13:56:22,849 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 19 [2019-11-22 13:56:22,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:56:22,849 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2019-11-22 13:56:22,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 13:56:22,850 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2019-11-22 13:56:22,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-22 13:56:22,850 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:56:22,851 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-22 13:56:23,053 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:56:23,054 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-22 13:56:23,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:56:23,055 INFO L82 PathProgramCache]: Analyzing trace with hash -188618375, now seen corresponding path program 1 times [2019-11-22 13:56:23,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 13:56:23,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [27944254] [2019-11-22 13:56:23,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:56:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:23,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 13:56:23,265 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:56:23,273 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 13:56:23,273 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:23,274 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:23,275 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:56:23,275 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2019-11-22 13:56:23,284 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-22 13:56:23,284 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:23,293 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:23,294 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:56:23,294 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:19, output treesize:13 [2019-11-22 13:56:23,312 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-22 13:56:23,312 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:23,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:23,315 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:56:23,315 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:7 [2019-11-22 13:56:23,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:23,325 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 13:56:23,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:23,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [27944254] [2019-11-22 13:56:23,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:56:23,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-22 13:56:23,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544229151] [2019-11-22 13:56:23,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 13:56:23,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 13:56:23,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 13:56:23,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-22 13:56:23,342 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand 5 states. [2019-11-22 13:56:23,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:56:23,751 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2019-11-22 13:56:23,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-22 13:56:23,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-11-22 13:56:23,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:56:23,753 INFO L225 Difference]: With dead ends: 115 [2019-11-22 13:56:23,753 INFO L226 Difference]: Without dead ends: 115 [2019-11-22 13:56:23,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-22 13:56:23,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2019-11-22 13:56:23,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2019-11-22 13:56:23,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-22 13:56:23,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2019-11-22 13:56:23,759 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 19 [2019-11-22 13:56:23,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:56:23,759 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2019-11-22 13:56:23,759 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 13:56:23,760 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2019-11-22 13:56:23,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-22 13:56:23,761 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:56:23,761 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-22 13:56:23,964 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:56:23,964 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-22 13:56:23,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:56:23,965 INFO L82 PathProgramCache]: Analyzing trace with hash 818029954, now seen corresponding path program 1 times [2019-11-22 13:56:23,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 13:56:23,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [206390106] [2019-11-22 13:56:23,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:56:24,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:56:24,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-22 13:56:24,223 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:56:24,234 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 13:56:24,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:24,245 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:24,256 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 13:56:24,257 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:24,265 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:24,266 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:56:24,266 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2019-11-22 13:56:24,326 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:24,328 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-22 13:56:24,328 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:24,342 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:24,348 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:56:24,349 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 11 treesize of output 7 [2019-11-22 13:56:24,350 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-22 13:56:24,359 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:56:24,359 INFO L496 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-22 13:56:24,360 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:25, output treesize:16 [2019-11-22 13:56:24,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:24,385 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 13:56:24,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:24,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:24,565 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:24,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:28,805 WARN L192 SmtUtils]: Spent 1.89 s on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2019-11-22 13:56:28,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:56:31,201 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-11-22 13:56:31,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:56:31,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [206390106] [2019-11-22 13:56:31,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:56:31,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-22 13:56:31,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98747834] [2019-11-22 13:56:31,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 13:56:31,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 13:56:31,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 13:56:31,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=66, Unknown=1, NotChecked=0, Total=90 [2019-11-22 13:56:31,413 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 10 states. [2019-11-22 13:56:38,086 WARN L192 SmtUtils]: Spent 2.44 s on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-11-22 13:56:52,543 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2019-11-22 13:57:08,779 WARN L192 SmtUtils]: Spent 934.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2019-11-22 13:57:41,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:57:41,141 INFO L93 Difference]: Finished difference Result 131 states and 140 transitions. [2019-11-22 13:57:41,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-22 13:57:41,147 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-22 13:57:41,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:57:41,149 INFO L225 Difference]: With dead ends: 131 [2019-11-22 13:57:41,149 INFO L226 Difference]: Without dead ends: 131 [2019-11-22 13:57:41,149 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 23.9s TimeCoverageRelationStatistics Valid=55, Invalid=148, Unknown=7, NotChecked=0, Total=210 [2019-11-22 13:57:41,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-22 13:57:41,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 116. [2019-11-22 13:57:41,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-22 13:57:41,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 123 transitions. [2019-11-22 13:57:41,154 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 123 transitions. Word has length 20 [2019-11-22 13:57:41,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:57:41,155 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 123 transitions. [2019-11-22 13:57:41,155 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 13:57:41,155 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2019-11-22 13:57:41,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-22 13:57:41,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:57:41,156 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-22 13:57:41,358 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:57:41,359 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-22 13:57:41,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:57:41,359 INFO L82 PathProgramCache]: Analyzing trace with hash 2147358802, now seen corresponding path program 1 times [2019-11-22 13:57:41,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 13:57:41,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [1873454269] [2019-11-22 13:57:41,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:57:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:41,558 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-22 13:57:41,559 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:57:41,571 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 5 treesize of output 3 [2019-11-22 13:57:41,572 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:41,573 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:41,574 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:57:41,574 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:9, output treesize:3 [2019-11-22 13:57:41,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:57:41,587 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 13:57:41,662 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:41,663 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-22 13:57:41,663 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:41,664 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:41,672 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:41,672 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:57:41,672 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:3 [2019-11-22 13:57:41,688 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 6 treesize of output 4 [2019-11-22 13:57:41,688 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:41,692 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:41,692 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:57:41,692 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:3 [2019-11-22 13:57:41,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:57:41,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1873454269] [2019-11-22 13:57:41,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:57:41,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-22 13:57:41,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043412275] [2019-11-22 13:57:41,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-22 13:57:41,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 13:57:41,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-22 13:57:41,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-22 13:57:41,699 INFO L87 Difference]: Start difference. First operand 116 states and 123 transitions. Second operand 5 states. [2019-11-22 13:57:41,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:57:41,973 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2019-11-22 13:57:41,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 13:57:41,974 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-22 13:57:41,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:57:41,976 INFO L225 Difference]: With dead ends: 112 [2019-11-22 13:57:41,976 INFO L226 Difference]: Without dead ends: 112 [2019-11-22 13:57:41,976 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-22 13:57:41,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-11-22 13:57:41,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2019-11-22 13:57:41,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-11-22 13:57:41,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 119 transitions. [2019-11-22 13:57:41,982 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 119 transitions. Word has length 22 [2019-11-22 13:57:41,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:57:41,983 INFO L462 AbstractCegarLoop]: Abstraction has 112 states and 119 transitions. [2019-11-22 13:57:41,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-22 13:57:41,983 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 119 transitions. [2019-11-22 13:57:41,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-22 13:57:41,985 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:57:41,985 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-22 13:57:42,187 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:57:42,188 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-22 13:57:42,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:57:42,189 INFO L82 PathProgramCache]: Analyzing trace with hash 2147358803, now seen corresponding path program 1 times [2019-11-22 13:57:42,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 13:57:42,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [273503528] [2019-11-22 13:57:42,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:57:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:42,395 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-22 13:57:42,396 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:57:42,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:57:42,448 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 13:57:42,567 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:42,574 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-22 13:57:42,574 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-22 13:57:42,591 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:42,591 INFO L496 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-22 13:57:42,591 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:12 [2019-11-22 13:57:42,733 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:42,734 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-22 13:57:42,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:42,735 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:42,736 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 13:57:42,799 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:42,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:42,800 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 13:57:42,800 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:26 [2019-11-22 13:57:42,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:42,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:43,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:43,158 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:43,282 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:43,433 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:43,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:43,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-22 13:57:43,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [273503528] [2019-11-22 13:57:43,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:57:43,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 9 [2019-11-22 13:57:43,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060454059] [2019-11-22 13:57:43,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-22 13:57:43,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 13:57:43,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-22 13:57:43,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-11-22 13:57:43,682 INFO L87 Difference]: Start difference. First operand 112 states and 119 transitions. Second operand 10 states. [2019-11-22 13:57:44,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 13:57:44,133 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2019-11-22 13:57:44,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-22 13:57:44,134 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-11-22 13:57:44,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 13:57:44,135 INFO L225 Difference]: With dead ends: 107 [2019-11-22 13:57:44,136 INFO L226 Difference]: Without dead ends: 107 [2019-11-22 13:57:44,136 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-22 13:57:44,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-22 13:57:44,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2019-11-22 13:57:44,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2019-11-22 13:57:44,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 114 transitions. [2019-11-22 13:57:44,140 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 114 transitions. Word has length 22 [2019-11-22 13:57:44,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 13:57:44,140 INFO L462 AbstractCegarLoop]: Abstraction has 107 states and 114 transitions. [2019-11-22 13:57:44,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-22 13:57:44,140 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 114 transitions. [2019-11-22 13:57:44,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-22 13:57:44,141 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 13:57:44,141 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-22 13:57:44,344 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:57:44,344 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-22 13:57:44,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 13:57:44,345 INFO L82 PathProgramCache]: Analyzing trace with hash 147774243, now seen corresponding path program 1 times [2019-11-22 13:57:44,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 13:57:44,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [2142472168] [2019-11-22 13:57:44,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 13:57:44,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 13:57:44,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-22 13:57:44,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 13:57:44,622 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 13:57:44,622 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:44,629 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:44,629 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 13:57:44,629 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2019-11-22 13:57:44,671 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:44,672 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-22 13:57:44,673 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:44,693 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:44,693 INFO L496 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-22 13:57:44,694 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:18, output treesize:19 [2019-11-22 13:57:44,793 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:44,794 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 22 treesize of output 16 [2019-11-22 13:57:44,795 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:44,821 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:44,823 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 13:57:44,823 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:36, output treesize:10 [2019-11-22 13:57:44,959 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:44,967 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 13:57:44,988 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 13:57:44,988 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 43 [2019-11-22 13:57:44,989 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 13:57:45,126 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-11-22 13:57:45,126 INFO L567 ElimStorePlain]: treesize reduction 10, result has 82.1 percent of original size [2019-11-22 13:57:45,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:45,128 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-11-22 13:57:45,129 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:43, output treesize:46 [2019-11-22 13:57:45,129 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:45,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:45,428 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:45,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:57:45,799 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 13:57:45,912 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:46,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:46,048 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:46,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:48,216 WARN L192 SmtUtils]: Spent 1.45 s on a formula simplification. DAG size of input: 32 DAG size of output: 26 [2019-11-22 13:57:48,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:52,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 13:57:52,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-22 13:57:52,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2142472168] [2019-11-22 13:57:52,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-22 13:57:52,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 15 [2019-11-22 13:57:52,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349193651] [2019-11-22 13:57:52,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-22 13:57:52,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-22 13:57:52,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-22 13:57:52,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-11-22 13:57:52,526 INFO L87 Difference]: Start difference. First operand 107 states and 114 transitions. Second operand 16 states. [2019-11-22 13:58:18,084 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-11-22 13:58:27,727 WARN L192 SmtUtils]: Spent 7.18 s on a formula simplification. DAG size of input: 33 DAG size of output: 30 [2019-11-22 13:58:40,560 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2019-11-22 14:00:25,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-22 14:00:25,135 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2019-11-22 14:00:25,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-22 14:00:25,136 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-11-22 14:00:25,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-22 14:00:25,138 INFO L225 Difference]: With dead ends: 137 [2019-11-22 14:00:25,138 INFO L226 Difference]: Without dead ends: 137 [2019-11-22 14:00:25,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 25 SyntacticMatches, 4 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 16.6s TimeCoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2019-11-22 14:00:25,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-22 14:00:25,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 124. [2019-11-22 14:00:25,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-11-22 14:00:25,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2019-11-22 14:00:25,145 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 22 [2019-11-22 14:00:25,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-22 14:00:25,146 INFO L462 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2019-11-22 14:00:25,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-22 14:00:25,146 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2019-11-22 14:00:25,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-22 14:00:25,147 INFO L402 BasicCegarLoop]: Found error trace [2019-11-22 14:00:25,147 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-22 14:00:25,350 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:00:25,350 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-22 14:00:25,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-22 14:00:25,351 INFO L82 PathProgramCache]: Analyzing trace with hash 2027630961, now seen corresponding path program 1 times [2019-11-22 14:00:25,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-22 14:00:25,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleCvc4 [962696591] [2019-11-22 14:00:25,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:00:25,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-22 14:00:25,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-22 14:00:25,607 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-22 14:00:25,612 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-11-22 14:00:25,612 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:25,624 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:25,624 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-22 14:00:25,624 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-22 14:00:25,640 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 7 treesize of output 5 [2019-11-22 14:00:25,641 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:25,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:25,656 INFO L496 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-22 14:00:25,656 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:14, output treesize:7 [2019-11-22 14:00:25,815 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:00:25,817 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 14 treesize of output 16 [2019-11-22 14:00:25,817 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:25,849 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:25,850 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-22 14:00:25,850 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:25 [2019-11-22 14:00:26,034 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:00:26,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-22 14:00:26,057 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-22 14:00:26,058 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 40 [2019-11-22 14:00:26,059 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-22 14:00:26,120 INFO L567 ElimStorePlain]: treesize reduction 14, result has 68.2 percent of original size [2019-11-22 14:00:26,121 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-22 14:00:26,121 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:30 [2019-11-22 14:00:26,180 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-22 14:00:26,180 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-22 14:00:26,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:00:26,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:00:26,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:00:26,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:00:26,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-22 14:00:27,416 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 cvc4 --incremental --print-success --lang smt --rewrite-divk [2019-11-22 14:00:27,417 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Alternating quantifiers not yet supported at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:419) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:334) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) 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) [2019-11-22 14:00:27,424 INFO L168 Benchmark]: Toolchain (without parser) took 261022.43 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 256.9 MB). Free memory was 961.7 MB in the beginning and 1.2 GB in the end (delta: -235.0 MB). Peak memory consumption was 21.9 MB. Max. memory is 11.5 GB. [2019-11-22 14:00:27,429 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 14:00:27,430 INFO L168 Benchmark]: CACSL2BoogieTranslator took 824.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. [2019-11-22 14:00:27,431 INFO L168 Benchmark]: Boogie Preprocessor took 97.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-22 14:00:27,431 INFO L168 Benchmark]: RCFGBuilder took 961.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.6 MB). Peak memory consumption was 65.6 MB. Max. memory is 11.5 GB. [2019-11-22 14:00:27,432 INFO L168 Benchmark]: TraceAbstraction took 259124.30 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 110.6 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -148.2 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-22 14:00:27,435 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 824.98 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 956.3 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 15.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 97.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 961.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.6 MB). Peak memory consumption was 65.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 259124.30 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 110.6 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -148.2 MB). There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Alternating quantifiers not yet supported de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Alternating quantifiers not yet supported: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:271) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...