./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 e8d55036 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-?-e8d5503-m [2023-02-15 21:59:57,400 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 21:59:57,402 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 21:59:57,428 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 21:59:57,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 21:59:57,434 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 21:59:57,436 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 21:59:57,438 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 21:59:57,440 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 21:59:57,446 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 21:59:57,447 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 21:59:57,448 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 21:59:57,449 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 21:59:57,453 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 21:59:57,454 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 21:59:57,456 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 21:59:57,457 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 21:59:57,458 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 21:59:57,459 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 21:59:57,464 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 21:59:57,465 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 21:59:57,466 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 21:59:57,467 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 21:59:57,467 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 21:59:57,470 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 21:59:57,471 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 21:59:57,471 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 21:59:57,472 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 21:59:57,472 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 21:59:57,473 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 21:59:57,473 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 21:59:57,474 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 21:59:57,475 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 21:59:57,476 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 21:59:57,477 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 21:59:57,477 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 21:59:57,477 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 21:59:57,478 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 21:59:57,478 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 21:59:57,479 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 21:59:57,480 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 21:59:57,481 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 21:59:57,512 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 21:59:57,512 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 21:59:57,513 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 21:59:57,513 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 21:59:57,514 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 21:59:57,514 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 21:59:57,514 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 21:59:57,515 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 21:59:57,515 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 21:59:57,515 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 21:59:57,516 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 21:59:57,516 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 21:59:57,516 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 21:59:57,517 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 21:59:57,517 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 21:59:57,517 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 21:59:57,517 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 21:59:57,517 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 21:59:57,518 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 21:59:57,518 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 21:59:57,518 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 21:59:57,518 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 21:59:57,518 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 21:59:57,518 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 21:59:57,519 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 21:59:57,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 21:59:57,519 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 21:59:57,519 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 21:59:57,520 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 21:59:57,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 21:59:57,520 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 21:59:57,520 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 21:59:57,520 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 21:59:57,520 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 21:59:57,521 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-15 21:59:57,712 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 21:59:57,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 21:59:57,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 21:59:57,739 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 21:59:57,739 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 21:59:57,740 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-15 21:59:58,834 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 21:59:59,018 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 21:59:59,018 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2023-02-15 21:59:59,044 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f577fe4b/170f88e114cf45868f8ca4ef6c2f446f/FLAGd1b8b7d17 [2023-02-15 21:59:59,056 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f577fe4b/170f88e114cf45868f8ca4ef6c2f446f [2023-02-15 21:59:59,058 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 21:59:59,059 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 21:59:59,059 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 21:59:59,059 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 21:59:59,062 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 21:59:59,062 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:59:59" (1/1) ... [2023-02-15 21:59:59,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3567b0ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:59:59, skipping insertion in model container [2023-02-15 21:59:59,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 09:59:59" (1/1) ... [2023-02-15 21:59:59,070 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 21:59:59,102 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 21:59:59,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 21:59:59,326 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-15 21:59:59,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@54d50ef4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 09:59:59, skipping insertion in model container [2023-02-15 21:59:59,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 21:59:59,327 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-15 21:59:59,329 INFO L158 Benchmark]: Toolchain (without parser) took 269.64ms. Allocated memory is still 151.0MB. Free memory was 109.1MB in the beginning and 96.9MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 21:59:59,329 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 151.0MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 21:59:59,330 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.13ms. Allocated memory is still 151.0MB. Free memory was 108.7MB in the beginning and 96.9MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 21:59:59,330 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.16ms. Allocated memory is still 151.0MB. Free memory is still 118.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.13ms. Allocated memory is still 151.0MB. Free memory was 108.7MB in the beginning and 96.9MB 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-?-e8d5503-m [2023-02-15 22:00:01,034 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 22:00:01,036 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 22:00:01,070 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 22:00:01,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 22:00:01,073 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 22:00:01,075 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 22:00:01,077 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 22:00:01,081 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 22:00:01,084 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 22:00:01,085 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 22:00:01,087 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 22:00:01,088 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 22:00:01,088 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 22:00:01,090 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 22:00:01,093 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 22:00:01,094 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 22:00:01,095 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 22:00:01,096 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 22:00:01,099 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 22:00:01,101 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 22:00:01,101 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 22:00:01,102 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 22:00:01,103 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 22:00:01,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 22:00:01,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 22:00:01,110 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 22:00:01,111 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 22:00:01,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 22:00:01,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 22:00:01,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 22:00:01,114 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 22:00:01,115 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 22:00:01,124 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 22:00:01,125 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 22:00:01,125 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 22:00:01,126 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 22:00:01,126 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 22:00:01,126 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 22:00:01,127 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 22:00:01,127 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 22:00:01,129 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-15 22:00:01,167 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 22:00:01,167 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 22:00:01,168 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 22:00:01,168 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 22:00:01,169 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 22:00:01,169 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 22:00:01,169 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 22:00:01,170 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 22:00:01,170 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 22:00:01,170 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 22:00:01,171 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 22:00:01,171 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 22:00:01,171 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 22:00:01,171 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 22:00:01,171 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 22:00:01,171 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 22:00:01,171 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 22:00:01,172 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 22:00:01,172 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 22:00:01,172 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 22:00:01,172 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 22:00:01,172 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 22:00:01,172 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 22:00:01,173 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 22:00:01,173 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 22:00:01,173 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 22:00:01,173 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 22:00:01,173 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:00:01,173 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 22:00:01,174 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 22:00:01,174 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 22:00:01,174 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 22:00:01,174 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 22:00:01,174 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 22:00:01,174 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 22:00:01,174 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 22:00:01,175 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 22:00:01,175 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-15 22:00:01,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 22:00:01,473 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 22:00:01,475 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 22:00:01,476 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 22:00:01,476 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 22:00:01,478 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-15 22:00:02,607 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 22:00:02,914 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 22:00:02,915 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2023-02-15 22:00:02,930 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d4982242/5a670d101467465d9c9f149a0dd0af57/FLAG6bd322a56 [2023-02-15 22:00:02,941 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d4982242/5a670d101467465d9c9f149a0dd0af57 [2023-02-15 22:00:02,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 22:00:02,945 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 22:00:02,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 22:00:02,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 22:00:02,949 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 22:00:02,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:00:02" (1/1) ... [2023-02-15 22:00:02,950 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e121c10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:00:02, skipping insertion in model container [2023-02-15 22:00:02,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 10:00:02" (1/1) ... [2023-02-15 22:00:02,955 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 22:00:02,999 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:00:03,244 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:00:03,255 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-15 22:00:03,267 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 22:00:03,299 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:00:03,306 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 22:00:03,355 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 22:00:03,378 INFO L208 MainTranslator]: Completed translation [2023-02-15 22:00:03,378 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:00:03 WrapperNode [2023-02-15 22:00:03,379 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 22:00:03,379 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 22:00:03,379 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 22:00:03,380 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 22:00:03,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:00:03" (1/1) ... [2023-02-15 22:00:03,414 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:00:03" (1/1) ... [2023-02-15 22:00:03,435 INFO L138 Inliner]: procedures = 129, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2023-02-15 22:00:03,436 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 22:00:03,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 22:00:03,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 22:00:03,437 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 22:00:03,443 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:00:03" (1/1) ... [2023-02-15 22:00:03,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:00:03" (1/1) ... [2023-02-15 22:00:03,456 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:00:03" (1/1) ... [2023-02-15 22:00:03,456 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:00:03" (1/1) ... [2023-02-15 22:00:03,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:00:03" (1/1) ... [2023-02-15 22:00:03,474 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:00:03" (1/1) ... [2023-02-15 22:00:03,477 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:00:03" (1/1) ... [2023-02-15 22:00:03,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:00:03" (1/1) ... [2023-02-15 22:00:03,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 22:00:03,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 22:00:03,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 22:00:03,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 22:00:03,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:00:03" (1/1) ... [2023-02-15 22:00:03,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 22:00:03,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 22:00:03,509 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-15 22:00:03,528 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-15 22:00:03,547 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-15 22:00:03,547 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 22:00:03,547 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2023-02-15 22:00:03,550 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2023-02-15 22:00:03,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 22:00:03,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 22:00:03,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 22:00:03,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 22:00:03,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 22:00:03,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-15 22:00:03,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 22:00:03,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 22:00:03,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 22:00:03,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 22:00:03,676 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 22:00:03,677 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 22:00:04,362 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 22:00:04,367 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 22:00:04,368 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-15 22:00:04,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:00:04 BoogieIcfgContainer [2023-02-15 22:00:04,369 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 22:00:04,371 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 22:00:04,371 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 22:00:04,373 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 22:00:04,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 10:00:02" (1/3) ... [2023-02-15 22:00:04,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1291bdca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:00:04, skipping insertion in model container [2023-02-15 22:00:04,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 10:00:03" (2/3) ... [2023-02-15 22:00:04,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1291bdca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 10:00:04, skipping insertion in model container [2023-02-15 22:00:04,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 10:00:04" (3/3) ... [2023-02-15 22:00:04,374 INFO L112 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02-2.i [2023-02-15 22:00:04,387 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 22:00:04,387 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2023-02-15 22:00:04,435 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 22:00:04,441 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;@214df307, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 22:00:04,461 INFO L358 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2023-02-15 22:00:04,465 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-15 22:00:04,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-15 22:00:04,470 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:04,471 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-15 22:00:04,471 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-15 22:00:04,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:04,475 INFO L85 PathProgramCache]: Analyzing trace with hash 5052905, now seen corresponding path program 1 times [2023-02-15 22:00:04,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:00:04,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1220812374] [2023-02-15 22:00:04,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:04,487 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-15 22:00:04,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:00:04,490 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-15 22:00:04,491 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-15 22:00:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:04,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-15 22:00:04,602 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:04,622 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-15 22:00:04,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:00:04,623 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:00:04,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1220812374] [2023-02-15 22:00:04,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1220812374] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:00:04,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:00:04,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:00:04,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251076012] [2023-02-15 22:00:04,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:00:04,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 22:00:04,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:00:04,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 22:00:04,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 22:00:04,692 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-15 22:00:04,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:04,733 INFO L93 Difference]: Finished difference Result 189 states and 200 transitions. [2023-02-15 22:00:04,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 22:00:04,735 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-15 22:00:04,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:04,745 INFO L225 Difference]: With dead ends: 189 [2023-02-15 22:00:04,745 INFO L226 Difference]: Without dead ends: 187 [2023-02-15 22:00:04,747 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-15 22:00:04,750 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-15 22:00:04,751 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-15 22:00:04,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-02-15 22:00:04,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2023-02-15 22:00:04,789 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-15 22:00:04,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 198 transitions. [2023-02-15 22:00:04,800 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 198 transitions. Word has length 4 [2023-02-15 22:00:04,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:04,800 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 198 transitions. [2023-02-15 22:00:04,801 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-15 22:00:04,801 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 198 transitions. [2023-02-15 22:00:04,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-15 22:00:04,801 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:04,801 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-15 22:00:04,827 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 (2)] Ended with exit code 0 [2023-02-15 22:00:05,010 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-15 22:00:05,012 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-15 22:00:05,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:05,013 INFO L85 PathProgramCache]: Analyzing trace with hash 5050693, now seen corresponding path program 1 times [2023-02-15 22:00:05,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:00:05,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1299327803] [2023-02-15 22:00:05,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:05,015 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-15 22:00:05,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:00:05,029 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-15 22:00:05,031 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-15 22:00:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:05,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:00:05,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:05,140 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-15 22:00:05,185 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:00:05,187 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-15 22:00:05,200 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-15 22:00:05,200 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:00:05,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:00:05,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1299327803] [2023-02-15 22:00:05,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1299327803] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:00:05,201 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:00:05,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:00:05,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651513689] [2023-02-15 22:00:05,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:00:05,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:00:05,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:00:05,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:00:05,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:00:05,204 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-15 22:00:05,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:05,587 INFO L93 Difference]: Finished difference Result 207 states and 219 transitions. [2023-02-15 22:00:05,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:00:05,589 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-15 22:00:05,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:05,590 INFO L225 Difference]: With dead ends: 207 [2023-02-15 22:00:05,590 INFO L226 Difference]: Without dead ends: 207 [2023-02-15 22:00:05,591 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-15 22:00:05,592 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-15 22:00:05,592 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-15 22:00:05,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-02-15 22:00:05,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 181. [2023-02-15 22:00:05,603 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-15 22:00:05,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 192 transitions. [2023-02-15 22:00:05,605 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 192 transitions. Word has length 4 [2023-02-15 22:00:05,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:05,605 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 192 transitions. [2023-02-15 22:00:05,605 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-15 22:00:05,605 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions. [2023-02-15 22:00:05,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-15 22:00:05,606 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:05,606 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-15 22:00:05,627 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 (3)] Forceful destruction successful, exit code 0 [2023-02-15 22:00:05,814 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-15 22:00:05,815 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-15 22:00:05,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:05,815 INFO L85 PathProgramCache]: Analyzing trace with hash 5050694, now seen corresponding path program 1 times [2023-02-15 22:00:05,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:00:05,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814919659] [2023-02-15 22:00:05,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:05,816 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-15 22:00:05,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:00:05,818 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-15 22:00:05,831 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-15 22:00:05,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:05,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 22:00:05,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:05,906 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-15 22:00:05,912 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-15 22:00:05,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:00:05,948 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-15 22:00:05,957 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:00:05,957 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-15 22:00:05,972 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-15 22:00:05,972 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:00:05,973 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:00:05,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814919659] [2023-02-15 22:00:05,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1814919659] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:00:05,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:00:05,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:00:05,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81960272] [2023-02-15 22:00:05,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:00:05,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:00:05,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:00:05,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:00:05,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:00:05,975 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-15 22:00:06,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:06,505 INFO L93 Difference]: Finished difference Result 197 states and 211 transitions. [2023-02-15 22:00:06,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:00:06,512 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-15 22:00:06,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:06,514 INFO L225 Difference]: With dead ends: 197 [2023-02-15 22:00:06,514 INFO L226 Difference]: Without dead ends: 197 [2023-02-15 22:00:06,514 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-15 22:00:06,515 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.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:00:06,515 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.5s Time] [2023-02-15 22:00:06,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-02-15 22:00:06,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 186. [2023-02-15 22:00:06,528 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-15 22:00:06,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 199 transitions. [2023-02-15 22:00:06,529 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 199 transitions. Word has length 4 [2023-02-15 22:00:06,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:06,530 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 199 transitions. [2023-02-15 22:00:06,530 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-15 22:00:06,530 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 199 transitions. [2023-02-15 22:00:06,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-15 22:00:06,530 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:06,530 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 22:00:06,541 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-15 22:00:06,731 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-15 22:00:06,731 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-15 22:00:06,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:06,732 INFO L85 PathProgramCache]: Analyzing trace with hash 156571597, now seen corresponding path program 1 times [2023-02-15 22:00:06,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:00:06,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [125700610] [2023-02-15 22:00:06,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:06,732 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-15 22:00:06,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:00:06,740 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-15 22:00:06,745 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-15 22:00:06,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:06,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 22:00:06,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:06,831 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-15 22:00:06,848 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-15 22:00:06,849 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:00:06,849 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:00:06,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [125700610] [2023-02-15 22:00:06,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [125700610] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:00:06,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:00:06,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:00:06,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601197787] [2023-02-15 22:00:06,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:00:06,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:00:06,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:00:06,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:00:06,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:00:06,851 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-15 22:00:07,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:07,121 INFO L93 Difference]: Finished difference Result 209 states and 222 transitions. [2023-02-15 22:00:07,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:00:07,122 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-15 22:00:07,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:07,123 INFO L225 Difference]: With dead ends: 209 [2023-02-15 22:00:07,123 INFO L226 Difference]: Without dead ends: 209 [2023-02-15 22:00:07,123 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-15 22:00:07,123 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.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:00:07,124 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.3s Time] [2023-02-15 22:00:07,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-02-15 22:00:07,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 184. [2023-02-15 22:00:07,133 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-15 22:00:07,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 196 transitions. [2023-02-15 22:00:07,136 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 196 transitions. Word has length 5 [2023-02-15 22:00:07,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:07,136 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 196 transitions. [2023-02-15 22:00:07,136 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-15 22:00:07,136 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 196 transitions. [2023-02-15 22:00:07,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-15 22:00:07,139 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:07,140 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 22:00:07,149 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 (5)] Forceful destruction successful, exit code 0 [2023-02-15 22:00:07,347 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-15 22:00:07,347 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-15 22:00:07,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:07,348 INFO L85 PathProgramCache]: Analyzing trace with hash 156571598, now seen corresponding path program 1 times [2023-02-15 22:00:07,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:00:07,348 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [361169449] [2023-02-15 22:00:07,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:07,348 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-15 22:00:07,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:00:07,351 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-15 22:00:07,352 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-15 22:00:07,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:07,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:00:07,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:07,446 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-15 22:00:07,457 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-15 22:00:07,458 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:00:07,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:00:07,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [361169449] [2023-02-15 22:00:07,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [361169449] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:00:07,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:00:07,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:00:07,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957469325] [2023-02-15 22:00:07,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:00:07,459 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:00:07,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:00:07,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:00:07,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:00:07,460 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-15 22:00:07,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:07,813 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2023-02-15 22:00:07,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:00:07,817 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-15 22:00:07,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:07,818 INFO L225 Difference]: With dead ends: 182 [2023-02-15 22:00:07,818 INFO L226 Difference]: Without dead ends: 182 [2023-02-15 22:00:07,818 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-15 22:00:07,819 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 11 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-15 22:00:07,819 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-15 22:00:07,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-02-15 22:00:07,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2023-02-15 22:00:07,828 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-15 22:00:07,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2023-02-15 22:00:07,829 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 5 [2023-02-15 22:00:07,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:07,830 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2023-02-15 22:00:07,830 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-15 22:00:07,830 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2023-02-15 22:00:07,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 22:00:07,830 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:07,830 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:00:07,837 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 (6)] Ended with exit code 0 [2023-02-15 22:00:08,037 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-15 22:00:08,037 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-15 22:00:08,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:08,038 INFO L85 PathProgramCache]: Analyzing trace with hash 666573431, now seen corresponding path program 1 times [2023-02-15 22:00:08,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:00:08,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420222862] [2023-02-15 22:00:08,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:08,038 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-15 22:00:08,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:00:08,039 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-15 22:00:08,040 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-15 22:00:08,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:08,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 22:00:08,094 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:08,104 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-15 22:00:08,129 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:00:08,130 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-15 22:00:08,160 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-15 22:00:08,164 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-15 22:00:08,198 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-15 22:00:08,201 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-15 22:00:08,216 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-15 22:00:08,217 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:00:08,217 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:00:08,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [420222862] [2023-02-15 22:00:08,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [420222862] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:00:08,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:00:08,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:00:08,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291135553] [2023-02-15 22:00:08,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:00:08,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:00:08,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:00:08,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:00:08,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:00:08,219 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-15 22:00:08,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:08,604 INFO L93 Difference]: Finished difference Result 184 states and 196 transitions. [2023-02-15 22:00:08,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:00:08,604 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-15 22:00:08,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:08,605 INFO L225 Difference]: With dead ends: 184 [2023-02-15 22:00:08,605 INFO L226 Difference]: Without dead ends: 184 [2023-02-15 22:00:08,605 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-15 22:00:08,606 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-15 22:00:08,606 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-15 22:00:08,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-02-15 22:00:08,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2023-02-15 22:00:08,611 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-15 22:00:08,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 194 transitions. [2023-02-15 22:00:08,611 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 194 transitions. Word has length 10 [2023-02-15 22:00:08,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:08,611 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 194 transitions. [2023-02-15 22:00:08,612 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-15 22:00:08,612 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 194 transitions. [2023-02-15 22:00:08,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 22:00:08,612 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:08,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:00:08,637 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-15 22:00:08,812 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-15 22:00:08,813 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-15 22:00:08,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:08,813 INFO L85 PathProgramCache]: Analyzing trace with hash 623653565, now seen corresponding path program 1 times [2023-02-15 22:00:08,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:00:08,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [59578541] [2023-02-15 22:00:08,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:08,814 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-15 22:00:08,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:00:08,818 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-15 22:00:08,819 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-15 22:00:08,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:08,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 22:00:08,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:08,918 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-15 22:00:08,918 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:00:08,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:00:08,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [59578541] [2023-02-15 22:00:08,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [59578541] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:00:08,919 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:00:08,919 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:00:08,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139141636] [2023-02-15 22:00:08,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:00:08,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:00:08,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:00:08,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:00:08,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:00:08,920 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-15 22:00:08,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:08,951 INFO L93 Difference]: Finished difference Result 260 states and 275 transitions. [2023-02-15 22:00:08,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:00:08,951 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-15 22:00:08,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:08,953 INFO L225 Difference]: With dead ends: 260 [2023-02-15 22:00:08,953 INFO L226 Difference]: Without dead ends: 260 [2023-02-15 22:00:08,954 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-15 22:00:08,957 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-15 22:00:08,957 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-15 22:00:08,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-02-15 22:00:08,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 224. [2023-02-15 22:00:08,973 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-15 22:00:08,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 275 transitions. [2023-02-15 22:00:08,973 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 275 transitions. Word has length 12 [2023-02-15 22:00:08,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:08,974 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 275 transitions. [2023-02-15 22:00:08,974 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-15 22:00:08,974 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 275 transitions. [2023-02-15 22:00:08,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 22:00:08,974 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:08,975 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:00:08,984 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-15 22:00:09,183 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-15 22:00:09,184 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-15 22:00:09,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:09,185 INFO L85 PathProgramCache]: Analyzing trace with hash -2141569776, now seen corresponding path program 1 times [2023-02-15 22:00:09,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:00:09,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316967943] [2023-02-15 22:00:09,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:09,186 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-15 22:00:09,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:00:09,187 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-15 22:00:09,189 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-15 22:00:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:09,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 22:00:09,293 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:09,326 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:00:09,326 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-15 22:00:09,347 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-15 22:00:09,348 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:00:09,348 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:00:09,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1316967943] [2023-02-15 22:00:09,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1316967943] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:00:09,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:00:09,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:00:09,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985911844] [2023-02-15 22:00:09,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:00:09,349 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:00:09,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:00:09,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:00:09,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:00:09,350 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-15 22:00:09,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:09,619 INFO L93 Difference]: Finished difference Result 227 states and 271 transitions. [2023-02-15 22:00:09,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:00:09,619 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-15 22:00:09,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:09,620 INFO L225 Difference]: With dead ends: 227 [2023-02-15 22:00:09,620 INFO L226 Difference]: Without dead ends: 227 [2023-02-15 22:00:09,621 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-15 22:00:09,621 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.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:00:09,621 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.3s Time] [2023-02-15 22:00:09,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-15 22:00:09,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 218. [2023-02-15 22:00:09,625 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-15 22:00:09,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 265 transitions. [2023-02-15 22:00:09,625 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 265 transitions. Word has length 13 [2023-02-15 22:00:09,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:09,625 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 265 transitions. [2023-02-15 22:00:09,625 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-15 22:00:09,626 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 265 transitions. [2023-02-15 22:00:09,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 22:00:09,626 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:09,626 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:00:09,643 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-15 22:00:09,826 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-15 22:00:09,827 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-15 22:00:09,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:09,827 INFO L85 PathProgramCache]: Analyzing trace with hash -2141569775, now seen corresponding path program 1 times [2023-02-15 22:00:09,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:00:09,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [734844520] [2023-02-15 22:00:09,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:09,828 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-15 22:00:09,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:00:09,829 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-15 22:00:09,831 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-15 22:00:09,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:09,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 22:00:09,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:09,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:00:09,916 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-15 22:00:09,921 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-15 22:00:09,926 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-15 22:00:09,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:00:09,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:00:09,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [734844520] [2023-02-15 22:00:09,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [734844520] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:00:09,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:00:09,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:00:09,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989374613] [2023-02-15 22:00:09,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:00:09,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:00:09,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:00:09,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:00:09,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:00:09,928 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-15 22:00:10,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:10,207 INFO L93 Difference]: Finished difference Result 239 states and 279 transitions. [2023-02-15 22:00:10,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:00:10,207 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-15 22:00:10,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:10,208 INFO L225 Difference]: With dead ends: 239 [2023-02-15 22:00:10,208 INFO L226 Difference]: Without dead ends: 239 [2023-02-15 22:00:10,208 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-15 22:00:10,209 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 49 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-15 22:00:10,209 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-15 22:00:10,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-02-15 22:00:10,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 219. [2023-02-15 22:00:10,212 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-15 22:00:10,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 259 transitions. [2023-02-15 22:00:10,213 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 259 transitions. Word has length 13 [2023-02-15 22:00:10,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:10,213 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 259 transitions. [2023-02-15 22:00:10,213 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-15 22:00:10,213 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 259 transitions. [2023-02-15 22:00:10,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 22:00:10,213 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:10,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:00:10,233 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-15 22:00:10,421 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-15 22:00:10,421 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-15 22:00:10,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:10,422 INFO L85 PathProgramCache]: Analyzing trace with hash 533828155, now seen corresponding path program 1 times [2023-02-15 22:00:10,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:00:10,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922341084] [2023-02-15 22:00:10,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:10,422 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-15 22:00:10,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:00:10,424 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-15 22:00:10,426 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-15 22:00:10,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:10,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:00:10,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:10,496 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 22:00:10,496 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-15 22:00:10,507 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-15 22:00:10,525 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-15 22:00:10,531 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-15 22:00:10,531 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:00:10,532 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:00:10,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922341084] [2023-02-15 22:00:10,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922341084] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:00:10,532 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:00:10,532 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:00:10,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50980968] [2023-02-15 22:00:10,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:00:10,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:00:10,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:00:10,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:00:10,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:00:10,533 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-15 22:00:10,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:10,989 INFO L93 Difference]: Finished difference Result 270 states and 323 transitions. [2023-02-15 22:00:10,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:00:10,990 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-15 22:00:10,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:10,991 INFO L225 Difference]: With dead ends: 270 [2023-02-15 22:00:10,991 INFO L226 Difference]: Without dead ends: 270 [2023-02-15 22:00:10,992 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-15 22:00:10,992 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 26 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-15 22:00:10,992 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-15 22:00:10,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-02-15 22:00:10,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 225. [2023-02-15 22:00:10,997 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-15 22:00:10,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 269 transitions. [2023-02-15 22:00:10,998 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 269 transitions. Word has length 17 [2023-02-15 22:00:10,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:10,998 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 269 transitions. [2023-02-15 22:00:10,998 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-15 22:00:10,998 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 269 transitions. [2023-02-15 22:00:11,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 22:00:11,001 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:11,001 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:00:11,008 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 (11)] Ended with exit code 0 [2023-02-15 22:00:11,209 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-15 22:00:11,209 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-15 22:00:11,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:11,209 INFO L85 PathProgramCache]: Analyzing trace with hash 533828156, now seen corresponding path program 1 times [2023-02-15 22:00:11,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:00:11,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273332257] [2023-02-15 22:00:11,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:11,210 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-15 22:00:11,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:00:11,215 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-15 22:00:11,217 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-15 22:00:11,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:11,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 22:00:11,335 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:11,366 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:00:11,366 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-15 22:00:11,389 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-15 22:00:11,406 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-15 22:00:11,478 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-15 22:00:11,483 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-15 22:00:11,509 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-15 22:00:11,509 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:00:11,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:00:11,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273332257] [2023-02-15 22:00:11,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273332257] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:00:11,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:00:11,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:00:11,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679223951] [2023-02-15 22:00:11,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:00:11,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:00:11,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:00:11,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:00:11,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:00:11,510 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-15 22:00:12,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:12,053 INFO L93 Difference]: Finished difference Result 227 states and 267 transitions. [2023-02-15 22:00:12,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:00:12,054 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-15 22:00:12,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:12,055 INFO L225 Difference]: With dead ends: 227 [2023-02-15 22:00:12,055 INFO L226 Difference]: Without dead ends: 227 [2023-02-15 22:00:12,055 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-15 22:00:12,055 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 4 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:00:12,055 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.5s Time] [2023-02-15 22:00:12,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-15 22:00:12,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2023-02-15 22:00:12,058 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-15 22:00:12,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 265 transitions. [2023-02-15 22:00:12,059 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 265 transitions. Word has length 17 [2023-02-15 22:00:12,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:12,059 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 265 transitions. [2023-02-15 22:00:12,059 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-15 22:00:12,059 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 265 transitions. [2023-02-15 22:00:12,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 22:00:12,059 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:12,060 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-15 22:00:12,067 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 (12)] Ended with exit code 0 [2023-02-15 22:00:12,260 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-15 22:00:12,260 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-15 22:00:12,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:12,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1553049946, now seen corresponding path program 1 times [2023-02-15 22:00:12,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:00:12,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1252057594] [2023-02-15 22:00:12,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:12,261 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-15 22:00:12,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:00:12,262 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-15 22:00:12,264 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-15 22:00:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:12,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 22:00:12,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:12,382 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:00:12,383 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-15 22:00:12,409 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-15 22:00:12,470 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:00:12,471 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-15 22:00:12,501 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-15 22:00:12,510 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-15 22:00:12,510 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:00:12,535 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| v_ArrVal_178) c_create_data_~data~0.base) (bvadd c_create_data_~data~0.offset (_ bv4 32)))) (_ bv1 1)))) is different from false [2023-02-15 22:00:12,544 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-15 22:00:12,567 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:12,568 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-15 22:00:12,570 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-15 22:00:12,577 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-15 22:00:12,604 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-15 22:00:12,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:00:12,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1252057594] [2023-02-15 22:00:12,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1252057594] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:00:12,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:00:12,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 9 [2023-02-15 22:00:12,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064776682] [2023-02-15 22:00:12,605 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:00:12,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:00:12,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:00:12,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:00:12,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=40, Unknown=2, NotChecked=26, Total=90 [2023-02-15 22:00:12,605 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-15 22:00:13,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:13,061 INFO L93 Difference]: Finished difference Result 232 states and 269 transitions. [2023-02-15 22:00:13,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:00:13,062 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-15 22:00:13,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:13,063 INFO L225 Difference]: With dead ends: 232 [2023-02-15 22:00:13,063 INFO L226 Difference]: Without dead ends: 232 [2023-02-15 22:00:13,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=50, Unknown=2, NotChecked=30, Total=110 [2023-02-15 22:00:13,063 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 46 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 210 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:00:13,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 545 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 257 Invalid, 0 Unknown, 210 Unchecked, 0.4s Time] [2023-02-15 22:00:13,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-02-15 22:00:13,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 224. [2023-02-15 22:00:13,069 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-15 22:00:13,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 263 transitions. [2023-02-15 22:00:13,069 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 263 transitions. Word has length 22 [2023-02-15 22:00:13,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:13,070 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 263 transitions. [2023-02-15 22:00:13,070 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-15 22:00:13,070 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 263 transitions. [2023-02-15 22:00:13,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 22:00:13,070 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:13,071 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-15 22:00:13,086 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-15 22:00:13,279 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-15 22:00:13,279 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-15 22:00:13,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:13,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1553049945, now seen corresponding path program 1 times [2023-02-15 22:00:13,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:00:13,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1162237312] [2023-02-15 22:00:13,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:13,281 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-15 22:00:13,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:00:13,282 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-15 22:00:13,284 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-15 22:00:13,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:13,394 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-15 22:00:13,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:13,422 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:00:13,423 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-15 22:00:13,429 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-15 22:00:13,448 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-15 22:00:13,456 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-15 22:00:13,561 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:00:13,562 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-15 22:00:13,572 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-15 22:00:13,629 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-15 22:00:13,633 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-15 22:00:13,651 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-15 22:00:13,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:00:13,870 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-15 22:00:13,912 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-15 22:00:13,970 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-15 22:00:13,987 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:13,987 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-15 22:00:13,991 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-15 22:00:14,012 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:14,012 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-15 22:00:14,025 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:14,026 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-15 22:00:14,029 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:00:14,032 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-15 22:00:14,041 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:00:14,043 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-15 22:00:14,100 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-15 22:00:14,103 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:00:14,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1162237312] [2023-02-15 22:00:14,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1162237312] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:00:14,103 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:00:14,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-02-15 22:00:14,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603932941] [2023-02-15 22:00:14,104 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:00:14,104 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-15 22:00:14,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:00:14,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-15 22:00:14,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210 [2023-02-15 22:00:14,105 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-15 22:00:18,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:18,552 INFO L93 Difference]: Finished difference Result 236 states and 275 transitions. [2023-02-15 22:00:18,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:00:18,553 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-15 22:00:18,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:18,554 INFO L225 Difference]: With dead ends: 236 [2023-02-15 22:00:18,554 INFO L226 Difference]: Without dead ends: 236 [2023-02-15 22:00:18,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=60, Invalid=159, Unknown=3, NotChecked=84, Total=306 [2023-02-15 22:00:18,555 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 4 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 2 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1002 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 266 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:00:18,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1002 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 586 Invalid, 1 Unknown, 266 Unchecked, 2.0s Time] [2023-02-15 22:00:18,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-02-15 22:00:18,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2023-02-15 22:00:18,576 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-15 22:00:18,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 273 transitions. [2023-02-15 22:00:18,576 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 273 transitions. Word has length 22 [2023-02-15 22:00:18,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:18,577 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 273 transitions. [2023-02-15 22:00:18,577 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-15 22:00:18,577 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 273 transitions. [2023-02-15 22:00:18,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 22:00:18,578 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:18,578 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-15 22:00:18,586 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-15 22:00:18,781 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-15 22:00:18,782 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-15 22:00:18,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:18,784 INFO L85 PathProgramCache]: Analyzing trace with hash 767728924, now seen corresponding path program 2 times [2023-02-15 22:00:18,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:00:18,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [849522286] [2023-02-15 22:00:18,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 22:00:18,785 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-15 22:00:18,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:00:18,787 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-15 22:00:18,788 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-15 22:00:18,987 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 22:00:18,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:00:18,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-15 22:00:18,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:19,020 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:00:19,020 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-15 22:00:19,028 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-15 22:00:19,047 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-15 22:00:19,055 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-15 22:00:19,183 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:00:19,183 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-15 22:00:19,195 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-15 22:00:19,383 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:00:19,384 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-15 22:00:19,395 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-15 22:00:19,455 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-15 22:00:19,459 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-15 22:00:19,480 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-15 22:00:19,480 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:00:19,849 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-15 22:00:19,886 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-15 22:00:19,942 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-15 22:00:19,998 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-15 22:00:20,066 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-15 22:00:20,132 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-15 22:00:20,151 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:20,151 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-15 22:00:20,159 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:20,161 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-15 22:00:20,171 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-15 22:00:20,193 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-15 22:00:20,234 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-15 22:00:20,242 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-15 22:00:20,250 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-15 22:00:20,265 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 [2023-02-15 22:00:30,016 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:30,016 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 80 [2023-02-15 22:00:30,026 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:30,026 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 69 treesize of output 60 [2023-02-15 22:00:30,036 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 102 treesize of output 84 [2023-02-15 22:00:30,046 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 174 treesize of output 144 [2023-02-15 22:00:30,074 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 102 treesize of output 86 [2023-02-15 22:00:30,081 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 124 treesize of output 100 [2023-02-15 22:00:30,091 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 70 treesize of output 62 [2023-02-15 22:00:31,705 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2023-02-15 22:00:31,705 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:00:31,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [849522286] [2023-02-15 22:00:31,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [849522286] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:00:31,705 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:00:31,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2023-02-15 22:00:31,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312285737] [2023-02-15 22:00:31,706 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:00:31,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 22:00:31,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:00:31,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 22:00:31,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=144, Unknown=6, NotChecked=174, Total=380 [2023-02-15 22:00:31,707 INFO L87 Difference]: Start difference. First operand 234 states and 273 transitions. Second operand has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:00:35,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:35,445 INFO L93 Difference]: Finished difference Result 246 states and 285 transitions. [2023-02-15 22:00:35,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 22:00:35,446 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-02-15 22:00:35,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:35,446 INFO L225 Difference]: With dead ends: 246 [2023-02-15 22:00:35,446 INFO L226 Difference]: Without dead ends: 246 [2023-02-15 22:00:35,447 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=95, Invalid=265, Unknown=6, NotChecked=234, Total=600 [2023-02-15 22:00:35,447 INFO L413 NwaCegarLoop]: 163 mSDtfsCounter, 6 mSDsluCounter, 1255 mSDsCounter, 0 mSdLazyCounter, 784 mSolverCounterSat, 4 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 1362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 784 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 570 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2023-02-15 22:00:35,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 1418 Invalid, 1362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 784 Invalid, 4 Unknown, 570 Unchecked, 2.8s Time] [2023-02-15 22:00:35,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2023-02-15 22:00:35,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 244. [2023-02-15 22:00:35,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 180 states have (on average 1.55) internal successors, (279), 239 states have internal predecessors, (279), 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-15 22:00:35,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 283 transitions. [2023-02-15 22:00:35,451 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 283 transitions. Word has length 27 [2023-02-15 22:00:35,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:35,451 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 283 transitions. [2023-02-15 22:00:35,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.210526315789474) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:00:35,451 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 283 transitions. [2023-02-15 22:00:35,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-02-15 22:00:35,451 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:35,452 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:00:35,463 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 (15)] Forceful destruction successful, exit code 0 [2023-02-15 22:00:35,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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-15 22:00:35,652 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:00:35,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:35,653 INFO L85 PathProgramCache]: Analyzing trace with hash 852563911, now seen corresponding path program 3 times [2023-02-15 22:00:35,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:00:35,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182961976] [2023-02-15 22:00:35,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 22:00:35,653 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-15 22:00:35,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:00:35,654 INFO L229 MonitoredProcess]: Starting monitored process 16 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-15 22:00:35,657 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 (16)] Waiting until timeout for monitored process [2023-02-15 22:00:35,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-02-15 22:00:35,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 22:00:35,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 22:00:35,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:35,968 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:35,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:00:36,071 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 22:00:36,071 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:00:36,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182961976] [2023-02-15 22:00:36,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182961976] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:00:36,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:00:36,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-15 22:00:36,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362966381] [2023-02-15 22:00:36,071 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:00:36,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:00:36,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:00:36,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:00:36,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:00:36,072 INFO L87 Difference]: Start difference. First operand 244 states and 283 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 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-15 22:00:36,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:36,185 INFO L93 Difference]: Finished difference Result 241 states and 277 transitions. [2023-02-15 22:00:36,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:00:36,188 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-02-15 22:00:36,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:36,189 INFO L225 Difference]: With dead ends: 241 [2023-02-15 22:00:36,189 INFO L226 Difference]: Without dead ends: 241 [2023-02-15 22:00:36,191 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:00:36,197 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 47 mSDsluCounter, 732 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:00:36,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 898 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 22:00:36,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-02-15 22:00:36,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 239. [2023-02-15 22:00:36,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 176 states have (on average 1.5397727272727273) internal successors, (271), 234 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-15 22:00:36,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 275 transitions. [2023-02-15 22:00:36,222 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 275 transitions. Word has length 32 [2023-02-15 22:00:36,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:36,223 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 275 transitions. [2023-02-15 22:00:36,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 10 states have internal predecessors, (48), 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-15 22:00:36,224 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 275 transitions. [2023-02-15 22:00:36,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 22:00:36,228 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:36,228 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:00:36,237 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 (16)] Forceful destruction successful, exit code 0 [2023-02-15 22:00:36,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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-15 22:00:36,429 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting create_dataErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:00:36,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:36,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1939829061, now seen corresponding path program 1 times [2023-02-15 22:00:36,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:00:36,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2038187496] [2023-02-15 22:00:36,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:36,430 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-15 22:00:36,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:00:36,432 INFO L229 MonitoredProcess]: Starting monitored process 17 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-15 22:00:36,433 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 (17)] Waiting until timeout for monitored process [2023-02-15 22:00:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:36,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 22:00:36,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:36,633 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-15 22:00:36,638 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:00:36,639 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:00:36,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:00:36,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2038187496] [2023-02-15 22:00:36,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2038187496] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:00:36,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:00:36,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:00:36,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347217921] [2023-02-15 22:00:36,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:00:36,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:00:36,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:00:36,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:00:36,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:00:36,640 INFO L87 Difference]: Start difference. First operand 239 states and 275 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 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-15 22:00:36,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:36,940 INFO L93 Difference]: Finished difference Result 241 states and 269 transitions. [2023-02-15 22:00:36,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:00:36,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 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 41 [2023-02-15 22:00:36,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:36,942 INFO L225 Difference]: With dead ends: 241 [2023-02-15 22:00:36,942 INFO L226 Difference]: Without dead ends: 241 [2023-02-15 22:00:36,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 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-15 22:00:36,943 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 22 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:00:36,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 233 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:00:36,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-02-15 22:00:36,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 235. [2023-02-15 22:00:36,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 176 states have (on average 1.4715909090909092) internal successors, (259), 230 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-15 22:00:36,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 263 transitions. [2023-02-15 22:00:36,946 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 263 transitions. Word has length 41 [2023-02-15 22:00:36,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:36,946 INFO L495 AbstractCegarLoop]: Abstraction has 235 states and 263 transitions. [2023-02-15 22:00:36,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 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-15 22:00:36,947 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 263 transitions. [2023-02-15 22:00:36,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 22:00:36,947 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:36,947 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:00:36,967 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 (17)] Forceful destruction successful, exit code 0 [2023-02-15 22:00:37,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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-15 22:00:37,148 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting create_dataErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:00:37,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:37,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1939829060, now seen corresponding path program 1 times [2023-02-15 22:00:37,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:00:37,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1070967080] [2023-02-15 22:00:37,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:37,149 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-15 22:00:37,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:00:37,150 INFO L229 MonitoredProcess]: Starting monitored process 18 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-15 22:00:37,150 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 (18)] Waiting until timeout for monitored process [2023-02-15 22:00:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:37,338 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:00:37,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:37,357 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-15 22:00:37,374 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:00:37,374 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:00:37,374 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:00:37,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1070967080] [2023-02-15 22:00:37,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1070967080] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:00:37,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:00:37,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 22:00:37,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625476904] [2023-02-15 22:00:37,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:00:37,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 22:00:37,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:00:37,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 22:00:37,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 22:00:37,377 INFO L87 Difference]: Start difference. First operand 235 states and 263 transitions. Second operand has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 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-15 22:00:37,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:37,737 INFO L93 Difference]: Finished difference Result 237 states and 257 transitions. [2023-02-15 22:00:37,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 22:00:37,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 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 41 [2023-02-15 22:00:37,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:37,738 INFO L225 Difference]: With dead ends: 237 [2023-02-15 22:00:37,739 INFO L226 Difference]: Without dead ends: 237 [2023-02-15 22:00:37,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 39 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-15 22:00:37,739 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 18 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:00:37,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 232 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:00:37,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-02-15 22:00:37,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 231. [2023-02-15 22:00:37,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 176 states have (on average 1.4034090909090908) internal successors, (247), 226 states have internal predecessors, (247), 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-15 22:00:37,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 251 transitions. [2023-02-15 22:00:37,743 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 251 transitions. Word has length 41 [2023-02-15 22:00:37,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:37,743 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 251 transitions. [2023-02-15 22:00:37,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 15.0) internal successors, (30), 3 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-15 22:00:37,743 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 251 transitions. [2023-02-15 22:00:37,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 22:00:37,744 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:37,744 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:00:37,754 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 (18)] Forceful destruction successful, exit code 0 [2023-02-15 22:00:37,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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-15 22:00:37,946 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:00:37,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:37,946 INFO L85 PathProgramCache]: Analyzing trace with hash -663465002, now seen corresponding path program 1 times [2023-02-15 22:00:37,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:00:37,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408940261] [2023-02-15 22:00:37,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:37,947 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-15 22:00:37,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:00:37,948 INFO L229 MonitoredProcess]: Starting monitored process 19 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-15 22:00:37,949 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 (19)] Waiting until timeout for monitored process [2023-02-15 22:00:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:38,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 22:00:38,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:38,248 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-15 22:00:38,312 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-15 22:00:38,369 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 9 [2023-02-15 22:00:38,614 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2023-02-15 22:00:38,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 38 [2023-02-15 22:00:38,625 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 22:00:38,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:00:40,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:00:40,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1408940261] [2023-02-15 22:00:40,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1408940261] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:00:40,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1421092881] [2023-02-15 22:00:40,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:40,712 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:00:40,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:00:40,714 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:00:40,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2023-02-15 22:00:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:41,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:00:41,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:41,102 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-15 22:00:41,131 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= |c_#valid| (store (store |c_old(#valid)| c_create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)))) is different from true [2023-02-15 22:00:43,328 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:00:43,355 INFO L321 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2023-02-15 22:00:43,355 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 2 case distinctions, treesize of input 17 treesize of output 31 [2023-02-15 22:00:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:00:43,371 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:00:43,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1421092881] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:00:43,371 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:00:43,371 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2023-02-15 22:00:43,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225772944] [2023-02-15 22:00:43,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:00:43,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:00:43,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:00:43,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:00:43,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=50, Unknown=3, NotChecked=14, Total=90 [2023-02-15 22:00:43,372 INFO L87 Difference]: Start difference. First operand 231 states and 251 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:00:45,541 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= |c_#valid| (store (store |c_old(#valid)| c_create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)))) (exists ((create_data_~data~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_780 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= |c_#valid| (store (store |c_old(#valid)| create_data_~data~0.base v_ArrVal_780) |create_data_#t~malloc7.base| (_ bv1 1)))) (= (_ bv0 1) (bvadd (select |c_#valid| create_data_~data~0.base) (_ bv1 1)))))) is different from true [2023-02-15 22:00:46,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:46,615 INFO L93 Difference]: Finished difference Result 284 states and 313 transitions. [2023-02-15 22:00:46,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:00:46,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2023-02-15 22:00:46,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:46,616 INFO L225 Difference]: With dead ends: 284 [2023-02-15 22:00:46,616 INFO L226 Difference]: Without dead ends: 284 [2023-02-15 22:00:46,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 78 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=29, Invalid=64, Unknown=5, NotChecked=34, Total=132 [2023-02-15 22:00:46,617 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 85 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 195 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:00:46,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 275 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 218 Invalid, 3 Unknown, 195 Unchecked, 1.2s Time] [2023-02-15 22:00:46,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2023-02-15 22:00:46,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 255. [2023-02-15 22:00:46,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 198 states have (on average 1.4090909090909092) internal successors, (279), 248 states have internal predecessors, (279), 2 states have call successors, (2), 2 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2023-02-15 22:00:46,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 285 transitions. [2023-02-15 22:00:46,625 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 285 transitions. Word has length 44 [2023-02-15 22:00:46,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:46,627 INFO L495 AbstractCegarLoop]: Abstraction has 255 states and 285 transitions. [2023-02-15 22:00:46,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:00:46,628 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 285 transitions. [2023-02-15 22:00:46,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-15 22:00:46,629 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:46,630 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:00:46,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Ended with exit code 0 [2023-02-15 22:00:46,843 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 (19)] Forceful destruction successful, exit code 0 [2023-02-15 22:00:47,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /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-15 22:00:47,034 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:00:47,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:47,035 INFO L85 PathProgramCache]: Analyzing trace with hash -663465001, now seen corresponding path program 1 times [2023-02-15 22:00:47,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:00:47,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600903773] [2023-02-15 22:00:47,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:47,035 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-15 22:00:47,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:00:47,036 INFO L229 MonitoredProcess]: Starting monitored process 21 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-15 22:00:47,038 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 (21)] Waiting until timeout for monitored process [2023-02-15 22:00:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:47,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 22:00:47,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:47,319 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-15 22:00:47,327 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-15 22:00:47,441 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-15 22:00:47,514 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 9 [2023-02-15 22:00:47,525 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_886 (_ BitVec 32)) (v_arrayElimCell_50 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_886) v_arrayElimCell_50 (_ bv80 32))))) is different from true [2023-02-15 22:00:47,763 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:00:47,799 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-15 22:00:47,799 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 2 case distinctions, treesize of input 15 treesize of output 27 [2023-02-15 22:00:47,815 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:00:47,815 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-15 22:00:47,866 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 5 not checked. [2023-02-15 22:00:47,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:00:48,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:00:48,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1600903773] [2023-02-15 22:00:48,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1600903773] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:00:48,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [953905487] [2023-02-15 22:00:48,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:48,222 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:00:48,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:00:48,223 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:00:48,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2023-02-15 22:00:48,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:48,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 22:00:48,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:48,669 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-15 22:00:48,677 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-15 22:00:48,740 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (exists ((v_ArrVal_1002 (_ BitVec 32))) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_1002) |create_data_#t~malloc7.base| (_ bv80 32)))))) is different from true [2023-02-15 22:00:48,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:00:49,002 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-15 22:00:49,002 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 2 case distinctions, treesize of input 15 treesize of output 27 [2023-02-15 22:00:49,022 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:00:49,022 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-15 22:00:49,062 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:00:49,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:00:49,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [953905487] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:00:49,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:00:49,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2023-02-15 22:00:49,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545364247] [2023-02-15 22:00:49,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:00:49,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:00:49,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:00:49,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:00:49,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=56, Unknown=2, NotChecked=30, Total=110 [2023-02-15 22:00:49,064 INFO L87 Difference]: Start difference. First operand 255 states and 285 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:00:50,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:50,045 INFO L93 Difference]: Finished difference Result 379 states and 413 transitions. [2023-02-15 22:00:50,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:00:50,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 44 [2023-02-15 22:00:50,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:50,047 INFO L225 Difference]: With dead ends: 379 [2023-02-15 22:00:50,047 INFO L226 Difference]: Without dead ends: 379 [2023-02-15 22:00:50,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 78 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=56, Unknown=2, NotChecked=30, Total=110 [2023-02-15 22:00:50,048 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 142 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 334 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:00:50,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 319 Invalid, 733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 396 Invalid, 0 Unknown, 334 Unchecked, 1.0s Time] [2023-02-15 22:00:50,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2023-02-15 22:00:50,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 258. [2023-02-15 22:00:50,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 200 states have (on average 1.4) internal successors, (280), 250 states have internal predecessors, (280), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 22:00:50,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 287 transitions. [2023-02-15 22:00:50,052 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 287 transitions. Word has length 44 [2023-02-15 22:00:50,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:50,052 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 287 transitions. [2023-02-15 22:00:50,052 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:00:50,052 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 287 transitions. [2023-02-15 22:00:50,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 22:00:50,053 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:50,053 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:00:50,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Forceful destruction successful, exit code 0 [2023-02-15 22:00:50,264 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 (21)] Forceful destruction successful, exit code 0 [2023-02-15 22:00:50,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,21 /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-15 22:00:50,456 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:00:50,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:50,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1359492877, now seen corresponding path program 1 times [2023-02-15 22:00:50,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:00:50,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031948424] [2023-02-15 22:00:50,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:50,457 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-15 22:00:50,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:00:50,458 INFO L229 MonitoredProcess]: Starting monitored process 23 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-15 22:00:50,459 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 (23)] Waiting until timeout for monitored process [2023-02-15 22:00:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:50,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 22:00:50,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:50,718 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:00:50,718 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:00:50,718 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:00:50,728 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 30 treesize of output 39 [2023-02-15 22:00:50,813 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:00:50,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 26 [2023-02-15 22:00:50,848 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:00:50,848 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:00:50,848 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:00:50,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031948424] [2023-02-15 22:00:50,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2031948424] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:00:50,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:00:50,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 22:00:50,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218383270] [2023-02-15 22:00:50,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:00:50,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:00:50,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:00:50,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:00:50,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:00:50,850 INFO L87 Difference]: Start difference. First operand 258 states and 287 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:00:51,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:51,327 INFO L93 Difference]: Finished difference Result 296 states and 331 transitions. [2023-02-15 22:00:51,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:00:51,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2023-02-15 22:00:51,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:51,329 INFO L225 Difference]: With dead ends: 296 [2023-02-15 22:00:51,329 INFO L226 Difference]: Without dead ends: 296 [2023-02-15 22:00:51,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-02-15 22:00:51,330 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 28 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:00:51,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 706 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:00:51,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2023-02-15 22:00:51,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 266. [2023-02-15 22:00:51,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 208 states have (on average 1.3846153846153846) internal successors, (288), 258 states have internal predecessors, (288), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 22:00:51,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 295 transitions. [2023-02-15 22:00:51,334 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 295 transitions. Word has length 46 [2023-02-15 22:00:51,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:51,334 INFO L495 AbstractCegarLoop]: Abstraction has 266 states and 295 transitions. [2023-02-15 22:00:51,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:00:51,334 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 295 transitions. [2023-02-15 22:00:51,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 22:00:51,334 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:51,334 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:00:51,349 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 (23)] Forceful destruction successful, exit code 0 [2023-02-15 22:00:51,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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-15 22:00:51,545 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:00:51,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:51,546 INFO L85 PathProgramCache]: Analyzing trace with hash 918765395, now seen corresponding path program 1 times [2023-02-15 22:00:51,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:00:51,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1927918002] [2023-02-15 22:00:51,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:51,547 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-15 22:00:51,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:00:51,550 INFO L229 MonitoredProcess]: Starting monitored process 24 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-15 22:00:51,552 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 (24)] Waiting until timeout for monitored process [2023-02-15 22:00:51,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:51,714 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 22:00:51,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:51,741 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:00:51,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:00:51,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:00:51,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1927918002] [2023-02-15 22:00:51,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1927918002] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:00:51,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:00:51,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:00:51,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865507668] [2023-02-15 22:00:51,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:00:51,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:00:51,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:00:51,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:00:51,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:00:51,744 INFO L87 Difference]: Start difference. First operand 266 states and 295 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:00:51,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:00:51,779 INFO L93 Difference]: Finished difference Result 274 states and 299 transitions. [2023-02-15 22:00:51,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:00:51,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2023-02-15 22:00:51,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:00:51,781 INFO L225 Difference]: With dead ends: 274 [2023-02-15 22:00:51,781 INFO L226 Difference]: Without dead ends: 274 [2023-02-15 22:00:51,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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-15 22:00:51,781 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 3 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 455 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-15 22:00:51,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 455 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 22:00:51,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2023-02-15 22:00:51,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 272. [2023-02-15 22:00:51,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 214 states have (on average 1.355140186915888) internal successors, (290), 264 states have internal predecessors, (290), 2 states have call successors, (2), 2 states have call predecessors, (2), 5 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2023-02-15 22:00:51,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 297 transitions. [2023-02-15 22:00:51,787 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 297 transitions. Word has length 46 [2023-02-15 22:00:51,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:00:51,787 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 297 transitions. [2023-02-15 22:00:51,787 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:00:51,788 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 297 transitions. [2023-02-15 22:00:51,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 22:00:51,788 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:00:51,788 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:00:51,800 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 (24)] Forceful destruction successful, exit code 0 [2023-02-15 22:00:51,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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-15 22:00:52,000 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:00:52,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:00:52,000 INFO L85 PathProgramCache]: Analyzing trace with hash -1934703003, now seen corresponding path program 1 times [2023-02-15 22:00:52,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:00:52,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186502724] [2023-02-15 22:00:52,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:52,001 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-15 22:00:52,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:00:52,002 INFO L229 MonitoredProcess]: Starting monitored process 25 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-15 22:00:52,004 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 (25)] Waiting until timeout for monitored process [2023-02-15 22:00:52,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:52,346 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 22:00:52,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:52,352 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-15 22:00:52,401 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-15 22:00:52,439 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 9 [2023-02-15 22:00:52,633 INFO L321 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2023-02-15 22:00:52,634 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 34 [2023-02-15 22:00:52,693 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 22:00:52,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:00:56,830 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:00:56,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186502724] [2023-02-15 22:00:56,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186502724] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:00:56,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [852907987] [2023-02-15 22:00:56,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:00:56,831 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:00:56,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:00:56,832 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:00:56,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2023-02-15 22:00:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:00:57,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 22:00:57,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:00:57,475 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 7 treesize of output 5 [2023-02-15 22:00:58,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:00:58,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:00:58,210 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 22:00:58,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 31 [2023-02-15 22:00:58,280 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:00:58,280 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:00:58,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [852907987] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:00:58,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:00:58,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2023-02-15 22:00:58,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170079400] [2023-02-15 22:00:58,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:00:58,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:00:58,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:00:58,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:00:58,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=170, Unknown=2, NotChecked=0, Total=210 [2023-02-15 22:00:58,281 INFO L87 Difference]: Start difference. First operand 272 states and 297 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:01:00,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:01:00,298 INFO L93 Difference]: Finished difference Result 360 states and 389 transitions. [2023-02-15 22:01:00,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:01:00,301 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2023-02-15 22:01:00,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:01:00,302 INFO L225 Difference]: With dead ends: 360 [2023-02-15 22:01:00,302 INFO L226 Difference]: Without dead ends: 360 [2023-02-15 22:01:00,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=60, Invalid=244, Unknown=2, NotChecked=0, Total=306 [2023-02-15 22:01:00,302 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 523 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 19 mSolverCounterUnsat, 16 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 16 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-02-15 22:01:00,303 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [523 Valid, 374 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 407 Invalid, 16 Unknown, 0 Unchecked, 1.9s Time] [2023-02-15 22:01:00,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2023-02-15 22:01:00,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 283. [2023-02-15 22:01:00,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 223 states have (on average 1.3632286995515694) internal successors, (304), 273 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call predecessors, (2), 7 states have return successors, (7), 7 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-15 22:01:00,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 313 transitions. [2023-02-15 22:01:00,307 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 313 transitions. Word has length 46 [2023-02-15 22:01:00,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:01:00,307 INFO L495 AbstractCegarLoop]: Abstraction has 283 states and 313 transitions. [2023-02-15 22:01:00,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:01:00,308 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 313 transitions. [2023-02-15 22:01:00,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 22:01:00,308 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:01:00,308 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:01:00,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2023-02-15 22:01:00,520 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 (25)] Forceful destruction successful, exit code 0 [2023-02-15 22:01:00,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,25 /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-15 22:01:00,709 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:01:00,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:01:00,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1934703002, now seen corresponding path program 1 times [2023-02-15 22:01:00,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:01:00,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1246138927] [2023-02-15 22:01:00,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:01:00,710 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-15 22:01:00,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:01:00,717 INFO L229 MonitoredProcess]: Starting monitored process 27 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-15 22:01:00,720 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 (27)] Waiting until timeout for monitored process [2023-02-15 22:01:00,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:01:01,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 22:01:01,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:01:01,032 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-15 22:01:01,147 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-15 22:01:01,212 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 9 [2023-02-15 22:01:01,224 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1553 (_ BitVec 32)) (v_arrayElimCell_66 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_1553) v_arrayElimCell_66 (_ bv80 32))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) is different from true [2023-02-15 22:01:01,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:01:01,464 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-15 22:01:01,464 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 2 case distinctions, treesize of input 17 treesize of output 29 [2023-02-15 22:01:01,479 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:01:01,479 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-15 22:01:01,560 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 5 not checked. [2023-02-15 22:01:01,561 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:01:03,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:01:03,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1246138927] [2023-02-15 22:01:03,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1246138927] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:01:03,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [607205084] [2023-02-15 22:01:03,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:01:03,867 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:01:03,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:01:03,869 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:01:03,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2023-02-15 22:01:04,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:01:04,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 22:01:04,283 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:01:04,288 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-15 22:01:04,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:01:04,333 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-15 22:01:04,496 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 13 treesize of output 9 [2023-02-15 22:01:05,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:01:05,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:01:05,169 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:01:05,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 28 [2023-02-15 22:01:05,303 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:01:05,304 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:01:05,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [607205084] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:01:05,304 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:01:05,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2023-02-15 22:01:05,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839222443] [2023-02-15 22:01:05,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:01:05,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 22:01:05,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:01:05,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 22:01:05,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=4, NotChecked=30, Total=306 [2023-02-15 22:01:05,306 INFO L87 Difference]: Start difference. First operand 283 states and 313 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:01:07,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:01:07,566 INFO L93 Difference]: Finished difference Result 503 states and 553 transitions. [2023-02-15 22:01:07,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 22:01:07,567 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2023-02-15 22:01:07,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:01:07,569 INFO L225 Difference]: With dead ends: 503 [2023-02-15 22:01:07,569 INFO L226 Difference]: Without dead ends: 503 [2023-02-15 22:01:07,569 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=58, Invalid=282, Unknown=6, NotChecked=34, Total=380 [2023-02-15 22:01:07,569 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 356 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 16 mSolverCounterUnsat, 123 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 356 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 123 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-02-15 22:01:07,570 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [356 Valid, 481 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 444 Invalid, 123 Unknown, 0 Unchecked, 2.1s Time] [2023-02-15 22:01:07,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2023-02-15 22:01:07,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 437. [2023-02-15 22:01:07,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 437 states, 370 states have (on average 1.3216216216216217) internal successors, (489), 420 states have internal predecessors, (489), 4 states have call successors, (4), 4 states have call predecessors, (4), 12 states have return successors, (14), 12 states have call predecessors, (14), 4 states have call successors, (14) [2023-02-15 22:01:07,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 507 transitions. [2023-02-15 22:01:07,578 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 507 transitions. Word has length 46 [2023-02-15 22:01:07,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:01:07,578 INFO L495 AbstractCegarLoop]: Abstraction has 437 states and 507 transitions. [2023-02-15 22:01:07,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 8 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:01:07,578 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 507 transitions. [2023-02-15 22:01:07,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 22:01:07,579 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:01:07,579 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:01:07,591 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 (27)] Forceful destruction successful, exit code 0 [2023-02-15 22:01:07,804 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2023-02-15 22:01:07,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-15 22:01:07,993 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:01:07,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:01:07,993 INFO L85 PathProgramCache]: Analyzing trace with hash 2050875696, now seen corresponding path program 1 times [2023-02-15 22:01:07,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:01:07,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [148512870] [2023-02-15 22:01:07,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:01:07,994 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-15 22:01:07,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:01:07,996 INFO L229 MonitoredProcess]: Starting monitored process 29 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-15 22:01:07,998 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 (29)] Waiting until timeout for monitored process [2023-02-15 22:01:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:01:08,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 22:01:08,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:01:08,354 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-15 22:01:08,421 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-15 22:01:08,499 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 9 [2023-02-15 22:01:08,827 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2023-02-15 22:01:08,828 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 38 [2023-02-15 22:01:08,842 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-02-15 22:01:08,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:01:10,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:01:10,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [148512870] [2023-02-15 22:01:10,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [148512870] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:01:10,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1682663383] [2023-02-15 22:01:10,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:01:10,963 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:01:10,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:01:10,973 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:01:10,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2023-02-15 22:01:11,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:01:11,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 22:01:11,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:01:11,421 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-15 22:01:11,447 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1891 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (= |c_#valid| (store (store |c_old(#valid)| c_create_data_~data~0.base v_ArrVal_1891) |create_data_#t~malloc7.base| (_ bv1 1)))) is different from true [2023-02-15 22:01:13,610 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:01:13,635 INFO L321 Elim1Store]: treesize reduction 34, result has 35.8 percent of original size [2023-02-15 22:01:13,635 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 2 case distinctions, treesize of input 17 treesize of output 31 [2023-02-15 22:01:13,648 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:01:13,648 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:01:13,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1682663383] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:01:13,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:01:13,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2023-02-15 22:01:13,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287485841] [2023-02-15 22:01:13,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:01:13,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:01:13,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:01:13,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:01:13,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=50, Unknown=3, NotChecked=14, Total=90 [2023-02-15 22:01:13,649 INFO L87 Difference]: Start difference. First operand 437 states and 507 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:01:16,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:01:16,694 INFO L93 Difference]: Finished difference Result 484 states and 553 transitions. [2023-02-15 22:01:16,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:01:16,695 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2023-02-15 22:01:16,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:01:16,696 INFO L225 Difference]: With dead ends: 484 [2023-02-15 22:01:16,696 INFO L226 Difference]: Without dead ends: 484 [2023-02-15 22:01:16,696 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 86 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=4, NotChecked=18, Total=132 [2023-02-15 22:01:16,697 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 121 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 9 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-02-15 22:01:16,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 304 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 242 Invalid, 3 Unknown, 155 Unchecked, 0.9s Time] [2023-02-15 22:01:16,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2023-02-15 22:01:16,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 417. [2023-02-15 22:01:16,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 352 states have (on average 1.3153409090909092) internal successors, (463), 402 states have internal predecessors, (463), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-15 22:01:16,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 479 transitions. [2023-02-15 22:01:16,705 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 479 transitions. Word has length 48 [2023-02-15 22:01:16,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:01:16,705 INFO L495 AbstractCegarLoop]: Abstraction has 417 states and 479 transitions. [2023-02-15 22:01:16,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:01:16,705 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 479 transitions. [2023-02-15 22:01:16,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 22:01:16,706 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:01:16,706 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:01:16,715 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 (29)] Forceful destruction successful, exit code 0 [2023-02-15 22:01:16,921 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Ended with exit code 0 [2023-02-15 22:01:17,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /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,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-15 22:01:17,115 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:01:17,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:01:17,116 INFO L85 PathProgramCache]: Analyzing trace with hash 2050875697, now seen corresponding path program 1 times [2023-02-15 22:01:17,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:01:17,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033490144] [2023-02-15 22:01:17,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:01:17,116 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-15 22:01:17,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:01:17,118 INFO L229 MonitoredProcess]: Starting monitored process 31 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-15 22:01:17,121 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 (31)] Waiting until timeout for monitored process [2023-02-15 22:01:17,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:01:17,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 22:01:17,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:01:17,510 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-15 22:01:17,516 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-15 22:01:17,609 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-15 22:01:17,659 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 9 [2023-02-15 22:01:17,675 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1997 (_ BitVec 32)) (v_arrayElimCell_77 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_1997) v_arrayElimCell_77 (_ bv80 32))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) is different from true [2023-02-15 22:01:17,886 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:01:17,917 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-15 22:01:17,917 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 2 case distinctions, treesize of input 15 treesize of output 27 [2023-02-15 22:01:17,931 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:01:17,931 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-15 22:01:17,974 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 5 not checked. [2023-02-15 22:01:17,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:01:18,193 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:01:18,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033490144] [2023-02-15 22:01:18,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033490144] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:01:18,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1111264954] [2023-02-15 22:01:18,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:01:18,193 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:01:18,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:01:18,194 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:01:18,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2023-02-15 22:01:18,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:01:18,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 22:01:18,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:01:18,674 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-15 22:01:18,680 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-15 22:01:18,759 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_2112 (_ BitVec 32))) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_2112) |c_create_data_#t~malloc7.base| (_ bv80 32)))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) is different from true [2023-02-15 22:01:18,766 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32)) (v_ArrVal_2112 (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_2112) |create_data_#t~malloc7.base| (_ bv80 32))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) is different from true [2023-02-15 22:01:18,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:01:18,964 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-15 22:01:18,964 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 2 case distinctions, treesize of input 15 treesize of output 27 [2023-02-15 22:01:18,973 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:01:18,974 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-15 22:01:18,995 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:01:18,995 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:01:18,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1111264954] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:01:18,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:01:18,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2023-02-15 22:01:18,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044409667] [2023-02-15 22:01:18,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:01:18,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:01:18,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:01:18,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:01:18,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=57, Unknown=3, NotChecked=48, Total=132 [2023-02-15 22:01:18,997 INFO L87 Difference]: Start difference. First operand 417 states and 479 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:01:19,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:01:19,828 INFO L93 Difference]: Finished difference Result 602 states and 699 transitions. [2023-02-15 22:01:19,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:01:19,829 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2023-02-15 22:01:19,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:01:19,831 INFO L225 Difference]: With dead ends: 602 [2023-02-15 22:01:19,831 INFO L226 Difference]: Without dead ends: 602 [2023-02-15 22:01:19,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=57, Unknown=3, NotChecked=48, Total=132 [2023-02-15 22:01:19,831 INFO L413 NwaCegarLoop]: 198 mSDtfsCounter, 140 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 619 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 22:01:19,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 430 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 490 Invalid, 0 Unknown, 619 Unchecked, 0.8s Time] [2023-02-15 22:01:19,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2023-02-15 22:01:19,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 423. [2023-02-15 22:01:19,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 358 states have (on average 1.3156424581005586) internal successors, (471), 408 states have internal predecessors, (471), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-15 22:01:19,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 487 transitions. [2023-02-15 22:01:19,844 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 487 transitions. Word has length 48 [2023-02-15 22:01:19,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:01:19,844 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 487 transitions. [2023-02-15 22:01:19,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:01:19,845 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 487 transitions. [2023-02-15 22:01:19,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 22:01:19,845 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:01:19,846 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:01:19,859 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 (31)] Forceful destruction successful, exit code 0 [2023-02-15 22:01:20,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Forceful destruction successful, exit code 0 [2023-02-15 22:01:20,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /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,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-15 22:01:20,261 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:01:20,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:01:20,262 INFO L85 PathProgramCache]: Analyzing trace with hash 471257990, now seen corresponding path program 1 times [2023-02-15 22:01:20,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:01:20,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [7452663] [2023-02-15 22:01:20,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:01:20,262 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-15 22:01:20,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:01:20,263 INFO L229 MonitoredProcess]: Starting monitored process 33 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-15 22:01:20,273 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 (33)] Waiting until timeout for monitored process [2023-02-15 22:01:20,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:01:20,478 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 22:01:20,479 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:01:20,517 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:01:20,518 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:01:20,518 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:01:20,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [7452663] [2023-02-15 22:01:20,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [7452663] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:01:20,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:01:20,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 22:01:20,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370486659] [2023-02-15 22:01:20,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:01:20,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:01:20,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:01:20,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:01:20,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:01:20,519 INFO L87 Difference]: Start difference. First operand 423 states and 487 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:01:20,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:01:20,805 INFO L93 Difference]: Finished difference Result 422 states and 485 transitions. [2023-02-15 22:01:20,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:01:20,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2023-02-15 22:01:20,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:01:20,806 INFO L225 Difference]: With dead ends: 422 [2023-02-15 22:01:20,806 INFO L226 Difference]: Without dead ends: 422 [2023-02-15 22:01:20,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 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-15 22:01:20,807 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 142 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:01:20,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 217 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 22:01:20,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2023-02-15 22:01:20,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2023-02-15 22:01:20,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 358 states have (on average 1.3100558659217878) internal successors, (469), 407 states have internal predecessors, (469), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-15 22:01:20,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 485 transitions. [2023-02-15 22:01:20,812 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 485 transitions. Word has length 48 [2023-02-15 22:01:20,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:01:20,814 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 485 transitions. [2023-02-15 22:01:20,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:01:20,815 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 485 transitions. [2023-02-15 22:01:20,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 22:01:20,815 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:01:20,815 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:01:20,834 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 (33)] Forceful destruction successful, exit code 0 [2023-02-15 22:01:21,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /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-15 22:01:21,016 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:01:21,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:01:21,016 INFO L85 PathProgramCache]: Analyzing trace with hash 471257991, now seen corresponding path program 1 times [2023-02-15 22:01:21,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:01:21,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [413283468] [2023-02-15 22:01:21,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:01:21,017 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-15 22:01:21,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:01:21,021 INFO L229 MonitoredProcess]: Starting monitored process 34 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-15 22:01:21,024 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 (34)] Waiting until timeout for monitored process [2023-02-15 22:01:21,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:01:21,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 22:01:21,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:01:21,353 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:01:21,353 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:01:21,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:01:21,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [413283468] [2023-02-15 22:01:21,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [413283468] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:01:21,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:01:21,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 22:01:21,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740090214] [2023-02-15 22:01:21,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:01:21,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:01:21,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:01:21,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:01:21,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:01:21,355 INFO L87 Difference]: Start difference. First operand 422 states and 485 transitions. Second operand has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:01:21,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:01:21,759 INFO L93 Difference]: Finished difference Result 413 states and 473 transitions. [2023-02-15 22:01:21,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:01:21,760 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 48 [2023-02-15 22:01:21,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:01:21,761 INFO L225 Difference]: With dead ends: 413 [2023-02-15 22:01:21,761 INFO L226 Difference]: Without dead ends: 413 [2023-02-15 22:01:21,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:01:21,762 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 139 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:01:21,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 277 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:01:21,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2023-02-15 22:01:21,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2023-02-15 22:01:21,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 358 states have (on average 1.276536312849162) internal successors, (457), 398 states have internal predecessors, (457), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-15 22:01:21,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 473 transitions. [2023-02-15 22:01:21,767 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 473 transitions. Word has length 48 [2023-02-15 22:01:21,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:01:21,768 INFO L495 AbstractCegarLoop]: Abstraction has 413 states and 473 transitions. [2023-02-15 22:01:21,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.0) internal successors, (36), 5 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:01:21,768 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 473 transitions. [2023-02-15 22:01:21,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 22:01:21,768 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:01:21,768 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:01:21,785 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 (34)] Forceful destruction successful, exit code 0 [2023-02-15 22:01:21,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /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-15 22:01:21,980 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:01:21,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:01:21,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1724095953, now seen corresponding path program 1 times [2023-02-15 22:01:21,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:01:21,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163867893] [2023-02-15 22:01:21,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:01:21,981 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-15 22:01:21,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:01:21,982 INFO L229 MonitoredProcess]: Starting monitored process 35 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-15 22:01:21,984 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 (35)] Waiting until timeout for monitored process [2023-02-15 22:01:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:01:22,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 22:01:22,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:01:22,253 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 11 treesize of output 7 [2023-02-15 22:01:22,266 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 11 [2023-02-15 22:01:22,275 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:01:22,275 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:01:22,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:01:22,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163867893] [2023-02-15 22:01:22,275 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163867893] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:01:22,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:01:22,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:01:22,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598432062] [2023-02-15 22:01:22,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:01:22,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:01:22,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:01:22,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:01:22,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:01:22,277 INFO L87 Difference]: Start difference. First operand 413 states and 473 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:01:22,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:01:22,719 INFO L93 Difference]: Finished difference Result 434 states and 494 transitions. [2023-02-15 22:01:22,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:01:22,720 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2023-02-15 22:01:22,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:01:22,721 INFO L225 Difference]: With dead ends: 434 [2023-02-15 22:01:22,721 INFO L226 Difference]: Without dead ends: 434 [2023-02-15 22:01:22,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:01:22,722 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 149 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:01:22,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 359 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:01:22,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2023-02-15 22:01:22,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 412. [2023-02-15 22:01:22,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 358 states have (on average 1.270949720670391) internal successors, (455), 397 states have internal predecessors, (455), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-15 22:01:22,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 471 transitions. [2023-02-15 22:01:22,727 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 471 transitions. Word has length 49 [2023-02-15 22:01:22,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:01:22,727 INFO L495 AbstractCegarLoop]: Abstraction has 412 states and 471 transitions. [2023-02-15 22:01:22,727 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:01:22,727 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 471 transitions. [2023-02-15 22:01:22,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 22:01:22,727 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:01:22,727 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:01:22,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 (35)] Forceful destruction successful, exit code 0 [2023-02-15 22:01:22,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /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-15 22:01:22,928 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:01:22,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:01:22,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1724095954, now seen corresponding path program 1 times [2023-02-15 22:01:22,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:01:22,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919655992] [2023-02-15 22:01:22,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:01:22,929 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-15 22:01:22,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:01:22,930 INFO L229 MonitoredProcess]: Starting monitored process 36 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-15 22:01:22,933 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 (36)] Waiting until timeout for monitored process [2023-02-15 22:01:23,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:01:23,178 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 22:01:23,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:01:23,298 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 11 treesize of output 7 [2023-02-15 22:01:23,305 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 11 treesize of output 7 [2023-02-15 22:01:23,330 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 17 treesize of output 9 [2023-02-15 22:01:23,341 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-15 22:01:23,360 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:01:23,360 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:01:23,360 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:01:23,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [919655992] [2023-02-15 22:01:23,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [919655992] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:01:23,361 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:01:23,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:01:23,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765802183] [2023-02-15 22:01:23,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:01:23,361 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:01:23,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:01:23,362 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:01:23,362 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:01:23,362 INFO L87 Difference]: Start difference. First operand 412 states and 471 transitions. Second operand has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:01:24,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:01:24,010 INFO L93 Difference]: Finished difference Result 450 states and 509 transitions. [2023-02-15 22:01:24,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:01:24,011 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2023-02-15 22:01:24,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:01:24,012 INFO L225 Difference]: With dead ends: 450 [2023-02-15 22:01:24,012 INFO L226 Difference]: Without dead ends: 450 [2023-02-15 22:01:24,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:01:24,013 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 285 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:01:24,013 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 311 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 22:01:24,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2023-02-15 22:01:24,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 411. [2023-02-15 22:01:24,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 358 states have (on average 1.26536312849162) internal successors, (453), 396 states have internal predecessors, (453), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-15 22:01:24,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 469 transitions. [2023-02-15 22:01:24,024 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 469 transitions. Word has length 49 [2023-02-15 22:01:24,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:01:24,025 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 469 transitions. [2023-02-15 22:01:24,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.4) internal successors, (37), 6 states have internal predecessors, (37), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:01:24,025 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 469 transitions. [2023-02-15 22:01:24,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 22:01:24,025 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:01:24,026 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:01:24,037 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 (36)] Forceful destruction successful, exit code 0 [2023-02-15 22:01:24,235 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /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-15 22:01:24,235 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:01:24,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:01:24,235 INFO L85 PathProgramCache]: Analyzing trace with hash -42553449, now seen corresponding path program 1 times [2023-02-15 22:01:24,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:01:24,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [600035881] [2023-02-15 22:01:24,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:01:24,236 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-15 22:01:24,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:01:24,237 INFO L229 MonitoredProcess]: Starting monitored process 37 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-15 22:01:24,239 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 (37)] Waiting until timeout for monitored process [2023-02-15 22:01:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:01:24,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 22:01:24,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:01:24,561 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 11 treesize of output 7 [2023-02-15 22:01:24,579 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 11 [2023-02-15 22:01:24,587 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:01:24,587 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:01:24,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:01:24,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [600035881] [2023-02-15 22:01:24,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [600035881] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:01:24,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:01:24,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:01:24,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061002099] [2023-02-15 22:01:24,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:01:24,587 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:01:24,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:01:24,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:01:24,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:01:24,588 INFO L87 Difference]: Start difference. First operand 411 states and 469 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:01:25,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:01:25,039 INFO L93 Difference]: Finished difference Result 434 states and 492 transitions. [2023-02-15 22:01:25,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:01:25,040 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2023-02-15 22:01:25,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:01:25,041 INFO L225 Difference]: With dead ends: 434 [2023-02-15 22:01:25,041 INFO L226 Difference]: Without dead ends: 434 [2023-02-15 22:01:25,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:01:25,042 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 134 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:01:25,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 362 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:01:25,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2023-02-15 22:01:25,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 410. [2023-02-15 22:01:25,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 358 states have (on average 1.2597765363128492) internal successors, (451), 395 states have internal predecessors, (451), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-15 22:01:25,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 467 transitions. [2023-02-15 22:01:25,047 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 467 transitions. Word has length 53 [2023-02-15 22:01:25,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:01:25,047 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 467 transitions. [2023-02-15 22:01:25,047 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:01:25,047 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 467 transitions. [2023-02-15 22:01:25,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 22:01:25,047 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:01:25,047 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:01:25,057 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 (37)] Forceful destruction successful, exit code 0 [2023-02-15 22:01:25,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /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-15 22:01:25,257 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:01:25,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:01:25,257 INFO L85 PathProgramCache]: Analyzing trace with hash -42553448, now seen corresponding path program 1 times [2023-02-15 22:01:25,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:01:25,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475473220] [2023-02-15 22:01:25,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:01:25,258 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-15 22:01:25,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:01:25,259 INFO L229 MonitoredProcess]: Starting monitored process 38 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-15 22:01:25,261 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 (38)] Waiting until timeout for monitored process [2023-02-15 22:01:25,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:01:25,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 22:01:25,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:01:25,646 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 11 treesize of output 7 [2023-02-15 22:01:25,653 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 11 treesize of output 7 [2023-02-15 22:01:25,698 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 17 treesize of output 9 [2023-02-15 22:01:25,700 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-15 22:01:25,717 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:01:25,718 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:01:25,718 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:01:25,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475473220] [2023-02-15 22:01:25,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475473220] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:01:25,718 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:01:25,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:01:25,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167302896] [2023-02-15 22:01:25,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:01:25,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:01:25,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:01:25,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:01:25,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:01:25,719 INFO L87 Difference]: Start difference. First operand 410 states and 467 transitions. Second operand has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:01:26,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:01:26,356 INFO L93 Difference]: Finished difference Result 450 states and 507 transitions. [2023-02-15 22:01:26,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:01:26,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2023-02-15 22:01:26,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:01:26,358 INFO L225 Difference]: With dead ends: 450 [2023-02-15 22:01:26,358 INFO L226 Difference]: Without dead ends: 450 [2023-02-15 22:01:26,358 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:01:26,359 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 268 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:01:26,359 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 314 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 22:01:26,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2023-02-15 22:01:26,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 409. [2023-02-15 22:01:26,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 358 states have (on average 1.2541899441340782) internal successors, (449), 394 states have internal predecessors, (449), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-15 22:01:26,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 465 transitions. [2023-02-15 22:01:26,364 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 465 transitions. Word has length 53 [2023-02-15 22:01:26,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:01:26,364 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 465 transitions. [2023-02-15 22:01:26,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.2) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:01:26,365 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 465 transitions. [2023-02-15 22:01:26,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 22:01:26,365 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:01:26,365 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:01:26,377 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 (38)] Forceful destruction successful, exit code 0 [2023-02-15 22:01:26,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /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-15 22:01:26,566 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting create_dataErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:01:26,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:01:26,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1556982670, now seen corresponding path program 1 times [2023-02-15 22:01:26,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:01:26,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [366932669] [2023-02-15 22:01:26,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:01:26,567 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-15 22:01:26,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:01:26,568 INFO L229 MonitoredProcess]: Starting monitored process 39 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-15 22:01:26,570 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 (39)] Waiting until timeout for monitored process [2023-02-15 22:01:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:01:27,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 22:01:27,152 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:01:27,157 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-15 22:01:27,203 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 22:01:27,204 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-15 22:01:27,217 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:01:27,217 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:01:27,260 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:01:27,260 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:01:27,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [366932669] [2023-02-15 22:01:27,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [366932669] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:01:27,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:01:27,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2023-02-15 22:01:27,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355769321] [2023-02-15 22:01:27,261 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:01:27,261 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 22:01:27,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:01:27,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 22:01:27,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 22:01:27,262 INFO L87 Difference]: Start difference. First operand 409 states and 465 transitions. Second operand has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:01:27,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:01:27,641 INFO L93 Difference]: Finished difference Result 408 states and 463 transitions. [2023-02-15 22:01:27,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:01:27,642 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2023-02-15 22:01:27,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:01:27,643 INFO L225 Difference]: With dead ends: 408 [2023-02-15 22:01:27,643 INFO L226 Difference]: Without dead ends: 408 [2023-02-15 22:01:27,643 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 100 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:01:27,643 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 50 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:01:27,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 240 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:01:27,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2023-02-15 22:01:27,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2023-02-15 22:01:27,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 358 states have (on average 1.2486033519553073) internal successors, (447), 393 states have internal predecessors, (447), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-15 22:01:27,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 463 transitions. [2023-02-15 22:01:27,648 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 463 transitions. Word has length 53 [2023-02-15 22:01:27,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:01:27,648 INFO L495 AbstractCegarLoop]: Abstraction has 408 states and 463 transitions. [2023-02-15 22:01:27,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 22:01:27,648 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 463 transitions. [2023-02-15 22:01:27,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-15 22:01:27,650 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:01:27,650 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:01:27,668 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 (39)] Forceful destruction successful, exit code 0 [2023-02-15 22:01:27,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /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-15 22:01:27,861 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting create_dataErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:01:27,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:01:27,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1556982671, now seen corresponding path program 1 times [2023-02-15 22:01:27,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:01:27,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [690676455] [2023-02-15 22:01:27,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:01:27,862 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-15 22:01:27,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:01:27,865 INFO L229 MonitoredProcess]: Starting monitored process 40 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-15 22:01:27,867 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 (40)] Waiting until timeout for monitored process [2023-02-15 22:01:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:01:28,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 22:01:28,411 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:01:28,417 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-15 22:01:28,472 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 22:01:28,473 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 12 treesize of output 14 [2023-02-15 22:01:28,484 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:01:28,484 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:01:28,685 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:01:28,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:01:28,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [690676455] [2023-02-15 22:01:28,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [690676455] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:01:28,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:01:28,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2023-02-15 22:01:28,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576109363] [2023-02-15 22:01:28,685 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:01:28,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:01:28,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:01:28,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:01:28,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:01:28,686 INFO L87 Difference]: Start difference. First operand 408 states and 463 transitions. Second operand has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 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-15 22:01:29,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:01:29,333 INFO L93 Difference]: Finished difference Result 404 states and 455 transitions. [2023-02-15 22:01:29,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:01:29,334 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 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 53 [2023-02-15 22:01:29,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:01:29,335 INFO L225 Difference]: With dead ends: 404 [2023-02-15 22:01:29,335 INFO L226 Difference]: Without dead ends: 404 [2023-02-15 22:01:29,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 98 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:01:29,335 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 46 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 22:01:29,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 380 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 22:01:29,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2023-02-15 22:01:29,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 390. [2023-02-15 22:01:29,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 344 states have (on average 1.2354651162790697) internal successors, (425), 375 states have internal predecessors, (425), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-15 22:01:29,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 441 transitions. [2023-02-15 22:01:29,340 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 441 transitions. Word has length 53 [2023-02-15 22:01:29,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:01:29,340 INFO L495 AbstractCegarLoop]: Abstraction has 390 states and 441 transitions. [2023-02-15 22:01:29,340 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 9.333333333333334) internal successors, (56), 7 states have internal predecessors, (56), 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-15 22:01:29,340 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 441 transitions. [2023-02-15 22:01:29,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-15 22:01:29,341 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:01:29,341 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:01:29,381 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 (40)] Forceful destruction successful, exit code 0 [2023-02-15 22:01:29,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /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-15 22:01:29,555 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:01:29,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:01:29,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1319156755, now seen corresponding path program 1 times [2023-02-15 22:01:29,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:01:29,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1526177015] [2023-02-15 22:01:29,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:01:29,556 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-15 22:01:29,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:01:29,562 INFO L229 MonitoredProcess]: Starting monitored process 41 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-15 22:01:29,565 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 (41)] Waiting until timeout for monitored process [2023-02-15 22:01:29,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:01:29,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 22:01:29,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:01:30,028 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 11 treesize of output 7 [2023-02-15 22:01:30,097 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 22:01:30,097 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2023-02-15 22:01:30,110 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 11 treesize of output 7 [2023-02-15 22:01:30,202 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-15 22:01:30,235 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 22:01:30,235 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 29 [2023-02-15 22:01:30,257 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-15 22:01:30,257 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:01:30,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:01:30,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1526177015] [2023-02-15 22:01:30,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1526177015] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:01:30,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:01:30,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 22:01:30,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796793269] [2023-02-15 22:01:30,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:01:30,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 22:01:30,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:01:30,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 22:01:30,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-15 22:01:30,258 INFO L87 Difference]: Start difference. First operand 390 states and 441 transitions. Second operand has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:01:31,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:01:31,415 INFO L93 Difference]: Finished difference Result 469 states and 541 transitions. [2023-02-15 22:01:31,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 22:01:31,416 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2023-02-15 22:01:31,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:01:31,418 INFO L225 Difference]: With dead ends: 469 [2023-02-15 22:01:31,418 INFO L226 Difference]: Without dead ends: 469 [2023-02-15 22:01:31,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2023-02-15 22:01:31,418 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 327 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 491 SdHoareTripleChecker+Invalid, 574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-15 22:01:31,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 491 Invalid, 574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-15 22:01:31,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2023-02-15 22:01:31,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 408. [2023-02-15 22:01:31,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 362 states have (on average 1.2375690607734806) internal successors, (448), 393 states have internal predecessors, (448), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-15 22:01:31,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 464 transitions. [2023-02-15 22:01:31,437 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 464 transitions. Word has length 54 [2023-02-15 22:01:31,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:01:31,438 INFO L495 AbstractCegarLoop]: Abstraction has 408 states and 464 transitions. [2023-02-15 22:01:31,438 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.6) internal successors, (46), 10 states have internal predecessors, (46), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:01:31,438 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 464 transitions. [2023-02-15 22:01:31,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-15 22:01:31,438 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:01:31,439 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:01:31,451 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 (41)] Forceful destruction successful, exit code 0 [2023-02-15 22:01:31,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /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-15 22:01:31,649 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:01:31,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:01:31,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1319156754, now seen corresponding path program 1 times [2023-02-15 22:01:31,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:01:31,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059765383] [2023-02-15 22:01:31,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:01:31,650 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-15 22:01:31,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:01:31,651 INFO L229 MonitoredProcess]: Starting monitored process 42 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-15 22:01:31,653 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 (42)] Waiting until timeout for monitored process [2023-02-15 22:01:32,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:01:32,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-15 22:01:32,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:01:32,044 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-15 22:01:32,067 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:01:32,068 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-15 22:01:32,125 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-15 22:01:32,129 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-15 22:01:32,322 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 11 treesize of output 7 [2023-02-15 22:01:32,328 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 11 treesize of output 7 [2023-02-15 22:01:32,382 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 21 treesize of output 20 [2023-02-15 22:01:32,389 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 23 treesize of output 22 [2023-02-15 22:01:32,571 INFO L321 Elim1Store]: treesize reduction 29, result has 9.4 percent of original size [2023-02-15 22:01:32,571 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 37 [2023-02-15 22:01:32,586 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 22:01:32,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2023-02-15 22:01:32,618 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:01:32,619 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:01:32,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:01:32,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1059765383] [2023-02-15 22:01:32,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1059765383] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:01:32,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:01:32,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 22:01:32,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888372452] [2023-02-15 22:01:32,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:01:32,619 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 22:01:32,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:01:32,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 22:01:32,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-02-15 22:01:32,620 INFO L87 Difference]: Start difference. First operand 408 states and 464 transitions. Second operand has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:01:34,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:01:34,722 INFO L93 Difference]: Finished difference Result 518 states and 574 transitions. [2023-02-15 22:01:34,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 22:01:34,722 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2023-02-15 22:01:34,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:01:34,723 INFO L225 Difference]: With dead ends: 518 [2023-02-15 22:01:34,724 INFO L226 Difference]: Without dead ends: 518 [2023-02-15 22:01:34,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2023-02-15 22:01:34,724 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 325 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:01:34,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [325 Valid, 667 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2023-02-15 22:01:34,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 518 states. [2023-02-15 22:01:34,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 518 to 408. [2023-02-15 22:01:34,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 362 states have (on average 1.2320441988950277) internal successors, (446), 393 states have internal predecessors, (446), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-15 22:01:34,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 462 transitions. [2023-02-15 22:01:34,738 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 462 transitions. Word has length 54 [2023-02-15 22:01:34,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:01:34,738 INFO L495 AbstractCegarLoop]: Abstraction has 408 states and 462 transitions. [2023-02-15 22:01:34,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.8181818181818183) internal successors, (42), 11 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:01:34,738 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 462 transitions. [2023-02-15 22:01:34,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-15 22:01:34,738 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:01:34,739 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:01:34,776 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 (42)] Forceful destruction successful, exit code 0 [2023-02-15 22:01:34,961 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /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-15 22:01:34,962 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:01:34,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:01:34,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1610777395, now seen corresponding path program 1 times [2023-02-15 22:01:34,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:01:34,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1534223775] [2023-02-15 22:01:34,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:01:34,963 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-15 22:01:34,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:01:34,964 INFO L229 MonitoredProcess]: Starting monitored process 43 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-15 22:01:34,971 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 (43)] Waiting until timeout for monitored process [2023-02-15 22:01:35,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:01:35,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 22:01:35,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:01:35,467 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-15 22:01:35,984 INFO L321 Elim1Store]: treesize reduction 123, result has 21.7 percent of original size [2023-02-15 22:01:35,984 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 56 [2023-02-15 22:01:36,033 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:01:36,033 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:01:40,170 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:01:40,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1534223775] [2023-02-15 22:01:40,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1534223775] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:01:40,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [50866373] [2023-02-15 22:01:40,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:01:40,171 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:01:40,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:01:40,172 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:01:40,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (44)] Waiting until timeout for monitored process [2023-02-15 22:01:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:01:41,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 22:01:41,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:01:41,035 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-15 22:01:41,078 WARN L859 $PredicateComparison]: unable to prove that (exists ((|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| c_create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (exists ((v_ArrVal_3823 (_ BitVec 1)) (v_ArrVal_3822 (_ BitVec 1))) (= |c_#valid| (store (store |c_old(#valid)| c_create_data_~data~0.base v_ArrVal_3822) |create_data_#t~malloc7.base| v_ArrVal_3823))))) is different from true [2023-02-15 22:01:41,194 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3823 (_ BitVec 1)) (v_ArrVal_3822 (_ BitVec 1)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| c_create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= |c_#valid| (store (store (store |c_old(#valid)| c_create_data_~data~0.base v_ArrVal_3822) |create_data_#t~malloc7.base| v_ArrVal_3823) c_create_data_~nextData~0.base (_ bv1 1))))) is different from true [2023-02-15 22:01:42,994 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 22:01:43,041 INFO L321 Elim1Store]: treesize reduction 91, result has 27.2 percent of original size [2023-02-15 22:01:43,042 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 29 treesize of output 53 [2023-02-15 22:01:43,055 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2023-02-15 22:01:43,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:01:45,314 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:01:45,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [50866373] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 22:01:45,314 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:01:45,314 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7, 7] total 14 [2023-02-15 22:01:45,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650166974] [2023-02-15 22:01:45,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:01:45,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:01:45,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:01:45,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:01:45,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=128, Unknown=4, NotChecked=50, Total=240 [2023-02-15 22:01:45,316 INFO L87 Difference]: Start difference. First operand 408 states and 462 transitions. Second operand has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:01:45,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:01:45,685 INFO L93 Difference]: Finished difference Result 428 states and 483 transitions. [2023-02-15 22:01:45,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 22:01:45,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2023-02-15 22:01:45,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:01:45,687 INFO L225 Difference]: With dead ends: 428 [2023-02-15 22:01:45,687 INFO L226 Difference]: Without dead ends: 428 [2023-02-15 22:01:45,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 147 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=58, Invalid=128, Unknown=4, NotChecked=50, Total=240 [2023-02-15 22:01:45,687 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 113 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:01:45,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 166 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:01:45,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2023-02-15 22:01:45,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 406. [2023-02-15 22:01:45,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 362 states have (on average 1.2265193370165746) internal successors, (444), 391 states have internal predecessors, (444), 4 states have call successors, (4), 4 states have call predecessors, (4), 10 states have return successors, (12), 10 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-15 22:01:45,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 460 transitions. [2023-02-15 22:01:45,692 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 460 transitions. Word has length 55 [2023-02-15 22:01:45,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:01:45,692 INFO L495 AbstractCegarLoop]: Abstraction has 406 states and 460 transitions. [2023-02-15 22:01:45,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.6) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:01:45,692 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 460 transitions. [2023-02-15 22:01:45,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-15 22:01:45,693 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:01:45,693 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:01:45,701 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (44)] Forceful destruction successful, exit code 0 [2023-02-15 22:01:45,914 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 (43)] Forceful destruction successful, exit code 0 [2023-02-15 22:01:46,101 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,43 /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-15 22:01:46,101 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:01:46,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:01:46,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1610777396, now seen corresponding path program 1 times [2023-02-15 22:01:46,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:01:46,102 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773078894] [2023-02-15 22:01:46,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:01:46,102 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-15 22:01:46,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:01:46,103 INFO L229 MonitoredProcess]: Starting monitored process 45 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-15 22:01:46,107 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 (45)] Waiting until timeout for monitored process [2023-02-15 22:01:46,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:01:46,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 22:01:46,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:01:46,741 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-15 22:01:46,747 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-15 22:01:46,827 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_4026 (_ BitVec 1))) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base v_ArrVal_4026) |c_create_data_#t~malloc7.base|))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (exists ((v_ArrVal_4024 (_ BitVec 32)) (v_ArrVal_4025 (_ BitVec 32))) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_4024) |c_create_data_#t~malloc7.base| v_ArrVal_4025))))) is different from true [2023-02-15 22:01:46,839 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4024 (_ BitVec 32)) (v_ArrVal_4025 (_ BitVec 32)) (v_ArrVal_4026 (_ BitVec 1)) (create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_4024) |create_data_#t~malloc7.base| v_ArrVal_4025)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base v_ArrVal_4026) |create_data_#t~malloc7.base|)))) is different from true [2023-02-15 22:01:47,112 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4024 (_ BitVec 32)) (v_ArrVal_4025 (_ BitVec 32)) (v_ArrVal_4026 (_ BitVec 1)) (create_data_~data~0.base (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_4024) |create_data_#t~malloc7.base| v_ArrVal_4025) create_data_~nextData~0.base (_ bv16 32))) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base v_ArrVal_4026) |create_data_#t~malloc7.base|)))) is different from true [2023-02-15 22:01:47,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:01:47,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:01:47,323 INFO L321 Elim1Store]: treesize reduction 43, result has 41.9 percent of original size [2023-02-15 22:01:47,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 39 [2023-02-15 22:01:47,373 INFO L321 Elim1Store]: treesize reduction 17, result has 45.2 percent of original size [2023-02-15 22:01:47,373 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 38 [2023-02-15 22:01:47,409 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2023-02-15 22:01:47,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:01:49,564 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_append_~node~0#1.offset| (_ bv4 32)))) (and (forall ((v_create_data_~data~0.base_84 (_ BitVec 32))) (or (forall ((v_ArrVal_4041 (_ BitVec 1)) (v_ArrVal_4039 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_create_data_~data~0.base_84 v_ArrVal_4041) v_ArrVal_4039))) (forall ((v_ArrVal_4038 (_ BitVec 32)) (v_ArrVal_4040 (_ BitVec 32)) (v_create_data_~nextData~0.base_29 (_ BitVec 32))) (bvule .cse0 (select (store (store (store |c_#length| v_create_data_~data~0.base_84 v_ArrVal_4040) v_ArrVal_4039 v_ArrVal_4038) v_create_data_~nextData~0.base_29 (_ bv16 32)) |c_ULTIMATE.start_append_~node~0#1.base|))))) (not (= (_ bv0 1) (select |c_#valid| v_create_data_~data~0.base_84))))) (or (forall ((v_ArrVal_4041 (_ BitVec 1)) (v_create_data_~data~0.base_84 (_ BitVec 32)) (v_ArrVal_4039 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_create_data_~data~0.base_84 v_ArrVal_4041) v_ArrVal_4039))) (not (= (_ bv0 1) (select |c_#valid| v_create_data_~data~0.base_84))))) (bvule |c_ULTIMATE.start_append_~node~0#1.offset| .cse0)))) is different from false [2023-02-15 22:01:49,570 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:01:49,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773078894] [2023-02-15 22:01:49,570 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1773078894] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:01:49,570 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [368217289] [2023-02-15 22:01:49,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:01:49,571 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:01:49,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:01:49,572 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:01:49,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (46)] Waiting until timeout for monitored process [2023-02-15 22:01:50,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:01:50,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 22:01:50,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:01:50,370 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-15 22:01:50,374 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-15 22:01:50,688 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_4226 (_ BitVec 32)) (v_ArrVal_4227 (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_4227) |create_data_#t~malloc7.base| v_ArrVal_4226) c_create_data_~nextData~0.base (_ bv16 32))))) is different from true [2023-02-15 22:01:50,766 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (v_ArrVal_4226 (_ BitVec 32)) (v_ArrVal_4227 (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_4227) |create_data_#t~malloc7.base| v_ArrVal_4226) create_data_~nextData~0.base (_ bv16 32))))) is different from true [2023-02-15 22:01:50,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:01:50,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:01:50,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:01:50,930 INFO L321 Elim1Store]: treesize reduction 30, result has 48.3 percent of original size [2023-02-15 22:01:50,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 36 [2023-02-15 22:01:50,966 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-02-15 22:01:50,967 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2023-02-15 22:01:50,982 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2023-02-15 22:01:50,982 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:01:51,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [368217289] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:01:51,225 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:01:51,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2023-02-15 22:01:51,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468323611] [2023-02-15 22:01:51,226 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:01:51,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 22:01:51,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:01:51,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 22:01:51,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=46, Unknown=6, NotChecked=102, Total=182 [2023-02-15 22:01:51,227 INFO L87 Difference]: Start difference. First operand 406 states and 460 transitions. Second operand has 11 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:01:53,432 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4024 (_ BitVec 32)) (v_ArrVal_4025 (_ BitVec 32)) (v_ArrVal_4026 (_ BitVec 1)) (create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_4024) |create_data_#t~malloc7.base| v_ArrVal_4025)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base v_ArrVal_4026) |create_data_#t~malloc7.base|)))) (exists ((create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (exists ((v_ArrVal_4226 (_ BitVec 32)) (v_ArrVal_4227 (_ BitVec 32))) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_4227) |create_data_#t~malloc7.base| v_ArrVal_4226)))))) is different from true [2023-02-15 22:01:53,452 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4024 (_ BitVec 32)) (v_ArrVal_4025 (_ BitVec 32)) (v_ArrVal_4026 (_ BitVec 1)) (create_data_~data~0.base (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_4024) |create_data_#t~malloc7.base| v_ArrVal_4025) create_data_~nextData~0.base (_ bv16 32))) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base v_ArrVal_4026) |create_data_#t~malloc7.base|)))) (exists ((create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_4226 (_ BitVec 32)) (v_ArrVal_4227 (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_4227) |create_data_#t~malloc7.base| v_ArrVal_4226) c_create_data_~nextData~0.base (_ bv16 32)))))) is different from true [2023-02-15 22:01:53,514 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_4024 (_ BitVec 32)) (v_ArrVal_4025 (_ BitVec 32)) (v_ArrVal_4026 (_ BitVec 1)) (create_data_~data~0.base (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_4024) |create_data_#t~malloc7.base| v_ArrVal_4025) create_data_~nextData~0.base (_ bv16 32))) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base v_ArrVal_4026) |create_data_#t~malloc7.base|)))) (exists ((create_data_~data~0.base (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (v_ArrVal_4226 (_ BitVec 32)) (v_ArrVal_4227 (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_4227) |create_data_#t~malloc7.base| v_ArrVal_4226) create_data_~nextData~0.base (_ bv16 32)))))) is different from true [2023-02-15 22:01:55,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:01:56,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:01:56,085 INFO L93 Difference]: Finished difference Result 565 states and 636 transitions. [2023-02-15 22:01:56,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:01:56,085 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 55 [2023-02-15 22:01:56,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:01:56,087 INFO L225 Difference]: With dead ends: 565 [2023-02-15 22:01:56,087 INFO L226 Difference]: Without dead ends: 565 [2023-02-15 22:01:56,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=37, Invalid=62, Unknown=9, NotChecked=198, Total=306 [2023-02-15 22:01:56,087 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 117 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 2 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 1649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 1218 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:01:56,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 527 Invalid, 1649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 410 Invalid, 19 Unknown, 1218 Unchecked, 2.7s Time] [2023-02-15 22:01:56,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2023-02-15 22:01:56,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 427. [2023-02-15 22:01:56,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 382 states have (on average 1.2225130890052356) internal successors, (467), 411 states have internal predecessors, (467), 4 states have call successors, (4), 4 states have call predecessors, (4), 11 states have return successors, (14), 11 states have call predecessors, (14), 4 states have call successors, (14) [2023-02-15 22:01:56,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 485 transitions. [2023-02-15 22:01:56,094 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 485 transitions. Word has length 55 [2023-02-15 22:01:56,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:01:56,094 INFO L495 AbstractCegarLoop]: Abstraction has 427 states and 485 transitions. [2023-02-15 22:01:56,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.5) internal successors, (75), 10 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:01:56,095 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 485 transitions. [2023-02-15 22:01:56,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 22:01:56,095 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:01:56,095 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:01:56,107 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 (45)] Forceful destruction successful, exit code 0 [2023-02-15 22:01:56,314 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (46)] Forceful destruction successful, exit code 0 [2023-02-15 22:01:56,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /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,46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-15 22:01:56,506 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:01:56,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:01:56,506 INFO L85 PathProgramCache]: Analyzing trace with hash 948367783, now seen corresponding path program 1 times [2023-02-15 22:01:56,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:01:56,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1919245158] [2023-02-15 22:01:56,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:01:56,507 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-15 22:01:56,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:01:56,508 INFO L229 MonitoredProcess]: Starting monitored process 47 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-15 22:01:56,510 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 (47)] Waiting until timeout for monitored process [2023-02-15 22:01:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:01:56,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 22:01:56,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:01:56,946 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-15 22:01:56,952 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-15 22:01:57,051 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-15 22:01:57,085 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 9 [2023-02-15 22:01:57,091 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4360 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_arrayElimCell_120 (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_4360) v_arrayElimCell_120 (_ bv80 32))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) is different from true [2023-02-15 22:01:57,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:01:57,318 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-15 22:01:57,319 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 2 case distinctions, treesize of input 15 treesize of output 27 [2023-02-15 22:01:57,330 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:01:57,330 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-15 22:01:57,361 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 5 not checked. [2023-02-15 22:01:57,361 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:01:59,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:01:59,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1919245158] [2023-02-15 22:01:59,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1919245158] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:01:59,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1545418393] [2023-02-15 22:01:59,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:01:59,553 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:01:59,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:01:59,554 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:01:59,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (48)] Waiting until timeout for monitored process [2023-02-15 22:02:00,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:02:00,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 22:02:00,209 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:02:00,214 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-15 22:02:00,219 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-15 22:02:00,276 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_4488 (_ BitVec 32))) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_4488) |c_create_data_#t~malloc7.base| (_ bv80 32)))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) is different from true [2023-02-15 22:02:00,287 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4488 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_4488) |create_data_#t~malloc7.base| (_ bv80 32))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) is different from true [2023-02-15 22:02:00,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:02:00,543 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-15 22:02:00,543 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 2 case distinctions, treesize of input 15 treesize of output 27 [2023-02-15 22:02:00,558 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:02:00,558 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-15 22:02:00,592 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2023-02-15 22:02:00,593 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:02:00,593 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1545418393] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:02:00,593 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:02:00,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2023-02-15 22:02:00,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697813472] [2023-02-15 22:02:00,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:02:00,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 22:02:00,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:02:00,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 22:02:00,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=56, Unknown=4, NotChecked=48, Total=132 [2023-02-15 22:02:00,595 INFO L87 Difference]: Start difference. First operand 427 states and 485 transitions. Second operand has 7 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:02:01,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:02:01,287 INFO L93 Difference]: Finished difference Result 530 states and 594 transitions. [2023-02-15 22:02:01,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:02:01,288 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2023-02-15 22:02:01,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:02:01,289 INFO L225 Difference]: With dead ends: 530 [2023-02-15 22:02:01,290 INFO L226 Difference]: Without dead ends: 530 [2023-02-15 22:02:01,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=24, Invalid=56, Unknown=4, NotChecked=48, Total=132 [2023-02-15 22:02:01,290 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 114 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 426 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:02:01,290 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 270 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 284 Invalid, 0 Unknown, 426 Unchecked, 0.7s Time] [2023-02-15 22:02:01,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2023-02-15 22:02:01,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 407. [2023-02-15 22:02:01,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 364 states have (on average 1.217032967032967) internal successors, (443), 393 states have internal predecessors, (443), 4 states have call successors, (4), 4 states have call predecessors, (4), 9 states have return successors, (12), 9 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-15 22:02:01,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 459 transitions. [2023-02-15 22:02:01,295 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 459 transitions. Word has length 56 [2023-02-15 22:02:01,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:02:01,295 INFO L495 AbstractCegarLoop]: Abstraction has 407 states and 459 transitions. [2023-02-15 22:02:01,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.0) internal successors, (42), 6 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:02:01,296 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 459 transitions. [2023-02-15 22:02:01,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-15 22:02:01,296 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:02:01,296 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:02:01,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (48)] Forceful destruction successful, exit code 0 [2023-02-15 22:02:01,515 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 (47)] Forceful destruction successful, exit code 0 [2023-02-15 22:02:01,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,47 /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-15 22:02:01,706 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:02:01,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:02:01,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1897094198, now seen corresponding path program 1 times [2023-02-15 22:02:01,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:02:01,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [551059191] [2023-02-15 22:02:01,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:02:01,707 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-15 22:02:01,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:02:01,708 INFO L229 MonitoredProcess]: Starting monitored process 49 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-15 22:02:01,710 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 (49)] Waiting until timeout for monitored process [2023-02-15 22:02:02,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:02:02,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 22:02:02,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:02:02,106 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 11 treesize of output 7 [2023-02-15 22:02:02,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 16 treesize of output 8 [2023-02-15 22:02:02,135 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:02:02,135 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:02:02,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:02:02,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [551059191] [2023-02-15 22:02:02,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [551059191] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:02:02,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:02:02,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:02:02,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004120962] [2023-02-15 22:02:02,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:02:02,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 22:02:02,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:02:02,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 22:02:02,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 22:02:02,136 INFO L87 Difference]: Start difference. First operand 407 states and 459 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:02:02,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:02:02,535 INFO L93 Difference]: Finished difference Result 445 states and 497 transitions. [2023-02-15 22:02:02,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 22:02:02,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2023-02-15 22:02:02,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:02:02,537 INFO L225 Difference]: With dead ends: 445 [2023-02-15 22:02:02,537 INFO L226 Difference]: Without dead ends: 445 [2023-02-15 22:02:02,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 22:02:02,537 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 151 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:02:02,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 353 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:02:02,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2023-02-15 22:02:02,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 409. [2023-02-15 22:02:02,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 366 states have (on average 1.215846994535519) internal successors, (445), 395 states have internal predecessors, (445), 4 states have call successors, (4), 4 states have call predecessors, (4), 9 states have return successors, (12), 9 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-15 22:02:02,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 461 transitions. [2023-02-15 22:02:02,542 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 461 transitions. Word has length 57 [2023-02-15 22:02:02,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:02:02,542 INFO L495 AbstractCegarLoop]: Abstraction has 409 states and 461 transitions. [2023-02-15 22:02:02,542 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:02:02,542 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 461 transitions. [2023-02-15 22:02:02,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-15 22:02:02,542 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:02:02,543 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:02:02,561 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 (49)] Ended with exit code 0 [2023-02-15 22:02:02,753 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /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-15 22:02:02,753 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:02:02,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:02:02,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1897093746, now seen corresponding path program 1 times [2023-02-15 22:02:02,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:02:02,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974359758] [2023-02-15 22:02:02,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:02:02,754 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-15 22:02:02,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:02:02,755 INFO L229 MonitoredProcess]: Starting monitored process 50 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-15 22:02:02,758 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 (50)] Waiting until timeout for monitored process [2023-02-15 22:02:03,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:02:03,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 22:02:03,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:02:03,161 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 11 treesize of output 7 [2023-02-15 22:02:03,187 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 11 [2023-02-15 22:02:03,196 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:02:03,196 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:02:03,197 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:02:03,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974359758] [2023-02-15 22:02:03,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974359758] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:02:03,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:02:03,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:02:03,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922914941] [2023-02-15 22:02:03,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:02:03,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:02:03,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:02:03,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:02:03,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:02:03,198 INFO L87 Difference]: Start difference. First operand 409 states and 461 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:02:03,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:02:03,673 INFO L93 Difference]: Finished difference Result 427 states and 479 transitions. [2023-02-15 22:02:03,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:02:03,674 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2023-02-15 22:02:03,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:02:03,675 INFO L225 Difference]: With dead ends: 427 [2023-02-15 22:02:03,675 INFO L226 Difference]: Without dead ends: 427 [2023-02-15 22:02:03,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:02:03,675 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 162 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:02:03,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 308 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 22:02:03,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2023-02-15 22:02:03,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 411. [2023-02-15 22:02:03,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 368 states have (on average 1.2173913043478262) internal successors, (448), 397 states have internal predecessors, (448), 4 states have call successors, (4), 4 states have call predecessors, (4), 9 states have return successors, (12), 9 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-15 22:02:03,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 464 transitions. [2023-02-15 22:02:03,681 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 464 transitions. Word has length 57 [2023-02-15 22:02:03,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:02:03,681 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 464 transitions. [2023-02-15 22:02:03,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:02:03,681 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 464 transitions. [2023-02-15 22:02:03,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-15 22:02:03,682 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:02:03,682 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:02:03,694 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 (50)] Forceful destruction successful, exit code 0 [2023-02-15 22:02:03,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /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-15 22:02:03,891 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:02:03,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:02:03,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1897093745, now seen corresponding path program 1 times [2023-02-15 22:02:03,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:02:03,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776957735] [2023-02-15 22:02:03,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:02:03,891 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-15 22:02:03,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:02:03,893 INFO L229 MonitoredProcess]: Starting monitored process 51 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-15 22:02:03,895 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 (51)] Waiting until timeout for monitored process [2023-02-15 22:02:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:02:04,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 22:02:04,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:02:04,352 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-15 22:02:04,360 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-15 22:02:04,502 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-15 22:02:04,540 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 9 [2023-02-15 22:02:04,548 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4840 (_ BitVec 32)) (v_arrayElimCell_129 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_4840) v_arrayElimCell_129 (_ bv80 32))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) is different from true [2023-02-15 22:02:04,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:02:04,738 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-15 22:02:04,738 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 2 case distinctions, treesize of input 15 treesize of output 27 [2023-02-15 22:02:04,754 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:02:04,755 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-15 22:02:04,836 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 11 treesize of output 7 [2023-02-15 22:02:04,847 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 11 treesize of output 7 [2023-02-15 22:02:04,992 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-15 22:02:04,994 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 21 [2023-02-15 22:02:05,034 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 5 not checked. [2023-02-15 22:02:05,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:02:05,215 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 60 treesize of output 56 [2023-02-15 22:02:05,217 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 90 treesize of output 82 [2023-02-15 22:02:05,375 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 40 treesize of output 32 [2023-02-15 22:02:06,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:02:06,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1776957735] [2023-02-15 22:02:06,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1776957735] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:02:06,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1218189656] [2023-02-15 22:02:06,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:02:06,024 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:02:06,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:02:06,025 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:02:06,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (52)] Waiting until timeout for monitored process [2023-02-15 22:02:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:02:06,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 22:02:06,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:02:07,151 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 11 treesize of output 7 [2023-02-15 22:02:07,260 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 11 treesize of output 7 [2023-02-15 22:02:07,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:02:07,271 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 20 treesize of output 19 [2023-02-15 22:02:07,405 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-15 22:02:07,504 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 22:02:07,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 14 [2023-02-15 22:02:07,592 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:02:07,592 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:02:07,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1218189656] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:02:07,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:02:07,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 20 [2023-02-15 22:02:07,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698506419] [2023-02-15 22:02:07,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:02:07,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 22:02:07,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:02:07,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 22:02:07,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=457, Unknown=1, NotChecked=42, Total=552 [2023-02-15 22:02:07,593 INFO L87 Difference]: Start difference. First operand 411 states and 464 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:02:10,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:02:10,488 INFO L93 Difference]: Finished difference Result 536 states and 605 transitions. [2023-02-15 22:02:10,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 22:02:10,489 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2023-02-15 22:02:10,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:02:10,491 INFO L225 Difference]: With dead ends: 536 [2023-02-15 22:02:10,491 INFO L226 Difference]: Without dead ends: 536 [2023-02-15 22:02:10,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=142, Invalid=983, Unknown=1, NotChecked=64, Total=1190 [2023-02-15 22:02:10,491 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 447 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-15 22:02:10,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 784 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-02-15 22:02:10,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2023-02-15 22:02:10,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 411. [2023-02-15 22:02:10,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 368 states have (on average 1.2119565217391304) internal successors, (446), 397 states have internal predecessors, (446), 4 states have call successors, (4), 4 states have call predecessors, (4), 9 states have return successors, (12), 9 states have call predecessors, (12), 4 states have call successors, (12) [2023-02-15 22:02:10,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 462 transitions. [2023-02-15 22:02:10,497 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 462 transitions. Word has length 57 [2023-02-15 22:02:10,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:02:10,497 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 462 transitions. [2023-02-15 22:02:10,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 11 states have internal predecessors, (45), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:02:10,497 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 462 transitions. [2023-02-15 22:02:10,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-15 22:02:10,498 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:02:10,498 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:02:10,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (52)] Ended with exit code 0 [2023-02-15 22:02:10,715 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 (51)] Ended with exit code 0 [2023-02-15 22:02:10,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,51 /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-15 22:02:10,912 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:02:10,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:02:10,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1768854146, now seen corresponding path program 1 times [2023-02-15 22:02:10,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:02:10,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1443207266] [2023-02-15 22:02:10,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:02:10,913 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-15 22:02:10,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:02:10,914 INFO L229 MonitoredProcess]: Starting monitored process 53 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-15 22:02:10,916 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 (53)] Waiting until timeout for monitored process [2023-02-15 22:02:11,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:02:11,500 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 22:02:11,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:02:11,512 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-15 22:02:11,549 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 7 treesize of output 5 [2023-02-15 22:02:12,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:02:12,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:02:12,212 INFO L321 Elim1Store]: treesize reduction 64, result has 34.7 percent of original size [2023-02-15 22:02:12,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 25 treesize of output 49 [2023-02-15 22:02:12,281 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:02:12,281 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:02:14,414 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:02:14,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1443207266] [2023-02-15 22:02:14,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1443207266] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:02:14,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1919009654] [2023-02-15 22:02:14,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:02:14,415 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:02:14,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:02:14,416 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:02:14,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (54)] Waiting until timeout for monitored process [2023-02-15 22:02:15,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:02:15,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 22:02:15,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:02:15,336 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 7 treesize of output 5 [2023-02-15 22:02:16,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:02:16,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:02:16,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:02:16,084 INFO L321 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2023-02-15 22:02:16,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 45 [2023-02-15 22:02:16,155 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:02:16,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:02:16,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1919009654] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:02:16,330 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:02:16,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2023-02-15 22:02:16,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860027899] [2023-02-15 22:02:16,330 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:02:16,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 22:02:16,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:02:16,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 22:02:16,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=173, Unknown=1, NotChecked=0, Total=210 [2023-02-15 22:02:16,331 INFO L87 Difference]: Start difference. First operand 411 states and 462 transitions. Second operand has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 12 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:02:22,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:02:24,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:02:24,774 INFO L93 Difference]: Finished difference Result 514 states and 574 transitions. [2023-02-15 22:02:24,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 22:02:24,775 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 12 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2023-02-15 22:02:24,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:02:24,776 INFO L225 Difference]: With dead ends: 514 [2023-02-15 22:02:24,776 INFO L226 Difference]: Without dead ends: 514 [2023-02-15 22:02:24,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=84, Invalid=335, Unknown=1, NotChecked=0, Total=420 [2023-02-15 22:02:24,777 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 427 mSDsluCounter, 371 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 23 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2023-02-15 22:02:24,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 444 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 536 Invalid, 19 Unknown, 0 Unchecked, 6.3s Time] [2023-02-15 22:02:24,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2023-02-15 22:02:24,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 441. [2023-02-15 22:02:24,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 396 states have (on average 1.2045454545454546) internal successors, (477), 426 states have internal predecessors, (477), 4 states have call successors, (4), 4 states have call predecessors, (4), 11 states have return successors, (16), 10 states have call predecessors, (16), 4 states have call successors, (16) [2023-02-15 22:02:24,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 497 transitions. [2023-02-15 22:02:24,781 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 497 transitions. Word has length 57 [2023-02-15 22:02:24,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:02:24,781 INFO L495 AbstractCegarLoop]: Abstraction has 441 states and 497 transitions. [2023-02-15 22:02:24,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 12 states have internal predecessors, (80), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:02:24,782 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 497 transitions. [2023-02-15 22:02:24,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-15 22:02:24,782 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:02:24,782 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:02:24,800 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 (53)] Ended with exit code 0 [2023-02-15 22:02:25,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (54)] Forceful destruction successful, exit code 0 [2023-02-15 22:02:25,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /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,54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-15 22:02:25,201 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:02:25,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:02:25,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1768854147, now seen corresponding path program 1 times [2023-02-15 22:02:25,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:02:25,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [140307322] [2023-02-15 22:02:25,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:02:25,202 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-15 22:02:25,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:02:25,203 INFO L229 MonitoredProcess]: Starting monitored process 55 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-15 22:02:25,205 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 (55)] Waiting until timeout for monitored process [2023-02-15 22:02:25,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:02:25,809 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-15 22:02:25,811 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:02:25,831 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-15 22:02:25,924 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 5 treesize of output 3 [2023-02-15 22:02:25,929 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 7 treesize of output 5 [2023-02-15 22:02:26,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:02:26,897 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:02:26,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:02:26,950 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2023-02-15 22:02:26,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 37 [2023-02-15 22:02:26,972 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:02:26,972 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-15 22:02:27,104 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:02:27,105 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:02:27,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:02:27,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [140307322] [2023-02-15 22:02:27,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [140307322] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:02:27,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1752483223] [2023-02-15 22:02:27,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:02:27,451 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:02:27,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:02:27,454 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:02:27,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (56)] Waiting until timeout for monitored process [2023-02-15 22:02:28,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:02:28,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 22:02:28,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:02:28,480 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-15 22:02:28,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:02:28,523 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-15 22:02:28,680 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 13 treesize of output 9 [2023-02-15 22:02:34,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:02:34,073 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:02:34,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:02:34,153 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2023-02-15 22:02:34,153 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 40 [2023-02-15 22:02:34,301 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:02:34,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:02:36,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1752483223] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:02:36,977 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:02:36,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-02-15 22:02:36,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232411309] [2023-02-15 22:02:36,978 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:02:36,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 22:02:36,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:02:36,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 22:02:36,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=285, Unknown=9, NotChecked=0, Total=342 [2023-02-15 22:02:36,979 INFO L87 Difference]: Start difference. First operand 441 states and 497 transitions. Second operand has 16 states, 15 states have (on average 5.933333333333334) internal successors, (89), 16 states have internal predecessors, (89), 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-15 22:02:41,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:02:43,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:02:49,693 WARN L233 SmtUtils]: Spent 6.14s on a formula simplification that was a NOOP. DAG size: 43 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:02:55,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:02:57,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:02:59,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:03:01,939 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:03:04,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:03:06,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:03:09,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:03:10,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:03:12,528 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:03:14,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:03:16,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:03:18,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:03:21,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:03:26,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:03:28,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:03:30,363 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:03:32,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:03:34,639 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:03:36,699 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:03:43,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:03:43,016 INFO L93 Difference]: Finished difference Result 750 states and 821 transitions. [2023-02-15 22:03:43,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 22:03:43,017 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 5.933333333333334) internal successors, (89), 16 states have internal predecessors, (89), 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) Word has length 57 [2023-02-15 22:03:43,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:03:43,019 INFO L225 Difference]: With dead ends: 750 [2023-02-15 22:03:43,019 INFO L226 Difference]: Without dead ends: 750 [2023-02-15 22:03:43,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=196, Invalid=895, Unknown=31, NotChecked=0, Total=1122 [2023-02-15 22:03:43,019 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 1249 mSDsluCounter, 663 mSDsCounter, 0 mSdLazyCounter, 1053 mSolverCounterSat, 66 mSolverCounterUnsat, 439 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 51.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1249 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 1558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1053 IncrementalHoareTripleChecker+Invalid, 439 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 52.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:03:43,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1249 Valid, 727 Invalid, 1558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1053 Invalid, 439 Unknown, 0 Unchecked, 52.2s Time] [2023-02-15 22:03:43,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2023-02-15 22:03:43,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 289. [2023-02-15 22:03:43,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 250 states have (on average 1.216) internal successors, (304), 279 states have internal predecessors, (304), 2 states have call successors, (2), 2 states have call predecessors, (2), 7 states have return successors, (7), 7 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-15 22:03:43,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 313 transitions. [2023-02-15 22:03:43,024 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 313 transitions. Word has length 57 [2023-02-15 22:03:43,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:03:43,024 INFO L495 AbstractCegarLoop]: Abstraction has 289 states and 313 transitions. [2023-02-15 22:03:43,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 5.933333333333334) internal successors, (89), 16 states have internal predecessors, (89), 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-15 22:03:43,037 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 313 transitions. [2023-02-15 22:03:43,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-02-15 22:03:43,038 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:03:43,038 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:03:43,066 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 (55)] Forceful destruction successful, exit code 0 [2023-02-15 22:03:43,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (56)] Forceful destruction successful, exit code 0 [2023-02-15 22:03:43,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 55 /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,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-15 22:03:43,439 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:03:43,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:03:43,439 INFO L85 PathProgramCache]: Analyzing trace with hash -2094859878, now seen corresponding path program 1 times [2023-02-15 22:03:43,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:03:43,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1291396398] [2023-02-15 22:03:43,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:03:43,439 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-15 22:03:43,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:03:43,441 INFO L229 MonitoredProcess]: Starting monitored process 57 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-15 22:03:43,442 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 (57)] Waiting until timeout for monitored process [2023-02-15 22:03:44,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:03:44,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-15 22:03:44,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:03:44,131 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-15 22:03:44,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-15 22:03:44,301 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5959 (_ BitVec 32)) (v_ArrVal_5958 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5959) |create_data_#t~malloc7.base| v_ArrVal_5958)))) is different from true [2023-02-15 22:03:44,736 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5959 (_ BitVec 32)) (v_ArrVal_5958 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5959) |create_data_#t~malloc7.base| v_ArrVal_5958) create_data_~nextData~0.base (_ bv16 32))) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) is different from true [2023-02-15 22:03:44,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:03:44,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:03:44,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:03:44,974 INFO L321 Elim1Store]: treesize reduction 30, result has 48.3 percent of original size [2023-02-15 22:03:44,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 36 [2023-02-15 22:03:45,013 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-02-15 22:03:45,013 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2023-02-15 22:03:45,051 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2023-02-15 22:03:45,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:03:45,350 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:03:45,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1291396398] [2023-02-15 22:03:45,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1291396398] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:03:45,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [718485710] [2023-02-15 22:03:45,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:03:45,351 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:03:45,351 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:03:45,352 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:03:45,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (58)] Waiting until timeout for monitored process [2023-02-15 22:03:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:03:46,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 431 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 22:03:46,257 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:03:46,262 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-15 22:03:46,271 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-15 22:03:46,721 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6162 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_6161 (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_6162) |create_data_#t~malloc7.base| v_ArrVal_6161) create_data_~nextData~0.base (_ bv16 32))) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) is different from true [2023-02-15 22:03:46,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:03:46,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:03:46,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:03:46,974 INFO L321 Elim1Store]: treesize reduction 30, result has 48.3 percent of original size [2023-02-15 22:03:46,974 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 18 treesize of output 36 [2023-02-15 22:03:47,014 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-02-15 22:03:47,015 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2023-02-15 22:03:47,034 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2023-02-15 22:03:47,035 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:03:50,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [718485710] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:03:50,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:03:50,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2023-02-15 22:03:50,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116591686] [2023-02-15 22:03:50,956 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:03:50,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:03:50,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:03:50,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:03:50,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=69, Unknown=4, NotChecked=54, Total=156 [2023-02-15 22:03:50,957 INFO L87 Difference]: Start difference. First operand 289 states and 313 transitions. Second operand has 10 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:03:51,064 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5959 (_ BitVec 32)) (v_ArrVal_5958 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5959) |create_data_#t~malloc7.base| v_ArrVal_5958)))) (exists ((create_data_~data~0.base (_ BitVec 32))) (and (exists ((v_ArrVal_5959 (_ BitVec 32)) (v_ArrVal_5958 (_ BitVec 32))) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5959) |c_create_data_#t~malloc7.base| v_ArrVal_5958))) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |c_create_data_#t~malloc7.base|)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base))))) is different from true [2023-02-15 22:03:51,071 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (exists ((v_ArrVal_6162 (_ BitVec 32)) (v_ArrVal_6161 (_ BitVec 32))) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_6162) |create_data_#t~malloc7.base| v_ArrVal_6161))))) (exists ((v_ArrVal_5959 (_ BitVec 32)) (v_ArrVal_5958 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5959) |create_data_#t~malloc7.base| v_ArrVal_5958))))) is different from true [2023-02-15 22:03:51,267 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_6162 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_6161 (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_6162) |create_data_#t~malloc7.base| v_ArrVal_6161) create_data_~nextData~0.base (_ bv16 32))) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) (exists ((v_ArrVal_5959 (_ BitVec 32)) (v_ArrVal_5958 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5959) |create_data_#t~malloc7.base| v_ArrVal_5958) create_data_~nextData~0.base (_ bv16 32))) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base))))) is different from true [2023-02-15 22:03:53,935 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 22:03:54,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:03:54,421 INFO L93 Difference]: Finished difference Result 427 states and 462 transitions. [2023-02-15 22:03:54,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:03:54,422 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 59 [2023-02-15 22:03:54,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:03:54,423 INFO L225 Difference]: With dead ends: 427 [2023-02-15 22:03:54,423 INFO L226 Difference]: Without dead ends: 427 [2023-02-15 22:03:54,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=35, Invalid=72, Unknown=7, NotChecked=126, Total=240 [2023-02-15 22:03:54,424 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 113 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 2 mSolverCounterUnsat, 59 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 675 SdHoareTripleChecker+Invalid, 1418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 59 IncrementalHoareTripleChecker+Unknown, 852 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-02-15 22:03:54,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 675 Invalid, 1418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 505 Invalid, 59 Unknown, 852 Unchecked, 3.4s Time] [2023-02-15 22:03:54,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2023-02-15 22:03:54,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 292. [2023-02-15 22:03:54,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 253 states have (on average 1.2173913043478262) internal successors, (308), 282 states have internal predecessors, (308), 2 states have call successors, (2), 2 states have call predecessors, (2), 7 states have return successors, (7), 7 states have call predecessors, (7), 2 states have call successors, (7) [2023-02-15 22:03:54,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 317 transitions. [2023-02-15 22:03:54,427 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 317 transitions. Word has length 59 [2023-02-15 22:03:54,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:03:54,427 INFO L495 AbstractCegarLoop]: Abstraction has 292 states and 317 transitions. [2023-02-15 22:03:54,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 9.222222222222221) internal successors, (83), 9 states have internal predecessors, (83), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:03:54,427 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 317 transitions. [2023-02-15 22:03:54,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-15 22:03:54,427 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:03:54,427 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:03:54,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (58)] Ended with exit code 0 [2023-02-15 22:03:54,644 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 (57)] Ended with exit code 0 [2023-02-15 22:03:54,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,57 /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-15 22:03:54,832 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:03:54,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:03:54,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1611932791, now seen corresponding path program 1 times [2023-02-15 22:03:54,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:03:54,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2094360565] [2023-02-15 22:03:54,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:03:54,833 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-15 22:03:54,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:03:54,835 INFO L229 MonitoredProcess]: Starting monitored process 59 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-15 22:03:54,836 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 (59)] Waiting until timeout for monitored process [2023-02-15 22:03:55,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:03:55,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 22:03:55,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:03:55,367 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-15 22:03:55,380 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-15 22:03:55,528 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-15 22:03:55,573 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 9 [2023-02-15 22:03:55,582 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6289 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_arrayElimCell_163 (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_6289) v_arrayElimCell_163 (_ bv80 32))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) is different from true [2023-02-15 22:03:55,771 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:03:55,810 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-15 22:03:55,810 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 2 case distinctions, treesize of input 15 treesize of output 27 [2023-02-15 22:03:55,830 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:03:55,830 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-15 22:03:55,932 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 11 treesize of output 7 [2023-02-15 22:03:55,944 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 11 treesize of output 7 [2023-02-15 22:03:56,171 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-15 22:03:56,175 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 21 [2023-02-15 22:03:56,251 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 5 not checked. [2023-02-15 22:03:56,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:03:56,522 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 60 treesize of output 56 [2023-02-15 22:03:56,525 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 90 treesize of output 82 [2023-02-15 22:03:56,700 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 40 treesize of output 32 [2023-02-15 22:04:07,352 WARN L233 SmtUtils]: Spent 10.23s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:04:07,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:04:07,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2094360565] [2023-02-15 22:04:07,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2094360565] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:04:07,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [109169836] [2023-02-15 22:04:07,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:04:07,353 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:04:07,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:04:07,354 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:04:07,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (60)] Waiting until timeout for monitored process [2023-02-15 22:04:08,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:04:08,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 22:04:08,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:04:08,447 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-15 22:04:08,475 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-15 22:04:08,722 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (exists ((v_ArrVal_6421 (_ BitVec 32))) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_6421) |create_data_#t~malloc7.base| (_ bv80 32)))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) is different from true [2023-02-15 22:04:08,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:04:09,015 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-15 22:04:09,016 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 2 case distinctions, treesize of input 15 treesize of output 27 [2023-02-15 22:04:09,032 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:04:09,033 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-15 22:04:09,187 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 11 treesize of output 7 [2023-02-15 22:04:09,195 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 11 treesize of output 7 [2023-02-15 22:04:09,684 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-15 22:04:09,688 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 21 [2023-02-15 22:04:09,722 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:04:09,723 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:04:09,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [109169836] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:04:09,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:04:09,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 15 [2023-02-15 22:04:09,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192083669] [2023-02-15 22:04:09,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:04:09,723 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:04:09,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:04:09,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:04:09,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=256, Unknown=2, NotChecked=66, Total=380 [2023-02-15 22:04:09,724 INFO L87 Difference]: Start difference. First operand 292 states and 317 transitions. Second operand has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:04:11,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:04:11,628 INFO L93 Difference]: Finished difference Result 484 states and 526 transitions. [2023-02-15 22:04:11,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:04:11,629 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 61 [2023-02-15 22:04:11,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:04:11,630 INFO L225 Difference]: With dead ends: 484 [2023-02-15 22:04:11,630 INFO L226 Difference]: Without dead ends: 484 [2023-02-15 22:04:11,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=88, Invalid=338, Unknown=2, NotChecked=78, Total=506 [2023-02-15 22:04:11,631 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 265 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 292 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:04:11,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 552 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 503 Invalid, 0 Unknown, 292 Unchecked, 1.5s Time] [2023-02-15 22:04:11,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2023-02-15 22:04:11,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 340. [2023-02-15 22:04:11,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 298 states have (on average 1.2147651006711409) internal successors, (362), 328 states have internal predecessors, (362), 4 states have call successors, (4), 2 states have call predecessors, (4), 8 states have return successors, (16), 9 states have call predecessors, (16), 4 states have call successors, (16) [2023-02-15 22:04:11,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 382 transitions. [2023-02-15 22:04:11,635 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 382 transitions. Word has length 61 [2023-02-15 22:04:11,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:04:11,635 INFO L495 AbstractCegarLoop]: Abstraction has 340 states and 382 transitions. [2023-02-15 22:04:11,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 10 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:04:11,635 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 382 transitions. [2023-02-15 22:04:11,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-15 22:04:11,636 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:04:11,636 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:04:11,652 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 (59)] Forceful destruction successful, exit code 0 [2023-02-15 22:04:11,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (60)] Forceful destruction successful, exit code 0 [2023-02-15 22:04:12,060 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /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,60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-15 22:04:12,060 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:04:12,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:04:12,061 INFO L85 PathProgramCache]: Analyzing trace with hash 939726753, now seen corresponding path program 1 times [2023-02-15 22:04:12,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:04:12,061 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1752546716] [2023-02-15 22:04:12,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:04:12,061 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-15 22:04:12,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:04:12,062 INFO L229 MonitoredProcess]: Starting monitored process 61 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-15 22:04:12,065 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 (61)] Waiting until timeout for monitored process [2023-02-15 22:04:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:04:12,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 22:04:12,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:04:12,622 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 11 treesize of output 7 [2023-02-15 22:04:12,708 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 11 [2023-02-15 22:04:12,725 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:04:12,725 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:04:12,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:04:12,725 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1752546716] [2023-02-15 22:04:12,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1752546716] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:04:12,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:04:12,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:04:12,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691826505] [2023-02-15 22:04:12,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:04:12,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:04:12,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:04:12,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:04:12,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:04:12,726 INFO L87 Difference]: Start difference. First operand 340 states and 382 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:04:13,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:04:13,304 INFO L93 Difference]: Finished difference Result 355 states and 396 transitions. [2023-02-15 22:04:13,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 22:04:13,304 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2023-02-15 22:04:13,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:04:13,305 INFO L225 Difference]: With dead ends: 355 [2023-02-15 22:04:13,305 INFO L226 Difference]: Without dead ends: 355 [2023-02-15 22:04:13,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2023-02-15 22:04:13,306 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 170 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 22:04:13,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 303 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 22:04:13,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2023-02-15 22:04:13,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 343. [2023-02-15 22:04:13,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 301 states have (on average 1.2159468438538206) internal successors, (366), 331 states have internal predecessors, (366), 4 states have call successors, (4), 2 states have call predecessors, (4), 8 states have return successors, (16), 9 states have call predecessors, (16), 4 states have call successors, (16) [2023-02-15 22:04:13,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 386 transitions. [2023-02-15 22:04:13,309 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 386 transitions. Word has length 64 [2023-02-15 22:04:13,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:04:13,309 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 386 transitions. [2023-02-15 22:04:13,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:04:13,310 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 386 transitions. [2023-02-15 22:04:13,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-15 22:04:13,310 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:04:13,310 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:04:13,338 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 (61)] Forceful destruction successful, exit code 0 [2023-02-15 22:04:13,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 61 /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-15 22:04:13,511 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:04:13,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:04:13,511 INFO L85 PathProgramCache]: Analyzing trace with hash 939726754, now seen corresponding path program 1 times [2023-02-15 22:04:13,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:04:13,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1418819400] [2023-02-15 22:04:13,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:04:13,512 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-15 22:04:13,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:04:13,517 INFO L229 MonitoredProcess]: Starting monitored process 62 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-15 22:04:13,519 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 (62)] Waiting until timeout for monitored process [2023-02-15 22:04:13,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:04:13,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 22:04:13,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:04:14,075 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 11 treesize of output 7 [2023-02-15 22:04:14,082 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 11 treesize of output 7 [2023-02-15 22:04:14,224 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 17 treesize of output 9 [2023-02-15 22:04:14,227 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-15 22:04:14,255 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:04:14,255 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:04:14,255 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:04:14,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1418819400] [2023-02-15 22:04:14,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1418819400] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:04:14,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 22:04:14,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 22:04:14,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982739711] [2023-02-15 22:04:14,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:04:14,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 22:04:14,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:04:14,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 22:04:14,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 22:04:14,256 INFO L87 Difference]: Start difference. First operand 343 states and 386 transitions. Second operand has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:04:15,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:04:15,019 INFO L93 Difference]: Finished difference Result 371 states and 412 transitions. [2023-02-15 22:04:15,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 22:04:15,020 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2023-02-15 22:04:15,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:04:15,021 INFO L225 Difference]: With dead ends: 371 [2023-02-15 22:04:15,021 INFO L226 Difference]: Without dead ends: 371 [2023-02-15 22:04:15,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 22:04:15,022 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 156 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 22:04:15,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 327 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 22:04:15,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2023-02-15 22:04:15,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 343. [2023-02-15 22:04:15,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 343 states, 301 states have (on average 1.212624584717608) internal successors, (365), 331 states have internal predecessors, (365), 4 states have call successors, (4), 2 states have call predecessors, (4), 8 states have return successors, (16), 9 states have call predecessors, (16), 4 states have call successors, (16) [2023-02-15 22:04:15,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 385 transitions. [2023-02-15 22:04:15,026 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 385 transitions. Word has length 64 [2023-02-15 22:04:15,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:04:15,027 INFO L495 AbstractCegarLoop]: Abstraction has 343 states and 385 transitions. [2023-02-15 22:04:15,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 10.4) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:04:15,027 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 385 transitions. [2023-02-15 22:04:15,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-15 22:04:15,027 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:04:15,027 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:04:15,039 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 (62)] Ended with exit code 0 [2023-02-15 22:04:15,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 62 /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-15 22:04:15,228 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:04:15,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:04:15,228 INFO L85 PathProgramCache]: Analyzing trace with hash 504851823, now seen corresponding path program 1 times [2023-02-15 22:04:15,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:04:15,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832694191] [2023-02-15 22:04:15,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:04:15,229 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-15 22:04:15,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:04:15,230 INFO L229 MonitoredProcess]: Starting monitored process 63 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-15 22:04:15,232 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 (63)] Waiting until timeout for monitored process [2023-02-15 22:04:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:04:15,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 22:04:15,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:04:15,781 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-15 22:04:15,795 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-15 22:04:15,959 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-15 22:04:16,014 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 9 [2023-02-15 22:04:16,026 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_6777 (_ BitVec 32)) (v_arrayElimCell_180 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_6777) v_arrayElimCell_180 (_ bv80 32))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) is different from true [2023-02-15 22:04:16,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:04:16,342 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-15 22:04:16,342 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 2 case distinctions, treesize of input 15 treesize of output 27 [2023-02-15 22:04:16,363 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:04:16,363 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-15 22:04:16,487 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 11 treesize of output 7 [2023-02-15 22:04:16,503 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 11 treesize of output 7 [2023-02-15 22:04:16,793 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-15 22:04:16,817 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 21 [2023-02-15 22:04:16,882 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 5 not checked. [2023-02-15 22:04:16,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:04:17,184 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 60 treesize of output 56 [2023-02-15 22:04:17,189 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 90 treesize of output 82 [2023-02-15 22:04:17,415 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 40 treesize of output 32 [2023-02-15 22:04:26,081 WARN L233 SmtUtils]: Spent 8.20s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 22:04:26,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:04:26,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832694191] [2023-02-15 22:04:26,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832694191] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 22:04:26,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [180196892] [2023-02-15 22:04:26,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:04:26,083 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 22:04:26,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 22:04:26,084 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 22:04:26,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (64)] Waiting until timeout for monitored process [2023-02-15 22:04:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:04:26,973 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 22:04:26,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:04:27,025 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-15 22:04:27,047 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-15 22:04:27,249 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (exists ((v_ArrVal_6909 (_ BitVec 32))) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_6909) |create_data_#t~malloc7.base| (_ bv80 32)))) (= (_ bv0 1) (select |c_old(#valid)| create_data_~data~0.base)))) is different from true [2023-02-15 22:04:27,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 22:04:27,560 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-15 22:04:27,561 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 2 case distinctions, treesize of input 15 treesize of output 27 [2023-02-15 22:04:27,582 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 22:04:27,582 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-15 22:04:27,729 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 11 treesize of output 7 [2023-02-15 22:04:27,736 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 11 treesize of output 7 [2023-02-15 22:04:28,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 15 treesize of output 7 [2023-02-15 22:04:28,122 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 21 [2023-02-15 22:04:28,159 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:04:28,159 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 22:04:28,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [180196892] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 22:04:28,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 22:04:28,160 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 15 [2023-02-15 22:04:28,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719066852] [2023-02-15 22:04:28,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 22:04:28,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 22:04:28,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:04:28,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 22:04:28,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=256, Unknown=2, NotChecked=66, Total=380 [2023-02-15 22:04:28,161 INFO L87 Difference]: Start difference. First operand 343 states and 385 transitions. Second operand has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:04:30,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:04:30,511 INFO L93 Difference]: Finished difference Result 478 states and 528 transitions. [2023-02-15 22:04:30,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 22:04:30,529 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 65 [2023-02-15 22:04:30,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:04:30,531 INFO L225 Difference]: With dead ends: 478 [2023-02-15 22:04:30,531 INFO L226 Difference]: Without dead ends: 478 [2023-02-15 22:04:30,532 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=88, Invalid=338, Unknown=2, NotChecked=78, Total=506 [2023-02-15 22:04:30,532 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 247 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 723 SdHoareTripleChecker+Invalid, 908 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 288 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-15 22:04:30,533 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 723 Invalid, 908 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 615 Invalid, 0 Unknown, 288 Unchecked, 1.8s Time] [2023-02-15 22:04:30,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2023-02-15 22:04:30,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 360. [2023-02-15 22:04:30,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 317 states have (on average 1.2050473186119874) internal successors, (382), 347 states have internal predecessors, (382), 4 states have call successors, (4), 2 states have call predecessors, (4), 9 states have return successors, (18), 10 states have call predecessors, (18), 4 states have call successors, (18) [2023-02-15 22:04:30,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 404 transitions. [2023-02-15 22:04:30,538 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 404 transitions. Word has length 65 [2023-02-15 22:04:30,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:04:30,539 INFO L495 AbstractCegarLoop]: Abstraction has 360 states and 404 transitions. [2023-02-15 22:04:30,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.888888888888889) internal successors, (53), 10 states have internal predecessors, (53), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 22:04:30,539 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 404 transitions. [2023-02-15 22:04:30,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-15 22:04:30,539 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:04:30,540 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:04:30,557 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 (63)] Forceful destruction successful, exit code 0 [2023-02-15 22:04:30,760 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (64)] Forceful destruction successful, exit code 0 [2023-02-15 22:04:30,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 63 /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,64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-15 22:04:30,961 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:04:30,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:04:30,961 INFO L85 PathProgramCache]: Analyzing trace with hash -665539789, now seen corresponding path program 1 times [2023-02-15 22:04:30,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:04:30,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641782665] [2023-02-15 22:04:30,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:04:30,962 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-15 22:04:30,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:04:30,964 INFO L229 MonitoredProcess]: Starting monitored process 65 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-15 22:04:30,966 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 (65)] Waiting until timeout for monitored process [2023-02-15 22:04:31,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:04:31,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-15 22:04:31,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:04:31,674 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 22:04:31,674 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-15 22:04:31,714 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 11 treesize of output 7 [2023-02-15 22:04:31,781 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-02-15 22:04:31,781 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 18 treesize of output 24 [2023-02-15 22:04:31,878 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-15 22:04:31,878 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 24 [2023-02-15 22:04:31,962 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-15 22:04:31,996 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:04:31,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:04:32,183 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 36 treesize of output 32 [2023-02-15 22:04:32,416 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:04:32,416 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 22:04:32,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641782665] [2023-02-15 22:04:32,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641782665] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 22:04:32,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 22:04:32,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2023-02-15 22:04:32,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964025920] [2023-02-15 22:04:32,416 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 22:04:32,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 22:04:32,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 22:04:32,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 22:04:32,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-02-15 22:04:32,417 INFO L87 Difference]: Start difference. First operand 360 states and 404 transitions. Second operand has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:04:33,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 22:04:33,882 INFO L93 Difference]: Finished difference Result 371 states and 419 transitions. [2023-02-15 22:04:33,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 22:04:33,896 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 65 [2023-02-15 22:04:33,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 22:04:33,897 INFO L225 Difference]: With dead ends: 371 [2023-02-15 22:04:33,897 INFO L226 Difference]: Without dead ends: 371 [2023-02-15 22:04:33,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 114 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2023-02-15 22:04:33,898 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 331 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-15 22:04:33,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [331 Valid, 590 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 560 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-15 22:04:33,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2023-02-15 22:04:33,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 359. [2023-02-15 22:04:33,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 317 states have (on average 1.1987381703470033) internal successors, (380), 346 states have internal predecessors, (380), 4 states have call successors, (4), 2 states have call predecessors, (4), 9 states have return successors, (18), 10 states have call predecessors, (18), 4 states have call successors, (18) [2023-02-15 22:04:33,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 402 transitions. [2023-02-15 22:04:33,902 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 402 transitions. Word has length 65 [2023-02-15 22:04:33,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 22:04:33,902 INFO L495 AbstractCegarLoop]: Abstraction has 359 states and 402 transitions. [2023-02-15 22:04:33,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 22:04:33,902 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 402 transitions. [2023-02-15 22:04:33,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-15 22:04:33,902 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 22:04:33,902 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 22:04:33,916 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 (65)] Forceful destruction successful, exit code 0 [2023-02-15 22:04:34,114 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 65 /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-15 22:04:34,114 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-15 22:04:34,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 22:04:34,115 INFO L85 PathProgramCache]: Analyzing trace with hash -665539788, now seen corresponding path program 1 times [2023-02-15 22:04:34,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 22:04:34,115 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [744169973] [2023-02-15 22:04:34,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 22:04:34,115 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-15 22:04:34,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 22:04:34,116 INFO L229 MonitoredProcess]: Starting monitored process 66 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-15 22:04:34,117 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 (66)] Waiting until timeout for monitored process [2023-02-15 22:04:34,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 22:04:34,691 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-15 22:04:34,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 22:04:34,828 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 22:04:34,828 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-15 22:04:34,932 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 11 treesize of output 7 [2023-02-15 22:04:34,943 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 11 treesize of output 7 [2023-02-15 22:04:35,154 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-02-15 22:04:35,155 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 17 treesize of output 17 [2023-02-15 22:04:35,169 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 16 treesize of output 18 [2023-02-15 22:04:35,315 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-15 22:04:35,316 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 26 [2023-02-15 22:04:35,360 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-15 22:04:35,360 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 1 case distinctions, treesize of input 25 treesize of output 20 [2023-02-15 22:04:35,555 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-15 22:04:35,556 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 16 [2023-02-15 22:04:35,567 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-15 22:04:35,567 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 10 [2023-02-15 22:04:35,614 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-02-15 22:04:35,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 22:04:36,524 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 36 treesize of output 28 [2023-02-15 22:04:36,556 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 66 treesize of output 62 [2023-02-15 22:04:36,560 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 102 treesize of output 94