./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b5317dae 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_test02-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 cb1edb9fb334d503cba549895692ff1d9d77f795ecc0798895274120b4ed179d --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:19:18,056 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:19:18,058 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:19:18,088 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:19:18,089 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:19:18,091 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:19:18,092 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:19:18,094 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:19:18,095 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:19:18,099 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:19:18,100 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:19:18,101 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:19:18,102 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:19:18,103 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:19:18,104 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:19:18,107 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:19:18,107 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:19:18,108 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:19:18,109 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:19:18,111 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:19:18,112 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:19:18,112 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:19:18,113 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:19:18,114 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:19:18,121 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:19:18,121 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:19:18,121 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:19:18,122 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:19:18,123 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:19:18,123 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:19:18,124 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:19:18,124 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:19:18,125 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:19:18,126 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:19:18,126 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:19:18,126 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:19:18,127 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:19:18,127 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:19:18,127 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:19:18,128 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:19:18,129 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:19:18,129 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-16 03:19:18,152 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:19:18,152 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:19:18,153 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:19:18,153 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:19:18,153 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:19:18,154 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:19:18,154 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:19:18,154 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:19:18,154 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:19:18,155 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:19:18,155 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:19:18,155 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:19:18,155 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:19:18,156 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:19:18,156 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:19:18,156 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:19:18,156 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:19:18,156 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:19:18,156 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:19:18,157 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:19:18,157 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:19:18,157 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:19:18,157 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:19:18,157 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:19:18,157 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:19:18,157 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:19:18,158 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:19:18,158 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:19:18,158 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 03:19:18,158 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 03:19:18,158 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:19:18,159 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:19:18,159 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:19:18,159 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:19:18,159 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> cb1edb9fb334d503cba549895692ff1d9d77f795ecc0798895274120b4ed179d [2023-02-16 03:19:18,360 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:19:18,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:19:18,381 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:19:18,382 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:19:18,382 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:19:18,383 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2023-02-16 03:19:19,382 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:19:19,538 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:19:19,538 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2023-02-16 03:19:19,551 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce88dd433/88850968590c48d8bdc974c96a57167d/FLAG0ed6e12e8 [2023-02-16 03:19:19,563 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce88dd433/88850968590c48d8bdc974c96a57167d [2023-02-16 03:19:19,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:19:19,566 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:19:19,567 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:19:19,567 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:19:19,569 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:19:19,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:19:19" (1/1) ... [2023-02-16 03:19:19,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e97bb3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:19:19, skipping insertion in model container [2023-02-16 03:19:19,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:19:19" (1/1) ... [2023-02-16 03:19:19,575 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:19:19,612 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:19:19,863 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:19:19,872 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-02-16 03:19:19,873 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5a88e0f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:19:19, skipping insertion in model container [2023-02-16 03:19:19,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:19:19,874 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-16 03:19:19,875 INFO L158 Benchmark]: Toolchain (without parser) took 308.70ms. Allocated memory is still 216.0MB. Free memory was 169.2MB in the beginning and 157.4MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-16 03:19:19,875 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 134.2MB. Free memory is still 79.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 03:19:19,876 INFO L158 Benchmark]: CACSL2BoogieTranslator took 307.20ms. Allocated memory is still 216.0MB. Free memory was 169.2MB in the beginning and 157.4MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-16 03:19:19,877 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 134.2MB. Free memory is still 79.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 307.20ms. Allocated memory is still 216.0MB. Free memory was 169.2MB in the beginning and 157.4MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. 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 of different sizes 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_test02-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 cb1edb9fb334d503cba549895692ff1d9d77f795ecc0798895274120b4ed179d --- Real Ultimate output --- This is Ultimate 0.2.2-?-b5317da-m [2023-02-16 03:19:21,510 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:19:21,512 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:19:21,542 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:19:21,543 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:19:21,545 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:19:21,546 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:19:21,549 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:19:21,552 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:19:21,555 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:19:21,556 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:19:21,557 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:19:21,558 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:19:21,559 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:19:21,560 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:19:21,562 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:19:21,571 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:19:21,572 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:19:21,573 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:19:21,577 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:19:21,577 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:19:21,578 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:19:21,579 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:19:21,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:19:21,584 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:19:21,584 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:19:21,584 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:19:21,585 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:19:21,587 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:19:21,587 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:19:21,587 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:19:21,589 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:19:21,590 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:19:21,590 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:19:21,591 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:19:21,591 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:19:21,591 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:19:21,592 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:19:21,592 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:19:21,592 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:19:21,593 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:19:21,593 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-16 03:19:21,618 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:19:21,618 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:19:21,619 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:19:21,619 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:19:21,620 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:19:21,620 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:19:21,620 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:19:21,620 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:19:21,620 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:19:21,621 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:19:21,621 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:19:21,621 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:19:21,622 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:19:21,622 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:19:21,622 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:19:21,622 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:19:21,622 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:19:21,622 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:19:21,623 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:19:21,623 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:19:21,623 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-16 03:19:21,623 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-16 03:19:21,623 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:19:21,623 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:19:21,624 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:19:21,624 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:19:21,624 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:19:21,624 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:19:21,624 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:19:21,624 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:19:21,625 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-16 03:19:21,625 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-16 03:19:21,625 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:19:21,625 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:19:21,625 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:19:21,625 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-16 03:19:21,626 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:19:21,626 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> cb1edb9fb334d503cba549895692ff1d9d77f795ecc0798895274120b4ed179d [2023-02-16 03:19:21,909 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:19:21,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:19:21,925 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:19:21,926 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:19:21,926 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:19:21,927 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2023-02-16 03:19:23,041 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:19:23,267 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:19:23,268 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2023-02-16 03:19:23,278 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c9c2bc66/3c61acd82ce6499d916fd7361ecbd3f9/FLAG7d36a3259 [2023-02-16 03:19:23,291 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c9c2bc66/3c61acd82ce6499d916fd7361ecbd3f9 [2023-02-16 03:19:23,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:19:23,293 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:19:23,295 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:19:23,295 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:19:23,298 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:19:23,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:19:23" (1/1) ... [2023-02-16 03:19:23,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35b62898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:19:23, skipping insertion in model container [2023-02-16 03:19:23,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:19:23" (1/1) ... [2023-02-16 03:19:23,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:19:23,335 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:19:23,578 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:19:23,589 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-16 03:19:23,596 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:19:23,631 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:19:23,639 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 03:19:23,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:19:23,711 INFO L208 MainTranslator]: Completed translation [2023-02-16 03:19:23,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:19:23 WrapperNode [2023-02-16 03:19:23,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:19:23,712 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 03:19:23,712 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 03:19:23,712 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 03:19:23,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:19:23" (1/1) ... [2023-02-16 03:19:23,741 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:19:23" (1/1) ... [2023-02-16 03:19:23,766 INFO L138 Inliner]: procedures = 129, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2023-02-16 03:19:23,766 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 03:19:23,767 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 03:19:23,768 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 03:19:23,768 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 03:19:23,774 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:19:23" (1/1) ... [2023-02-16 03:19:23,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:19:23" (1/1) ... [2023-02-16 03:19:23,787 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:19:23" (1/1) ... [2023-02-16 03:19:23,789 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:19:23" (1/1) ... [2023-02-16 03:19:23,798 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:19:23" (1/1) ... [2023-02-16 03:19:23,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:19:23" (1/1) ... [2023-02-16 03:19:23,817 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:19:23" (1/1) ... [2023-02-16 03:19:23,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:19:23" (1/1) ... [2023-02-16 03:19:23,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 03:19:23,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 03:19:23,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 03:19:23,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 03:19:23,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:19:23" (1/1) ... [2023-02-16 03:19:23,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:19:23,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:19:23,913 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) [2023-02-16 03:19:23,952 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 [2023-02-16 03:19:23,959 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-16 03:19:23,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 03:19:23,960 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2023-02-16 03:19:23,960 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2023-02-16 03:19:23,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 03:19:23,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 03:19:23,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 03:19:23,960 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 03:19:23,960 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 03:19:23,960 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-16 03:19:23,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-16 03:19:23,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-16 03:19:23,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 03:19:23,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 03:19:24,053 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 03:19:24,054 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 03:19:24,688 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 03:19:24,693 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 03:19:24,693 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-16 03:19:24,694 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:19:24 BoogieIcfgContainer [2023-02-16 03:19:24,694 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 03:19:24,696 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 03:19:24,696 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 03:19:24,698 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 03:19:24,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 03:19:23" (1/3) ... [2023-02-16 03:19:24,698 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f739a6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:19:24, skipping insertion in model container [2023-02-16 03:19:24,698 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:19:23" (2/3) ... [2023-02-16 03:19:24,699 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f739a6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:19:24, skipping insertion in model container [2023-02-16 03:19:24,699 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:19:24" (3/3) ... [2023-02-16 03:19:24,699 INFO L112 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02-2.i [2023-02-16 03:19:24,709 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 03:19:24,710 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2023-02-16 03:19:24,736 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 03:19:24,741 INFO L357 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=PETRI_NET, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@71d8b33d, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 03:19:24,741 INFO L358 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2023-02-16 03:19:24,744 INFO L276 IsEmpty]: Start isEmpty. Operand has 189 states, 93 states have (on average 2.161290322580645) internal successors, (201), 185 states have internal predecessors, (201), 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) [2023-02-16 03:19:24,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-16 03:19:24,747 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:19:24,748 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-16 03:19:24,748 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-16 03:19:24,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:19:24,753 INFO L85 PathProgramCache]: Analyzing trace with hash 5052905, now seen corresponding path program 1 times [2023-02-16 03:19:24,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:19:24,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [709809900] [2023-02-16 03:19:24,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:19:24,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:19:24,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:19:24,773 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:19:24,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-16 03:19:24,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:19:24,832 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-16 03:19:24,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:19:24,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:19:24,847 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:19:24,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:19:24,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [709809900] [2023-02-16 03:19:24,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [709809900] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:19:24,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:19:24,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:19:24,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003351562] [2023-02-16 03:19:24,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:19:24,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 03:19:24,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:19:24,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 03:19:24,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 03:19:24,876 INFO L87 Difference]: Start difference. First operand has 189 states, 93 states have (on average 2.161290322580645) internal successors, (201), 185 states have internal predecessors, (201), 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 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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) [2023-02-16 03:19:24,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:19:24,896 INFO L93 Difference]: Finished difference Result 189 states and 200 transitions. [2023-02-16 03:19:24,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 03:19:24,897 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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 [2023-02-16 03:19:24,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:19:24,902 INFO L225 Difference]: With dead ends: 189 [2023-02-16 03:19:24,902 INFO L226 Difference]: Without dead ends: 187 [2023-02-16 03:19:24,903 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 03:19:24,905 INFO L413 NwaCegarLoop]: 200 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:19:24,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:19:24,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-02-16 03:19:24,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2023-02-16 03:19:24,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 92 states have (on average 2.108695652173913) internal successors, (194), 183 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) [2023-02-16 03:19:24,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 198 transitions. [2023-02-16 03:19:24,949 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 198 transitions. Word has length 4 [2023-02-16 03:19:24,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:19:24,949 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 198 transitions. [2023-02-16 03:19:24,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 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) [2023-02-16 03:19:24,950 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 198 transitions. [2023-02-16 03:19:24,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-16 03:19:24,950 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:19:24,950 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-16 03:19:24,971 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-16 03:19:25,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:19:25,157 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-16 03:19:25,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:19:25,157 INFO L85 PathProgramCache]: Analyzing trace with hash 5050693, now seen corresponding path program 1 times [2023-02-16 03:19:25,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:19:25,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434645144] [2023-02-16 03:19:25,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:19:25,158 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:19:25,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:19:25,164 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:19:25,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-16 03:19:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:19:25,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:19:25,301 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:19:25,345 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-16 03:19:25,372 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 03:19:25,373 INFO L350 Elim1Store]: Elim1 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 14 treesize of output 20 [2023-02-16 03:19:25,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:19:25,394 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:19:25,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:19:25,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434645144] [2023-02-16 03:19:25,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [434645144] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:19:25,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:19:25,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:19:25,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105130804] [2023-02-16 03:19:25,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:19:25,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:19:25,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:19:25,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:19:25,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:19:25,397 INFO L87 Difference]: Start difference. First operand 187 states and 198 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) [2023-02-16 03:19:25,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:19:25,808 INFO L93 Difference]: Finished difference Result 207 states and 219 transitions. [2023-02-16 03:19:25,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:19:25,808 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 [2023-02-16 03:19:25,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:19:25,809 INFO L225 Difference]: With dead ends: 207 [2023-02-16 03:19:25,809 INFO L226 Difference]: Without dead ends: 207 [2023-02-16 03:19:25,809 INFO L412 NwaCegarLoop]: 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 [2023-02-16 03:19:25,810 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 149 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:19:25,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 287 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 03:19:25,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-02-16 03:19:25,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 181. [2023-02-16 03:19:25,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 92 states have (on average 2.0434782608695654) 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) [2023-02-16 03:19:25,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 192 transitions. [2023-02-16 03:19:25,818 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 192 transitions. Word has length 4 [2023-02-16 03:19:25,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:19:25,818 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 192 transitions. [2023-02-16 03:19:25,818 INFO L496 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) [2023-02-16 03:19:25,818 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions. [2023-02-16 03:19:25,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-16 03:19:25,819 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:19:25,819 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-16 03:19:25,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-02-16 03:19:26,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:19:26,022 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-16 03:19:26,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:19:26,022 INFO L85 PathProgramCache]: Analyzing trace with hash 5050694, now seen corresponding path program 1 times [2023-02-16 03:19:26,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:19:26,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1226826658] [2023-02-16 03:19:26,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:19:26,023 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:19:26,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:19:26,025 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:19:26,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-16 03:19:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:19:26,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 03:19:26,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:19:26,133 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:26,138 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-16 03:19:26,181 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:19:26,182 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:26,189 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:19:26,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-16 03:19:26,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:19:26,214 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:19:26,215 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:19:26,215 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1226826658] [2023-02-16 03:19:26,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1226826658] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:19:26,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:19:26,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:19:26,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032628669] [2023-02-16 03:19:26,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:19:26,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:19:26,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:19:26,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:19:26,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:19:26,217 INFO L87 Difference]: Start difference. First operand 181 states and 192 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) [2023-02-16 03:19:26,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:19:26,679 INFO L93 Difference]: Finished difference Result 197 states and 211 transitions. [2023-02-16 03:19:26,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:19:26,684 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 [2023-02-16 03:19:26,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:19:26,686 INFO L225 Difference]: With dead ends: 197 [2023-02-16 03:19:26,686 INFO L226 Difference]: Without dead ends: 197 [2023-02-16 03:19:26,686 INFO L412 NwaCegarLoop]: 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 [2023-02-16 03:19:26,686 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 28 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 344 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 [2023-02-16 03:19:26,687 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 344 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 03:19:26,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-02-16 03:19:26,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 186. [2023-02-16 03:19:26,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 182 states have internal predecessors, (195), 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) [2023-02-16 03:19:26,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 199 transitions. [2023-02-16 03:19:26,694 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 199 transitions. Word has length 4 [2023-02-16 03:19:26,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:19:26,694 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 199 transitions. [2023-02-16 03:19:26,694 INFO L496 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) [2023-02-16 03:19:26,694 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 199 transitions. [2023-02-16 03:19:26,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-16 03:19:26,694 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:19:26,695 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-16 03:19:26,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-16 03:19:26,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:19:26,899 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-16 03:19:26,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:19:26,899 INFO L85 PathProgramCache]: Analyzing trace with hash 156571597, now seen corresponding path program 1 times [2023-02-16 03:19:26,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:19:26,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [889136609] [2023-02-16 03:19:26,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:19:26,902 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:19:26,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:19:26,903 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:19:26,903 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-16 03:19:26,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:19:26,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 03:19:26,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:19:26,967 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-16 03:19:26,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:19:26,971 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:19:26,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:19:26,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [889136609] [2023-02-16 03:19:26,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [889136609] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:19:26,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:19:26,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:19:26,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473297849] [2023-02-16 03:19:26,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:19:26,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:19:26,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:19:26,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:19:26,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:19:26,974 INFO L87 Difference]: Start difference. First operand 186 states and 199 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) [2023-02-16 03:19:27,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:19:27,173 INFO L93 Difference]: Finished difference Result 209 states and 222 transitions. [2023-02-16 03:19:27,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:19:27,173 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 [2023-02-16 03:19:27,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:19:27,174 INFO L225 Difference]: With dead ends: 209 [2023-02-16 03:19:27,174 INFO L226 Difference]: Without dead ends: 209 [2023-02-16 03:19:27,174 INFO L412 NwaCegarLoop]: 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 [2023-02-16 03:19:27,175 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 64 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 232 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 [2023-02-16 03:19:27,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 232 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:19:27,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-02-16 03:19:27,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 184. [2023-02-16 03:19:27,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 97 states have (on average 1.9793814432989691) internal successors, (192), 180 states have internal predecessors, (192), 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) [2023-02-16 03:19:27,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 196 transitions. [2023-02-16 03:19:27,181 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 196 transitions. Word has length 5 [2023-02-16 03:19:27,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:19:27,181 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 196 transitions. [2023-02-16 03:19:27,181 INFO L496 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) [2023-02-16 03:19:27,181 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 196 transitions. [2023-02-16 03:19:27,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-16 03:19:27,182 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:19:27,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-16 03:19:27,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-02-16 03:19:27,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:19:27,388 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-16 03:19:27,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:19:27,388 INFO L85 PathProgramCache]: Analyzing trace with hash 156571598, now seen corresponding path program 1 times [2023-02-16 03:19:27,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:19:27,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [560073298] [2023-02-16 03:19:27,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:19:27,389 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:19:27,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:19:27,390 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:19:27,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-16 03:19:27,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:19:27,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:19:27,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:19:27,489 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:27,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:19:27,500 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:19:27,500 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:19:27,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [560073298] [2023-02-16 03:19:27,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [560073298] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:19:27,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:19:27,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:19:27,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585439944] [2023-02-16 03:19:27,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:19:27,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:19:27,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:19:27,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:19:27,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:19:27,503 INFO L87 Difference]: Start difference. First operand 184 states and 196 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) [2023-02-16 03:19:27,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:19:27,763 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2023-02-16 03:19:27,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:19:27,764 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 [2023-02-16 03:19:27,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:19:27,765 INFO L225 Difference]: With dead ends: 182 [2023-02-16 03:19:27,765 INFO L226 Difference]: Without dead ends: 182 [2023-02-16 03:19:27,765 INFO L412 NwaCegarLoop]: 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 [2023-02-16 03:19:27,765 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 11 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 273 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.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:19:27,766 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 273 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:19:27,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-02-16 03:19:27,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2023-02-16 03:19:27,770 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) [2023-02-16 03:19:27,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2023-02-16 03:19:27,770 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 5 [2023-02-16 03:19:27,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:19:27,771 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2023-02-16 03:19:27,771 INFO L496 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) [2023-02-16 03:19:27,771 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2023-02-16 03:19:27,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-16 03:19:27,771 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:19:27,772 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:19:27,782 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-16 03:19:27,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:19:27,979 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-16 03:19:27,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:19:27,979 INFO L85 PathProgramCache]: Analyzing trace with hash 666573431, now seen corresponding path program 1 times [2023-02-16 03:19:27,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:19:27,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [676705243] [2023-02-16 03:19:27,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:19:27,980 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:19:27,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:19:27,981 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:19:27,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-16 03:19:28,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:19:28,041 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-16 03:19:28,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:19:28,053 INFO L350 Elim1Store]: Elim1 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 7 [2023-02-16 03:19:28,074 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:19:28,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-16 03:19:28,104 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:28,108 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:28,127 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:28,131 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:28,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:19:28,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:19:28,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:19:28,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [676705243] [2023-02-16 03:19:28,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [676705243] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:19:28,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:19:28,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-16 03:19:28,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391673010] [2023-02-16 03:19:28,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:19:28,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:19:28,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:19:28,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:19:28,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:19:28,142 INFO L87 Difference]: Start difference. First operand 182 states and 193 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) [2023-02-16 03:19:28,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:19:28,477 INFO L93 Difference]: Finished difference Result 184 states and 196 transitions. [2023-02-16 03:19:28,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:19:28,478 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 [2023-02-16 03:19:28,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:19:28,479 INFO L225 Difference]: With dead ends: 184 [2023-02-16 03:19:28,479 INFO L226 Difference]: Without dead ends: 184 [2023-02-16 03:19:28,479 INFO L412 NwaCegarLoop]: 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 [2023-02-16 03:19:28,480 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 6 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:19:28,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 606 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:19:28,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-02-16 03:19:28,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2023-02-16 03:19:28,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 98 states have (on average 1.9387755102040816) internal successors, (190), 179 states have internal predecessors, (190), 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) [2023-02-16 03:19:28,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 194 transitions. [2023-02-16 03:19:28,484 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 194 transitions. Word has length 10 [2023-02-16 03:19:28,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:19:28,485 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 194 transitions. [2023-02-16 03:19:28,485 INFO L496 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) [2023-02-16 03:19:28,485 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 194 transitions. [2023-02-16 03:19:28,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-16 03:19:28,485 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:19:28,485 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:19:28,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-16 03:19:28,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:19:28,692 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-16 03:19:28,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:19:28,693 INFO L85 PathProgramCache]: Analyzing trace with hash 623653565, now seen corresponding path program 1 times [2023-02-16 03:19:28,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:19:28,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [768035189] [2023-02-16 03:19:28,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:19:28,695 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:19:28,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:19:28,696 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:19:28,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-16 03:19:28,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:19:28,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 03:19:28,747 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:19:28,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:19:28,763 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:19:28,763 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:19:28,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [768035189] [2023-02-16 03:19:28,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [768035189] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:19:28,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:19:28,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:19:28,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769131569] [2023-02-16 03:19:28,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:19:28,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:19:28,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:19:28,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:19:28,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:19:28,765 INFO L87 Difference]: Start difference. First operand 183 states and 194 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) [2023-02-16 03:19:28,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:19:28,789 INFO L93 Difference]: Finished difference Result 260 states and 275 transitions. [2023-02-16 03:19:28,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:19:28,790 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 [2023-02-16 03:19:28,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:19:28,791 INFO L225 Difference]: With dead ends: 260 [2023-02-16 03:19:28,791 INFO L226 Difference]: Without dead ends: 260 [2023-02-16 03:19:28,791 INFO L412 NwaCegarLoop]: 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 [2023-02-16 03:19:28,791 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 81 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:19:28,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 548 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-16 03:19:28,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-02-16 03:19:28,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 224. [2023-02-16 03:19:28,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 138 states have (on average 1.963768115942029) internal successors, (271), 219 states have internal predecessors, (271), 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) [2023-02-16 03:19:28,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 275 transitions. [2023-02-16 03:19:28,797 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 275 transitions. Word has length 12 [2023-02-16 03:19:28,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:19:28,798 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 275 transitions. [2023-02-16 03:19:28,798 INFO L496 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) [2023-02-16 03:19:28,798 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 275 transitions. [2023-02-16 03:19:28,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-16 03:19:28,798 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:19:28,798 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:19:28,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-16 03:19:29,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:19:29,006 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting create_dataErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-16 03:19:29,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:19:29,006 INFO L85 PathProgramCache]: Analyzing trace with hash -2141569776, now seen corresponding path program 1 times [2023-02-16 03:19:29,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:19:29,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [985651043] [2023-02-16 03:19:29,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:19:29,007 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:19:29,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:19:29,008 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:19:29,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-16 03:19:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:19:29,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-16 03:19:29,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:19:29,106 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 03:19:29,106 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:29,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:19:29,116 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:19:29,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:19:29,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [985651043] [2023-02-16 03:19:29,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [985651043] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:19:29,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:19:29,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:19:29,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817676040] [2023-02-16 03:19:29,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:19:29,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:19:29,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:19:29,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:19:29,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:19:29,118 INFO L87 Difference]: Start difference. First operand 224 states and 275 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) [2023-02-16 03:19:29,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:19:29,335 INFO L93 Difference]: Finished difference Result 227 states and 271 transitions. [2023-02-16 03:19:29,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:19:29,336 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 [2023-02-16 03:19:29,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:19:29,337 INFO L225 Difference]: With dead ends: 227 [2023-02-16 03:19:29,337 INFO L226 Difference]: Without dead ends: 227 [2023-02-16 03:19:29,337 INFO L412 NwaCegarLoop]: 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 [2023-02-16 03:19:29,337 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 62 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:19:29,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 202 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-16 03:19:29,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-16 03:19:29,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 218. [2023-02-16 03:19:29,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 144 states have (on average 1.8125) internal successors, (261), 213 states have internal predecessors, (261), 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) [2023-02-16 03:19:29,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 265 transitions. [2023-02-16 03:19:29,341 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 265 transitions. Word has length 13 [2023-02-16 03:19:29,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:19:29,341 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 265 transitions. [2023-02-16 03:19:29,341 INFO L496 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) [2023-02-16 03:19:29,341 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 265 transitions. [2023-02-16 03:19:29,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-16 03:19:29,342 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:19:29,342 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:19:29,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-16 03:19:29,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:19:29,549 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting create_dataErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-16 03:19:29,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:19:29,550 INFO L85 PathProgramCache]: Analyzing trace with hash -2141569775, now seen corresponding path program 1 times [2023-02-16 03:19:29,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:19:29,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438695164] [2023-02-16 03:19:29,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:19:29,551 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:19:29,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:19:29,552 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:19:29,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-16 03:19:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:19:29,613 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-16 03:19:29,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:19:29,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:19:29,640 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:29,648 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-02-16 03:19:29,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:19:29,656 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:19:29,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:19:29,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438695164] [2023-02-16 03:19:29,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438695164] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:19:29,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:19:29,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:19:29,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735507671] [2023-02-16 03:19:29,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:19:29,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:19:29,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:19:29,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:19:29,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:19:29,660 INFO L87 Difference]: Start difference. First operand 218 states and 265 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) [2023-02-16 03:19:29,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:19:29,975 INFO L93 Difference]: Finished difference Result 239 states and 279 transitions. [2023-02-16 03:19:29,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:19:29,975 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 [2023-02-16 03:19:29,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:19:29,976 INFO L225 Difference]: With dead ends: 239 [2023-02-16 03:19:29,976 INFO L226 Difference]: Without dead ends: 239 [2023-02-16 03:19:29,976 INFO L412 NwaCegarLoop]: 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 [2023-02-16 03:19:29,977 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 49 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:19:29,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 212 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:19:29,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-02-16 03:19:29,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 219. [2023-02-16 03:19:29,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 154 states have (on average 1.655844155844156) internal successors, (255), 214 states have internal predecessors, (255), 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) [2023-02-16 03:19:29,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 259 transitions. [2023-02-16 03:19:29,980 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 259 transitions. Word has length 13 [2023-02-16 03:19:29,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:19:29,980 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 259 transitions. [2023-02-16 03:19:29,980 INFO L496 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) [2023-02-16 03:19:29,981 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 259 transitions. [2023-02-16 03:19:29,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 03:19:29,981 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:19:29,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:19:29,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-16 03:19:30,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:19:30,190 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-16 03:19:30,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:19:30,190 INFO L85 PathProgramCache]: Analyzing trace with hash 533828155, now seen corresponding path program 1 times [2023-02-16 03:19:30,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:19:30,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2029569827] [2023-02-16 03:19:30,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:19:30,191 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:19:30,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:19:30,192 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:19:30,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-16 03:19:30,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:19:30,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:19:30,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:19:30,283 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-16 03:19:30,284 INFO L350 Elim1Store]: Elim1 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 19 [2023-02-16 03:19:30,296 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:30,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-02-16 03:19:30,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:19:30,317 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:19:30,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:19:30,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2029569827] [2023-02-16 03:19:30,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2029569827] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:19:30,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:19:30,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:19:30,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468012931] [2023-02-16 03:19:30,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:19:30,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:19:30,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:19:30,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:19:30,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:19:30,319 INFO L87 Difference]: Start difference. First operand 219 states and 259 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) [2023-02-16 03:19:30,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:19:30,733 INFO L93 Difference]: Finished difference Result 270 states and 323 transitions. [2023-02-16 03:19:30,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:19:30,734 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 [2023-02-16 03:19:30,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:19:30,735 INFO L225 Difference]: With dead ends: 270 [2023-02-16 03:19:30,735 INFO L226 Difference]: Without dead ends: 270 [2023-02-16 03:19:30,736 INFO L412 NwaCegarLoop]: 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 [2023-02-16 03:19:30,736 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 26 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:19:30,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 413 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 03:19:30,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-02-16 03:19:30,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 225. [2023-02-16 03:19:30,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 160 states have (on average 1.65625) internal successors, (265), 220 states have internal predecessors, (265), 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) [2023-02-16 03:19:30,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 269 transitions. [2023-02-16 03:19:30,740 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 269 transitions. Word has length 17 [2023-02-16 03:19:30,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:19:30,740 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 269 transitions. [2023-02-16 03:19:30,740 INFO L496 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) [2023-02-16 03:19:30,740 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 269 transitions. [2023-02-16 03:19:30,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 03:19:30,741 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:19:30,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:19:30,750 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-16 03:19:30,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:19:30,948 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-16 03:19:30,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:19:30,948 INFO L85 PathProgramCache]: Analyzing trace with hash 533828156, now seen corresponding path program 1 times [2023-02-16 03:19:30,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:19:30,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [154260870] [2023-02-16 03:19:30,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:19:30,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:19:30,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:19:30,950 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:19:30,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-16 03:19:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:19:31,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 03:19:31,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:19:31,027 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:19:31,027 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:31,043 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:31,055 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:31,098 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:31,100 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:31,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:19:31,114 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:19:31,114 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:19:31,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [154260870] [2023-02-16 03:19:31,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [154260870] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:19:31,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:19:31,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:19:31,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394257800] [2023-02-16 03:19:31,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:19:31,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:19:31,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:19:31,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:19:31,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:19:31,115 INFO L87 Difference]: Start difference. First operand 225 states and 269 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) [2023-02-16 03:19:31,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:19:31,545 INFO L93 Difference]: Finished difference Result 227 states and 267 transitions. [2023-02-16 03:19:31,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:19:31,545 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 [2023-02-16 03:19:31,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:19:31,546 INFO L225 Difference]: With dead ends: 227 [2023-02-16 03:19:31,546 INFO L226 Difference]: Without dead ends: 227 [2023-02-16 03:19:31,546 INFO L412 NwaCegarLoop]: 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 [2023-02-16 03:19:31,547 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 4 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:19:31,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 424 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-16 03:19:31,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-16 03:19:31,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2023-02-16 03:19:31,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 160 states have (on average 1.63125) internal successors, (261), 220 states have internal predecessors, (261), 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) [2023-02-16 03:19:31,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 265 transitions. [2023-02-16 03:19:31,550 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 265 transitions. Word has length 17 [2023-02-16 03:19:31,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:19:31,550 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 265 transitions. [2023-02-16 03:19:31,551 INFO L496 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) [2023-02-16 03:19:31,551 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 265 transitions. [2023-02-16 03:19:31,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-16 03:19:31,551 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:19:31,551 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:19:31,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-16 03:19:31,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:19:31,759 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting create_dataErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-16 03:19:31,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:19:31,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1553049946, now seen corresponding path program 1 times [2023-02-16 03:19:31,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:19:31,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2011164545] [2023-02-16 03:19:31,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:19:31,760 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:19:31,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:19:31,761 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:19:31,771 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-16 03:19:31,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:19:31,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-16 03:19:31,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:19:31,915 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 03:19:31,915 INFO L350 Elim1Store]: Elim1 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 19 treesize of output 22 [2023-02-16 03:19:31,928 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:31,978 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:19:31,978 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:32,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-02-16 03:19:32,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:19:32,009 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:19:34,096 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_178 (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_178) c_create_data_~data~0.base) .cse0))) (_ bv1 1)))) is different from false [2023-02-16 03:19:34,115 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:19:34,115 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:34,118 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:34,128 INFO L350 Elim1Store]: Elim1 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 11 treesize of output 7 [2023-02-16 03:19:34,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-16 03:19:34,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:19:34,177 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2011164545] [2023-02-16 03:19:34,177 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2011164545] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:19:34,177 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:19:34,177 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2023-02-16 03:19:34,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475879638] [2023-02-16 03:19:34,177 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:19:34,177 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 03:19:34,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:19:34,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 03:19:34,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=4, NotChecked=14, Total=90 [2023-02-16 03:19:34,178 INFO L87 Difference]: Start difference. First operand 225 states and 265 transitions. Second operand has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 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) [2023-02-16 03:19:34,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:19:34,800 INFO L93 Difference]: Finished difference Result 232 states and 269 transitions. [2023-02-16 03:19:34,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:19:34,801 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 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 [2023-02-16 03:19:34,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:19:34,801 INFO L225 Difference]: With dead ends: 232 [2023-02-16 03:19:34,801 INFO L226 Difference]: Without dead ends: 232 [2023-02-16 03:19:34,802 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=4, NotChecked=16, Total=110 [2023-02-16 03:19:34,802 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 46 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-16 03:19:34,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 560 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 338 Invalid, 0 Unknown, 104 Unchecked, 0.6s Time] [2023-02-16 03:19:34,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-02-16 03:19:34,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 224. [2023-02-16 03:19:34,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 160 states have (on average 1.61875) internal successors, (259), 219 states have internal predecessors, (259), 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) [2023-02-16 03:19:34,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 263 transitions. [2023-02-16 03:19:34,806 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 263 transitions. Word has length 22 [2023-02-16 03:19:34,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:19:34,806 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 263 transitions. [2023-02-16 03:19:34,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 10 states have internal predecessors, (30), 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) [2023-02-16 03:19:34,806 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 263 transitions. [2023-02-16 03:19:34,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-16 03:19:34,806 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:19:34,806 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:19:34,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-16 03:19:35,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:19:35,007 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-16 03:19:35,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:19:35,007 INFO L85 PathProgramCache]: Analyzing trace with hash -1553049945, now seen corresponding path program 1 times [2023-02-16 03:19:35,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:19:35,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [346262621] [2023-02-16 03:19:35,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:19:35,008 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:19:35,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:19:35,009 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:19:35,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-16 03:19:35,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:19:35,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-16 03:19:35,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:19:35,138 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:19:35,138 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:35,144 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-02-16 03:19:35,158 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:35,164 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:35,254 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:19:35,255 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:35,263 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:35,315 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:35,319 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:35,337 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:19:35,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:19:35,535 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (and (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_223) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse0 .cse1 (_ bv4 32)) (bvadd .cse0 .cse1 (_ bv8 32))))) (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_224 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_223) c_create_data_~data~0.base) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_224) c_create_data_~data~0.base) .cse2)))))) is different from false [2023-02-16 03:19:35,564 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_224 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_223) c_create_data_~data~0.base) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_224) c_create_data_~data~0.base) .cse2)))) (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_223) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse0 .cse3 (_ bv4 32)) (bvadd .cse0 .cse3 (_ bv8 32)))))))) is different from false [2023-02-16 03:19:35,600 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_223) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse0 (_ bv4 32)) (bvadd .cse0 (_ bv8 32))))) (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_224 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_223) c_create_data_~data~0.base) .cse2) (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_224) c_create_data_~data~0.base) .cse2))))))) is different from false [2023-02-16 03:19:35,623 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:19:35,623 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:35,625 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:35,642 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:19:35,642 INFO L350 Elim1Store]: Elim1 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 45 treesize of output 46 [2023-02-16 03:19:35,651 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:19:35,651 INFO L350 Elim1Store]: Elim1 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 35 treesize of output 36 [2023-02-16 03:19:35,654 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:19:35,657 INFO L350 Elim1Store]: Elim1 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 33 treesize of output 21 [2023-02-16 03:19:35,661 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:19:35,663 INFO L350 Elim1Store]: Elim1 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 24 treesize of output 12 [2023-02-16 03:19:35,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-02-16 03:19:35,719 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:19:35,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [346262621] [2023-02-16 03:19:35,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [346262621] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:19:35,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:19:35,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-02-16 03:19:35,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055451188] [2023-02-16 03:19:35,719 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:19:35,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-16 03:19:35,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:19:35,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-16 03:19:35,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210 [2023-02-16 03:19:35,720 INFO L87 Difference]: Start difference. First operand 224 states and 263 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) [2023-02-16 03:19:37,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:19:37,397 INFO L93 Difference]: Finished difference Result 236 states and 275 transitions. [2023-02-16 03:19:37,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:19:37,397 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 [2023-02-16 03:19:37,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:19:37,398 INFO L225 Difference]: With dead ends: 236 [2023-02-16 03:19:37,398 INFO L226 Difference]: Without dead ends: 236 [2023-02-16 03:19:37,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=159, Unknown=3, NotChecked=84, Total=306 [2023-02-16 03:19:37,399 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 4 mSDsluCounter, 925 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1087 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-16 03:19:37,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1087 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 671 Invalid, 0 Unknown, 272 Unchecked, 1.5s Time] [2023-02-16 03:19:37,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-02-16 03:19:37,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2023-02-16 03:19:37,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 170 states have (on average 1.5823529411764705) internal successors, (269), 229 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) [2023-02-16 03:19:37,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 273 transitions. [2023-02-16 03:19:37,402 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 273 transitions. Word has length 22 [2023-02-16 03:19:37,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:19:37,402 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 273 transitions. [2023-02-16 03:19:37,403 INFO L496 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) [2023-02-16 03:19:37,403 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 273 transitions. [2023-02-16 03:19:37,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-16 03:19:37,403 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:19:37,403 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:19:37,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-16 03:19:37,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:19:37,611 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-16 03:19:37,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:19:37,611 INFO L85 PathProgramCache]: Analyzing trace with hash 767728924, now seen corresponding path program 2 times [2023-02-16 03:19:37,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:19:37,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [661202640] [2023-02-16 03:19:37,612 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-16 03:19:37,612 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:19:37,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:19:37,615 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:19:37,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-16 03:19:37,780 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-16 03:19:37,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-16 03:19:37,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-16 03:19:37,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:19:37,806 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:19:37,806 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:37,812 INFO L350 Elim1Store]: Elim1 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 10 treesize of output 8 [2023-02-16 03:19:37,831 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:37,837 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:37,928 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:19:37,928 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:37,935 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:38,027 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-16 03:19:38,027 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:38,035 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:38,090 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:38,094 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:38,113 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:19:38,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:19:38,320 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (and (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_286) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse0 .cse1 (_ bv4 32)) (bvadd .cse0 .cse1 (_ bv8 32))))) (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd .cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_286) c_create_data_~data~0.base) .cse2) (_ 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) .cse2)))))) is different from false [2023-02-16 03:19:38,362 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_286) c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse0 .cse1 (_ bv4 32)) (bvadd .cse0 .cse1 (_ bv8 32))))) (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_286) c_create_data_~data~0.base) .cse3) .cse1 (_ bv8 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_285) c_create_data_~data~0.base) .cse3))))))) is different from false [2023-02-16 03:19:38,407 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse2 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_286) c_create_data_~data~0.base) .cse1) .cse2 (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_285) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_286) c_create_data_~data~0.base) .cse1))) (bvule (bvadd .cse3 .cse2 (_ bv8 32)) (bvadd .cse3 .cse2 (_ bv12 32)))))))) is different from false [2023-02-16 03:19:38,451 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_284))) (let ((.cse1 (select (select .cse3 c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_283) .cse1 v_ArrVal_286) c_create_data_~data~0.base) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_285) c_create_data_~data~0.base) .cse2)))))) (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_283) (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_284) c_create_data_~data~0.base) .cse2) v_ArrVal_286) c_create_data_~data~0.base) .cse2))) (bvule (bvadd .cse0 .cse4 (_ bv8 32)) (bvadd .cse0 .cse4 (_ bv12 32))))))) is different from false [2023-02-16 03:19:38,487 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse0 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse3))) (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_283) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_284) c_create_data_~data~0.base) .cse3) v_ArrVal_286) c_create_data_~data~0.base) .cse3))) (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_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_284))) (let ((.cse4 (select (select .cse5 c_create_data_~data~0.base) .cse3))) (bvule (bvadd .cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_283) .cse4 v_ArrVal_286) c_create_data_~data~0.base) .cse3) (_ bv12 32)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_285) c_create_data_~data~0.base) .cse3))))))))) is different from false [2023-02-16 03:19:38,532 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse2))) (and (forall ((v_ArrVal_284 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_283) (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_284) c_create_data_~data~0.base) .cse2) v_ArrVal_286) 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_286 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_283 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_284))) (let ((.cse3 (select (select .cse4 c_create_data_~data~0.base) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_283) .cse3 v_ArrVal_286) c_create_data_~data~0.base) .cse2) (_ bv12 32)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_285) c_create_data_~data~0.base) .cse2))))))))) is different from false [2023-02-16 03:19:38,545 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:19:38,546 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:38,554 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:19:38,554 INFO L350 Elim1Store]: Elim1 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 [2023-02-16 03:19:38,559 INFO L350 Elim1Store]: Elim1 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 754 treesize of output 640 [2023-02-16 03:19:38,563 INFO L350 Elim1Store]: Elim1 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 1360 treesize of output 1258 [2023-02-16 03:19:38,567 INFO L350 Elim1Store]: Elim1 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 1254 treesize of output 1158 [2023-02-16 03:19:38,569 INFO L350 Elim1Store]: Elim1 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 1158 treesize of output 1062 [2023-02-16 03:19:38,572 INFO L350 Elim1Store]: Elim1 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 1062 treesize of output 862 [2023-02-16 03:19:38,574 INFO L350 Elim1Store]: Elim1 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 862 treesize of output 830