./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/complex_data_creation_test01-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 20:40:18,703 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 20:40:18,705 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 20:40:18,742 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 20:40:18,747 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 20:40:18,750 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 20:40:18,752 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 20:40:18,754 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 20:40:18,756 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 20:40:18,758 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 20:40:18,761 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 20:40:18,761 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 20:40:18,762 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 20:40:18,763 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 20:40:18,765 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 20:40:18,766 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 20:40:18,768 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 20:40:18,769 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 20:40:18,770 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 20:40:18,773 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 20:40:18,777 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 20:40:18,777 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 20:40:18,778 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 20:40:18,779 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 20:40:18,780 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 20:40:18,781 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 20:40:18,782 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 20:40:18,782 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 20:40:18,783 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 20:40:18,784 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 20:40:18,784 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 20:40:18,784 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 20:40:18,785 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 20:40:18,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 20:40:18,787 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 20:40:18,787 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 20:40:18,788 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 20:40:18,788 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 20:40:18,788 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 20:40:18,789 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 20:40:18,789 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 20:40:18,790 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2021-12-18 20:40:18,809 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 20:40:18,811 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 20:40:18,811 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 20:40:18,811 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 20:40:18,812 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 20:40:18,812 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 20:40:18,813 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 20:40:18,813 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 20:40:18,813 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 20:40:18,813 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 20:40:18,814 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 20:40:18,814 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 20:40:18,814 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 20:40:18,814 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 20:40:18,815 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 20:40:18,815 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 20:40:18,815 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 20:40:18,815 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 20:40:18,815 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 20:40:18,815 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 20:40:18,815 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 20:40:18,816 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 20:40:18,816 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 20:40:18,816 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 20:40:18,816 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 20:40:18,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 20:40:18,817 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 20:40:18,818 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 20:40:18,818 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-18 20:40:18,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-18 20:40:18,818 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 20:40:18,818 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f [2021-12-18 20:40:18,997 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 20:40:19,014 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 20:40:19,016 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 20:40:19,017 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 20:40:19,018 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 20:40:19,019 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2021-12-18 20:40:19,061 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7e6f9b64/c5754de95bc949bc95487a973897d311/FLAG4aa39acbc [2021-12-18 20:40:19,506 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 20:40:19,507 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2021-12-18 20:40:19,518 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7e6f9b64/c5754de95bc949bc95487a973897d311/FLAG4aa39acbc [2021-12-18 20:40:19,527 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7e6f9b64/c5754de95bc949bc95487a973897d311 [2021-12-18 20:40:19,529 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 20:40:19,530 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 20:40:19,531 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 20:40:19,531 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 20:40:19,533 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 20:40:19,534 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:40:19" (1/1) ... [2021-12-18 20:40:19,535 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2899c5ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:40:19, skipping insertion in model container [2021-12-18 20:40:19,535 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:40:19" (1/1) ... [2021-12-18 20:40:19,539 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 20:40:19,569 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 20:40:19,791 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 20:40:19,800 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) [2021-12-18 20:40:19,801 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4ad63c47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:40:19, skipping insertion in model container [2021-12-18 20:40:19,801 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 20:40:19,802 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2021-12-18 20:40:19,803 INFO L158 Benchmark]: Toolchain (without parser) took 272.19ms. Allocated memory is still 121.6MB. Free memory was 89.5MB in the beginning and 96.3MB in the end (delta: -6.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-18 20:40:19,804 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory was 55.0MB in the beginning and 54.9MB in the end (delta: 42.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-18 20:40:19,805 INFO L158 Benchmark]: CACSL2BoogieTranslator took 270.45ms. Allocated memory is still 121.6MB. Free memory was 89.2MB in the beginning and 96.3MB in the end (delta: -7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-18 20:40:19,806 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 96.5MB. Free memory was 55.0MB in the beginning and 54.9MB in the end (delta: 42.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 270.45ms. Allocated memory is still 121.6MB. Free memory was 89.2MB in the beginning and 96.3MB in the end (delta: -7.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 556]: 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... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/complex_data_creation_test01-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-18 20:40:21,439 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-18 20:40:21,442 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-18 20:40:21,472 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-18 20:40:21,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-18 20:40:21,475 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-18 20:40:21,476 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-18 20:40:21,480 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-18 20:40:21,482 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-18 20:40:21,485 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-18 20:40:21,486 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-18 20:40:21,487 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-18 20:40:21,487 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-18 20:40:21,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-18 20:40:21,490 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-18 20:40:21,494 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-18 20:40:21,495 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-18 20:40:21,496 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-18 20:40:21,498 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-18 20:40:21,502 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-18 20:40:21,503 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-18 20:40:21,504 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-18 20:40:21,505 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-18 20:40:21,506 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-18 20:40:21,510 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-18 20:40:21,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-18 20:40:21,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-18 20:40:21,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-18 20:40:21,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-18 20:40:21,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-18 20:40:21,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-18 20:40:21,514 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-18 20:40:21,515 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-18 20:40:21,515 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-18 20:40:21,516 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-18 20:40:21,516 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-18 20:40:21,517 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-18 20:40:21,517 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-18 20:40:21,517 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-18 20:40:21,519 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-18 20:40:21,519 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-18 20:40:21,520 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2021-12-18 20:40:21,548 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-18 20:40:21,549 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-18 20:40:21,550 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-18 20:40:21,550 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-18 20:40:21,551 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-18 20:40:21,551 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-18 20:40:21,552 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-18 20:40:21,552 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-18 20:40:21,552 INFO L138 SettingsManager]: * Use SBE=true [2021-12-18 20:40:21,552 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-18 20:40:21,553 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-18 20:40:21,553 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-18 20:40:21,553 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-18 20:40:21,553 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-18 20:40:21,554 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-18 20:40:21,554 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-12-18 20:40:21,554 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-12-18 20:40:21,554 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2021-12-18 20:40:21,554 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-18 20:40:21,554 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-18 20:40:21,555 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-18 20:40:21,555 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-18 20:40:21,555 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-18 20:40:21,555 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-18 20:40:21,555 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-18 20:40:21,555 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-18 20:40:21,555 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-18 20:40:21,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 20:40:21,556 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-18 20:40:21,556 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-18 20:40:21,556 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-18 20:40:21,556 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-18 20:40:21,557 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-18 20:40:21,557 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-18 20:40:21,557 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 232b8770d72be0c69bb3b6e33b82b59b612dcbb47eb932e66c113d1f5f5b981f [2021-12-18 20:40:21,838 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-18 20:40:21,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-18 20:40:21,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-18 20:40:21,853 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-18 20:40:21,853 INFO L275 PluginConnector]: CDTParser initialized [2021-12-18 20:40:21,854 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2021-12-18 20:40:21,908 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98ffd4e6c/4eab53ac03ff4296beece98737eb89f4/FLAGdffe89539 [2021-12-18 20:40:22,322 INFO L306 CDTParser]: Found 1 translation units. [2021-12-18 20:40:22,323 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test01-2.i [2021-12-18 20:40:22,331 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98ffd4e6c/4eab53ac03ff4296beece98737eb89f4/FLAGdffe89539 [2021-12-18 20:40:22,339 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98ffd4e6c/4eab53ac03ff4296beece98737eb89f4 [2021-12-18 20:40:22,341 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-18 20:40:22,342 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-18 20:40:22,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-18 20:40:22,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-18 20:40:22,350 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-18 20:40:22,350 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:40:22" (1/1) ... [2021-12-18 20:40:22,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4582c664 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:40:22, skipping insertion in model container [2021-12-18 20:40:22,351 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 08:40:22" (1/1) ... [2021-12-18 20:40:22,356 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-18 20:40:22,381 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 20:40:22,619 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 20:40:22,636 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2021-12-18 20:40:22,640 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-18 20:40:22,670 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 20:40:22,675 INFO L203 MainTranslator]: Completed pre-run [2021-12-18 20:40:22,712 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-18 20:40:22,733 INFO L208 MainTranslator]: Completed translation [2021-12-18 20:40:22,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:40:22 WrapperNode [2021-12-18 20:40:22,734 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-18 20:40:22,735 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-18 20:40:22,735 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-18 20:40:22,735 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-18 20:40:22,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:40:22" (1/1) ... [2021-12-18 20:40:22,755 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:40:22" (1/1) ... [2021-12-18 20:40:22,771 INFO L137 Inliner]: procedures = 129, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2021-12-18 20:40:22,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-18 20:40:22,774 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-18 20:40:22,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-18 20:40:22,774 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-18 20:40:22,780 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:40:22" (1/1) ... [2021-12-18 20:40:22,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:40:22" (1/1) ... [2021-12-18 20:40:22,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:40:22" (1/1) ... [2021-12-18 20:40:22,793 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:40:22" (1/1) ... [2021-12-18 20:40:22,806 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:40:22" (1/1) ... [2021-12-18 20:40:22,809 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:40:22" (1/1) ... [2021-12-18 20:40:22,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:40:22" (1/1) ... [2021-12-18 20:40:22,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-18 20:40:22,814 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-18 20:40:22,814 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-18 20:40:22,815 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-18 20:40:22,815 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:40:22" (1/1) ... [2021-12-18 20:40:22,820 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-18 20:40:22,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:40:22,839 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-18 20:40:22,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-18 20:40:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2021-12-18 20:40:22,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-18 20:40:22,879 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2021-12-18 20:40:22,879 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2021-12-18 20:40:22,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-18 20:40:22,879 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-18 20:40:22,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-18 20:40:22,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-18 20:40:22,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-18 20:40:22,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2021-12-18 20:40:22,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-18 20:40:22,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-18 20:40:22,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-18 20:40:22,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-18 20:40:23,069 INFO L236 CfgBuilder]: Building ICFG [2021-12-18 20:40:23,070 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-18 20:40:23,753 INFO L277 CfgBuilder]: Performing block encoding [2021-12-18 20:40:23,758 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-18 20:40:23,758 INFO L301 CfgBuilder]: Removed 4 assume(true) statements. [2021-12-18 20:40:23,760 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:40:23 BoogieIcfgContainer [2021-12-18 20:40:23,760 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-18 20:40:23,761 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-18 20:40:23,761 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-18 20:40:23,763 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-18 20:40:23,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 08:40:22" (1/3) ... [2021-12-18 20:40:23,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499d1a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:40:23, skipping insertion in model container [2021-12-18 20:40:23,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 08:40:22" (2/3) ... [2021-12-18 20:40:23,764 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499d1a6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 08:40:23, skipping insertion in model container [2021-12-18 20:40:23,764 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 08:40:23" (3/3) ... [2021-12-18 20:40:23,765 INFO L111 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test01-2.i [2021-12-18 20:40:23,772 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-18 20:40:23,773 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2021-12-18 20:40:23,817 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-18 20:40:23,822 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-18 20:40:23,822 INFO L340 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2021-12-18 20:40:23,839 INFO L276 IsEmpty]: Start isEmpty. Operand has 188 states, 92 states have (on average 2.1630434782608696) internal successors, (199), 184 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 20:40:23,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-18 20:40:23,844 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:40:23,844 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-18 20:40:23,844 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-18 20:40:23,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:40:23,849 INFO L85 PathProgramCache]: Analyzing trace with hash 4835205, now seen corresponding path program 1 times [2021-12-18 20:40:23,864 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:40:23,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [970244601] [2021-12-18 20:40:23,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:40:23,866 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:40:23,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:40:23,868 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:40:23,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-18 20:40:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:40:23,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 20:40:23,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:40:24,029 INFO L388 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 [2021-12-18 20:40:24,084 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-18 20:40:24,084 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 20 [2021-12-18 20:40:24,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:40:24,100 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:40:24,100 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:40:24,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [970244601] [2021-12-18 20:40:24,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [970244601] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:40:24,101 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:40:24,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 20:40:24,103 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315324454] [2021-12-18 20:40:24,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:40:24,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 20:40:24,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:40:24,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 20:40:24,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 20:40:24,134 INFO L87 Difference]: Start difference. First operand has 188 states, 92 states have (on average 2.1630434782608696) internal successors, (199), 184 states have internal predecessors, (199), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:24,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:40:24,517 INFO L93 Difference]: Finished difference Result 208 states and 220 transitions. [2021-12-18 20:40:24,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 20:40:24,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-12-18 20:40:24,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:40:24,525 INFO L225 Difference]: With dead ends: 208 [2021-12-18 20:40:24,525 INFO L226 Difference]: Without dead ends: 206 [2021-12-18 20:40:24,526 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:40:24,529 INFO L933 BasicCegarLoop]: 155 mSDtfsCounter, 149 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:40:24,532 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 288 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 20:40:24,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2021-12-18 20:40:24,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 180. [2021-12-18 20:40:24,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 91 states have (on average 2.0549450549450547) internal successors, (187), 176 states have internal predecessors, (187), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 20:40:24,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 191 transitions. [2021-12-18 20:40:24,564 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 191 transitions. Word has length 4 [2021-12-18 20:40:24,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:40:24,565 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 191 transitions. [2021-12-18 20:40:24,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:24,565 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 191 transitions. [2021-12-18 20:40:24,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-12-18 20:40:24,565 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:40:24,565 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-12-18 20:40:24,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2021-12-18 20:40:24,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:40:24,772 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-18 20:40:24,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:40:24,774 INFO L85 PathProgramCache]: Analyzing trace with hash 4835206, now seen corresponding path program 1 times [2021-12-18 20:40:24,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:40:24,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [616567463] [2021-12-18 20:40:24,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:40:24,775 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:40:24,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:40:24,780 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:40:24,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-18 20:40:24,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:40:24,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-18 20:40:24,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:40:24,864 INFO L388 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 [2021-12-18 20:40:24,869 INFO L388 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 [2021-12-18 20:40:24,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:40:24,905 INFO L388 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 [2021-12-18 20:40:24,913 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:40:24,914 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 20:40:24,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:40:24,929 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:40:24,929 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:40:24,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [616567463] [2021-12-18 20:40:24,930 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [616567463] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:40:24,930 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:40:24,930 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-18 20:40:24,931 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706447454] [2021-12-18 20:40:24,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:40:24,932 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 20:40:24,932 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:40:24,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 20:40:24,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 20:40:24,933 INFO L87 Difference]: Start difference. First operand 180 states and 191 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:25,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:40:25,386 INFO L93 Difference]: Finished difference Result 196 states and 210 transitions. [2021-12-18 20:40:25,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-18 20:40:25,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-12-18 20:40:25,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:40:25,389 INFO L225 Difference]: With dead ends: 196 [2021-12-18 20:40:25,389 INFO L226 Difference]: Without dead ends: 196 [2021-12-18 20:40:25,390 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:40:25,390 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 28 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 20:40:25,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 341 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 20:40:25,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-12-18 20:40:25,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 185. [2021-12-18 20:40:25,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 96 states have (on average 2.0208333333333335) internal successors, (194), 181 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 20:40:25,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 198 transitions. [2021-12-18 20:40:25,423 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 198 transitions. Word has length 4 [2021-12-18 20:40:25,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:40:25,423 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 198 transitions. [2021-12-18 20:40:25,423 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:25,424 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 198 transitions. [2021-12-18 20:40:25,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-18 20:40:25,424 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:40:25,424 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-18 20:40:25,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-18 20:40:25,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:40:25,625 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-18 20:40:25,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:40:25,626 INFO L85 PathProgramCache]: Analyzing trace with hash 149891462, now seen corresponding path program 1 times [2021-12-18 20:40:25,626 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:40:25,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033331867] [2021-12-18 20:40:25,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:40:25,626 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:40:25,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:40:25,629 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:40:25,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-18 20:40:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:40:25,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-18 20:40:25,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:40:25,689 INFO L388 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 [2021-12-18 20:40:25,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:40:25,696 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:40:25,696 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:40:25,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033331867] [2021-12-18 20:40:25,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033331867] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:40:25,696 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:40:25,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:40:25,697 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553744786] [2021-12-18 20:40:25,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:40:25,697 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:40:25,697 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:40:25,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:40:25,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:40:25,698 INFO L87 Difference]: Start difference. First operand 185 states and 198 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:25,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:40:25,893 INFO L93 Difference]: Finished difference Result 208 states and 221 transitions. [2021-12-18 20:40:25,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:40:25,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-18 20:40:25,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:40:25,897 INFO L225 Difference]: With dead ends: 208 [2021-12-18 20:40:25,897 INFO L226 Difference]: Without dead ends: 208 [2021-12-18 20:40:25,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:40:25,898 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 64 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:40:25,898 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 230 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 20:40:25,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2021-12-18 20:40:25,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 183. [2021-12-18 20:40:25,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 96 states have (on average 1.9895833333333333) internal successors, (191), 179 states have internal predecessors, (191), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 20:40:25,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 195 transitions. [2021-12-18 20:40:25,907 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 195 transitions. Word has length 5 [2021-12-18 20:40:25,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:40:25,913 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 195 transitions. [2021-12-18 20:40:25,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:25,914 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 195 transitions. [2021-12-18 20:40:25,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-18 20:40:25,914 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:40:25,914 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-18 20:40:25,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2021-12-18 20:40:26,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:40:26,122 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-18 20:40:26,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:40:26,123 INFO L85 PathProgramCache]: Analyzing trace with hash 149891463, now seen corresponding path program 1 times [2021-12-18 20:40:26,124 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:40:26,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [730399413] [2021-12-18 20:40:26,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:40:26,125 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:40:26,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:40:26,126 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:40:26,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-18 20:40:26,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:40:26,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 20:40:26,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:40:26,214 INFO L388 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 [2021-12-18 20:40:26,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:40:26,226 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:40:26,227 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:40:26,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [730399413] [2021-12-18 20:40:26,227 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [730399413] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:40:26,227 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:40:26,227 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:40:26,228 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83881344] [2021-12-18 20:40:26,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:40:26,228 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:40:26,229 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:40:26,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:40:26,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:40:26,230 INFO L87 Difference]: Start difference. First operand 183 states and 195 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:26,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:40:26,483 INFO L93 Difference]: Finished difference Result 181 states and 192 transitions. [2021-12-18 20:40:26,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:40:26,484 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-12-18 20:40:26,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:40:26,485 INFO L225 Difference]: With dead ends: 181 [2021-12-18 20:40:26,485 INFO L226 Difference]: Without dead ends: 181 [2021-12-18 20:40:26,485 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:40:26,486 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 11 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:40:26,486 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 271 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 20:40:26,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2021-12-18 20:40:26,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2021-12-18 20:40:26,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 96 states have (on average 1.9583333333333333) internal successors, (188), 177 states have internal predecessors, (188), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 20:40:26,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 192 transitions. [2021-12-18 20:40:26,493 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 192 transitions. Word has length 5 [2021-12-18 20:40:26,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:40:26,493 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 192 transitions. [2021-12-18 20:40:26,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:26,494 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions. [2021-12-18 20:40:26,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-12-18 20:40:26,494 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:40:26,494 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:40:26,501 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2021-12-18 20:40:26,700 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:40:26,701 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-18 20:40:26,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:40:26,701 INFO L85 PathProgramCache]: Analyzing trace with hash 370034199, now seen corresponding path program 1 times [2021-12-18 20:40:26,702 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:40:26,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1693210802] [2021-12-18 20:40:26,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:40:26,702 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:40:26,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:40:26,703 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:40:26,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-18 20:40:26,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:40:26,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core [2021-12-18 20:40:26,778 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:40:26,804 INFO L388 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 [2021-12-18 20:40:26,840 INFO L354 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2021-12-18 20:40:26,840 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 14 [2021-12-18 20:40:26,894 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:40:26,899 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2021-12-18 20:40:26,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 20:40:26,923 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2021-12-18 20:40:26,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:40:26,936 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:40:26,936 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:40:26,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1693210802] [2021-12-18 20:40:26,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1693210802] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:40:26,937 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:40:26,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-18 20:40:26,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388953039] [2021-12-18 20:40:26,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:40:26,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 20:40:26,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:40:26,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 20:40:26,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-18 20:40:26,938 INFO L87 Difference]: Start difference. First operand 181 states and 192 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:27,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:40:27,235 INFO L93 Difference]: Finished difference Result 183 states and 195 transitions. [2021-12-18 20:40:27,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 20:40:27,235 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-12-18 20:40:27,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:40:27,236 INFO L225 Difference]: With dead ends: 183 [2021-12-18 20:40:27,236 INFO L226 Difference]: Without dead ends: 183 [2021-12-18 20:40:27,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-18 20:40:27,237 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 5 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:40:27,237 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 602 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 20:40:27,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2021-12-18 20:40:27,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2021-12-18 20:40:27,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 97 states have (on average 1.9484536082474226) internal successors, (189), 178 states have internal predecessors, (189), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 20:40:27,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2021-12-18 20:40:27,243 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 10 [2021-12-18 20:40:27,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:40:27,243 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2021-12-18 20:40:27,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:27,244 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2021-12-18 20:40:27,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-12-18 20:40:27,244 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:40:27,244 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:40:27,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-18 20:40:27,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:40:27,464 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting create_dataErr0REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-18 20:40:27,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:40:27,465 INFO L85 PathProgramCache]: Analyzing trace with hash -882700124, now seen corresponding path program 1 times [2021-12-18 20:40:27,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:40:27,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [660599596] [2021-12-18 20:40:27,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:40:27,466 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:40:27,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:40:27,467 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:40:27,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2021-12-18 20:40:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:40:27,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-18 20:40:27,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:40:27,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:40:27,542 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:40:27,543 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:40:27,543 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [660599596] [2021-12-18 20:40:27,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [660599596] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:40:27,543 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:40:27,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 20:40:27,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955797055] [2021-12-18 20:40:27,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:40:27,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-18 20:40:27,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:40:27,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-18 20:40:27,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-18 20:40:27,545 INFO L87 Difference]: Start difference. First operand 182 states and 193 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:27,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:40:27,567 INFO L93 Difference]: Finished difference Result 258 states and 273 transitions. [2021-12-18 20:40:27,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-18 20:40:27,567 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-12-18 20:40:27,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:40:27,568 INFO L225 Difference]: With dead ends: 258 [2021-12-18 20:40:27,568 INFO L226 Difference]: Without dead ends: 258 [2021-12-18 20:40:27,569 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:40:27,569 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 79 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-18 20:40:27,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 545 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-18 20:40:27,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-12-18 20:40:27,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 222. [2021-12-18 20:40:27,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 136 states have (on average 1.9779411764705883) internal successors, (269), 217 states have internal predecessors, (269), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 20:40:27,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 273 transitions. [2021-12-18 20:40:27,575 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 273 transitions. Word has length 12 [2021-12-18 20:40:27,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:40:27,575 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 273 transitions. [2021-12-18 20:40:27,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:27,575 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 273 transitions. [2021-12-18 20:40:27,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-18 20:40:27,576 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:40:27,576 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:40:27,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2021-12-18 20:40:27,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:40:27,783 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr4REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-18 20:40:27,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:40:27,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1593893879, now seen corresponding path program 1 times [2021-12-18 20:40:27,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:40:27,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [418280121] [2021-12-18 20:40:27,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:40:27,784 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:40:27,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:40:27,785 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:40:27,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2021-12-18 20:40:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:40:27,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2021-12-18 20:40:27,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:40:27,859 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:40:27,866 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-18 20:40:27,866 INFO L388 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 1 case distinctions, treesize of input 9 treesize of output 14 [2021-12-18 20:40:27,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:40:27,875 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:40:27,875 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:40:27,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [418280121] [2021-12-18 20:40:27,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [418280121] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:40:27,875 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:40:27,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:40:27,876 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759111960] [2021-12-18 20:40:27,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:40:27,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:40:27,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:40:27,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:40:27,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:40:27,877 INFO L87 Difference]: Start difference. First operand 222 states and 273 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:28,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:40:28,065 INFO L93 Difference]: Finished difference Result 211 states and 249 transitions. [2021-12-18 20:40:28,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:40:28,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-18 20:40:28,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:40:28,067 INFO L225 Difference]: With dead ends: 211 [2021-12-18 20:40:28,067 INFO L226 Difference]: Without dead ends: 211 [2021-12-18 20:40:28,067 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:40:28,068 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 62 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:40:28,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 198 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 20:40:28,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2021-12-18 20:40:28,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2021-12-18 20:40:28,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 136 states have (on average 1.786764705882353) internal successors, (243), 204 states have internal predecessors, (243), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 20:40:28,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 247 transitions. [2021-12-18 20:40:28,072 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 247 transitions. Word has length 13 [2021-12-18 20:40:28,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:40:28,072 INFO L470 AbstractCegarLoop]: Abstraction has 209 states and 247 transitions. [2021-12-18 20:40:28,072 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:28,072 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 247 transitions. [2021-12-18 20:40:28,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-12-18 20:40:28,072 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:40:28,072 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:40:28,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2021-12-18 20:40:28,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:40:28,273 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr5REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-18 20:40:28,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:40:28,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1593893878, now seen corresponding path program 1 times [2021-12-18 20:40:28,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:40:28,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [11159372] [2021-12-18 20:40:28,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:40:28,274 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:40:28,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:40:28,275 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:40:28,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2021-12-18 20:40:28,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:40:28,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 20:40:28,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:40:28,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:40:28,364 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-12-18 20:40:28,368 INFO L388 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 18 treesize of output 16 [2021-12-18 20:40:28,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:40:28,385 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:40:28,386 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:40:28,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [11159372] [2021-12-18 20:40:28,386 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [11159372] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:40:28,386 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:40:28,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-18 20:40:28,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792906974] [2021-12-18 20:40:28,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:40:28,387 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-18 20:40:28,387 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:40:28,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-18 20:40:28,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:40:28,387 INFO L87 Difference]: Start difference. First operand 209 states and 247 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:28,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:40:28,597 INFO L93 Difference]: Finished difference Result 198 states and 223 transitions. [2021-12-18 20:40:28,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-18 20:40:28,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-12-18 20:40:28,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:40:28,598 INFO L225 Difference]: With dead ends: 198 [2021-12-18 20:40:28,598 INFO L226 Difference]: Without dead ends: 198 [2021-12-18 20:40:28,598 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-18 20:40:28,599 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 49 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-18 20:40:28,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 200 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-18 20:40:28,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2021-12-18 20:40:28,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2021-12-18 20:40:28,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 136 states have (on average 1.5955882352941178) internal successors, (217), 191 states have internal predecessors, (217), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 20:40:28,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 221 transitions. [2021-12-18 20:40:28,603 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 221 transitions. Word has length 13 [2021-12-18 20:40:28,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:40:28,603 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 221 transitions. [2021-12-18 20:40:28,603 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:28,603 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 221 transitions. [2021-12-18 20:40:28,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-18 20:40:28,603 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:40:28,603 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:40:28,614 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2021-12-18 20:40:28,803 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:40:28,804 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr8REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-18 20:40:28,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:40:28,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1802744652, now seen corresponding path program 1 times [2021-12-18 20:40:28,804 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:40:28,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1890754861] [2021-12-18 20:40:28,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:40:28,805 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:40:28,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:40:28,806 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:40:28,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2021-12-18 20:40:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:40:28,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2021-12-18 20:40:28,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:40:28,929 INFO L354 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2021-12-18 20:40:28,930 INFO L388 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 1 case distinctions, treesize of input 9 treesize of output 18 [2021-12-18 20:40:28,946 INFO L388 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 [2021-12-18 20:40:28,971 INFO L388 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 24 treesize of output 12 [2021-12-18 20:40:28,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:40:28,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:40:28,978 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:40:28,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1890754861] [2021-12-18 20:40:28,978 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1890754861] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:40:28,978 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:40:28,979 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-12-18 20:40:28,979 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206606489] [2021-12-18 20:40:28,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:40:28,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-18 20:40:28,980 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:40:28,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-18 20:40:28,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-18 20:40:28,981 INFO L87 Difference]: Start difference. First operand 196 states and 221 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:29,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:40:29,355 INFO L93 Difference]: Finished difference Result 247 states and 285 transitions. [2021-12-18 20:40:29,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 20:40:29,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-18 20:40:29,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:40:29,357 INFO L225 Difference]: With dead ends: 247 [2021-12-18 20:40:29,357 INFO L226 Difference]: Without dead ends: 247 [2021-12-18 20:40:29,357 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-12-18 20:40:29,357 INFO L933 BasicCegarLoop]: 147 mSDtfsCounter, 25 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-18 20:40:29,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 397 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-18 20:40:29,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2021-12-18 20:40:29,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 202. [2021-12-18 20:40:29,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 142 states have (on average 1.5985915492957747) internal successors, (227), 197 states have internal predecessors, (227), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 20:40:29,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 231 transitions. [2021-12-18 20:40:29,361 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 231 transitions. Word has length 17 [2021-12-18 20:40:29,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:40:29,361 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 231 transitions. [2021-12-18 20:40:29,361 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:29,361 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 231 transitions. [2021-12-18 20:40:29,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-12-18 20:40:29,362 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:40:29,362 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:40:29,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2021-12-18 20:40:29,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:40:29,570 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-18 20:40:29,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:40:29,570 INFO L85 PathProgramCache]: Analyzing trace with hash -1802744651, now seen corresponding path program 1 times [2021-12-18 20:40:29,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:40:29,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815050536] [2021-12-18 20:40:29,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:40:29,571 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:40:29,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:40:29,572 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:40:29,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2021-12-18 20:40:29,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:40:29,632 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-18 20:40:29,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:40:29,660 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:40:29,661 INFO L388 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-18 20:40:29,679 INFO L388 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 [2021-12-18 20:40:29,684 INFO L388 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 [2021-12-18 20:40:29,742 INFO L388 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 [2021-12-18 20:40:29,745 INFO L388 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 [2021-12-18 20:40:29,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:40:29,758 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-18 20:40:29,758 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:40:29,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815050536] [2021-12-18 20:40:29,758 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815050536] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-18 20:40:29,758 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-18 20:40:29,758 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-18 20:40:29,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092962615] [2021-12-18 20:40:29,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-18 20:40:29,758 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-18 20:40:29,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:40:29,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-18 20:40:29,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-18 20:40:29,759 INFO L87 Difference]: Start difference. First operand 202 states and 231 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:30,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:40:30,189 INFO L93 Difference]: Finished difference Result 204 states and 229 transitions. [2021-12-18 20:40:30,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-18 20:40:30,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-12-18 20:40:30,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:40:30,190 INFO L225 Difference]: With dead ends: 204 [2021-12-18 20:40:30,190 INFO L226 Difference]: Without dead ends: 204 [2021-12-18 20:40:30,191 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-12-18 20:40:30,191 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 5 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-18 20:40:30,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 414 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-18 20:40:30,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2021-12-18 20:40:30,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 202. [2021-12-18 20:40:30,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 142 states have (on average 1.5704225352112675) internal successors, (223), 197 states have internal predecessors, (223), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 20:40:30,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 227 transitions. [2021-12-18 20:40:30,194 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 227 transitions. Word has length 17 [2021-12-18 20:40:30,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:40:30,195 INFO L470 AbstractCegarLoop]: Abstraction has 202 states and 227 transitions. [2021-12-18 20:40:30,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:30,195 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 227 transitions. [2021-12-18 20:40:30,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-18 20:40:30,195 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:40:30,195 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:40:30,202 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2021-12-18 20:40:30,402 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:40:30,402 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr8REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-18 20:40:30,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:40:30,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1188184013, now seen corresponding path program 1 times [2021-12-18 20:40:30,403 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:40:30,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1191078578] [2021-12-18 20:40:30,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:40:30,403 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:40:30,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:40:30,404 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:40:30,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2021-12-18 20:40:30,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:40:30,509 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2021-12-18 20:40:30,511 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:40:30,534 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:40:30,540 INFO L354 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2021-12-18 20:40:30,540 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2021-12-18 20:40:30,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:40:30,642 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:40:30,643 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 38 [2021-12-18 20:40:30,682 INFO L388 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 34 treesize of output 16 [2021-12-18 20:40:30,698 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-18 20:40:30,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:40:30,734 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_176) c_create_data_~data~0.base) (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (_ bv1 1)))) is different from false [2021-12-18 20:40:30,742 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_176 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (let ((.cse0 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse0) v_ArrVal_176) c_create_data_~data~0.base) .cse0))) (_ bv1 1)))) is different from false [2021-12-18 20:40:30,773 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:40:30,773 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2021-12-18 20:40:30,775 INFO L388 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 44 treesize of output 32 [2021-12-18 20:40:30,778 INFO L388 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 15 treesize of output 11 [2021-12-18 20:40:30,831 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-18 20:40:30,831 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:40:30,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1191078578] [2021-12-18 20:40:30,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1191078578] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:40:30,832 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 20:40:30,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2021-12-18 20:40:30,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350202790] [2021-12-18 20:40:30,832 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 20:40:30,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-18 20:40:30,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:40:30,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-18 20:40:30,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2021-12-18 20:40:30,833 INFO L87 Difference]: Start difference. First operand 202 states and 227 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:31,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:40:31,387 INFO L93 Difference]: Finished difference Result 207 states and 231 transitions. [2021-12-18 20:40:31,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-18 20:40:31,388 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-18 20:40:31,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:40:31,389 INFO L225 Difference]: With dead ends: 207 [2021-12-18 20:40:31,389 INFO L226 Difference]: Without dead ends: 207 [2021-12-18 20:40:31,389 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=64, Unknown=2, NotChecked=34, Total=132 [2021-12-18 20:40:31,389 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 25 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 266 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2021-12-18 20:40:31,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 736 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 369 Invalid, 0 Unknown, 266 Unchecked, 0.5s Time] [2021-12-18 20:40:31,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2021-12-18 20:40:31,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 201. [2021-12-18 20:40:31,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 142 states have (on average 1.556338028169014) internal successors, (221), 196 states have internal predecessors, (221), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 20:40:31,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 225 transitions. [2021-12-18 20:40:31,393 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 225 transitions. Word has length 22 [2021-12-18 20:40:31,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:40:31,393 INFO L470 AbstractCegarLoop]: Abstraction has 201 states and 225 transitions. [2021-12-18 20:40:31,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:31,393 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 225 transitions. [2021-12-18 20:40:31,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-12-18 20:40:31,393 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:40:31,393 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:40:31,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2021-12-18 20:40:31,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:40:31,602 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-18 20:40:31,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:40:31,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1188184014, now seen corresponding path program 1 times [2021-12-18 20:40:31,602 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:40:31,602 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2042800888] [2021-12-18 20:40:31,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-18 20:40:31,603 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:40:31,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:40:31,604 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:40:31,605 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2021-12-18 20:40:31,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-18 20:40:31,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjunts are in the unsatisfiable core [2021-12-18 20:40:31,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:40:31,749 INFO L388 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 18 treesize of output 16 [2021-12-18 20:40:31,762 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-12-18 20:40:31,779 INFO L388 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 [2021-12-18 20:40:31,791 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:40:31,920 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:40:31,921 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-18 20:40:31,926 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 20:40:31,996 INFO L388 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 31 treesize of output 13 [2021-12-18 20:40:32,000 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-18 20:40:32,022 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:40:32,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:40:32,365 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_222) c_create_data_~data~0.base) .cse0) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_221) c_create_data_~data~0.base) .cse0))))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_222) c_create_data_~data~0.base) (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse1 .cse2 (_ bv4 32)) (bvadd .cse1 .cse2 (_ bv8 32)))))) is different from false [2021-12-18 20:40:32,410 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_222) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv4 32)) (bvadd .cse0 .cse1 (_ bv8 32))))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_222) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_221) c_create_data_~data~0.base) .cse4))))))) is different from false [2021-12-18 20:40:32,450 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse1 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1) v_ArrVal_222) c_create_data_~data~0.base) .cse1)))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_222) c_create_data_~data~0.base) .cse3) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_221) c_create_data_~data~0.base) .cse3))))))) is different from false [2021-12-18 20:40:32,463 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:40:32,463 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 46 [2021-12-18 20:40:32,469 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:40:32,469 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 36 [2021-12-18 20:40:32,473 INFO L388 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 62 treesize of output 50 [2021-12-18 20:40:32,476 INFO L388 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 96 treesize of output 78 [2021-12-18 20:40:32,481 INFO L388 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 40 treesize of output 32 [2021-12-18 20:40:32,483 INFO L388 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 66 treesize of output 58 [2021-12-18 20:40:32,566 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:40:32,566 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 36 [2021-12-18 20:40:32,569 INFO L388 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 54 treesize of output 36 [2021-12-18 20:40:32,574 INFO L388 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 19 treesize of output 11 [2021-12-18 20:40:32,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2021-12-18 20:40:32,660 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:40:32,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2042800888] [2021-12-18 20:40:32,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2042800888] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:40:32,660 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 20:40:32,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2021-12-18 20:40:32,661 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314827494] [2021-12-18 20:40:32,661 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 20:40:32,661 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2021-12-18 20:40:32,661 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:40:32,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2021-12-18 20:40:32,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210 [2021-12-18 20:40:32,662 INFO L87 Difference]: Start difference. First operand 201 states and 225 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:34,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:40:34,711 INFO L93 Difference]: Finished difference Result 213 states and 237 transitions. [2021-12-18 20:40:34,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-18 20:40:34,712 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-12-18 20:40:34,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:40:34,712 INFO L225 Difference]: With dead ends: 213 [2021-12-18 20:40:34,713 INFO L226 Difference]: Without dead ends: 213 [2021-12-18 20:40:34,713 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=60, Invalid=159, Unknown=3, NotChecked=84, Total=306 [2021-12-18 20:40:34,713 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 17 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 911 SdHoareTripleChecker+Invalid, 735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 334 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2021-12-18 20:40:34,713 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 911 Invalid, 735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 396 Invalid, 0 Unknown, 334 Unchecked, 1.6s Time] [2021-12-18 20:40:34,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2021-12-18 20:40:34,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 211. [2021-12-18 20:40:34,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 211 states, 152 states have (on average 1.519736842105263) internal successors, (231), 206 states have internal predecessors, (231), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 20:40:34,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 235 transitions. [2021-12-18 20:40:34,717 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 235 transitions. Word has length 22 [2021-12-18 20:40:34,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:40:34,717 INFO L470 AbstractCegarLoop]: Abstraction has 211 states and 235 transitions. [2021-12-18 20:40:34,717 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 15 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:34,717 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 235 transitions. [2021-12-18 20:40:34,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-12-18 20:40:34,717 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:40:34,717 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:40:34,725 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2021-12-18 20:40:34,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:40:34,925 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-18 20:40:34,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:40:34,925 INFO L85 PathProgramCache]: Analyzing trace with hash 200627285, now seen corresponding path program 2 times [2021-12-18 20:40:34,925 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:40:34,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200281853] [2021-12-18 20:40:34,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-18 20:40:34,926 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:40:34,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:40:34,927 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:40:34,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2021-12-18 20:40:35,083 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-18 20:40:35,083 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 20:40:35,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 24 conjunts are in the unsatisfiable core [2021-12-18 20:40:35,095 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:40:35,126 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:40:35,126 INFO L388 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-18 20:40:35,136 INFO L388 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 18 treesize of output 16 [2021-12-18 20:40:35,161 INFO L388 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 [2021-12-18 20:40:35,167 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:40:35,265 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:40:35,265 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-18 20:40:35,269 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 20:40:35,391 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:40:35,392 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-18 20:40:35,397 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 20:40:35,463 INFO L388 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 31 treesize of output 13 [2021-12-18 20:40:35,467 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-18 20:40:35,484 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:40:35,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:40:35,798 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_284) c_create_data_~data~0.base) .cse0) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_285) c_create_data_~data~0.base) .cse0))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_284) c_create_data_~data~0.base) (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse1 .cse2 (_ bv4 32)) (bvadd .cse1 .cse2 (_ bv8 32)))))) is different from false [2021-12-18 20:40:35,831 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_284) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv4 32)) (bvadd .cse0 .cse1 (_ bv8 32))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_284) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_285) c_create_data_~data~0.base) .cse4))))))) is different from false [2021-12-18 20:40:35,881 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_284) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv8 32)) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_284) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_285) c_create_data_~data~0.base) .cse4))))))) is different from false [2021-12-18 20:40:35,937 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_282) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_283) c_create_data_~data~0.base) .cse2) v_ArrVal_284) c_create_data_~data~0.base) .cse2)))) (bvule (bvadd .cse0 .cse1 (_ bv8 32)) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_283)) (.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_282) .cse3 v_ArrVal_284) c_create_data_~data~0.base) .cse4) (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_285) c_create_data_~data~0.base) .cse4))))))) is different from false [2021-12-18 20:40:35,981 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_282) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_283) c_create_data_~data~0.base) .cse3) v_ArrVal_284)) c_create_data_~data~0.base) .cse3))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv8 32)) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_283))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_282) .cse5 v_ArrVal_284) c_create_data_~data~0.base) .cse6) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_285) c_create_data_~data~0.base) .cse6))))))))) is different from false [2021-12-18 20:40:36,030 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_282) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_283) c_create_data_~data~0.base) .cse2) v_ArrVal_284)) c_create_data_~data~0.base) .cse2)))) (bvule (bvadd .cse0 (_ bv8 32)) (bvadd .cse0 (_ bv12 32))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_282 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse5))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_283))) (let ((.cse4 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_282) .cse4 v_ArrVal_284) c_create_data_~data~0.base) .cse5) (_ bv12 32)) (select |c_#length| (select (select (store .cse6 .cse4 v_ArrVal_285) c_create_data_~data~0.base) .cse5))))))))) is different from false [2021-12-18 20:40:36,046 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:40:36,046 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2021-12-18 20:40:36,054 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:40:36,054 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2021-12-18 20:40:36,057 INFO L388 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 400 treesize of output 334 [2021-12-18 20:40:36,064 INFO L388 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 1112 treesize of output 1034 [2021-12-18 20:40:36,100 INFO L388 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 1030 treesize of output 950 [2021-12-18 20:40:36,115 INFO L388 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 950 treesize of output 870 [2021-12-18 20:40:36,123 INFO L388 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 870 treesize of output 838 [2021-12-18 20:40:36,132 INFO L388 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 838 treesize of output 686 [2021-12-18 20:40:47,284 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:40:47,284 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 80 [2021-12-18 20:40:47,290 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:40:47,290 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 60 [2021-12-18 20:40:47,293 INFO L388 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 102 treesize of output 84 [2021-12-18 20:40:47,296 INFO L388 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 286 treesize of output 244 [2021-12-18 20:40:47,298 INFO L388 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 240 treesize of output 200 [2021-12-18 20:40:47,304 INFO L388 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 170 treesize of output 154 [2021-12-18 20:40:47,311 INFO L388 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 154 treesize of output 130 [2021-12-18 20:40:47,839 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2021-12-18 20:40:47,840 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:40:47,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200281853] [2021-12-18 20:40:47,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200281853] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:40:47,840 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 20:40:47,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2021-12-18 20:40:47,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086975123] [2021-12-18 20:40:47,840 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 20:40:47,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2021-12-18 20:40:47,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:40:47,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2021-12-18 20:40:47,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=144, Unknown=6, NotChecked=174, Total=380 [2021-12-18 20:40:47,841 INFO L87 Difference]: Start difference. First operand 211 states and 235 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:50,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:40:50,172 INFO L93 Difference]: Finished difference Result 223 states and 247 transitions. [2021-12-18 20:40:50,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-18 20:40:50,173 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-12-18 20:40:50,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:40:50,173 INFO L225 Difference]: With dead ends: 223 [2021-12-18 20:40:50,173 INFO L226 Difference]: Without dead ends: 223 [2021-12-18 20:40:50,174 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 22 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=85, Invalid=239, Unknown=6, NotChecked=222, Total=552 [2021-12-18 20:40:50,174 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 17 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1331 SdHoareTripleChecker+Invalid, 1211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 611 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2021-12-18 20:40:50,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 1331 Invalid, 1211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 586 Invalid, 0 Unknown, 611 Unchecked, 1.7s Time] [2021-12-18 20:40:50,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2021-12-18 20:40:50,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2021-12-18 20:40:50,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 162 states have (on average 1.4876543209876543) internal successors, (241), 216 states have internal predecessors, (241), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 20:40:50,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 245 transitions. [2021-12-18 20:40:50,178 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 245 transitions. Word has length 27 [2021-12-18 20:40:50,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:40:50,179 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 245 transitions. [2021-12-18 20:40:50,179 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:40:50,179 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 245 transitions. [2021-12-18 20:40:50,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-12-18 20:40:50,180 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:40:50,180 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:40:50,188 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2021-12-18 20:40:50,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-18 20:40:50,389 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-18 20:40:50,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:40:50,389 INFO L85 PathProgramCache]: Analyzing trace with hash 201129006, now seen corresponding path program 3 times [2021-12-18 20:40:50,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:40:50,390 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [249167873] [2021-12-18 20:40:50,390 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-18 20:40:50,390 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:40:50,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:40:50,391 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:40:50,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2021-12-18 20:40:50,729 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-18 20:40:50,730 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 20:40:50,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 28 conjunts are in the unsatisfiable core [2021-12-18 20:40:50,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:40:50,762 INFO L388 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 18 treesize of output 16 [2021-12-18 20:40:50,776 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-12-18 20:40:50,793 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:40:50,801 INFO L388 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 [2021-12-18 20:40:50,897 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:40:50,897 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-18 20:40:50,902 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 20:40:51,024 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:40:51,024 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-18 20:40:51,029 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 20:40:51,161 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:40:51,161 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-18 20:40:51,166 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 20:40:51,241 INFO L388 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 31 treesize of output 13 [2021-12-18 20:40:51,245 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-18 20:40:51,263 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:40:51,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:40:51,572 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_364) c_create_data_~data~0.base) .cse0) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_365) c_create_data_~data~0.base) .cse0))))) (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_364) c_create_data_~data~0.base) (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse1 .cse2 (_ bv4 32)) (bvadd .cse1 .cse2 (_ bv8 32)))))) is different from false [2021-12-18 20:40:51,613 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_364) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_365) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4) v_ArrVal_364) c_create_data_~data~0.base) .cse4))) (.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse2 .cse3 (_ bv4 32)) (bvadd .cse2 .cse3 (_ bv8 32)))))) is different from false [2021-12-18 20:40:51,665 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_364) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_365) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4) v_ArrVal_364) c_create_data_~data~0.base) .cse4))) (.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse2 .cse3 (_ bv8 32)) (bvadd .cse2 .cse3 (_ bv12 32)))))) is different from false [2021-12-18 20:40:51,730 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_363)) (.cse1 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select .cse2 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_362) .cse0 v_ArrVal_364) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_365) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse5 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_362) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_363) c_create_data_~data~0.base) .cse5) v_ArrVal_364) c_create_data_~data~0.base) .cse5))) (.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse3 .cse4 (_ bv8 32)) (bvadd .cse3 .cse4 (_ bv12 32)))))) is different from false [2021-12-18 20:40:51,799 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_363))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_362) .cse1 v_ArrVal_364) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_365) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse7 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse7))) (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_362) (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_363) c_create_data_~data~0.base) .cse7) v_ArrVal_364)) c_create_data_~data~0.base) .cse7))) (.cse5 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse4 .cse5 (_ bv8 32)) (bvadd .cse4 .cse5 (_ bv12 32)))))) is different from false [2021-12-18 20:40:51,858 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_362) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_363) c_create_data_~data~0.base) .cse3) v_ArrVal_364)) c_create_data_~data~0.base) .cse3))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd .cse0 .cse1 (_ bv16 32))))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_363))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_362) .cse5 v_ArrVal_364) c_create_data_~data~0.base) .cse6) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv16 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_365) c_create_data_~data~0.base) .cse6))))))))) is different from false [2021-12-18 20:40:52,237 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_360))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_361) .cse2 v_ArrVal_362) (select (select (store .cse3 .cse2 v_ArrVal_363) c_create_data_~data~0.base) .cse4) v_ArrVal_364))) c_create_data_~data~0.base) .cse4))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd .cse0 .cse1 (_ bv16 32))))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_360)) (.cse7 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse5 (select (select .cse9 c_create_data_~data~0.base) .cse7))) (let ((.cse8 (store .cse9 .cse5 v_ArrVal_363))) (let ((.cse6 (select (select .cse8 c_create_data_~data~0.base) .cse7))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_361) .cse5 v_ArrVal_362) .cse6 v_ArrVal_364) c_create_data_~data~0.base) .cse7) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv16 32)) (select |c_#length| (select (select (store .cse8 .cse6 v_ArrVal_365) c_create_data_~data~0.base) .cse7))))))))) is different from false [2021-12-18 20:40:54,337 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse5 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_360))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_361) .cse3 v_ArrVal_362) (select (select (store .cse4 .cse3 v_ArrVal_363) c_create_data_~data~0.base) .cse5) v_ArrVal_364)))) c_create_data_~data~0.base) .cse5))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd .cse0 .cse1 (_ bv16 32))))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse9))) (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_360))) (let ((.cse7 (select (select .cse11 c_create_data_~data~0.base) .cse9))) (let ((.cse10 (store .cse11 .cse7 v_ArrVal_363))) (let ((.cse8 (select (select .cse10 c_create_data_~data~0.base) .cse9))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_361) .cse7 v_ArrVal_362) .cse8 v_ArrVal_364) c_create_data_~data~0.base) .cse9) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv16 32)) (select |c_#length| (select (select (store .cse10 .cse8 v_ArrVal_365) c_create_data_~data~0.base) .cse9))))))))))) is different from false [2021-12-18 20:40:54,478 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_360))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_363))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_361) .cse1 v_ArrVal_362) .cse2 v_ArrVal_364) c_create_data_~data~0.base) .cse3) (_ bv16 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_365) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_361 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_362 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_363 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_360 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (let ((.cse10 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse7 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse10))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_360))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse10))) (store (store (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_361) .cse8 v_ArrVal_362) (select (select (store .cse9 .cse8 v_ArrVal_363) c_create_data_~data~0.base) .cse10) v_ArrVal_364)))) c_create_data_~data~0.base) .cse10)))) (bvule (bvadd .cse6 (_ bv12 32)) (bvadd .cse6 (_ bv16 32)))))) is different from false [2021-12-18 20:40:54,531 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:40:54,531 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 168 [2021-12-18 20:40:54,575 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:40:54,576 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 108 [2021-12-18 20:40:54,594 INFO L388 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 1130 treesize of output 968 [2021-12-18 20:40:54,621 INFO L388 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 12668 treesize of output 11918 [2021-12-18 20:40:54,688 INFO L388 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 11914 treesize of output 10170 [2021-12-18 20:40:54,723 INFO L388 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 10170 treesize of output 9154 [2021-12-18 20:40:54,757 INFO L388 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 9154 treesize of output 8322 [2021-12-18 20:40:54,796 INFO L388 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 8322 treesize of output 7906 [2021-12-18 20:40:54,830 INFO L388 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 7906 treesize of output 7426 [2021-12-18 20:40:56,032 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:40:56,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [249167873] [2021-12-18 20:40:56,033 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-18 20:40:56,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [120410068] [2021-12-18 20:40:56,033 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-18 20:40:56,033 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-18 20:40:56,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-18 20:40:56,035 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-18 20:40:56,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2021-12-18 20:40:56,456 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-18 20:40:56,456 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 20:40:56,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 30 conjunts are in the unsatisfiable core [2021-12-18 20:40:56,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:40:56,495 INFO L388 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 18 treesize of output 16 [2021-12-18 20:40:56,586 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-12-18 20:40:56,618 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:40:56,658 INFO L388 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 [2021-12-18 20:40:56,940 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:40:56,940 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-18 20:40:56,955 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 20:40:57,328 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:40:57,329 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-18 20:40:57,344 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 20:40:57,921 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:40:57,922 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 65 [2021-12-18 20:40:57,937 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2021-12-18 20:40:58,203 INFO L388 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 31 treesize of output 13 [2021-12-18 20:40:58,220 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-18 20:40:58,246 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:40:58,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:41:13,639 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:41:13,640 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 536 treesize of output 486 [2021-12-18 20:41:13,676 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:41:13,677 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 486 treesize of output 316 [2021-12-18 20:41:13,695 INFO L388 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 5634 treesize of output 4776 [2021-12-18 20:41:13,749 INFO L388 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 115484 treesize of output 112118 [2021-12-18 20:41:14,018 INFO L388 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 112118 treesize of output 107750 [2021-12-18 20:41:14,289 INFO L388 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 107750 treesize of output 99446 [2021-12-18 20:41:14,549 INFO L388 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 99446 treesize of output 87542 [2021-12-18 20:41:14,807 INFO L388 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 87542 treesize of output 85302 [2021-12-18 20:41:15,310 INFO L388 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 84233 treesize of output 76745 [2021-12-18 20:41:15,625 INFO L388 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 76745 treesize of output 69257 [2021-12-18 20:41:15,885 INFO L388 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 69257 treesize of output 68185 [2021-12-18 20:41:16,114 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-18 20:41:16,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120562708] [2021-12-18 20:41:16,115 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-18 20:41:16,115 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:41:16,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:41:16,117 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:41:16,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2021-12-18 20:41:16,479 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-12-18 20:41:16,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 20:41:16,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 27 conjunts are in the unsatisfiable core [2021-12-18 20:41:16,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:41:16,616 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:41:16,616 INFO L388 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-18 20:41:16,678 INFO L388 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 18 treesize of output 16 [2021-12-18 20:41:16,770 INFO L388 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 [2021-12-18 20:41:16,799 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:41:17,119 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:41:17,120 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-18 20:41:17,138 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 20:41:17,508 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:41:17,508 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-18 20:41:17,525 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 20:41:17,871 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:41:17,872 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-18 20:41:17,887 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 20:41:18,130 INFO L388 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 31 treesize of output 13 [2021-12-18 20:41:18,144 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-18 20:41:18,169 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:41:18,169 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:41:18,523 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_523 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_523) c_create_data_~data~0.base) .cse0) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_522) c_create_data_~data~0.base) .cse0))))) (forall ((v_ArrVal_523 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_523) c_create_data_~data~0.base) (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse1 .cse2 (_ bv4 32)) (bvadd .cse1 .cse2 (_ bv8 32)))))) is different from false [2021-12-18 20:41:18,596 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_523 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_523) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv4 32)) (bvadd .cse0 .cse1 (_ bv8 32))))) (forall ((v_ArrVal_522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_523 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_523) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_522) c_create_data_~data~0.base) .cse4))))))) is different from false [2021-12-18 20:41:18,715 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_523 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_523) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv8 32)) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_523 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_523) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_522) c_create_data_~data~0.base) .cse4))))))) is different from false [2021-12-18 20:41:18,861 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_523 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_520)) (.cse1 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select .cse2 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_521) .cse0 v_ArrVal_523) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_522) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_523 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse5 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_521) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_520) c_create_data_~data~0.base) .cse5) v_ArrVal_523) c_create_data_~data~0.base) .cse5))) (.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse3 .cse4 (_ bv8 32)) (bvadd .cse3 .cse4 (_ bv12 32)))))) is different from false [2021-12-18 20:41:19,105 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_523 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_520))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_521) .cse1 v_ArrVal_523) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_522) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_523 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse7 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse7))) (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_521) (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_520) c_create_data_~data~0.base) .cse7) v_ArrVal_523)) c_create_data_~data~0.base) .cse7))) (.cse5 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse4 .cse5 (_ bv8 32)) (bvadd .cse4 .cse5 (_ bv12 32)))))) is different from false [2021-12-18 20:41:19,229 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_523 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_520))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_521) .cse1 v_ArrVal_523) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv16 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_522) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_523 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse7 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse7))) (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_521) (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_520) c_create_data_~data~0.base) .cse7) v_ArrVal_523)) c_create_data_~data~0.base) .cse7))) (.cse5 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse4 .cse5 (_ bv12 32)) (bvadd .cse4 .cse5 (_ bv16 32)))))) is different from false [2021-12-18 20:41:20,050 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_523 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_519)) (.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_520))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_518) .cse0 v_ArrVal_521) .cse1 v_ArrVal_523) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv16 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_522) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_523 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (let ((.cse9 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_519))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse9))) (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_518) .cse7 v_ArrVal_521) (select (select (store .cse8 .cse7 v_ArrVal_520) c_create_data_~data~0.base) .cse9) v_ArrVal_523))) c_create_data_~data~0.base) .cse9))) (.cse6 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse5 .cse6 (_ bv12 32)) (bvadd .cse5 .cse6 (_ bv16 32)))))) is different from false [2021-12-18 20:41:20,366 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_523 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse5 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_519))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_518) .cse3 v_ArrVal_521) (select (select (store .cse4 .cse3 v_ArrVal_520) c_create_data_~data~0.base) .cse5) v_ArrVal_523)))) c_create_data_~data~0.base) .cse5))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd .cse0 .cse1 (_ bv16 32))))) (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_523 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse9))) (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_519))) (let ((.cse7 (select (select .cse11 c_create_data_~data~0.base) .cse9))) (let ((.cse10 (store .cse11 .cse7 v_ArrVal_520))) (let ((.cse8 (select (select .cse10 c_create_data_~data~0.base) .cse9))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_518) .cse7 v_ArrVal_521) .cse8 v_ArrVal_523) c_create_data_~data~0.base) .cse9) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv16 32)) (select |c_#length| (select (select (store .cse10 .cse8 v_ArrVal_522) c_create_data_~data~0.base) .cse9))))))))))) is different from false [2021-12-18 20:41:20,532 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_522 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_523 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_519))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_520))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_518) .cse1 v_ArrVal_521) .cse2 v_ArrVal_523) c_create_data_~data~0.base) .cse3) (_ bv16 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_522) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_520 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_521 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_518 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_519 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_523 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (let ((.cse10 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse7 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse10))) (let ((.cse9 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_519))) (let ((.cse8 (select (select .cse9 c_create_data_~data~0.base) .cse10))) (store (store (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_518) .cse8 v_ArrVal_521) (select (select (store .cse9 .cse8 v_ArrVal_520) c_create_data_~data~0.base) .cse10) v_ArrVal_523)))) c_create_data_~data~0.base) .cse10)))) (bvule (bvadd .cse6 (_ bv12 32)) (bvadd .cse6 (_ bv16 32)))))) is different from false [2021-12-18 20:41:20,588 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:41:20,588 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 168 [2021-12-18 20:41:20,617 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:41:20,618 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 108 [2021-12-18 20:41:20,633 INFO L388 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 588 treesize of output 498 [2021-12-18 20:41:20,648 INFO L388 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 1542 treesize of output 1428 [2021-12-18 20:41:20,679 INFO L388 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 1424 treesize of output 1328 [2021-12-18 20:41:20,693 INFO L388 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 1328 treesize of output 1128 [2021-12-18 20:41:20,707 INFO L388 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 1128 treesize of output 1040 [2021-12-18 20:41:20,721 INFO L388 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 1040 treesize of output 896 [2021-12-18 20:41:20,735 INFO L388 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 896 treesize of output 856 [2021-12-18 20:41:21,817 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:41:21,818 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 178 [2021-12-18 20:41:21,869 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:41:21,869 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 108 [2021-12-18 20:41:21,878 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:41:21,889 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 916 treesize of output 610 [2021-12-18 20:41:21,911 INFO L173 IndexEqualityManager]: detected equality via solver [2021-12-18 20:41:21,919 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 720 treesize of output 618 [2021-12-18 20:41:21,938 INFO L388 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 614 treesize of output 566 [2021-12-18 20:41:21,956 INFO L388 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 566 treesize of output 454 [2021-12-18 20:41:21,974 INFO L388 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 454 treesize of output 422 [2021-12-18 20:41:22,631 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 24 not checked. [2021-12-18 20:41:22,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120562708] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-18 20:41:22,632 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-18 20:41:22,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 24 [2021-12-18 20:41:22,632 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471854452] [2021-12-18 20:41:22,632 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-18 20:41:22,632 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2021-12-18 20:41:22,632 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-18 20:41:22,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2021-12-18 20:41:22,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=478, Unknown=66, NotChecked=1170, Total=1892 [2021-12-18 20:41:22,633 INFO L87 Difference]: Start difference. First operand 221 states and 245 transitions. Second operand has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:33,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-18 20:41:33,824 INFO L93 Difference]: Finished difference Result 233 states and 257 transitions. [2021-12-18 20:41:33,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-18 20:41:33,826 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-12-18 20:41:33,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-18 20:41:33,827 INFO L225 Difference]: With dead ends: 233 [2021-12-18 20:41:33,827 INFO L226 Difference]: Without dead ends: 233 [2021-12-18 20:41:33,828 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 118 SyntacticMatches, 9 SemanticMatches, 47 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=250, Invalid=686, Unknown=66, NotChecked=1350, Total=2352 [2021-12-18 20:41:33,828 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 26 mSDsluCounter, 1344 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 833 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2021-12-18 20:41:33,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 1502 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 631 Invalid, 0 Unknown, 833 Unchecked, 6.4s Time] [2021-12-18 20:41:33,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2021-12-18 20:41:33,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2021-12-18 20:41:33,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 172 states have (on average 1.4593023255813953) internal successors, (251), 226 states have internal predecessors, (251), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-18 20:41:33,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 255 transitions. [2021-12-18 20:41:33,832 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 255 transitions. Word has length 32 [2021-12-18 20:41:33,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-18 20:41:33,832 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 255 transitions. [2021-12-18 20:41:33,832 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 25 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-18 20:41:33,832 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 255 transitions. [2021-12-18 20:41:33,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2021-12-18 20:41:33,832 INFO L506 BasicCegarLoop]: Found error trace [2021-12-18 20:41:33,833 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-18 20:41:33,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2021-12-18 20:41:34,047 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2021-12-18 20:41:34,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2021-12-18 20:41:34,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:41:34,437 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr9REQUIRES_VIOLATION === [create_dataErr0REQUIRES_VIOLATION, create_dataErr1REQUIRES_VIOLATION, create_dataErr2REQUIRES_VIOLATION, create_dataErr3REQUIRES_VIOLATION (and 88 more)] === [2021-12-18 20:41:34,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-18 20:41:34,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1676760053, now seen corresponding path program 4 times [2021-12-18 20:41:34,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-18 20:41:34,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2065158366] [2021-12-18 20:41:34,437 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-18 20:41:34,437 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-18 20:41:34,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-18 20:41:34,438 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-18 20:41:34,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2021-12-18 20:41:34,741 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-18 20:41:34,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 20:41:34,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 32 conjunts are in the unsatisfiable core [2021-12-18 20:41:34,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:41:34,789 INFO L388 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 18 treesize of output 16 [2021-12-18 20:41:34,868 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2021-12-18 20:41:34,969 INFO L388 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 [2021-12-18 20:41:34,998 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:41:35,579 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:41:35,580 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-18 20:41:35,596 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 20:41:36,306 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:41:36,306 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-18 20:41:36,322 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 20:41:36,995 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:41:36,995 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-18 20:41:37,012 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 20:41:37,733 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:41:37,733 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-18 20:41:37,748 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 20:41:38,218 INFO L388 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 31 treesize of output 13 [2021-12-18 20:41:38,232 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-18 20:41:38,404 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:41:38,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:41:39,381 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_619 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_619) c_create_data_~data~0.base) .cse0) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_620) c_create_data_~data~0.base) .cse0))))) (forall ((v_ArrVal_619 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_619) c_create_data_~data~0.base) (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse1 .cse2 (_ bv4 32)) (bvadd .cse1 .cse2 (_ bv8 32)))))) is different from false [2021-12-18 20:41:39,451 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_619 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (bvule (bvadd (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_619) c_create_data_~data~0.base) .cse1) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_620) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_619 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse3 (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4) v_ArrVal_619) c_create_data_~data~0.base) .cse4)))) (bvule (bvadd .cse2 .cse3 (_ bv4 32)) (bvadd .cse2 .cse3 (_ bv8 32)))))) is different from false [2021-12-18 20:41:39,565 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_619 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (bvule (bvadd (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_619) c_create_data_~data~0.base) .cse1) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_620) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_619 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse3 (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4) v_ArrVal_619) c_create_data_~data~0.base) .cse4)))) (bvule (bvadd .cse2 .cse3 (_ bv8 32)) (bvadd .cse2 .cse3 (_ bv12 32)))))) is different from false [2021-12-18 20:41:39,696 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_618 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_618)) (.cse1 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select .cse2 c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_617) .cse0 v_ArrVal_619) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_620) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_618 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (let ((.cse5 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_617) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_618) c_create_data_~data~0.base) .cse5) v_ArrVal_619) c_create_data_~data~0.base) .cse5))) (.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse3 .cse4 (_ bv8 32)) (bvadd .cse3 .cse4 (_ bv12 32)))))) is different from false [2021-12-18 20:41:39,867 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_618 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_618))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_617) .cse1 v_ArrVal_619) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_620) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_618 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse7 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse7))) (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_617) (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_618) c_create_data_~data~0.base) .cse7) v_ArrVal_619)) c_create_data_~data~0.base) .cse7))) (.cse5 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse4 .cse5 (_ bv8 32)) (bvadd .cse4 .cse5 (_ bv12 32)))))) is different from false [2021-12-18 20:41:39,995 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_618 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_618))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_617) .cse1 v_ArrVal_619) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv16 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_620) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_618 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse7 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse7))) (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_617) (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_618) c_create_data_~data~0.base) .cse7) v_ArrVal_619)) c_create_data_~data~0.base) .cse7))) (.cse5 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse4 .cse5 (_ bv12 32)) (bvadd .cse4 .cse5 (_ bv16 32)))))) is different from false [2021-12-18 20:41:40,185 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_618 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_615)) (.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_618))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_616) .cse0 v_ArrVal_617) .cse1 v_ArrVal_619) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv16 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_620) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_618 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (let ((.cse9 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_615))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse9))) (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_616) .cse7 v_ArrVal_617) (select (select (store .cse8 .cse7 v_ArrVal_618) c_create_data_~data~0.base) .cse9) v_ArrVal_619))) c_create_data_~data~0.base) .cse9))) (.cse6 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse5 .cse6 (_ bv12 32)) (bvadd .cse5 .cse6 (_ bv16 32)))))) is different from false [2021-12-18 20:41:42,140 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_618 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse5 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_615))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_616) .cse3 v_ArrVal_617) (select (select (store .cse4 .cse3 v_ArrVal_618) c_create_data_~data~0.base) .cse5) v_ArrVal_619)))) c_create_data_~data~0.base) .cse5))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd .cse0 .cse1 (_ bv16 32))))) (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_618 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse9))) (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_615))) (let ((.cse7 (select (select .cse11 c_create_data_~data~0.base) .cse9))) (let ((.cse10 (store .cse11 .cse7 v_ArrVal_618))) (let ((.cse8 (select (select .cse10 c_create_data_~data~0.base) .cse9))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_616) .cse7 v_ArrVal_617) .cse8 v_ArrVal_619) c_create_data_~data~0.base) .cse9) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv16 32)) (select |c_#length| (select (select (store .cse10 .cse8 v_ArrVal_620) c_create_data_~data~0.base) .cse9))))))))))) is different from false [2021-12-18 20:41:42,298 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_618 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse5 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_615))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_616) .cse3 v_ArrVal_617) (select (select (store .cse4 .cse3 v_ArrVal_618) c_create_data_~data~0.base) .cse5) v_ArrVal_619)))) c_create_data_~data~0.base) .cse5))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv16 32)) (bvadd .cse0 .cse1 (_ bv20 32))))) (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_618 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse9))) (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_615))) (let ((.cse7 (select (select .cse11 c_create_data_~data~0.base) .cse9))) (let ((.cse10 (store .cse11 .cse7 v_ArrVal_618))) (let ((.cse8 (select (select .cse10 c_create_data_~data~0.base) .cse9))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_616) .cse7 v_ArrVal_617) .cse8 v_ArrVal_619) c_create_data_~data~0.base) .cse9) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv20 32)) (select |c_#length| (select (select (store .cse10 .cse8 v_ArrVal_620) c_create_data_~data~0.base) .cse9))))))))))) is different from false [2021-12-18 20:41:44,005 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_618 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_614 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse5 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_614))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_615))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_613) .cse2 v_ArrVal_616) .cse3 v_ArrVal_617) (select (select (store .cse4 .cse3 v_ArrVal_618) c_create_data_~data~0.base) .cse5) v_ArrVal_619))))) c_create_data_~data~0.base) .cse5))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv16 32)) (bvadd .cse0 .cse1 (_ bv20 32))))) (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_618 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_614 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_614)) (.cse10 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse7 (select (select .cse13 c_create_data_~data~0.base) .cse10))) (let ((.cse12 (store .cse13 .cse7 v_ArrVal_615))) (let ((.cse8 (select (select .cse12 c_create_data_~data~0.base) .cse10))) (let ((.cse11 (store .cse12 .cse8 v_ArrVal_618))) (let ((.cse9 (select (select .cse11 c_create_data_~data~0.base) .cse10))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_613) .cse7 v_ArrVal_616) .cse8 v_ArrVal_617) .cse9 v_ArrVal_619) c_create_data_~data~0.base) .cse10) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv20 32)) (select |c_#length| (select (select (store .cse11 .cse9 v_ArrVal_620) c_create_data_~data~0.base) .cse10))))))))))) is different from false [2021-12-18 20:41:46,484 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_618 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_614 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_614))) (let ((.cse1 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_615))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_618))) (let ((.cse3 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_613) .cse1 v_ArrVal_616) .cse2 v_ArrVal_617) .cse3 v_ArrVal_619) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv20 32)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_620) c_create_data_~data~0.base) .cse4)))))))))))) (forall ((v_ArrVal_619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_618 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_614 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (let ((.cse14 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse10 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse14))) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_614))) (let ((.cse11 (select (select .cse15 c_create_data_~data~0.base) .cse14))) (let ((.cse13 (store .cse15 .cse11 v_ArrVal_615))) (let ((.cse12 (select (select .cse13 c_create_data_~data~0.base) .cse14))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse10 v_ArrVal_613) .cse11 v_ArrVal_616) .cse12 v_ArrVal_617) (select (select (store .cse13 .cse12 v_ArrVal_618) c_create_data_~data~0.base) .cse14) v_ArrVal_619)))))) c_create_data_~data~0.base) .cse14))) (.cse9 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse8 .cse9 (_ bv16 32)) (bvadd .cse8 .cse9 (_ bv20 32)))))) is different from false [2021-12-18 20:41:46,859 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_618 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_614 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse5 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse5))) (let ((.cse6 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_614))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_615))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_613) .cse2 v_ArrVal_616) .cse3 v_ArrVal_617) (select (select (store .cse4 .cse3 v_ArrVal_618) c_create_data_~data~0.base) .cse5) v_ArrVal_619)))))) c_create_data_~data~0.base) .cse5)))) (bvule (bvadd .cse0 (_ bv16 32)) (bvadd .cse0 (_ bv20 32))))) (forall ((v_ArrVal_620 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_619 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_615 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_616 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_617 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_618 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_613 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_614 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse11))) (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse7 v_ArrVal_614))) (let ((.cse8 (select (select .cse14 c_create_data_~data~0.base) .cse11))) (let ((.cse13 (store .cse14 .cse8 v_ArrVal_615))) (let ((.cse9 (select (select .cse13 c_create_data_~data~0.base) .cse11))) (let ((.cse12 (store .cse13 .cse9 v_ArrVal_618))) (let ((.cse10 (select (select .cse12 c_create_data_~data~0.base) .cse11))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse7 v_ArrVal_613) .cse8 v_ArrVal_616) .cse9 v_ArrVal_617) .cse10 v_ArrVal_619) c_create_data_~data~0.base) .cse11) (_ bv20 32)) (select |c_#length| (select (select (store .cse12 .cse10 v_ArrVal_620) c_create_data_~data~0.base) .cse11))))))))))))) is different from false [2021-12-18 20:41:46,997 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:41:46,997 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 353 treesize of output 354 [2021-12-18 20:41:47,094 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:41:47,095 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 343 treesize of output 204 [2021-12-18 20:41:47,152 INFO L388 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 1892436 treesize of output 1556022 [2021-12-18 20:42:14,032 WARN L227 SmtUtils]: Spent 26.88s on a formula simplification. DAG size of input: 1195 DAG size of output: 1195 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-18 20:42:15,942 INFO L388 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 16830092 treesize of output 16430726 [2021-12-18 20:42:46,035 WARN L227 SmtUtils]: Spent 30.09s on a formula simplification that was a NOOP. DAG size: 3172 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-18 20:43:15,593 WARN L227 SmtUtils]: Spent 29.55s on a formula simplification that was a NOOP. DAG size: 3168 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-18 20:43:15,736 INFO L388 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 16430722 treesize of output 15324802 [2021-12-18 20:43:45,177 WARN L227 SmtUtils]: Spent 29.44s on a formula simplification that was a NOOP. DAG size: 3154 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-18 20:43:45,317 INFO L388 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 15324802 treesize of output 14806658 [2021-12-18 20:44:15,605 WARN L227 SmtUtils]: Spent 30.28s on a formula simplification that was a NOOP. DAG size: 3132 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-18 20:44:15,750 INFO L388 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 14806658 treesize of output 14757506 [2021-12-18 20:44:46,821 WARN L227 SmtUtils]: Spent 31.07s on a formula simplification that was a NOOP. DAG size: 3131 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-18 20:44:46,962 INFO L388 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 14757506 treesize of output 13087586 [2021-12-18 20:45:18,605 WARN L227 SmtUtils]: Spent 31.64s on a formula simplification that was a NOOP. DAG size: 3125 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-18 20:45:18,750 INFO L388 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 13087586 treesize of output 11981666 [2021-12-18 20:45:48,499 WARN L227 SmtUtils]: Spent 29.75s on a formula simplification that was a NOOP. DAG size: 3121 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-18 20:45:48,635 INFO L388 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 11981666 treesize of output 11709282 [2021-12-18 20:46:18,225 WARN L227 SmtUtils]: Spent 29.59s on a formula simplification that was a NOOP. DAG size: 3120 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-18 20:46:18,361 INFO L388 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 11709282 treesize of output 10286754 [2021-12-18 20:46:47,867 WARN L227 SmtUtils]: Spent 29.50s on a formula simplification that was a NOOP. DAG size: 3119 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-18 20:46:48,001 INFO L388 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 10286754 treesize of output 9489922 [2021-12-18 20:47:17,421 WARN L227 SmtUtils]: Spent 29.42s on a formula simplification that was a NOOP. DAG size: 3115 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-18 20:48:02,408 WARN L227 SmtUtils]: Spent 44.44s on a formula simplification that was a NOOP. DAG size: 3117 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-18 20:50:28,584 WARN L227 SmtUtils]: Spent 1.21m on a formula simplification that was a NOOP. DAG size: 3117 (called from [L1066] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2021-12-18 20:52:30,026 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-18 20:52:30,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2065158366] [2021-12-18 20:52:30,027 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-18 20:52:30,027 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [261519904] [2021-12-18 20:52:30,027 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-18 20:52:30,027 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2021-12-18 20:52:30,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2021-12-18 20:52:30,028 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2021-12-18 20:52:30,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2021-12-18 20:52:30,522 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-18 20:52:30,522 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 20:52:30,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 31 conjunts are in the unsatisfiable core [2021-12-18 20:52:30,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:52:30,936 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:52:30,936 INFO L388 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 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-18 20:52:31,054 INFO L388 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 18 treesize of output 16 [2021-12-18 20:52:31,333 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2021-12-18 20:52:31,473 INFO L388 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 [2021-12-18 20:52:32,384 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:52:32,385 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-18 20:52:32,433 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 20:52:33,745 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:52:33,745 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-18 20:52:33,790 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 20:52:34,995 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:52:34,996 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-18 20:52:35,046 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 20:52:36,388 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:52:36,388 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2021-12-18 20:52:36,441 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 20:52:37,523 INFO L388 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 31 treesize of output 13 [2021-12-18 20:52:37,567 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2021-12-18 20:52:37,702 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:52:37,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:52:38,788 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_716 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_715) c_create_data_~data~0.base) .cse0) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_716) c_create_data_~data~0.base) .cse0))))) (forall ((v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_715) c_create_data_~data~0.base) (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse1 .cse2 (_ bv4 32)) (bvadd .cse1 .cse2 (_ bv8 32)))))) is different from false [2021-12-18 20:52:38,982 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2) v_ArrVal_715) c_create_data_~data~0.base) .cse2))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv4 32)) (bvadd .cse0 .cse1 (_ bv8 32))))) (forall ((v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_716 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_715) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_716) c_create_data_~data~0.base) .cse4))))))) is different from false [2021-12-18 20:52:39,271 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_716 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_715) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_716) c_create_data_~data~0.base) .cse1)))))) (forall ((v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4) v_ArrVal_715) c_create_data_~data~0.base) .cse4))) (.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse2 .cse3 (_ bv8 32)) (bvadd .cse2 .cse3 (_ bv12 32)))))) is different from false [2021-12-18 20:52:39,611 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_714) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_713) c_create_data_~data~0.base) .cse2) v_ArrVal_715) c_create_data_~data~0.base) .cse2)))) (bvule (bvadd .cse0 .cse1 (_ bv8 32)) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_713)) (.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse3 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_714) .cse3 v_ArrVal_715) c_create_data_~data~0.base) .cse4) (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_716) c_create_data_~data~0.base) .cse4))))))) is different from false [2021-12-18 20:52:40,049 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_713))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_714) .cse1 v_ArrVal_715) c_create_data_~data~0.base) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_716) c_create_data_~data~0.base) .cse2)))))))) (forall ((v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse5 (let ((.cse7 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse7))) (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_714) (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_713) c_create_data_~data~0.base) .cse7) v_ArrVal_715)) c_create_data_~data~0.base) .cse7)))) (bvule (bvadd .cse4 .cse5 (_ bv8 32)) (bvadd .cse4 .cse5 (_ bv12 32)))))) is different from false [2021-12-18 20:52:40,376 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_714) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_713) c_create_data_~data~0.base) .cse3) v_ArrVal_715)) c_create_data_~data~0.base) .cse3)))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd .cse0 .cse1 (_ bv16 32))))) (forall ((v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_713))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_714) .cse5 v_ArrVal_715) c_create_data_~data~0.base) .cse6) (_ bv16 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_716) c_create_data_~data~0.base) .cse6))))))))) is different from false [2021-12-18 20:52:40,898 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_711 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_711))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_712) .cse2 v_ArrVal_714) (select (select (store .cse3 .cse2 v_ArrVal_713) c_create_data_~data~0.base) .cse4) v_ArrVal_715))) c_create_data_~data~0.base) .cse4)))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd .cse0 .cse1 (_ bv16 32))))) (forall ((v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_711 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_711)) (.cse7 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse5 (select (select .cse9 c_create_data_~data~0.base) .cse7))) (let ((.cse8 (store .cse9 .cse5 v_ArrVal_713))) (let ((.cse6 (select (select .cse8 c_create_data_~data~0.base) .cse7))) (bvule (bvadd (bvmul c_create_data_~counter~0 (_ bv4 32)) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_712) .cse5 v_ArrVal_714) .cse6 v_ArrVal_715) c_create_data_~data~0.base) .cse7) (_ bv16 32)) (select |c_#length| (select (select (store .cse8 .cse6 v_ArrVal_716) c_create_data_~data~0.base) .cse7))))))))) is different from false [2021-12-18 20:52:41,406 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_711 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse5 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse5))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_711))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse5))) (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_712) .cse3 v_ArrVal_714) (select (select (store .cse4 .cse3 v_ArrVal_713) c_create_data_~data~0.base) .cse5) v_ArrVal_715)))) c_create_data_~data~0.base) .cse5))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd .cse0 .cse1 (_ bv16 32))))) (forall ((v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_711 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse9))) (let ((.cse11 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_711))) (let ((.cse7 (select (select .cse11 c_create_data_~data~0.base) .cse9))) (let ((.cse10 (store .cse11 .cse7 v_ArrVal_713))) (let ((.cse8 (select (select .cse10 c_create_data_~data~0.base) .cse9))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_712) .cse7 v_ArrVal_714) .cse8 v_ArrVal_715) c_create_data_~data~0.base) .cse9) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv16 32)) (select |c_#length| (select (select (store .cse10 .cse8 v_ArrVal_716) c_create_data_~data~0.base) .cse9))))))))))) is different from false [2021-12-18 20:52:41,808 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_711 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_711))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_713))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_712) .cse1 v_ArrVal_714) .cse2 v_ArrVal_715) c_create_data_~data~0.base) .cse3) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv20 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_716) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_711 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (let ((.cse11 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse11))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_711))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse11))) (store (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_712) .cse9 v_ArrVal_714) (select (select (store .cse10 .cse9 v_ArrVal_713) c_create_data_~data~0.base) .cse11) v_ArrVal_715)))) c_create_data_~data~0.base) .cse11))) (.cse7 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse6 .cse7 (_ bv16 32)) (bvadd .cse6 .cse7 (_ bv20 32)))))) is different from false [2021-12-18 20:52:44,345 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_709 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_711 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_710)) (.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select .cse6 c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store .cse6 .cse0 v_ArrVal_711))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_713))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_709) .cse0 v_ArrVal_712) .cse1 v_ArrVal_714) .cse2 v_ArrVal_715) c_create_data_~data~0.base) .cse3) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv20 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_716) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_709 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_711 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (let ((.cse12 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_710))) (let ((.cse9 (select (select .cse13 c_create_data_~data~0.base) .cse12))) (let ((.cse11 (store .cse13 .cse9 v_ArrVal_711))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse12))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_709) .cse9 v_ArrVal_712) .cse10 v_ArrVal_714) (select (select (store .cse11 .cse10 v_ArrVal_713) c_create_data_~data~0.base) .cse12) v_ArrVal_715))))) c_create_data_~data~0.base) .cse12))) (.cse8 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse7 .cse8 (_ bv16 32)) (bvadd .cse7 .cse8 (_ bv20 32)))))) is different from false [2021-12-18 20:52:47,465 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_709 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_711 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse6 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_710))) (let ((.cse3 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (let ((.cse5 (store .cse7 .cse3 v_ArrVal_711))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse6))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_709) .cse3 v_ArrVal_712) .cse4 v_ArrVal_714) (select (select (store .cse5 .cse4 v_ArrVal_713) c_create_data_~data~0.base) .cse6) v_ArrVal_715)))))) c_create_data_~data~0.base) .cse6))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv16 32)) (bvadd .cse0 .cse1 (_ bv20 32))))) (forall ((v_ArrVal_709 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_711 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse12))) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_710))) (let ((.cse9 (select (select .cse15 c_create_data_~data~0.base) .cse12))) (let ((.cse14 (store .cse15 .cse9 v_ArrVal_711))) (let ((.cse10 (select (select .cse14 c_create_data_~data~0.base) .cse12))) (let ((.cse13 (store .cse14 .cse10 v_ArrVal_713))) (let ((.cse11 (select (select .cse13 c_create_data_~data~0.base) .cse12))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_709) .cse9 v_ArrVal_712) .cse10 v_ArrVal_714) .cse11 v_ArrVal_715) c_create_data_~data~0.base) .cse12) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv20 32)) (select |c_#length| (select (select (store .cse13 .cse11 v_ArrVal_716) c_create_data_~data~0.base) .cse12))))))))))))) is different from false [2021-12-18 20:52:48,327 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_709 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_716 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_711 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_710))) (let ((.cse1 (select (select .cse7 c_create_data_~data~0.base) .cse4))) (let ((.cse6 (store .cse7 .cse1 v_ArrVal_711))) (let ((.cse2 (select (select .cse6 c_create_data_~data~0.base) .cse4))) (let ((.cse5 (store .cse6 .cse2 v_ArrVal_713))) (let ((.cse3 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_709) .cse1 v_ArrVal_712) .cse2 v_ArrVal_714) .cse3 v_ArrVal_715) c_create_data_~data~0.base) .cse4) (_ bv20 32)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_716) c_create_data_~data~0.base) .cse4)))))))))))) (forall ((v_ArrVal_709 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_714 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_710 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_711 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_712 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse8 (let ((.cse13 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse9 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse13))) (let ((.cse14 (store |c_#memory_$Pointer$.base| .cse9 v_ArrVal_710))) (let ((.cse10 (select (select .cse14 c_create_data_~data~0.base) .cse13))) (let ((.cse12 (store .cse14 .cse10 v_ArrVal_711))) (let ((.cse11 (select (select .cse12 c_create_data_~data~0.base) .cse13))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse9 v_ArrVal_709) .cse10 v_ArrVal_712) .cse11 v_ArrVal_714) (select (select (store .cse12 .cse11 v_ArrVal_713) c_create_data_~data~0.base) .cse13) v_ArrVal_715)))))) c_create_data_~data~0.base) .cse13)))) (bvule (bvadd .cse8 (_ bv16 32)) (bvadd .cse8 (_ bv20 32)))))) is different from false [2021-12-18 20:52:48,541 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:48,541 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 353 treesize of output 344 [2021-12-18 20:52:48,716 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:52:48,716 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 333 treesize of output 204 [2021-12-18 20:52:48,804 INFO L388 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 12780 treesize of output 10890 [2021-12-18 20:52:49,077 INFO L388 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 369218 treesize of output 358028 [2021-12-18 20:52:50,542 INFO L388 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 358024 treesize of output 346568 [2021-12-18 20:52:51,324 INFO L388 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 346568 treesize of output 298328 [2021-12-18 20:52:52,128 INFO L388 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 298328 treesize of output 256104 [2021-12-18 20:52:52,887 INFO L388 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 256104 treesize of output 244648 [2021-12-18 20:52:53,638 INFO L388 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 244648 treesize of output 238664 [2021-12-18 20:52:54,383 INFO L388 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 238664 treesize of output 215320 [2021-12-18 20:52:55,146 INFO L388 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 215320 treesize of output 205800 [2021-12-18 20:52:59,146 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2021-12-18 20:52:59,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543436443] [2021-12-18 20:52:59,146 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-18 20:52:59,146 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-18 20:52:59,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-18 20:52:59,148 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-18 20:52:59,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2021-12-18 20:52:59,277 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-18 20:52:59,277 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-18 20:52:59,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 35 conjunts are in the unsatisfiable core [2021-12-18 20:52:59,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-18 20:52:59,953 INFO L354 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2021-12-18 20:52:59,953 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2021-12-18 20:53:00,308 INFO L388 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 18 treesize of output 16 [2021-12-18 20:53:02,365 INFO L388 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 [2021-12-18 20:53:02,507 INFO L388 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 [2021-12-18 20:53:07,763 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:53:07,763 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2021-12-18 20:53:07,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:53:07,871 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 20:53:13,490 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:53:13,490 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2021-12-18 20:53:13,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:53:13,603 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 20:53:18,268 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:53:18,268 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2021-12-18 20:53:18,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:53:18,374 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2021-12-18 20:53:23,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-12-18 20:53:23,137 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 44 [2021-12-18 20:53:23,544 INFO L354 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2021-12-18 20:53:23,545 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 47 [2021-12-18 20:53:27,168 INFO L388 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 [2021-12-18 20:53:27,244 INFO L388 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 [2021-12-18 20:53:28,857 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-18 20:53:28,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-18 20:53:37,867 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_811 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (let ((.cse0 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_811) c_create_data_~data~0.base) .cse0) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_810) c_create_data_~data~0.base) .cse0))))) (and (forall ((v_ArrVal_813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_812 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_810)) (.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_811) .cse1 v_ArrVal_812) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_813) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_812 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse6 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_811) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_810) c_create_data_~data~0.base) .cse6) v_ArrVal_812) c_create_data_~data~0.base) .cse6))) (.cse5 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse4 .cse5 (_ bv8 32)) (bvadd .cse4 .cse5 (_ bv12 32)))))))) is different from false [2021-12-18 20:53:38,717 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_811 (Array (_ BitVec 32) (_ BitVec 32)))) (or (and (forall ((v_ArrVal_812 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_811) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_810) c_create_data_~data~0.base) .cse3) v_ArrVal_812)) c_create_data_~data~0.base) .cse3))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv8 32)) (bvadd .cse0 .cse1 (_ bv12 32))))) (forall ((v_ArrVal_813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_812 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_810))) (let ((.cse5 (select (select .cse7 c_create_data_~data~0.base) .cse6))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_811) .cse5 v_ArrVal_812) c_create_data_~data~0.base) .cse6) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_813) c_create_data_~data~0.base) .cse6))))))))) (not (let ((.cse9 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse9))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_811) c_create_data_~data~0.base) .cse9) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_810) c_create_data_~data~0.base) .cse9)))))))) is different from false [2021-12-18 20:53:40,628 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_811 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (let ((.cse1 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_811) c_create_data_~data~0.base) .cse1) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_810) c_create_data_~data~0.base) .cse1)))))) (and (forall ((v_ArrVal_813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_812 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_810))) (let ((.cse3 (select (select .cse5 c_create_data_~data~0.base) .cse4))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_811) .cse3 v_ArrVal_812) c_create_data_~data~0.base) .cse4) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv16 32)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_813) c_create_data_~data~0.base) .cse4)))))))) (forall ((v_ArrVal_812 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (let ((.cse9 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse9))) (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_811) (select (select (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_810) c_create_data_~data~0.base) .cse9) v_ArrVal_812)) c_create_data_~data~0.base) .cse9))) (.cse7 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse6 .cse7 (_ bv12 32)) (bvadd .cse6 .cse7 (_ bv16 32)))))))) is different from false [2021-12-18 20:53:42,487 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_809 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_811 (Array (_ BitVec 32) (_ BitVec 32)))) (or (and (forall ((v_ArrVal_812 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (let ((.cse4 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_809))) (let ((.cse2 (select (select .cse3 c_create_data_~data~0.base) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_808) .cse2 v_ArrVal_811) (select (select (store .cse3 .cse2 v_ArrVal_810) c_create_data_~data~0.base) .cse4) v_ArrVal_812))) c_create_data_~data~0.base) .cse4))) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse0 .cse1 (_ bv12 32)) (bvadd .cse0 .cse1 (_ bv16 32))))) (forall ((v_ArrVal_813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_812 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_809)) (.cse7 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse5 (select (select .cse9 c_create_data_~data~0.base) .cse7))) (let ((.cse8 (store .cse9 .cse5 v_ArrVal_810))) (let ((.cse6 (select (select .cse8 c_create_data_~data~0.base) .cse7))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_808) .cse5 v_ArrVal_811) .cse6 v_ArrVal_812) c_create_data_~data~0.base) .cse7) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv16 32)) (select |c_#length| (select (select (store .cse8 .cse6 v_ArrVal_813) c_create_data_~data~0.base) .cse7))))))))) (not (let ((.cse12 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_809)) (.cse11 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse10 (select (select .cse12 c_create_data_~data~0.base) .cse11))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_808) .cse10 v_ArrVal_811) c_create_data_~data~0.base) .cse11) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse12 .cse10 v_ArrVal_810) c_create_data_~data~0.base) .cse11)))))))) is different from false [2021-12-18 20:53:43,470 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_809 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_811 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_809))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_808) .cse1 v_ArrVal_811) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_810) c_create_data_~data~0.base) .cse2)))))))) (and (forall ((v_ArrVal_812 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (let ((.cse9 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse9))) (let ((.cse8 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_809))) (let ((.cse7 (select (select .cse8 c_create_data_~data~0.base) .cse9))) (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_808) .cse7 v_ArrVal_811) (select (select (store .cse8 .cse7 v_ArrVal_810) c_create_data_~data~0.base) .cse9) v_ArrVal_812)))) c_create_data_~data~0.base) .cse9))) (.cse5 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse4 .cse5 (_ bv12 32)) (bvadd .cse4 .cse5 (_ bv16 32))))) (forall ((v_ArrVal_813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_812 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse13 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse10 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse13))) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse10 v_ArrVal_809))) (let ((.cse11 (select (select .cse15 c_create_data_~data~0.base) .cse13))) (let ((.cse14 (store .cse15 .cse11 v_ArrVal_810))) (let ((.cse12 (select (select .cse14 c_create_data_~data~0.base) .cse13))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse10 v_ArrVal_808) .cse11 v_ArrVal_811) .cse12 v_ArrVal_812) c_create_data_~data~0.base) .cse13) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv16 32)) (select |c_#length| (select (select (store .cse14 .cse12 v_ArrVal_813) c_create_data_~data~0.base) .cse13))))))))))))) is different from false [2021-12-18 20:53:45,280 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_809 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_811 (Array (_ BitVec 32) (_ BitVec 32)))) (or (and (forall ((v_ArrVal_813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_812 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_809))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_810))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_808) .cse1 v_ArrVal_811) .cse2 v_ArrVal_812) c_create_data_~data~0.base) .cse3) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv20 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_813) c_create_data_~data~0.base) .cse3)))))))))) (forall ((v_ArrVal_812 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (let ((.cse11 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse11))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_809))) (let ((.cse9 (select (select .cse10 c_create_data_~data~0.base) .cse11))) (store (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_808) .cse9 v_ArrVal_811) (select (select (store .cse10 .cse9 v_ArrVal_810) c_create_data_~data~0.base) .cse11) v_ArrVal_812)))) c_create_data_~data~0.base) .cse11))) (.cse7 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse6 .cse7 (_ bv16 32)) (bvadd .cse6 .cse7 (_ bv20 32)))))) (not (let ((.cse14 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse12 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse14))) (let ((.cse15 (store |c_#memory_$Pointer$.base| .cse12 v_ArrVal_809))) (let ((.cse13 (select (select .cse15 c_create_data_~data~0.base) .cse14))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse12 v_ArrVal_808) .cse13 v_ArrVal_811) c_create_data_~data~0.base) .cse14) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv16 32)) (select |c_#length| (select (select (store .cse15 .cse13 v_ArrVal_810) c_create_data_~data~0.base) .cse14)))))))))) is different from false [2021-12-18 20:53:47,344 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_806 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_809 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_811 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_806)) (.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_809))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_807) .cse0 v_ArrVal_808) .cse1 v_ArrVal_811) c_create_data_~data~0.base) .cse2) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv16 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_810) c_create_data_~data~0.base) .cse2)))))))) (and (forall ((v_ArrVal_813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_812 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_806)) (.cse8 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse5 (select (select .cse11 c_create_data_~data~0.base) .cse8))) (let ((.cse10 (store .cse11 .cse5 v_ArrVal_809))) (let ((.cse6 (select (select .cse10 c_create_data_~data~0.base) .cse8))) (let ((.cse9 (store .cse10 .cse6 v_ArrVal_810))) (let ((.cse7 (select (select .cse9 c_create_data_~data~0.base) .cse8))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_807) .cse5 v_ArrVal_808) .cse6 v_ArrVal_811) .cse7 v_ArrVal_812) c_create_data_~data~0.base) .cse8) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv20 32)) (select |c_#length| (select (select (store .cse9 .cse7 v_ArrVal_813) c_create_data_~data~0.base) .cse8)))))))))) (forall ((v_ArrVal_812 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse12 (let ((.cse17 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse18 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_806))) (let ((.cse14 (select (select .cse18 c_create_data_~data~0.base) .cse17))) (let ((.cse16 (store .cse18 .cse14 v_ArrVal_809))) (let ((.cse15 (select (select .cse16 c_create_data_~data~0.base) .cse17))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_807) .cse14 v_ArrVal_808) .cse15 v_ArrVal_811) (select (select (store .cse16 .cse15 v_ArrVal_810) c_create_data_~data~0.base) .cse17) v_ArrVal_812))))) c_create_data_~data~0.base) .cse17))) (.cse13 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse12 .cse13 (_ bv16 32)) (bvadd .cse12 .cse13 (_ bv20 32)))))))) is different from false [2021-12-18 20:53:48,812 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_806 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_809 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_811 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_806))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_809))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_807) .cse1 v_ArrVal_808) .cse2 v_ArrVal_811) c_create_data_~data~0.base) .cse3) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv16 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_810) c_create_data_~data~0.base) .cse3)))))))))) (and (forall ((v_ArrVal_812 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (let ((.cse12 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse8 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse12))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_806))) (let ((.cse9 (select (select .cse13 c_create_data_~data~0.base) .cse12))) (let ((.cse11 (store .cse13 .cse9 v_ArrVal_809))) (let ((.cse10 (select (select .cse11 c_create_data_~data~0.base) .cse12))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_807) .cse9 v_ArrVal_808) .cse10 v_ArrVal_811) (select (select (store .cse11 .cse10 v_ArrVal_810) c_create_data_~data~0.base) .cse12) v_ArrVal_812)))))) c_create_data_~data~0.base) .cse12))) (.cse7 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (bvule (bvadd .cse6 .cse7 (_ bv16 32)) (bvadd .cse6 .cse7 (_ bv20 32))))) (forall ((v_ArrVal_813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_812 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse18 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse14 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse18))) (let ((.cse21 (store |c_#memory_$Pointer$.base| .cse14 v_ArrVal_806))) (let ((.cse15 (select (select .cse21 c_create_data_~data~0.base) .cse18))) (let ((.cse20 (store .cse21 .cse15 v_ArrVal_809))) (let ((.cse16 (select (select .cse20 c_create_data_~data~0.base) .cse18))) (let ((.cse19 (store .cse20 .cse16 v_ArrVal_810))) (let ((.cse17 (select (select .cse19 c_create_data_~data~0.base) .cse18))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse14 v_ArrVal_807) .cse15 v_ArrVal_808) .cse16 v_ArrVal_811) .cse17 v_ArrVal_812) c_create_data_~data~0.base) .cse18) (bvmul c_create_data_~counter~0 (_ bv4 32)) (_ bv20 32)) (select |c_#length| (select (select (store .cse19 .cse17 v_ArrVal_813) c_create_data_~data~0.base) .cse18))))))))))))))) is different from false [2021-12-18 20:53:50,658 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_806 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_807 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_808 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_809 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_810 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_811 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_806))) (let ((.cse1 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_809))) (let ((.cse2 (select (select .cse4 c_create_data_~data~0.base) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_807) .cse1 v_ArrVal_808) .cse2 v_ArrVal_811) c_create_data_~data~0.base) .cse3) (_ bv16 32)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_810) c_create_data_~data~0.base) .cse3)))))))))) (and (forall ((v_ArrVal_813 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_812 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse10))) (let ((.cse13 (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_806))) (let ((.cse7 (select (select .cse13 c_create_data_~data~0.base) .cse10))) (let ((.cse12 (store .cse13 .cse7 v_ArrVal_809))) (let ((.cse8 (select (select .cse12 c_create_data_~data~0.base) .cse10))) (let ((.cse11 (store .cse12 .cse8 v_ArrVal_810))) (let ((.cse9 (select (select .cse11 c_create_data_~data~0.base) .cse10))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_807) .cse7 v_ArrVal_808) .cse8 v_ArrVal_811) .cse9 v_ArrVal_812) c_create_data_~data~0.base) .cse10) (_ bv20 32)) (select |c_#length| (select (select (store .cse11 .cse9 v_ArrVal_813) c_create_data_~data~0.base) .cse10)))))))))))) (forall ((v_ArrVal_812 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse14 (let ((.cse19 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (select (select (let ((.cse15 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse19))) (let ((.cse20 (store |c_#memory_$Pointer$.base| .cse15 v_ArrVal_806))) (let ((.cse16 (select (select .cse20 c_create_data_~data~0.base) .cse19))) (let ((.cse18 (store .cse20 .cse16 v_ArrVal_809))) (let ((.cse17 (select (select .cse18 c_create_data_~data~0.base) .cse19))) (store (store (store (store |c_#memory_$Pointer$.offset| .cse15 v_ArrVal_807) .cse16 v_ArrVal_808) .cse17 v_ArrVal_811) (select (select (store .cse18 .cse17 v_ArrVal_810) c_create_data_~data~0.base) .cse19) v_ArrVal_812)))))) c_create_data_~data~0.base) .cse19)))) (bvule (bvadd .cse14 (_ bv16 32)) (bvadd .cse14 (_ bv20 32)))))))) is different from false [2021-12-18 20:53:50,899 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:50,899 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 886 treesize of output 856 [2021-12-18 20:53:51,103 INFO L354 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-12-18 20:53:51,104 INFO L388 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 856 treesize of output 506 [2021-12-18 20:53:51,353 INFO L388 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 9717776 treesize of output 8423270 Killed by 15