./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 2329fc70 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-?-2329fc7 [2023-02-14 01:52:42,222 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 01:52:42,224 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 01:52:42,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 01:52:42,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 01:52:42,267 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 01:52:42,269 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 01:52:42,272 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 01:52:42,273 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 01:52:42,277 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 01:52:42,278 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 01:52:42,279 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 01:52:42,279 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 01:52:42,281 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 01:52:42,282 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 01:52:42,284 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 01:52:42,285 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 01:52:42,286 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 01:52:42,287 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 01:52:42,291 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 01:52:42,292 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 01:52:42,292 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 01:52:42,293 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 01:52:42,294 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 01:52:42,300 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 01:52:42,300 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 01:52:42,300 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 01:52:42,301 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 01:52:42,302 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 01:52:42,302 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 01:52:42,302 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 01:52:42,303 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 01:52:42,305 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 01:52:42,305 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 01:52:42,306 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 01:52:42,306 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 01:52:42,306 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 01:52:42,306 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 01:52:42,307 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 01:52:42,308 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 01:52:42,308 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 01:52:42,309 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-14 01:52:42,330 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 01:52:42,330 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 01:52:42,331 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 01:52:42,331 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 01:52:42,332 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 01:52:42,332 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 01:52:42,332 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 01:52:42,332 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 01:52:42,332 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 01:52:42,333 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 01:52:42,333 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 01:52:42,333 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 01:52:42,333 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 01:52:42,334 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 01:52:42,334 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 01:52:42,334 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 01:52:42,334 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 01:52:42,334 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 01:52:42,334 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 01:52:42,334 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 01:52:42,334 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 01:52:42,335 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 01:52:42,335 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 01:52:42,335 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 01:52:42,335 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 01:52:42,335 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 01:52:42,335 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 01:52:42,335 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 01:52:42,336 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-14 01:52:42,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-14 01:52:42,336 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 01:52:42,336 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 01:52:42,336 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 01:52:42,337 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 01:52:42,337 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-14 01:52:42,557 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 01:52:42,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 01:52:42,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 01:52:42,577 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 01:52:42,577 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 01:52:42,578 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-14 01:52:43,544 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 01:52:43,703 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 01:52:43,703 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2023-02-14 01:52:43,712 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/122ed0f51/22efc0934b83405e959a631ff1b8b55f/FLAG2c2cfebb9 [2023-02-14 01:52:43,722 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/122ed0f51/22efc0934b83405e959a631ff1b8b55f [2023-02-14 01:52:43,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 01:52:43,724 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 01:52:43,725 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 01:52:43,725 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 01:52:43,736 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 01:52:43,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:52:43" (1/1) ... [2023-02-14 01:52:43,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@70f62ee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:52:43, skipping insertion in model container [2023-02-14 01:52:43,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:52:43" (1/1) ... [2023-02-14 01:52:43,742 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 01:52:43,776 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 01:52:43,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 01:52:43,963 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-14 01:52:43,964 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@349115bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:52:43, skipping insertion in model container [2023-02-14 01:52:43,964 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 01:52:43,965 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-14 01:52:43,966 INFO L158 Benchmark]: Toolchain (without parser) took 241.31ms. Allocated memory is still 151.0MB. Free memory was 111.8MB in the beginning and 100.0MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-14 01:52:43,967 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 80.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-14 01:52:43,967 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.81ms. Allocated memory is still 151.0MB. Free memory was 111.8MB in the beginning and 100.0MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-14 01:52:43,968 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 80.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.81ms. Allocated memory is still 151.0MB. Free memory was 111.8MB in the beginning and 100.0MB in the end (delta: 11.8MB). Peak memory consumption was 12.6MB. 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-?-2329fc7 [2023-02-14 01:52:45,555 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-14 01:52:45,556 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-14 01:52:45,581 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-14 01:52:45,583 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-14 01:52:45,586 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-14 01:52:45,588 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-14 01:52:45,590 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-14 01:52:45,595 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-14 01:52:45,599 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-14 01:52:45,600 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-14 01:52:45,602 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-14 01:52:45,602 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-14 01:52:45,604 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-14 01:52:45,605 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-14 01:52:45,606 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-14 01:52:45,607 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-14 01:52:45,608 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-14 01:52:45,609 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-14 01:52:45,613 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-14 01:52:45,614 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-14 01:52:45,615 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-14 01:52:45,616 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-14 01:52:45,616 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-14 01:52:45,621 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-14 01:52:45,622 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-14 01:52:45,622 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-14 01:52:45,623 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-14 01:52:45,624 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-14 01:52:45,624 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-14 01:52:45,625 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-14 01:52:45,630 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-14 01:52:45,632 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-14 01:52:45,633 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-14 01:52:45,633 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-14 01:52:45,633 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-14 01:52:45,634 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-14 01:52:45,634 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-14 01:52:45,634 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-14 01:52:45,635 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-14 01:52:45,635 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-14 01:52:45,636 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-14 01:52:45,672 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-14 01:52:45,673 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-14 01:52:45,674 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-14 01:52:45,674 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-14 01:52:45,674 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-14 01:52:45,675 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-14 01:52:45,675 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-14 01:52:45,675 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-14 01:52:45,675 INFO L138 SettingsManager]: * Use SBE=true [2023-02-14 01:52:45,676 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-14 01:52:45,676 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-14 01:52:45,676 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-14 01:52:45,677 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-14 01:52:45,677 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-14 01:52:45,677 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-14 01:52:45,677 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-14 01:52:45,677 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-14 01:52:45,677 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-14 01:52:45,677 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-14 01:52:45,678 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-14 01:52:45,678 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-14 01:52:45,678 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-14 01:52:45,678 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-14 01:52:45,678 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-14 01:52:45,678 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-14 01:52:45,679 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-14 01:52:45,679 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-14 01:52:45,679 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 01:52:45,679 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-14 01:52:45,679 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-14 01:52:45,679 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-14 01:52:45,679 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-14 01:52:45,680 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-14 01:52:45,680 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-14 01:52:45,680 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-14 01:52:45,680 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-14 01:52:45,680 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-14 01:52:45,680 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-14 01:52:45,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-14 01:52:45,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-14 01:52:45,951 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-14 01:52:45,952 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-14 01:52:45,952 INFO L275 PluginConnector]: CDTParser initialized [2023-02-14 01:52:45,955 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-14 01:52:47,023 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-14 01:52:47,216 INFO L351 CDTParser]: Found 1 translation units. [2023-02-14 01:52:47,216 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/complex_data_creation_test02-2.i [2023-02-14 01:52:47,231 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5651b288c/e9da6ddad8f243a083cf85782ad5bcb3/FLAG9df2511c7 [2023-02-14 01:52:47,576 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5651b288c/e9da6ddad8f243a083cf85782ad5bcb3 [2023-02-14 01:52:47,578 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-14 01:52:47,579 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-14 01:52:47,581 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-14 01:52:47,581 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-14 01:52:47,584 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-14 01:52:47,584 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:52:47" (1/1) ... [2023-02-14 01:52:47,585 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@261378c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:52:47, skipping insertion in model container [2023-02-14 01:52:47,585 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.02 01:52:47" (1/1) ... [2023-02-14 01:52:47,590 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-14 01:52:47,627 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 01:52:47,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 01:52:47,873 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-14 01:52:47,885 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-14 01:52:47,905 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 01:52:47,908 INFO L203 MainTranslator]: Completed pre-run [2023-02-14 01:52:47,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-14 01:52:47,994 INFO L208 MainTranslator]: Completed translation [2023-02-14 01:52:47,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:52:47 WrapperNode [2023-02-14 01:52:47,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-14 01:52:47,996 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-14 01:52:47,996 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-14 01:52:47,996 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-14 01:52:48,000 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:52:47" (1/1) ... [2023-02-14 01:52:48,015 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:52:47" (1/1) ... [2023-02-14 01:52:48,030 INFO L138 Inliner]: procedures = 129, calls = 62, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 98 [2023-02-14 01:52:48,030 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-14 01:52:48,031 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-14 01:52:48,031 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-14 01:52:48,031 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-14 01:52:48,037 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:52:47" (1/1) ... [2023-02-14 01:52:48,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:52:47" (1/1) ... [2023-02-14 01:52:48,042 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:52:47" (1/1) ... [2023-02-14 01:52:48,045 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:52:47" (1/1) ... [2023-02-14 01:52:48,053 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:52:47" (1/1) ... [2023-02-14 01:52:48,064 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:52:47" (1/1) ... [2023-02-14 01:52:48,068 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:52:47" (1/1) ... [2023-02-14 01:52:48,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:52:47" (1/1) ... [2023-02-14 01:52:48,078 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-14 01:52:48,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-14 01:52:48,079 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-14 01:52:48,079 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-14 01:52:48,080 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:52:47" (1/1) ... [2023-02-14 01:52:48,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-14 01:52:48,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-14 01:52:48,111 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-14 01:52:48,113 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-14 01:52:48,135 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-14 01:52:48,135 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-14 01:52:48,136 INFO L130 BoogieDeclarations]: Found specification of procedure create_data [2023-02-14 01:52:48,139 INFO L138 BoogieDeclarations]: Found implementation of procedure create_data [2023-02-14 01:52:48,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-14 01:52:48,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-14 01:52:48,139 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-14 01:52:48,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-14 01:52:48,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-14 01:52:48,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-14 01:52:48,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-14 01:52:48,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-14 01:52:48,140 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-14 01:52:48,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-14 01:52:48,224 INFO L235 CfgBuilder]: Building ICFG [2023-02-14 01:52:48,225 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-14 01:52:48,988 INFO L276 CfgBuilder]: Performing block encoding [2023-02-14 01:52:48,993 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-14 01:52:48,993 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2023-02-14 01:52:48,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:52:48 BoogieIcfgContainer [2023-02-14 01:52:48,995 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-14 01:52:48,996 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-14 01:52:48,996 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-14 01:52:49,001 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-14 01:52:49,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.02 01:52:47" (1/3) ... [2023-02-14 01:52:49,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0e5090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:52:49, skipping insertion in model container [2023-02-14 01:52:49,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.02 01:52:47" (2/3) ... [2023-02-14 01:52:49,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f0e5090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 01:52:49, skipping insertion in model container [2023-02-14 01:52:49,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 01:52:48" (3/3) ... [2023-02-14 01:52:49,004 INFO L112 eAbstractionObserver]: Analyzing ICFG complex_data_creation_test02-2.i [2023-02-14 01:52:49,018 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-14 01:52:49,018 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 92 error locations. [2023-02-14 01:52:49,063 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-14 01:52:49,068 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;@1e7359b3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-14 01:52:49,069 INFO L358 AbstractCegarLoop]: Starting to check reachability of 92 error locations. [2023-02-14 01:52:49,073 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-14 01:52:49,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-14 01:52:49,077 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:52:49,078 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-14 01:52:49,078 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-14 01:52:49,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:52:49,084 INFO L85 PathProgramCache]: Analyzing trace with hash 5052905, now seen corresponding path program 1 times [2023-02-14 01:52:49,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:52:49,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [143989058] [2023-02-14 01:52:49,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:52:49,094 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-14 01:52:49,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:52:49,097 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-14 01:52:49,098 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-14 01:52:49,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:52:49,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-14 01:52:49,184 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:52:49,197 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-14 01:52:49,197 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:52:49,198 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:52:49,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [143989058] [2023-02-14 01:52:49,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [143989058] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:52:49,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:52:49,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 01:52:49,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828368624] [2023-02-14 01:52:49,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:52:49,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-14 01:52:49,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:52:49,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-14 01:52:49,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-14 01:52:49,241 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-14 01:52:49,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:52:49,264 INFO L93 Difference]: Finished difference Result 189 states and 200 transitions. [2023-02-14 01:52:49,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-14 01:52:49,265 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-14 01:52:49,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:52:49,272 INFO L225 Difference]: With dead ends: 189 [2023-02-14 01:52:49,272 INFO L226 Difference]: Without dead ends: 187 [2023-02-14 01:52:49,273 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-14 01:52:49,277 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-14 01:52:49,278 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-14 01:52:49,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-02-14 01:52:49,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2023-02-14 01:52:49,311 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-14 01:52:49,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 198 transitions. [2023-02-14 01:52:49,318 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 198 transitions. Word has length 4 [2023-02-14 01:52:49,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:52:49,318 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 198 transitions. [2023-02-14 01:52:49,318 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-14 01:52:49,319 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 198 transitions. [2023-02-14 01:52:49,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-14 01:52:49,319 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:52:49,319 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-14 01:52:49,325 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-14 01:52:49,519 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-14 01:52:49,520 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-14 01:52:49,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:52:49,520 INFO L85 PathProgramCache]: Analyzing trace with hash 5050693, now seen corresponding path program 1 times [2023-02-14 01:52:49,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:52:49,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1771392924] [2023-02-14 01:52:49,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:52:49,521 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-14 01:52:49,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:52:49,523 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-14 01:52:49,525 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-14 01:52:49,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:52:49,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 01:52:49,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:52:49,644 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-14 01:52:49,681 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-14 01:52:49,683 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-14 01:52:49,698 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-14 01:52:49,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:52:49,698 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:52:49,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1771392924] [2023-02-14 01:52:49,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1771392924] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:52:49,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:52:49,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 01:52:49,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585681593] [2023-02-14 01:52:49,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:52:49,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 01:52:49,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:52:49,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 01:52:49,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 01:52:49,708 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-14 01:52:50,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:52:50,151 INFO L93 Difference]: Finished difference Result 207 states and 219 transitions. [2023-02-14 01:52:50,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 01:52:50,151 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-14 01:52:50,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:52:50,153 INFO L225 Difference]: With dead ends: 207 [2023-02-14 01:52:50,153 INFO L226 Difference]: Without dead ends: 207 [2023-02-14 01:52:50,153 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-14 01:52:50,154 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-14 01:52:50,154 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-14 01:52:50,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2023-02-14 01:52:50,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 181. [2023-02-14 01:52:50,160 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-14 01:52:50,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 192 transitions. [2023-02-14 01:52:50,161 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 192 transitions. Word has length 4 [2023-02-14 01:52:50,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:52:50,162 INFO L495 AbstractCegarLoop]: Abstraction has 181 states and 192 transitions. [2023-02-14 01:52:50,162 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-14 01:52:50,162 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 192 transitions. [2023-02-14 01:52:50,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2023-02-14 01:52:50,162 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:52:50,162 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2023-02-14 01:52:50,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-02-14 01:52:50,369 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-14 01:52:50,369 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-14 01:52:50,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:52:50,370 INFO L85 PathProgramCache]: Analyzing trace with hash 5050694, now seen corresponding path program 1 times [2023-02-14 01:52:50,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:52:50,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1442707959] [2023-02-14 01:52:50,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:52:50,370 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-14 01:52:50,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:52:50,381 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-14 01:52:50,383 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-14 01:52:50,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:52:50,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-14 01:52:50,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:52:50,444 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-14 01:52:50,448 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-14 01:52:50,476 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:52:50,478 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-14 01:52:50,486 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:52:50,487 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-14 01:52:50,501 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-14 01:52:50,501 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:52:50,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:52:50,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1442707959] [2023-02-14 01:52:50,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1442707959] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:52:50,502 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:52:50,502 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 01:52:50,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994867966] [2023-02-14 01:52:50,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:52:50,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 01:52:50,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:52:50,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 01:52:50,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 01:52:50,503 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-14 01:52:50,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:52:50,958 INFO L93 Difference]: Finished difference Result 197 states and 211 transitions. [2023-02-14 01:52:50,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 01:52:50,960 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-14 01:52:50,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:52:50,962 INFO L225 Difference]: With dead ends: 197 [2023-02-14 01:52:50,962 INFO L226 Difference]: Without dead ends: 197 [2023-02-14 01:52:50,962 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-14 01:52:50,963 INFO L413 NwaCegarLoop]: 182 mSDtfsCounter, 28 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 01:52:50,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 344 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-14 01:52:50,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2023-02-14 01:52:50,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 186. [2023-02-14 01:52:50,969 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-14 01:52:50,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 199 transitions. [2023-02-14 01:52:50,970 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 199 transitions. Word has length 4 [2023-02-14 01:52:50,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:52:50,971 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 199 transitions. [2023-02-14 01:52:50,971 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-14 01:52:50,971 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 199 transitions. [2023-02-14 01:52:50,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-14 01:52:50,971 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:52:50,971 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-14 01:52:50,980 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-14 01:52:51,178 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-14 01:52:51,178 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-14 01:52:51,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:52:51,179 INFO L85 PathProgramCache]: Analyzing trace with hash 156571597, now seen corresponding path program 1 times [2023-02-14 01:52:51,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:52:51,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1850408317] [2023-02-14 01:52:51,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:52:51,179 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-14 01:52:51,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:52:51,181 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-14 01:52:51,183 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-14 01:52:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:52:51,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-14 01:52:51,263 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:52:51,267 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-14 01:52:51,272 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-14 01:52:51,272 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:52:51,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:52:51,273 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1850408317] [2023-02-14 01:52:51,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1850408317] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:52:51,273 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:52:51,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 01:52:51,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688741910] [2023-02-14 01:52:51,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:52:51,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 01:52:51,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:52:51,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 01:52:51,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 01:52:51,274 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-14 01:52:51,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:52:51,473 INFO L93 Difference]: Finished difference Result 209 states and 222 transitions. [2023-02-14 01:52:51,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 01:52:51,474 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-14 01:52:51,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:52:51,475 INFO L225 Difference]: With dead ends: 209 [2023-02-14 01:52:51,475 INFO L226 Difference]: Without dead ends: 209 [2023-02-14 01:52:51,475 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-14 01:52:51,475 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 64 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:52:51,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 232 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:52:51,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-02-14 01:52:51,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 184. [2023-02-14 01:52:51,480 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-14 01:52:51,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 196 transitions. [2023-02-14 01:52:51,484 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 196 transitions. Word has length 5 [2023-02-14 01:52:51,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:52:51,484 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 196 transitions. [2023-02-14 01:52:51,484 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-14 01:52:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 196 transitions. [2023-02-14 01:52:51,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-14 01:52:51,484 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:52:51,485 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-14 01:52:51,495 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-14 01:52:51,693 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-14 01:52:51,693 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-14 01:52:51,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:52:51,694 INFO L85 PathProgramCache]: Analyzing trace with hash 156571598, now seen corresponding path program 1 times [2023-02-14 01:52:51,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:52:51,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1079305283] [2023-02-14 01:52:51,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:52:51,695 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:52:51,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:52:51,696 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-14 01:52:51,697 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-14 01:52:51,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:52:51,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 01:52:51,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:52:51,759 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-14 01:52:51,772 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-14 01:52:51,773 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:52:51,773 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:52:51,773 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1079305283] [2023-02-14 01:52:51,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1079305283] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:52:51,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:52:51,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 01:52:51,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055376698] [2023-02-14 01:52:51,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:52:51,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 01:52:51,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:52:51,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 01:52:51,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 01:52:51,775 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-14 01:52:52,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:52:52,020 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2023-02-14 01:52:52,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 01:52:52,020 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-14 01:52:52,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:52:52,021 INFO L225 Difference]: With dead ends: 182 [2023-02-14 01:52:52,021 INFO L226 Difference]: Without dead ends: 182 [2023-02-14 01:52:52,021 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-14 01:52:52,021 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 11 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:52:52,022 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.2s Time] [2023-02-14 01:52:52,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-02-14 01:52:52,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2023-02-14 01:52:52,025 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-14 01:52:52,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 193 transitions. [2023-02-14 01:52:52,026 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 193 transitions. Word has length 5 [2023-02-14 01:52:52,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:52:52,026 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 193 transitions. [2023-02-14 01:52:52,026 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-14 01:52:52,026 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 193 transitions. [2023-02-14 01:52:52,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-14 01:52:52,026 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:52:52,026 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:52:52,056 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-14 01:52:52,235 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-14 01:52:52,237 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-14 01:52:52,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:52:52,237 INFO L85 PathProgramCache]: Analyzing trace with hash 666573431, now seen corresponding path program 1 times [2023-02-14 01:52:52,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:52:52,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1382263693] [2023-02-14 01:52:52,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:52:52,238 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-14 01:52:52,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:52:52,239 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-14 01:52:52,241 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-14 01:52:52,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:52:52,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-14 01:52:52,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:52:52,304 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-14 01:52:52,324 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:52:52,324 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-14 01:52:52,358 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-14 01:52:52,362 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-14 01:52:52,381 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-14 01:52:52,384 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-14 01:52:52,394 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-14 01:52:52,394 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:52:52,394 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:52:52,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1382263693] [2023-02-14 01:52:52,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1382263693] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:52:52,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:52:52,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 01:52:52,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326930766] [2023-02-14 01:52:52,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:52:52,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 01:52:52,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:52:52,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 01:52:52,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:52:52,396 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-14 01:52:52,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:52:52,735 INFO L93 Difference]: Finished difference Result 184 states and 196 transitions. [2023-02-14 01:52:52,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 01:52:52,735 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-14 01:52:52,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:52:52,736 INFO L225 Difference]: With dead ends: 184 [2023-02-14 01:52:52,736 INFO L226 Difference]: Without dead ends: 184 [2023-02-14 01:52:52,736 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-14 01:52:52,737 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-14 01:52:52,737 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-14 01:52:52,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-02-14 01:52:52,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2023-02-14 01:52:52,740 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-14 01:52:52,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 194 transitions. [2023-02-14 01:52:52,740 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 194 transitions. Word has length 10 [2023-02-14 01:52:52,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:52:52,741 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 194 transitions. [2023-02-14 01:52:52,741 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-14 01:52:52,741 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 194 transitions. [2023-02-14 01:52:52,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-14 01:52:52,741 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:52:52,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:52:52,748 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-14 01:52:52,948 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-14 01:52:52,948 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-14 01:52:52,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:52:52,949 INFO L85 PathProgramCache]: Analyzing trace with hash 623653565, now seen corresponding path program 1 times [2023-02-14 01:52:52,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:52:52,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1095084596] [2023-02-14 01:52:52,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:52:52,949 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-14 01:52:52,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:52:52,950 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-14 01:52:52,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-14 01:52:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:52:53,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 01:52:53,015 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:52:53,036 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-14 01:52:53,036 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:52:53,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:52:53,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1095084596] [2023-02-14 01:52:53,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1095084596] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:52:53,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:52:53,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 01:52:53,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325288222] [2023-02-14 01:52:53,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:52:53,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 01:52:53,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:52:53,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 01:52:53,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 01:52:53,038 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-14 01:52:53,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:52:53,060 INFO L93 Difference]: Finished difference Result 260 states and 275 transitions. [2023-02-14 01:52:53,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 01:52:53,061 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-14 01:52:53,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:52:53,062 INFO L225 Difference]: With dead ends: 260 [2023-02-14 01:52:53,062 INFO L226 Difference]: Without dead ends: 260 [2023-02-14 01:52:53,062 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-14 01:52:53,063 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-14 01:52:53,063 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-14 01:52:53,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2023-02-14 01:52:53,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 224. [2023-02-14 01:52:53,068 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-14 01:52:53,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 275 transitions. [2023-02-14 01:52:53,069 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 275 transitions. Word has length 12 [2023-02-14 01:52:53,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:52:53,069 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 275 transitions. [2023-02-14 01:52:53,069 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-14 01:52:53,070 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 275 transitions. [2023-02-14 01:52:53,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-14 01:52:53,070 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:52:53,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:52:53,081 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-14 01:52:53,276 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-14 01:52:53,277 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-14 01:52:53,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:52:53,278 INFO L85 PathProgramCache]: Analyzing trace with hash -2141569776, now seen corresponding path program 1 times [2023-02-14 01:52:53,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:52:53,278 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [848700875] [2023-02-14 01:52:53,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:52:53,278 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-14 01:52:53,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:52:53,279 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-14 01:52:53,279 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-14 01:52:53,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:52:53,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 01:52:53,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:52:53,356 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-14 01:52:53,356 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-14 01:52:53,366 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-14 01:52:53,366 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:52:53,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:52:53,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [848700875] [2023-02-14 01:52:53,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [848700875] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:52:53,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:52:53,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 01:52:53,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660798407] [2023-02-14 01:52:53,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:52:53,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 01:52:53,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:52:53,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 01:52:53,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 01:52:53,368 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-14 01:52:53,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:52:53,579 INFO L93 Difference]: Finished difference Result 227 states and 271 transitions. [2023-02-14 01:52:53,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 01:52:53,579 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-14 01:52:53,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:52:53,580 INFO L225 Difference]: With dead ends: 227 [2023-02-14 01:52:53,580 INFO L226 Difference]: Without dead ends: 227 [2023-02-14 01:52:53,580 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-14 01:52:53,581 INFO L413 NwaCegarLoop]: 139 mSDtfsCounter, 62 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:52:53,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 202 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:52:53,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-14 01:52:53,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 218. [2023-02-14 01:52:53,584 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-14 01:52:53,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 265 transitions. [2023-02-14 01:52:53,585 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 265 transitions. Word has length 13 [2023-02-14 01:52:53,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:52:53,585 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 265 transitions. [2023-02-14 01:52:53,585 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-14 01:52:53,585 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 265 transitions. [2023-02-14 01:52:53,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-14 01:52:53,585 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:52:53,586 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:52:53,607 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-14 01:52:53,792 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-14 01:52:53,795 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-14 01:52:53,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:52:53,795 INFO L85 PathProgramCache]: Analyzing trace with hash -2141569775, now seen corresponding path program 1 times [2023-02-14 01:52:53,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:52:53,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1459095081] [2023-02-14 01:52:53,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:52:53,796 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-14 01:52:53,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:52:53,797 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-14 01:52:53,802 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-14 01:52:53,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:52:53,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 01:52:53,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:52:53,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:52:53,866 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-14 01:52:53,872 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-14 01:52:53,877 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-14 01:52:53,877 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:52:53,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:52:53,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1459095081] [2023-02-14 01:52:53,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1459095081] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:52:53,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:52:53,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 01:52:53,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420635621] [2023-02-14 01:52:53,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:52:53,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 01:52:53,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:52:53,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 01:52:53,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 01:52:53,879 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-14 01:52:54,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:52:54,161 INFO L93 Difference]: Finished difference Result 239 states and 279 transitions. [2023-02-14 01:52:54,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 01:52:54,162 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-14 01:52:54,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:52:54,163 INFO L225 Difference]: With dead ends: 239 [2023-02-14 01:52:54,163 INFO L226 Difference]: Without dead ends: 239 [2023-02-14 01:52:54,163 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-14 01:52:54,164 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-14 01:52:54,164 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-14 01:52:54,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2023-02-14 01:52:54,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 219. [2023-02-14 01:52:54,167 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-14 01:52:54,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 259 transitions. [2023-02-14 01:52:54,167 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 259 transitions. Word has length 13 [2023-02-14 01:52:54,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:52:54,168 INFO L495 AbstractCegarLoop]: Abstraction has 219 states and 259 transitions. [2023-02-14 01:52:54,168 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-14 01:52:54,168 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 259 transitions. [2023-02-14 01:52:54,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-14 01:52:54,168 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:52:54,168 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:52:54,175 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-14 01:52:54,375 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-14 01:52:54,376 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-14 01:52:54,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:52:54,376 INFO L85 PathProgramCache]: Analyzing trace with hash 533828155, now seen corresponding path program 1 times [2023-02-14 01:52:54,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:52:54,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003564698] [2023-02-14 01:52:54,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:52:54,376 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-14 01:52:54,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:52:54,378 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-14 01:52:54,383 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-14 01:52:54,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:52:54,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 01:52:54,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:52:54,454 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-14 01:52:54,455 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-14 01:52:54,465 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-14 01:52:54,480 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-14 01:52:54,486 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-14 01:52:54,486 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:52:54,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:52:54,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003564698] [2023-02-14 01:52:54,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003564698] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:52:54,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:52:54,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 01:52:54,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710967484] [2023-02-14 01:52:54,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:52:54,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 01:52:54,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:52:54,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 01:52:54,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:52:54,488 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-14 01:52:54,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:52:54,936 INFO L93 Difference]: Finished difference Result 270 states and 323 transitions. [2023-02-14 01:52:54,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 01:52:54,937 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-14 01:52:54,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:52:54,938 INFO L225 Difference]: With dead ends: 270 [2023-02-14 01:52:54,938 INFO L226 Difference]: Without dead ends: 270 [2023-02-14 01:52:54,938 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-14 01:52:54,939 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 26 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 01:52:54,939 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-14 01:52:54,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-02-14 01:52:54,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 225. [2023-02-14 01:52:54,943 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-14 01:52:54,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 269 transitions. [2023-02-14 01:52:54,943 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 269 transitions. Word has length 17 [2023-02-14 01:52:54,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:52:54,944 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 269 transitions. [2023-02-14 01:52:54,944 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-14 01:52:54,944 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 269 transitions. [2023-02-14 01:52:54,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-14 01:52:54,944 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:52:54,944 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:52:54,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-14 01:52:55,151 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-14 01:52:55,151 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-14 01:52:55,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:52:55,152 INFO L85 PathProgramCache]: Analyzing trace with hash 533828156, now seen corresponding path program 1 times [2023-02-14 01:52:55,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:52:55,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1106666626] [2023-02-14 01:52:55,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:52:55,152 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-14 01:52:55,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:52:55,154 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-14 01:52:55,157 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-14 01:52:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:52:55,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-14 01:52:55,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:52:55,244 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 01:52:55,245 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-14 01:52:55,259 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-14 01:52:55,270 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-14 01:52:55,321 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-14 01:52:55,326 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-14 01:52:55,339 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-14 01:52:55,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:52:55,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:52:55,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1106666626] [2023-02-14 01:52:55,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1106666626] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:52:55,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:52:55,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 01:52:55,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035251164] [2023-02-14 01:52:55,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:52:55,341 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 01:52:55,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:52:55,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 01:52:55,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:52:55,341 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-14 01:52:55,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:52:55,862 INFO L93 Difference]: Finished difference Result 227 states and 267 transitions. [2023-02-14 01:52:55,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 01:52:55,863 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-14 01:52:55,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:52:55,864 INFO L225 Difference]: With dead ends: 227 [2023-02-14 01:52:55,864 INFO L226 Difference]: Without dead ends: 227 [2023-02-14 01:52:55,864 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-14 01:52:55,864 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-14 01:52:55,865 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-14 01:52:55,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-14 01:52:55,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2023-02-14 01:52:55,868 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-14 01:52:55,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 265 transitions. [2023-02-14 01:52:55,869 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 265 transitions. Word has length 17 [2023-02-14 01:52:55,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:52:55,869 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 265 transitions. [2023-02-14 01:52:55,869 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-14 01:52:55,869 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 265 transitions. [2023-02-14 01:52:55,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-14 01:52:55,869 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:52:55,871 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-14 01:52:55,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-14 01:52:56,073 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-14 01:52:56,073 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-14 01:52:56,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:52:56,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1553049946, now seen corresponding path program 1 times [2023-02-14 01:52:56,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:52:56,074 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [690674453] [2023-02-14 01:52:56,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:52:56,074 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-14 01:52:56,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:52:56,075 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-14 01:52:56,075 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-14 01:52:56,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:52:56,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-14 01:52:56,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:52:56,201 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-14 01:52:56,201 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-14 01:52:56,243 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-14 01:52:56,315 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:52:56,315 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-14 01:52:56,351 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-14 01:52:56,373 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-14 01:52:56,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:52:56,410 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 (_ bv4 32) c_create_data_~data~0.offset))) (_ bv1 1)))) is different from false [2023-02-14 01:52:56,448 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_178 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (let ((.cse0 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (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)) (_ bv0 1))) is different from false [2023-02-14 01:52:56,461 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:52:56,461 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-14 01:52:56,463 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-14 01:52:56,468 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-14 01:52:56,511 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-14 01:52:56,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:52:56,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [690674453] [2023-02-14 01:52:56,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [690674453] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:52:56,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:52:56,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2023-02-14 01:52:56,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671414232] [2023-02-14 01:52:56,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:52:56,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 01:52:56,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:52:56,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 01:52:56,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=52, Unknown=2, NotChecked=30, Total=110 [2023-02-14 01:52:56,512 INFO L87 Difference]: Start difference. First operand 225 states and 265 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:52:57,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:52:57,026 INFO L93 Difference]: Finished difference Result 232 states and 269 transitions. [2023-02-14 01:52:57,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 01:52:57,027 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-14 01:52:57,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:52:57,028 INFO L225 Difference]: With dead ends: 232 [2023-02-14 01:52:57,028 INFO L226 Difference]: Without dead ends: 232 [2023-02-14 01:52:57,028 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=64, Unknown=2, NotChecked=34, Total=132 [2023-02-14 01:52:57,028 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 47 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 609 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 210 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 01:52:57,029 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 609 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 327 Invalid, 0 Unknown, 210 Unchecked, 0.5s Time] [2023-02-14 01:52:57,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2023-02-14 01:52:57,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 224. [2023-02-14 01:52:57,032 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-14 01:52:57,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 263 transitions. [2023-02-14 01:52:57,032 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 263 transitions. Word has length 22 [2023-02-14 01:52:57,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:52:57,032 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 263 transitions. [2023-02-14 01:52:57,032 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:52:57,033 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 263 transitions. [2023-02-14 01:52:57,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-14 01:52:57,033 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:52:57,033 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-14 01:52:57,046 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-14 01:52:57,237 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-14 01:52:57,237 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-14 01:52:57,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:52:57,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1553049945, now seen corresponding path program 1 times [2023-02-14 01:52:57,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:52:57,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1217424060] [2023-02-14 01:52:57,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:52:57,238 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-14 01:52:57,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:52:57,239 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-14 01:52:57,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 (14)] Waiting until timeout for monitored process [2023-02-14 01:52:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:52:57,341 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-14 01:52:57,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:52:57,352 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-14 01:52:57,357 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-14 01:52:57,372 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-14 01:52:57,379 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-14 01:52:57,466 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:52:57,467 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-14 01:52:57,481 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-14 01:52:57,547 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-14 01:52:57,554 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-14 01:52:57,570 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-14 01:52:57,570 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:52:57,779 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (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 (_ bv4 32) .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (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| |c_create_data_#t~mem9.base| v_ArrVal_223) c_create_data_~data~0.base) .cse2) (_ bv8 32) .cse1) (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-14 01:52:57,812 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (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_223 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_224 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_223) c_create_data_~data~0.base) .cse1) .cse2) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_224) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_223) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse3 .cse2) (bvadd (_ bv8 32) .cse3 .cse2))))))) is different from false [2023-02-14 01:52:57,867 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse1))) (and (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_224 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_223) c_create_data_~data~0.base) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_224) c_create_data_~data~0.base) .cse1)))) (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_223) c_create_data_~data~0.base) .cse1))) (bvule (bvadd (_ bv4 32) .cse2) (bvadd (_ bv8 32) .cse2))))))) is different from false [2023-02-14 01:52:57,880 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:52:57,880 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 46 [2023-02-14 01:52:57,886 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:52:57,886 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 35 treesize of output 36 [2023-02-14 01:52:57,894 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 62 treesize of output 50 [2023-02-14 01:52:57,897 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 96 treesize of output 78 [2023-02-14 01:52:57,902 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 40 treesize of output 32 [2023-02-14 01:52:57,905 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 66 treesize of output 58 [2023-02-14 01:52:58,034 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:52:58,034 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-14 01:52:58,039 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-14 01:52:58,098 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-14 01:52:58,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:52:58,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1217424060] [2023-02-14 01:52:58,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1217424060] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:52:58,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:52:58,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-02-14 01:52:58,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889001553] [2023-02-14 01:52:58,099 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:52:58,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-14 01:52:58,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:52:58,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-14 01:52:58,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=102, Unknown=3, NotChecked=66, Total=210 [2023-02-14 01:52:58,099 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-14 01:53:00,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:00,183 INFO L93 Difference]: Finished difference Result 236 states and 275 transitions. [2023-02-14 01:53:00,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-14 01:53:00,183 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-14 01:53:00,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:00,184 INFO L225 Difference]: With dead ends: 236 [2023-02-14 01:53:00,184 INFO L226 Difference]: Without dead ends: 236 [2023-02-14 01:53:00,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=68, Invalid=181, Unknown=3, NotChecked=90, Total=342 [2023-02-14 01:53:00,185 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 6 mSDsluCounter, 755 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 2 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 262 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:00,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 917 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 502 Invalid, 11 Unknown, 262 Unchecked, 1.7s Time] [2023-02-14 01:53:00,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2023-02-14 01:53:00,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2023-02-14 01:53:00,188 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-14 01:53:00,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 273 transitions. [2023-02-14 01:53:00,189 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 273 transitions. Word has length 22 [2023-02-14 01:53:00,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:00,189 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 273 transitions. [2023-02-14 01:53:00,189 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-14 01:53:00,189 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 273 transitions. [2023-02-14 01:53:00,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-14 01:53:00,189 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:00,189 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-14 01:53:00,197 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-14 01:53:00,397 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-14 01:53:00,397 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-14 01:53:00,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:00,398 INFO L85 PathProgramCache]: Analyzing trace with hash 767728924, now seen corresponding path program 2 times [2023-02-14 01:53:00,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:53:00,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [100691294] [2023-02-14 01:53:00,398 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-14 01:53:00,398 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-14 01:53:00,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:53:00,400 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-14 01:53:00,401 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-14 01:53:00,549 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-14 01:53:00,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 01:53:00,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-14 01:53:00,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:00,581 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 01:53:00,581 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-14 01:53:00,590 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-14 01:53:00,606 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-14 01:53:00,614 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-14 01:53:00,697 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:53:00,697 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-14 01:53:00,705 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-14 01:53:00,811 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:53:00,811 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-14 01:53:00,814 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-14 01:53:00,884 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-14 01:53:00,890 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-14 01:53:00,909 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-14 01:53:00,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:53:01,159 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (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 (_ bv4 32) .cse0 .cse1) (bvadd .cse0 (_ bv8 32) .cse1)))) (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| |c_create_data_#t~mem9.base| v_ArrVal_286) c_create_data_~data~0.base) .cse2) (_ bv8 32) .cse1) (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-14 01:53:01,193 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (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 (_ bv4 32) .cse0 .cse1) (bvadd (_ bv8 32) .cse0 .cse1)))) (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_286) c_create_data_~data~0.base) .cse3) .cse1) (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-14 01:53:01,236 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (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 (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 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 (_ bv12 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-14 01:53:01,304 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32))) (.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (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| |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 (_ bv8 32) .cse1) (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 ((.cse4 (store |c_#memory_$Pointer$.base| |c_create_data_#t~mem9.base| 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| |c_create_data_#t~mem9.base| v_ArrVal_283) .cse3 v_ArrVal_286) c_create_data_~data~0.base) .cse2) .cse1 (_ 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-14 01:53:01,639 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (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-14 01:53:01,656 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:01,656 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-14 01:53:01,664 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:01,665 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-14 01:53:01,669 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-14 01:53:01,679 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-14 01:53:01,700 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-14 01:53:01,707 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 958 [2023-02-14 01:53:01,713 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 958 treesize of output 862 [2023-02-14 01:53:01,720 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-14 01:53:10,660 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:10,661 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-14 01:53:10,673 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:10,673 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-14 01:53:10,695 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-14 01:53:10,701 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-14 01:53:10,713 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-14 01:53:10,717 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-14 01:53:10,727 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-14 01:53:11,211 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2023-02-14 01:53:11,212 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:53:11,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [100691294] [2023-02-14 01:53:11,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [100691294] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:53:11,212 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:53:11,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 19 [2023-02-14 01:53:11,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913137685] [2023-02-14 01:53:11,212 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:53:11,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-14 01:53:11,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:53:11,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-14 01:53:11,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=160, Unknown=9, NotChecked=150, Total=380 [2023-02-14 01:53:11,213 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-14 01:53:13,855 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse4 (select (select |c_#memory_$Pointer$.offset| c_create_data_~data~0.base) .cse3)) (.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (let ((.cse5 (bvadd (_ bv8 32) .cse4 .cse1)) (.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 (_ bv8 32) .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv12 32))))) (bvule (bvadd (_ bv4 32) .cse4 .cse1) .cse5) (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 (_ bv12 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_285) c_create_data_~data~0.base) .cse3)))) (bvule .cse5 (select |c_#length| .cse2)))))) is different from false [2023-02-14 01:53:13,872 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (let ((.cse5 (select (select |c_#memory_$Pointer$.offset| c_create_data_~data~0.base) .cse4)) (.cse3 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| c_create_data_~data~0.base) .cse4)) (.cse0 (bvadd (_ bv4 32) .cse5 .cse3))) (and (bvule .cse0 (select |c_#length| .cse1)) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_286) c_create_data_~data~0.base) .cse4))) (bvule (bvadd (_ bv4 32) .cse2 .cse3) (bvadd (_ bv8 32) .cse2 .cse3)))) (forall ((v_ArrVal_285 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_286) c_create_data_~data~0.base) .cse4) .cse3) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_285) c_create_data_~data~0.base) .cse4)))) (bvule (bvadd .cse5 .cse3) .cse0))))) is different from false [2023-02-14 01:53:14,011 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvmul c_create_data_~counter~0 (_ bv4 32)))) (let ((.cse0 (bvadd (_ bv4 32) |c_create_data_#t~mem9.offset| .cse1)) (.cse3 (bvadd (_ bv4 32) c_create_data_~data~0.offset))) (and (bvule .cse0 (select |c_#length| |c_create_data_#t~mem9.base|)) (bvule (bvadd |c_create_data_#t~mem9.offset| .cse1) .cse0) (forall ((v_ArrVal_286 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_create_data_#t~mem9.base| v_ArrVal_286) c_create_data_~data~0.base) .cse3))) (bvule (bvadd (_ bv4 32) .cse2 .cse1) (bvadd .cse2 (_ bv8 32) .cse1)))) (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| |c_create_data_#t~mem9.base| v_ArrVal_286) c_create_data_~data~0.base) .cse3) (_ bv8 32) .cse1) (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) .cse3))))))) is different from false [2023-02-14 01:53:17,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:17,863 INFO L93 Difference]: Finished difference Result 304 states and 355 transitions. [2023-02-14 01:53:17,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-14 01:53:17,864 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-14 01:53:17,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:17,865 INFO L225 Difference]: With dead ends: 304 [2023-02-14 01:53:17,865 INFO L226 Difference]: Without dead ends: 304 [2023-02-14 01:53:17,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=106, Invalid=294, Unknown=12, NotChecked=344, Total=756 [2023-02-14 01:53:17,866 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 27 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 7 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 1461 SdHoareTripleChecker+Invalid, 1487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 582 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:17,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 1461 Invalid, 1487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 897 Invalid, 1 Unknown, 582 Unchecked, 4.6s Time] [2023-02-14 01:53:17,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2023-02-14 01:53:17,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 264. [2023-02-14 01:53:17,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 200 states have (on average 1.515) internal successors, (303), 259 states have internal predecessors, (303), 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-14 01:53:17,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 307 transitions. [2023-02-14 01:53:17,871 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 307 transitions. Word has length 27 [2023-02-14 01:53:17,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:17,871 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 307 transitions. [2023-02-14 01:53:17,871 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-14 01:53:17,871 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 307 transitions. [2023-02-14 01:53:17,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-14 01:53:17,872 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:17,872 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-14 01:53:17,881 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-14 01:53:18,080 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-14 01:53:18,081 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting create_dataErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-14 01:53:18,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:18,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1939829061, now seen corresponding path program 1 times [2023-02-14 01:53:18,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:53:18,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1816628105] [2023-02-14 01:53:18,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:18,082 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-14 01:53:18,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:53:18,083 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-14 01:53:18,085 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-14 01:53:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:18,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-14 01:53:18,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:18,217 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-14 01:53:18,222 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-14 01:53:18,222 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:53:18,222 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:53:18,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1816628105] [2023-02-14 01:53:18,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1816628105] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:53:18,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:53:18,222 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 01:53:18,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395619754] [2023-02-14 01:53:18,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:53:18,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 01:53:18,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:53:18,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 01:53:18,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 01:53:18,224 INFO L87 Difference]: Start difference. First operand 264 states and 307 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-14 01:53:18,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:18,426 INFO L93 Difference]: Finished difference Result 266 states and 301 transitions. [2023-02-14 01:53:18,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 01:53:18,426 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-14 01:53:18,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:18,427 INFO L225 Difference]: With dead ends: 266 [2023-02-14 01:53:18,427 INFO L226 Difference]: Without dead ends: 266 [2023-02-14 01:53:18,428 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-14 01:53:18,428 INFO L413 NwaCegarLoop]: 153 mSDtfsCounter, 22 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 235 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.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:18,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 235 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:53:18,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2023-02-14 01:53:18,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 260. [2023-02-14 01:53:18,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 200 states have (on average 1.455) internal successors, (291), 255 states have internal predecessors, (291), 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-14 01:53:18,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 295 transitions. [2023-02-14 01:53:18,447 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 295 transitions. Word has length 41 [2023-02-14 01:53:18,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:18,449 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 295 transitions. [2023-02-14 01:53:18,449 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-14 01:53:18,449 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 295 transitions. [2023-02-14 01:53:18,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-14 01:53:18,450 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:18,450 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-14 01:53:18,462 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-14 01:53:18,659 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-14 01:53:18,659 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting create_dataErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-14 01:53:18,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:18,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1939829060, now seen corresponding path program 1 times [2023-02-14 01:53:18,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:53:18,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1517602508] [2023-02-14 01:53:18,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:18,660 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-14 01:53:18,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:53:18,661 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-14 01:53:18,662 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-14 01:53:18,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:18,814 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 01:53:18,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:18,825 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-14 01:53:18,833 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-14 01:53:18,833 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:53:18,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:53:18,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1517602508] [2023-02-14 01:53:18,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1517602508] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:53:18,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:53:18,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-14 01:53:18,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066414112] [2023-02-14 01:53:18,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:53:18,834 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-14 01:53:18,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:53:18,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-14 01:53:18,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-14 01:53:18,835 INFO L87 Difference]: Start difference. First operand 260 states and 295 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-14 01:53:19,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:19,060 INFO L93 Difference]: Finished difference Result 262 states and 289 transitions. [2023-02-14 01:53:19,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-14 01:53:19,061 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-14 01:53:19,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:19,062 INFO L225 Difference]: With dead ends: 262 [2023-02-14 01:53:19,062 INFO L226 Difference]: Without dead ends: 262 [2023-02-14 01:53:19,062 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-14 01:53:19,063 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 18 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:19,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 233 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:53:19,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2023-02-14 01:53:19,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 256. [2023-02-14 01:53:19,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 200 states have (on average 1.395) internal successors, (279), 251 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-14 01:53:19,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 283 transitions. [2023-02-14 01:53:19,067 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 283 transitions. Word has length 41 [2023-02-14 01:53:19,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:19,067 INFO L495 AbstractCegarLoop]: Abstraction has 256 states and 283 transitions. [2023-02-14 01:53:19,067 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-14 01:53:19,068 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 283 transitions. [2023-02-14 01:53:19,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-14 01:53:19,068 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:19,068 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-14 01:53:19,091 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-14 01:53:19,289 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-14 01:53:19,289 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting create_dataErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-14 01:53:19,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:19,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1997336807, now seen corresponding path program 3 times [2023-02-14 01:53:19,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:53:19,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [986748119] [2023-02-14 01:53:19,290 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-14 01:53:19,290 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-14 01:53:19,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:53:19,291 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-14 01:53:19,291 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-14 01:53:19,809 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-02-14 01:53:19,809 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-14 01:53:19,824 INFO L263 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-14 01:53:19,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:19,873 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 38 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 01:53:19,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:53:19,943 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 38 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 01:53:19,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:53:19,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [986748119] [2023-02-14 01:53:19,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [986748119] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:53:19,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:53:19,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-02-14 01:53:19,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679271127] [2023-02-14 01:53:19,944 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:53:19,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-14 01:53:19,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:53:19,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-14 01:53:19,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-14 01:53:19,945 INFO L87 Difference]: Start difference. First operand 256 states and 283 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:20,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:20,054 INFO L93 Difference]: Finished difference Result 233 states and 253 transitions. [2023-02-14 01:53:20,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 01:53:20,055 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2023-02-14 01:53:20,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:20,056 INFO L225 Difference]: With dead ends: 233 [2023-02-14 01:53:20,056 INFO L226 Difference]: Without dead ends: 233 [2023-02-14 01:53:20,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-02-14 01:53:20,056 INFO L413 NwaCegarLoop]: 158 mSDtfsCounter, 156 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:20,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 976 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-14 01:53:20,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-02-14 01:53:20,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2023-02-14 01:53:20,059 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-14 01:53:20,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 251 transitions. [2023-02-14 01:53:20,060 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 251 transitions. Word has length 42 [2023-02-14 01:53:20,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:20,060 INFO L495 AbstractCegarLoop]: Abstraction has 231 states and 251 transitions. [2023-02-14 01:53:20,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 10 states have internal predecessors, (52), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-14 01:53:20,060 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 251 transitions. [2023-02-14 01:53:20,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-14 01:53:20,061 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:20,061 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-14 01:53:20,081 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-14 01:53:20,261 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-14 01:53:20,262 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-14 01:53:20,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:20,262 INFO L85 PathProgramCache]: Analyzing trace with hash -663465002, now seen corresponding path program 1 times [2023-02-14 01:53:20,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:53:20,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214829585] [2023-02-14 01:53:20,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:20,263 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-14 01:53:20,263 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:53:20,264 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-14 01:53:20,268 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-14 01:53:20,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:20,493 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-14 01:53:20,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:20,498 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-14 01:53:20,529 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-14 01:53:20,555 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-14 01:53:20,690 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2023-02-14 01:53:20,690 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-14 01:53:20,698 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-14 01:53:20,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:53:21,924 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-14 01:53:21,924 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:53:21,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214829585] [2023-02-14 01:53:21,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214829585] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-14 01:53:21,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 01:53:21,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2023-02-14 01:53:21,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137787126] [2023-02-14 01:53:21,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:53:21,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 01:53:21,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:53:21,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 01:53:21,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-14 01:53:21,926 INFO L87 Difference]: Start difference. First operand 231 states and 251 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 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-14 01:53:22,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:22,316 INFO L93 Difference]: Finished difference Result 254 states and 275 transitions. [2023-02-14 01:53:22,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 01:53:22,317 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 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-14 01:53:22,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:22,318 INFO L225 Difference]: With dead ends: 254 [2023-02-14 01:53:22,318 INFO L226 Difference]: Without dead ends: 254 [2023-02-14 01:53:22,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-14 01:53:22,318 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 97 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:22,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 201 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-14 01:53:22,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2023-02-14 01:53:22,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 229. [2023-02-14 01:53:22,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 176 states have (on average 1.3920454545454546) internal successors, (245), 224 states have internal predecessors, (245), 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-14 01:53:22,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 249 transitions. [2023-02-14 01:53:22,323 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 249 transitions. Word has length 44 [2023-02-14 01:53:22,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:22,323 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 249 transitions. [2023-02-14 01:53:22,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 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-14 01:53:22,323 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 249 transitions. [2023-02-14 01:53:22,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-02-14 01:53:22,324 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:22,324 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-14 01:53:22,351 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-14 01:53:22,552 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-14 01:53:22,552 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-14 01:53:22,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:22,554 INFO L85 PathProgramCache]: Analyzing trace with hash -663465001, now seen corresponding path program 1 times [2023-02-14 01:53:22,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:53:22,554 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [881301427] [2023-02-14 01:53:22,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:22,554 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-14 01:53:22,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:53:22,555 INFO L229 MonitoredProcess]: Starting monitored process 20 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-14 01:53:22,596 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 (20)] Waiting until timeout for monitored process [2023-02-14 01:53:22,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:22,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-14 01:53:22,819 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:22,825 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-14 01:53:22,829 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-14 01:53:22,898 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-14 01:53:22,929 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-14 01:53:22,935 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_811 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_arrayElimCell_51 (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_811) v_arrayElimCell_51 (_ bv80 32))))) is different from true [2023-02-14 01:53:23,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:53:23,083 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-14 01:53:23,084 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-14 01:53:23,105 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:53:23,105 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-14 01:53:23,145 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-14 01:53:23,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:53:23,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:53:23,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [881301427] [2023-02-14 01:53:23,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [881301427] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:53:23,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [682115002] [2023-02-14 01:53:23,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:23,377 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 01:53:23,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 01:53:23,379 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-14 01:53:23,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2023-02-14 01:53:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:23,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-14 01:53:23,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:23,904 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-14 01:53:23,908 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-14 01:53:23,947 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (exists ((v_ArrVal_927 (_ BitVec 32))) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_927) |c_create_data_#t~malloc7.base| (_ bv80 32)) |c_#length|)))) is different from true [2023-02-14 01:53:23,953 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32)) (v_ArrVal_927 (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_927) |create_data_#t~malloc7.base| (_ bv80 32)) |c_#length|))) is different from true [2023-02-14 01:53:24,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:53:24,110 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-14 01:53:24,110 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-14 01:53:24,120 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:53:24,120 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-14 01:53:24,140 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-14 01:53:24,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:53:24,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [682115002] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:53:24,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 01:53:24,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2023-02-14 01:53:24,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891116679] [2023-02-14 01:53:24,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:53:24,141 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 01:53:24,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:53:24,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 01:53:24,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=73, Unknown=3, NotChecked=54, Total=156 [2023-02-14 01:53:24,141 INFO L87 Difference]: Start difference. First operand 229 states and 249 transitions. Second operand has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 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-14 01:53:25,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:25,009 INFO L93 Difference]: Finished difference Result 377 states and 412 transitions. [2023-02-14 01:53:25,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 01:53:25,009 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 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-14 01:53:25,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:25,011 INFO L225 Difference]: With dead ends: 377 [2023-02-14 01:53:25,011 INFO L226 Difference]: Without dead ends: 377 [2023-02-14 01:53:25,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=87, Unknown=3, NotChecked=60, Total=182 [2023-02-14 01:53:25,011 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 148 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 493 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:25,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 424 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 476 Invalid, 0 Unknown, 493 Unchecked, 0.8s Time] [2023-02-14 01:53:25,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2023-02-14 01:53:25,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 244. [2023-02-14 01:53:25,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 189 states have (on average 1.3862433862433863) internal successors, (262), 237 states have internal predecessors, (262), 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-14 01:53:25,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 268 transitions. [2023-02-14 01:53:25,016 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 268 transitions. Word has length 44 [2023-02-14 01:53:25,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:25,016 INFO L495 AbstractCegarLoop]: Abstraction has 244 states and 268 transitions. [2023-02-14 01:53:25,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 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-14 01:53:25,016 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 268 transitions. [2023-02-14 01:53:25,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-14 01:53:25,017 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:25,017 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-14 01:53:25,028 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 (20)] Ended with exit code 0 [2023-02-14 01:53:25,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2023-02-14 01:53:25,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-14 01:53:25,428 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-14 01:53:25,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:25,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1359492876, now seen corresponding path program 1 times [2023-02-14 01:53:25,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:53:25,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860236650] [2023-02-14 01:53:25,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:25,429 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-14 01:53:25,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:53:25,429 INFO L229 MonitoredProcess]: Starting monitored process 22 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-14 01:53:25,430 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 (22)] Waiting until timeout for monitored process [2023-02-14 01:53:25,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:25,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-14 01:53:25,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:25,693 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:53:25,694 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:53:25,694 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-14 01:53:25,695 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-14 01:53:25,753 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:25,754 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-14 01:53:25,779 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-14 01:53:25,779 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:53:25,779 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:53:25,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860236650] [2023-02-14 01:53:25,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1860236650] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:53:25,779 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:53:25,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-14 01:53:25,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960131830] [2023-02-14 01:53:25,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:53:25,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 01:53:25,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:53:25,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 01:53:25,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:53:25,780 INFO L87 Difference]: Start difference. First operand 244 states and 268 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-14 01:53:26,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:26,196 INFO L93 Difference]: Finished difference Result 286 states and 318 transitions. [2023-02-14 01:53:26,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 01:53:26,197 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-14 01:53:26,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:26,198 INFO L225 Difference]: With dead ends: 286 [2023-02-14 01:53:26,198 INFO L226 Difference]: Without dead ends: 286 [2023-02-14 01:53:26,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2023-02-14 01:53:26,198 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 28 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 696 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-14 01:53:26,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 696 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 01:53:26,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2023-02-14 01:53:26,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 254. [2023-02-14 01:53:26,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 199 states have (on average 1.3718592964824121) internal successors, (273), 247 states have internal predecessors, (273), 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-14 01:53:26,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 279 transitions. [2023-02-14 01:53:26,202 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 279 transitions. Word has length 46 [2023-02-14 01:53:26,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:26,203 INFO L495 AbstractCegarLoop]: Abstraction has 254 states and 279 transitions. [2023-02-14 01:53:26,203 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-14 01:53:26,203 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 279 transitions. [2023-02-14 01:53:26,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-14 01:53:26,203 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:26,203 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-14 01:53:26,215 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 (22)] Forceful destruction successful, exit code 0 [2023-02-14 01:53:26,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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-14 01:53:26,404 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-14 01:53:26,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:26,404 INFO L85 PathProgramCache]: Analyzing trace with hash 918765396, now seen corresponding path program 1 times [2023-02-14 01:53:26,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:53:26,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [661733534] [2023-02-14 01:53:26,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:26,405 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-14 01:53:26,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:53:26,405 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-14 01:53:26,407 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-14 01:53:26,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:26,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-14 01:53:26,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:26,570 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-14 01:53:26,570 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:53:26,571 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:53:26,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [661733534] [2023-02-14 01:53:26,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [661733534] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:53:26,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:53:26,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 01:53:26,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706866545] [2023-02-14 01:53:26,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:53:26,571 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 01:53:26,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:53:26,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 01:53:26,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 01:53:26,572 INFO L87 Difference]: Start difference. First operand 254 states and 279 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-14 01:53:26,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:26,587 INFO L93 Difference]: Finished difference Result 262 states and 285 transitions. [2023-02-14 01:53:26,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 01:53:26,587 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-14 01:53:26,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:26,588 INFO L225 Difference]: With dead ends: 262 [2023-02-14 01:53:26,588 INFO L226 Difference]: Without dead ends: 262 [2023-02-14 01:53:26,588 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-14 01:53:26,589 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 3 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 449 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-14 01:53:26,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 449 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-14 01:53:26,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2023-02-14 01:53:26,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2023-02-14 01:53:26,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 205 states have (on average 1.351219512195122) internal successors, (277), 253 states have internal predecessors, (277), 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-14 01:53:26,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 283 transitions. [2023-02-14 01:53:26,593 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 283 transitions. Word has length 46 [2023-02-14 01:53:26,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:26,593 INFO L495 AbstractCegarLoop]: Abstraction has 260 states and 283 transitions. [2023-02-14 01:53:26,593 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-14 01:53:26,593 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 283 transitions. [2023-02-14 01:53:26,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-14 01:53:26,594 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:26,594 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-14 01:53:26,613 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-14 01:53:26,813 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-14 01:53:26,813 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-14 01:53:26,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:26,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1934703003, now seen corresponding path program 1 times [2023-02-14 01:53:26,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:53:26,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1580060765] [2023-02-14 01:53:26,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:26,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-14 01:53:26,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:53:26,815 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-14 01:53:26,841 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-14 01:53:27,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:27,064 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-14 01:53:27,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:27,068 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-14 01:53:27,096 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-14 01:53:27,124 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-14 01:53:27,253 INFO L321 Elim1Store]: treesize reduction 56, result has 25.3 percent of original size [2023-02-14 01:53:27,253 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-14 01:53:27,299 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-14 01:53:27,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:53:31,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:53:31,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1580060765] [2023-02-14 01:53:31,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1580060765] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:53:31,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1364514456] [2023-02-14 01:53:31,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:31,436 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 01:53:31,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 01:53:31,437 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-14 01:53:31,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Waiting until timeout for monitored process [2023-02-14 01:53:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:31,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-14 01:53:31,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:31,912 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-14 01:53:32,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:53:32,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:53:32,333 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-14 01:53:32,334 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-14 01:53:32,388 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-14 01:53:32,388 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:53:32,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1364514456] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:53:32,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 01:53:32,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2023-02-14 01:53:32,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750719712] [2023-02-14 01:53:32,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:53:32,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 01:53:32,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:53:32,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 01:53:32,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=170, Unknown=2, NotChecked=0, Total=210 [2023-02-14 01:53:32,390 INFO L87 Difference]: Start difference. First operand 260 states and 283 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-14 01:53:33,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:33,443 INFO L93 Difference]: Finished difference Result 346 states and 373 transitions. [2023-02-14 01:53:33,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 01:53:33,444 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-14 01:53:33,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:33,445 INFO L225 Difference]: With dead ends: 346 [2023-02-14 01:53:33,445 INFO L226 Difference]: Without dead ends: 346 [2023-02-14 01:53:33,445 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-14 01:53:33,445 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 509 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 18 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 509 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:33,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [509 Valid, 374 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 396 Invalid, 14 Unknown, 0 Unchecked, 1.0s Time] [2023-02-14 01:53:33,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2023-02-14 01:53:33,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 271. [2023-02-14 01:53:33,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 214 states have (on average 1.3504672897196262) internal successors, (289), 262 states have internal predecessors, (289), 2 states have call successors, (2), 2 states have call predecessors, (2), 6 states have return successors, (6), 6 states have call predecessors, (6), 2 states have call successors, (6) [2023-02-14 01:53:33,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 297 transitions. [2023-02-14 01:53:33,449 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 297 transitions. Word has length 46 [2023-02-14 01:53:33,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:33,449 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 297 transitions. [2023-02-14 01:53:33,449 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-14 01:53:33,449 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 297 transitions. [2023-02-14 01:53:33,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-14 01:53:33,450 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:33,450 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-14 01:53:33,465 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-14 01:53:33,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (25)] Forceful destruction successful, exit code 0 [2023-02-14 01:53:33,850 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,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-14 01:53:33,851 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-14 01:53:33,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:33,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1934703002, now seen corresponding path program 1 times [2023-02-14 01:53:33,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:53:33,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460917640] [2023-02-14 01:53:33,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:33,851 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-14 01:53:33,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:53:33,858 INFO L229 MonitoredProcess]: Starting monitored process 26 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-14 01:53:33,859 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 (26)] Waiting until timeout for monitored process [2023-02-14 01:53:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:34,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 18 conjunts are in the unsatisfiable core [2023-02-14 01:53:34,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:34,136 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-14 01:53:34,210 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-14 01:53:34,251 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-14 01:53:34,258 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1477 (_ BitVec 32)) (v_arrayElimCell_67 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_1477) v_arrayElimCell_67 (_ bv80 32)) |c_#length|))) is different from true [2023-02-14 01:53:34,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:53:34,466 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-14 01:53:34,466 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-14 01:53:34,480 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:53:34,480 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-14 01:53:34,553 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-14 01:53:34,554 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:53:36,681 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_append_~pointerToList#1.offset|))) (and (forall ((v_create_data_~data~0.base_58 (_ BitVec 32))) (or (not (= (select |c_#valid| v_create_data_~data~0.base_58) (_ bv0 1))) (forall ((v_ArrVal_1485 (_ BitVec 32)) (|v_create_data_#t~malloc7.base_34| (_ BitVec 32))) (bvule .cse0 (select (store (store |c_#length| v_create_data_~data~0.base_58 v_ArrVal_1485) |v_create_data_#t~malloc7.base_34| (_ bv80 32)) |c_ULTIMATE.start_append_~pointerToList#1.base|))))) (or (forall ((v_create_data_~data~0.base_58 (_ BitVec 32))) (not (= (select |c_#valid| v_create_data_~data~0.base_58) (_ bv0 1)))) (bvule |c_ULTIMATE.start_append_~pointerToList#1.offset| .cse0)))) is different from false [2023-02-14 01:53:36,684 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:53:36,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460917640] [2023-02-14 01:53:36,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460917640] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:53:36,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [190720767] [2023-02-14 01:53:36,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:36,685 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 01:53:36,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 01:53:36,686 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-14 01:53:36,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Waiting until timeout for monitored process [2023-02-14 01:53:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:37,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-14 01:53:37,096 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:37,101 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-14 01:53:37,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:53:37,131 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-14 01:53:37,256 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-14 01:53:37,305 WARN L859 $PredicateComparison]: unable to prove that (and (not (= |c_#StackHeapBarrier| (_ bv0 32))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (exists ((v_ArrVal_1597 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_1596 (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (bvult create_data_~data~0.base |c_#StackHeapBarrier|) (bvult |create_data_#t~malloc7.base| |c_#StackHeapBarrier|) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_1597) |create_data_#t~malloc7.base| v_ArrVal_1596) |c_#length|)))) is different from true [2023-02-14 01:53:37,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:53:37,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:53:37,718 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 01:53:37,718 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-14 01:53:37,831 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-14 01:53:37,832 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:53:37,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [190720767] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:53:37,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 01:53:37,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2023-02-14 01:53:37,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566480888] [2023-02-14 01:53:37,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:53:37,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 01:53:37,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:53:37,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 01:53:37,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=176, Unknown=3, NotChecked=84, Total=306 [2023-02-14 01:53:37,833 INFO L87 Difference]: Start difference. First operand 271 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-14 01:53:38,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:38,963 INFO L93 Difference]: Finished difference Result 376 states and 408 transitions. [2023-02-14 01:53:38,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 01:53:38,964 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-14 01:53:38,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:38,965 INFO L225 Difference]: With dead ends: 376 [2023-02-14 01:53:38,965 INFO L226 Difference]: Without dead ends: 376 [2023-02-14 01:53:38,965 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=56, Invalid=225, Unknown=3, NotChecked=96, Total=380 [2023-02-14 01:53:38,966 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 76 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 393 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 312 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:38,966 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 498 Invalid, 707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 393 Invalid, 0 Unknown, 312 Unchecked, 1.1s Time] [2023-02-14 01:53:38,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2023-02-14 01:53:38,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 309. [2023-02-14 01:53:38,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 250 states have (on average 1.308) internal successors, (327), 298 states have internal predecessors, (327), 3 states have call successors, (3), 3 states have call predecessors, (3), 7 states have return successors, (9), 7 states have call predecessors, (9), 3 states have call successors, (9) [2023-02-14 01:53:38,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 339 transitions. [2023-02-14 01:53:38,971 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 339 transitions. Word has length 46 [2023-02-14 01:53:38,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:38,971 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 339 transitions. [2023-02-14 01:53:38,971 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-14 01:53:38,972 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 339 transitions. [2023-02-14 01:53:38,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-14 01:53:38,972 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:38,972 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-14 01:53:38,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (27)] Forceful destruction successful, exit code 0 [2023-02-14 01:53:39,188 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 (26)] Forceful destruction successful, exit code 0 [2023-02-14 01:53:39,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,26 /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-14 01:53:39,378 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-14 01:53:39,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:39,378 INFO L85 PathProgramCache]: Analyzing trace with hash 2050875697, now seen corresponding path program 1 times [2023-02-14 01:53:39,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:53:39,379 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [678119764] [2023-02-14 01:53:39,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:39,379 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-14 01:53:39,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:53:39,381 INFO L229 MonitoredProcess]: Starting monitored process 28 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-14 01:53:39,385 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 (28)] Waiting until timeout for monitored process [2023-02-14 01:53:39,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:39,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-14 01:53:39,656 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:39,661 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-14 01:53:39,664 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-14 01:53:39,720 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-14 01:53:39,751 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-14 01:53:39,758 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1702 (_ BitVec 32)) (v_arrayElimCell_74 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_1702) v_arrayElimCell_74 (_ bv80 32))))) is different from true [2023-02-14 01:53:39,893 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:53:39,914 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-14 01:53:39,914 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-14 01:53:39,923 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:53:39,923 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-14 01:53:39,949 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-14 01:53:39,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:53:42,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:53:42,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [678119764] [2023-02-14 01:53:42,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [678119764] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:53:42,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1496897833] [2023-02-14 01:53:42,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:42,141 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 01:53:42,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 01:53:42,142 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-14 01:53:42,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Waiting until timeout for monitored process [2023-02-14 01:53:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:42,699 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-14 01:53:42,701 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:42,722 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-14 01:53:42,725 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-14 01:53:42,764 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (exists ((v_ArrVal_1819 (_ BitVec 32))) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_1819) |c_create_data_#t~malloc7.base| (_ bv80 32)) |c_#length|)))) is different from true [2023-02-14 01:53:42,772 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (v_ArrVal_1819 (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_1819) |create_data_#t~malloc7.base| (_ bv80 32))))) is different from true [2023-02-14 01:53:42,925 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:53:42,947 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-14 01:53:42,947 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-14 01:53:42,957 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:53:42,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-14 01:53:42,976 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-14 01:53:42,977 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:53:42,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1496897833] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:53:42,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 01:53:42,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 10 [2023-02-14 01:53:42,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360909207] [2023-02-14 01:53:42,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:53:42,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 01:53:42,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:53:42,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 01:53:42,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=72, Unknown=4, NotChecked=54, Total=156 [2023-02-14 01:53:42,978 INFO L87 Difference]: Start difference. First operand 309 states and 339 transitions. Second operand has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 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-14 01:53:43,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:43,718 INFO L93 Difference]: Finished difference Result 447 states and 487 transitions. [2023-02-14 01:53:43,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 01:53:43,719 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 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-14 01:53:43,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:43,720 INFO L225 Difference]: With dead ends: 447 [2023-02-14 01:53:43,720 INFO L226 Difference]: Without dead ends: 447 [2023-02-14 01:53:43,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 84 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=37, Invalid=103, Unknown=4, NotChecked=66, Total=210 [2023-02-14 01:53:43,721 INFO L413 NwaCegarLoop]: 180 mSDtfsCounter, 231 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 1158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 646 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:43,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 479 Invalid, 1158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 507 Invalid, 0 Unknown, 646 Unchecked, 0.7s Time] [2023-02-14 01:53:43,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2023-02-14 01:53:43,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 318. [2023-02-14 01:53:43,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 258 states have (on average 1.306201550387597) internal successors, (337), 307 states have internal predecessors, (337), 3 states have call successors, (3), 3 states have call predecessors, (3), 8 states have return successors, (11), 7 states have call predecessors, (11), 3 states have call successors, (11) [2023-02-14 01:53:43,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 351 transitions. [2023-02-14 01:53:43,726 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 351 transitions. Word has length 48 [2023-02-14 01:53:43,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:43,726 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 351 transitions. [2023-02-14 01:53:43,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.142857142857143) internal successors, (36), 7 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-14 01:53:43,727 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 351 transitions. [2023-02-14 01:53:43,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-14 01:53:43,727 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:43,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] [2023-02-14 01:53:43,744 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (29)] Forceful destruction successful, exit code 0 [2023-02-14 01:53:43,942 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 (28)] Forceful destruction successful, exit code 0 [2023-02-14 01:53:44,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,28 /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-14 01:53:44,133 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-14 01:53:44,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:44,133 INFO L85 PathProgramCache]: Analyzing trace with hash 471257990, now seen corresponding path program 1 times [2023-02-14 01:53:44,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:53:44,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2078845579] [2023-02-14 01:53:44,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:44,134 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-14 01:53:44,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:53:44,134 INFO L229 MonitoredProcess]: Starting monitored process 30 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-14 01:53:44,135 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 (30)] Waiting until timeout for monitored process [2023-02-14 01:53:44,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:44,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-14 01:53:44,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:44,326 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-14 01:53:44,326 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:53:44,326 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:53:44,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2078845579] [2023-02-14 01:53:44,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2078845579] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:53:44,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:53:44,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-14 01:53:44,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768489504] [2023-02-14 01:53:44,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:53:44,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 01:53:44,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:53:44,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 01:53:44,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 01:53:44,327 INFO L87 Difference]: Start difference. First operand 318 states and 351 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-14 01:53:44,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:44,528 INFO L93 Difference]: Finished difference Result 317 states and 350 transitions. [2023-02-14 01:53:44,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 01:53:44,528 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-14 01:53:44,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:44,529 INFO L225 Difference]: With dead ends: 317 [2023-02-14 01:53:44,529 INFO L226 Difference]: Without dead ends: 317 [2023-02-14 01:53:44,530 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-14 01:53:44,530 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 140 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:44,530 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 215 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-14 01:53:44,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2023-02-14 01:53:44,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2023-02-14 01:53:44,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 317 states, 258 states have (on average 1.302325581395349) internal successors, (336), 306 states have internal predecessors, (336), 3 states have call successors, (3), 3 states have call predecessors, (3), 8 states have return successors, (11), 7 states have call predecessors, (11), 3 states have call successors, (11) [2023-02-14 01:53:44,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 350 transitions. [2023-02-14 01:53:44,535 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 350 transitions. Word has length 48 [2023-02-14 01:53:44,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:44,535 INFO L495 AbstractCegarLoop]: Abstraction has 317 states and 350 transitions. [2023-02-14 01:53:44,535 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-14 01:53:44,535 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 350 transitions. [2023-02-14 01:53:44,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-14 01:53:44,535 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:44,536 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-14 01:53:44,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 (30)] Forceful destruction successful, exit code 0 [2023-02-14 01:53:44,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /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-14 01:53:44,744 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-14 01:53:44,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:44,745 INFO L85 PathProgramCache]: Analyzing trace with hash 471257991, now seen corresponding path program 1 times [2023-02-14 01:53:44,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:53:44,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [192527544] [2023-02-14 01:53:44,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:44,745 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-14 01:53:44,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:53:44,746 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-14 01:53:44,747 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-14 01:53:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:44,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-14 01:53:44,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:44,997 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-14 01:53:44,998 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:53:44,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:53:44,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [192527544] [2023-02-14 01:53:44,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [192527544] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:53:44,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:53:44,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-14 01:53:44,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45797254] [2023-02-14 01:53:44,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:53:44,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 01:53:44,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:53:44,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 01:53:44,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:53:44,999 INFO L87 Difference]: Start difference. First operand 317 states and 350 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-14 01:53:45,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:45,280 INFO L93 Difference]: Finished difference Result 308 states and 341 transitions. [2023-02-14 01:53:45,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 01:53:45,280 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-14 01:53:45,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:45,296 INFO L225 Difference]: With dead ends: 308 [2023-02-14 01:53:45,296 INFO L226 Difference]: Without dead ends: 308 [2023-02-14 01:53:45,297 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-14 01:53:45,297 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 137 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 273 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.3s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:45,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 273 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 01:53:45,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2023-02-14 01:53:45,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2023-02-14 01:53:45,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 258 states have (on average 1.2674418604651163) internal successors, (327), 297 states have internal predecessors, (327), 3 states have call successors, (3), 3 states have call predecessors, (3), 8 states have return successors, (11), 7 states have call predecessors, (11), 3 states have call successors, (11) [2023-02-14 01:53:45,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 341 transitions. [2023-02-14 01:53:45,301 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 341 transitions. Word has length 48 [2023-02-14 01:53:45,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:45,302 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 341 transitions. [2023-02-14 01:53:45,302 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-14 01:53:45,302 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 341 transitions. [2023-02-14 01:53:45,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-14 01:53:45,302 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:45,302 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-14 01:53:45,316 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-14 01:53:45,502 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 [2023-02-14 01:53:45,503 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-14 01:53:45,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:45,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1724095953, now seen corresponding path program 1 times [2023-02-14 01:53:45,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:53:45,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1924024686] [2023-02-14 01:53:45,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:45,503 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-14 01:53:45,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:53:45,504 INFO L229 MonitoredProcess]: Starting monitored process 32 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-14 01:53:45,505 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 (32)] Waiting until timeout for monitored process [2023-02-14 01:53:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:45,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-14 01:53:45,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:45,759 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-14 01:53:45,769 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-14 01:53:45,782 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-14 01:53:45,782 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:53:45,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:53:45,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1924024686] [2023-02-14 01:53:45,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1924024686] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:53:45,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:53:45,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 01:53:45,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022992659] [2023-02-14 01:53:45,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:53:45,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 01:53:45,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:53:45,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 01:53:45,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:53:45,784 INFO L87 Difference]: Start difference. First operand 308 states and 341 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-14 01:53:46,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:46,117 INFO L93 Difference]: Finished difference Result 329 states and 363 transitions. [2023-02-14 01:53:46,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 01:53:46,118 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-14 01:53:46,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:46,119 INFO L225 Difference]: With dead ends: 329 [2023-02-14 01:53:46,119 INFO L226 Difference]: Without dead ends: 329 [2023-02-14 01:53:46,119 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-14 01:53:46,119 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 196 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:46,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 323 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 01:53:46,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2023-02-14 01:53:46,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 307. [2023-02-14 01:53:46,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 258 states have (on average 1.2635658914728682) internal successors, (326), 296 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 8 states have return successors, (11), 7 states have call predecessors, (11), 3 states have call successors, (11) [2023-02-14 01:53:46,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 340 transitions. [2023-02-14 01:53:46,124 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 340 transitions. Word has length 49 [2023-02-14 01:53:46,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:46,124 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 340 transitions. [2023-02-14 01:53:46,124 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-14 01:53:46,124 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 340 transitions. [2023-02-14 01:53:46,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-14 01:53:46,125 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:46,125 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-14 01:53:46,136 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 (32)] Forceful destruction successful, exit code 0 [2023-02-14 01:53:46,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /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-14 01:53:46,334 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-14 01:53:46,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:46,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1724095954, now seen corresponding path program 1 times [2023-02-14 01:53:46,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:53:46,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364508617] [2023-02-14 01:53:46,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:46,335 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-14 01:53:46,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:53:46,336 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-14 01:53:46,337 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-14 01:53:46,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:46,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-14 01:53:46,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:46,602 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-14 01:53:46,606 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-14 01:53:46,622 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-14 01:53:46,624 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-14 01:53:46,635 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-14 01:53:46,635 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:53:46,635 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:53:46,635 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364508617] [2023-02-14 01:53:46,635 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364508617] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:53:46,635 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:53:46,635 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 01:53:46,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269495554] [2023-02-14 01:53:46,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:53:46,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 01:53:46,636 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:53:46,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 01:53:46,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:53:46,637 INFO L87 Difference]: Start difference. First operand 307 states and 340 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-14 01:53:47,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:47,130 INFO L93 Difference]: Finished difference Result 345 states and 379 transitions. [2023-02-14 01:53:47,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 01:53:47,131 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-14 01:53:47,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:47,132 INFO L225 Difference]: With dead ends: 345 [2023-02-14 01:53:47,132 INFO L226 Difference]: Without dead ends: 345 [2023-02-14 01:53:47,132 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-14 01:53:47,132 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 178 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:47,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 337 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-14 01:53:47,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2023-02-14 01:53:47,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 306. [2023-02-14 01:53:47,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 258 states have (on average 1.2596899224806202) internal successors, (325), 295 states have internal predecessors, (325), 3 states have call successors, (3), 3 states have call predecessors, (3), 8 states have return successors, (11), 7 states have call predecessors, (11), 3 states have call successors, (11) [2023-02-14 01:53:47,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 339 transitions. [2023-02-14 01:53:47,136 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 339 transitions. Word has length 49 [2023-02-14 01:53:47,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:47,137 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 339 transitions. [2023-02-14 01:53:47,137 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-14 01:53:47,137 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 339 transitions. [2023-02-14 01:53:47,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-02-14 01:53:47,137 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:47,137 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] [2023-02-14 01:53:47,148 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-14 01:53:47,346 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-14 01:53:47,346 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-14 01:53:47,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:47,347 INFO L85 PathProgramCache]: Analyzing trace with hash -498440896, now seen corresponding path program 1 times [2023-02-14 01:53:47,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:53:47,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [319603217] [2023-02-14 01:53:47,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:47,347 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-14 01:53:47,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:53:47,348 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-14 01:53:47,350 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-14 01:53:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:47,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-14 01:53:47,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:47,701 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-14 01:53:47,732 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-14 01:53:47,737 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_2392 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_arrayElimCell_84 (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_2392) v_arrayElimCell_84 (_ bv80 32)) |c_#length|))) is different from true [2023-02-14 01:53:47,881 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:53:47,906 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-14 01:53:47,906 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-14 01:53:47,917 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:53:47,917 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-14 01:53:47,960 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-14 01:53:47,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:53:50,140 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:53:50,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [319603217] [2023-02-14 01:53:50,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [319603217] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:53:50,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1478567687] [2023-02-14 01:53:50,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:50,140 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 01:53:50,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 01:53:50,141 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-14 01:53:50,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Waiting until timeout for monitored process [2023-02-14 01:53:50,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:50,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-14 01:53:50,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:50,613 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-14 01:53:50,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:53:50,650 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-14 01:53:50,785 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-14 01:53:50,838 WARN L859 $PredicateComparison]: unable to prove that (and (not (= |c_#StackHeapBarrier| (_ bv0 32))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (exists ((v_ArrVal_2513 (_ BitVec 32)) (v_ArrVal_2514 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (bvult create_data_~data~0.base |c_#StackHeapBarrier|) (bvult |create_data_#t~malloc7.base| |c_#StackHeapBarrier|) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_2514) |create_data_#t~malloc7.base| v_ArrVal_2513) |c_#length|)))) is different from true [2023-02-14 01:53:51,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:53:51,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:53:51,290 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-14 01:53:51,290 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-14 01:53:51,388 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-14 01:53:51,388 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:53:51,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1478567687] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:53:51,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 01:53:51,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 15 [2023-02-14 01:53:51,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180823063] [2023-02-14 01:53:51,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:53:51,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-14 01:53:51,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:53:51,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-14 01:53:51,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=201, Unknown=3, NotChecked=58, Total=306 [2023-02-14 01:53:51,390 INFO L87 Difference]: Start difference. First operand 306 states and 339 transitions. Second operand has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 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-14 01:53:52,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:52,227 INFO L93 Difference]: Finished difference Result 379 states and 415 transitions. [2023-02-14 01:53:52,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 01:53:52,228 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 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 50 [2023-02-14 01:53:52,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:52,229 INFO L225 Difference]: With dead ends: 379 [2023-02-14 01:53:52,229 INFO L226 Difference]: Without dead ends: 379 [2023-02-14 01:53:52,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=57, Invalid=254, Unknown=3, NotChecked=66, Total=380 [2023-02-14 01:53:52,230 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 66 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 302 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:52,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 581 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 363 Invalid, 0 Unknown, 302 Unchecked, 0.8s Time] [2023-02-14 01:53:52,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2023-02-14 01:53:52,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 307. [2023-02-14 01:53:52,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 260 states have (on average 1.2576923076923077) internal successors, (327), 296 states have internal predecessors, (327), 3 states have call successors, (3), 3 states have call predecessors, (3), 7 states have return successors, (9), 7 states have call predecessors, (9), 3 states have call successors, (9) [2023-02-14 01:53:52,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 339 transitions. [2023-02-14 01:53:52,235 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 339 transitions. Word has length 50 [2023-02-14 01:53:52,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:52,235 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 339 transitions. [2023-02-14 01:53:52,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 5.428571428571429) internal successors, (38), 8 states have internal predecessors, (38), 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-14 01:53:52,235 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 339 transitions. [2023-02-14 01:53:52,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-14 01:53:52,236 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:52,236 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-14 01:53:52,256 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 (34)] Ended with exit code 0 [2023-02-14 01:53:52,450 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (35)] Forceful destruction successful, exit code 0 [2023-02-14 01:53:52,645 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,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-14 01:53:52,645 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-14 01:53:52,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:52,646 INFO L85 PathProgramCache]: Analyzing trace with hash -42553449, now seen corresponding path program 1 times [2023-02-14 01:53:52,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:53:52,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1358835228] [2023-02-14 01:53:52,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:52,646 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-14 01:53:52,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:53:52,647 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-14 01:53:52,648 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-14 01:53:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:52,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-14 01:53:52,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:52,940 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-14 01:53:52,957 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-14 01:53:52,964 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-14 01:53:52,964 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:53:52,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:53:52,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1358835228] [2023-02-14 01:53:52,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1358835228] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:53:52,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:53:52,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 01:53:52,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714230307] [2023-02-14 01:53:52,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:53:52,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 01:53:52,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:53:52,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 01:53:52,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:53:52,965 INFO L87 Difference]: Start difference. First operand 307 states and 339 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-14 01:53:53,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:53,315 INFO L93 Difference]: Finished difference Result 329 states and 362 transitions. [2023-02-14 01:53:53,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 01:53:53,316 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-14 01:53:53,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:53,317 INFO L225 Difference]: With dead ends: 329 [2023-02-14 01:53:53,317 INFO L226 Difference]: Without dead ends: 329 [2023-02-14 01:53:53,317 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-14 01:53:53,317 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 179 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:53,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 326 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 01:53:53,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2023-02-14 01:53:53,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 306. [2023-02-14 01:53:53,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 260 states have (on average 1.2538461538461538) internal successors, (326), 295 states have internal predecessors, (326), 3 states have call successors, (3), 3 states have call predecessors, (3), 7 states have return successors, (9), 7 states have call predecessors, (9), 3 states have call successors, (9) [2023-02-14 01:53:53,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 338 transitions. [2023-02-14 01:53:53,321 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 338 transitions. Word has length 53 [2023-02-14 01:53:53,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:53,322 INFO L495 AbstractCegarLoop]: Abstraction has 306 states and 338 transitions. [2023-02-14 01:53:53,322 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-14 01:53:53,322 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 338 transitions. [2023-02-14 01:53:53,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-14 01:53:53,322 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:53,322 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-14 01:53:53,333 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-14 01:53:53,531 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-14 01:53:53,532 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-14 01:53:53,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:53,532 INFO L85 PathProgramCache]: Analyzing trace with hash -42553448, now seen corresponding path program 1 times [2023-02-14 01:53:53,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:53:53,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1141533164] [2023-02-14 01:53:53,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:53,533 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-14 01:53:53,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:53:53,534 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-14 01:53:53,536 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-14 01:53:53,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:53,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-14 01:53:53,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:53,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-14 01:53:53,840 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-14 01:53:53,871 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-14 01:53:53,873 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-14 01:53:53,889 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-14 01:53:53,889 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:53:53,890 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:53:53,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1141533164] [2023-02-14 01:53:53,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1141533164] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:53:53,890 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:53:53,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 01:53:53,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141923409] [2023-02-14 01:53:53,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:53:53,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 01:53:53,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:53:53,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 01:53:53,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:53:53,891 INFO L87 Difference]: Start difference. First operand 306 states and 338 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-14 01:53:54,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:54,402 INFO L93 Difference]: Finished difference Result 345 states and 378 transitions. [2023-02-14 01:53:54,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 01:53:54,402 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-14 01:53:54,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:54,403 INFO L225 Difference]: With dead ends: 345 [2023-02-14 01:53:54,403 INFO L226 Difference]: Without dead ends: 345 [2023-02-14 01:53:54,404 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-14 01:53:54,404 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 163 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:54,404 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 340 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-14 01:53:54,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2023-02-14 01:53:54,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 305. [2023-02-14 01:53:54,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 260 states have (on average 1.25) internal successors, (325), 294 states have internal predecessors, (325), 3 states have call successors, (3), 3 states have call predecessors, (3), 7 states have return successors, (9), 7 states have call predecessors, (9), 3 states have call successors, (9) [2023-02-14 01:53:54,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 337 transitions. [2023-02-14 01:53:54,408 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 337 transitions. Word has length 53 [2023-02-14 01:53:54,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:54,409 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 337 transitions. [2023-02-14 01:53:54,409 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-14 01:53:54,409 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 337 transitions. [2023-02-14 01:53:54,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-14 01:53:54,409 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:54,409 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-14 01:53:54,420 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-14 01:53:54,617 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-14 01:53:54,618 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-14 01:53:54,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:54,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1556982670, now seen corresponding path program 1 times [2023-02-14 01:53:54,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:53:54,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [814799315] [2023-02-14 01:53:54,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:54,619 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-14 01:53:54,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:53:54,620 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-14 01:53:54,623 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-14 01:53:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:55,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-14 01:53:55,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:55,139 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-14 01:53:55,168 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-14 01:53:55,168 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-14 01:53:55,177 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-14 01:53:55,178 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:53:55,206 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-14 01:53:55,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:53:55,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [814799315] [2023-02-14 01:53:55,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [814799315] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:53:55,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:53:55,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 3 [2023-02-14 01:53:55,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498667507] [2023-02-14 01:53:55,207 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:53:55,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-14 01:53:55,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:53:55,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-14 01:53:55,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-14 01:53:55,208 INFO L87 Difference]: Start difference. First operand 305 states and 337 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-14 01:53:55,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:55,470 INFO L93 Difference]: Finished difference Result 304 states and 335 transitions. [2023-02-14 01:53:55,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 01:53:55,470 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-14 01:53:55,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:55,471 INFO L225 Difference]: With dead ends: 304 [2023-02-14 01:53:55,471 INFO L226 Difference]: Without dead ends: 304 [2023-02-14 01:53:55,471 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-14 01:53:55,472 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 50 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:55,472 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 238 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-14 01:53:55,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2023-02-14 01:53:55,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2023-02-14 01:53:55,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 260 states have (on average 1.2423076923076923) internal successors, (323), 293 states have internal predecessors, (323), 3 states have call successors, (3), 3 states have call predecessors, (3), 7 states have return successors, (9), 7 states have call predecessors, (9), 3 states have call successors, (9) [2023-02-14 01:53:55,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 335 transitions. [2023-02-14 01:53:55,476 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 335 transitions. Word has length 53 [2023-02-14 01:53:55,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:55,476 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 335 transitions. [2023-02-14 01:53:55,476 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-14 01:53:55,476 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 335 transitions. [2023-02-14 01:53:55,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-02-14 01:53:55,477 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:55,477 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-14 01:53:55,488 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-14 01:53:55,687 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-14 01:53:55,688 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-14 01:53:55,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:55,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1556982671, now seen corresponding path program 1 times [2023-02-14 01:53:55,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:53:55,689 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [150773954] [2023-02-14 01:53:55,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:55,689 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-14 01:53:55,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:53:55,690 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-14 01:53:55,690 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-14 01:53:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:56,160 INFO L263 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-14 01:53:56,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:56,165 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-14 01:53:56,215 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:53:56,215 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-14 01:53:56,226 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-14 01:53:56,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:53:56,405 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-14 01:53:56,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:53:56,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [150773954] [2023-02-14 01:53:56,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [150773954] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:53:56,406 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:53:56,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 4] total 6 [2023-02-14 01:53:56,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064865884] [2023-02-14 01:53:56,406 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:53:56,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 01:53:56,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:53:56,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 01:53:56,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-02-14 01:53:56,407 INFO L87 Difference]: Start difference. First operand 304 states and 335 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-14 01:53:56,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:56,864 INFO L93 Difference]: Finished difference Result 300 states and 327 transitions. [2023-02-14 01:53:56,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-14 01:53:56,865 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-14 01:53:56,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:56,866 INFO L225 Difference]: With dead ends: 300 [2023-02-14 01:53:56,866 INFO L226 Difference]: Without dead ends: 300 [2023-02-14 01:53:56,866 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-14 01:53:56,867 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 122 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:56,867 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 254 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-14 01:53:56,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2023-02-14 01:53:56,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 286. [2023-02-14 01:53:56,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 246 states have (on average 1.2235772357723578) internal successors, (301), 275 states have internal predecessors, (301), 3 states have call successors, (3), 3 states have call predecessors, (3), 7 states have return successors, (9), 7 states have call predecessors, (9), 3 states have call successors, (9) [2023-02-14 01:53:56,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 313 transitions. [2023-02-14 01:53:56,870 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 313 transitions. Word has length 53 [2023-02-14 01:53:56,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:56,871 INFO L495 AbstractCegarLoop]: Abstraction has 286 states and 313 transitions. [2023-02-14 01:53:56,871 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-14 01:53:56,871 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 313 transitions. [2023-02-14 01:53:56,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-14 01:53:56,871 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:56,872 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-14 01:53:56,897 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-14 01:53:57,083 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-14 01:53:57,084 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-14 01:53:57,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:57,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1319156755, now seen corresponding path program 1 times [2023-02-14 01:53:57,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:53:57,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [713818546] [2023-02-14 01:53:57,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:57,085 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-14 01:53:57,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:53:57,086 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-14 01:53:57,089 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-14 01:53:57,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:57,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-14 01:53:57,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:57,547 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-14 01:53:57,593 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-14 01:53:57,607 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-14 01:53:57,608 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-14 01:53:57,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 15 treesize of output 7 [2023-02-14 01:53:57,732 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-14 01:53:57,732 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-14 01:53:57,753 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-14 01:53:57,753 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:53:57,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:53:57,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [713818546] [2023-02-14 01:53:57,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [713818546] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:53:57,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:53:57,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-14 01:53:57,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614411519] [2023-02-14 01:53:57,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:53:57,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 01:53:57,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:53:57,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 01:53:57,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-02-14 01:53:57,754 INFO L87 Difference]: Start difference. First operand 286 states and 313 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-14 01:53:58,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:53:58,797 INFO L93 Difference]: Finished difference Result 341 states and 377 transitions. [2023-02-14 01:53:58,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-14 01:53:58,798 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-14 01:53:58,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:53:58,799 INFO L225 Difference]: With dead ends: 341 [2023-02-14 01:53:58,799 INFO L226 Difference]: Without dead ends: 341 [2023-02-14 01:53:58,799 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-14 01:53:58,799 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 287 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-14 01:53:58,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 489 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-14 01:53:58,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2023-02-14 01:53:58,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 295. [2023-02-14 01:53:58,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 255 states have (on average 1.227450980392157) internal successors, (313), 284 states have internal predecessors, (313), 3 states have call successors, (3), 3 states have call predecessors, (3), 7 states have return successors, (9), 7 states have call predecessors, (9), 3 states have call successors, (9) [2023-02-14 01:53:58,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 325 transitions. [2023-02-14 01:53:58,804 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 325 transitions. Word has length 54 [2023-02-14 01:53:58,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:53:58,804 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 325 transitions. [2023-02-14 01:53:58,804 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-14 01:53:58,804 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 325 transitions. [2023-02-14 01:53:58,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-02-14 01:53:58,805 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:53:58,805 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-14 01:53:58,829 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-14 01:53:59,014 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-14 01:53:59,015 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-14 01:53:59,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:53:59,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1319156754, now seen corresponding path program 1 times [2023-02-14 01:53:59,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:53:59,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [953220974] [2023-02-14 01:53:59,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:53:59,016 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-14 01:53:59,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:53:59,017 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-14 01:53:59,018 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-14 01:53:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:53:59,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 329 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-14 01:53:59,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:53:59,371 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-14 01:53:59,384 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:53:59,384 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-14 01:53:59,434 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-14 01:53:59,437 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-14 01:53:59,588 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-14 01:53:59,593 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-14 01:53:59,640 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-14 01:53:59,647 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-14 01:53:59,754 INFO L321 Elim1Store]: treesize reduction 29, result has 9.4 percent of original size [2023-02-14 01:53:59,755 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-14 01:53:59,763 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-14 01:53:59,763 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-14 01:53:59,781 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-14 01:53:59,781 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:53:59,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:53:59,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [953220974] [2023-02-14 01:53:59,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [953220974] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:53:59,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:53:59,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-14 01:53:59,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103276342] [2023-02-14 01:53:59,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:53:59,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-14 01:53:59,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:53:59,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 01:53:59,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2023-02-14 01:53:59,782 INFO L87 Difference]: Start difference. First operand 295 states and 325 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-14 01:54:01,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:54:01,291 INFO L93 Difference]: Finished difference Result 400 states and 430 transitions. [2023-02-14 01:54:01,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-14 01:54:01,292 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-14 01:54:01,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:54:01,293 INFO L225 Difference]: With dead ends: 400 [2023-02-14 01:54:01,293 INFO L226 Difference]: Without dead ends: 400 [2023-02-14 01:54:01,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2023-02-14 01:54:01,293 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 323 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:54:01,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 590 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-02-14 01:54:01,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2023-02-14 01:54:01,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 295. [2023-02-14 01:54:01,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 255 states have (on average 1.223529411764706) internal successors, (312), 284 states have internal predecessors, (312), 3 states have call successors, (3), 3 states have call predecessors, (3), 7 states have return successors, (9), 7 states have call predecessors, (9), 3 states have call successors, (9) [2023-02-14 01:54:01,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 324 transitions. [2023-02-14 01:54:01,298 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 324 transitions. Word has length 54 [2023-02-14 01:54:01,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:54:01,298 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 324 transitions. [2023-02-14 01:54:01,298 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-14 01:54:01,299 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 324 transitions. [2023-02-14 01:54:01,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-14 01:54:01,299 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:54:01,299 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-14 01:54:01,324 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-14 01:54:01,510 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-14 01:54:01,510 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-14 01:54:01,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:54:01,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1610777396, now seen corresponding path program 1 times [2023-02-14 01:54:01,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:54:01,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1666968711] [2023-02-14 01:54:01,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:54:01,511 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-14 01:54:01,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:54:01,512 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-14 01:54:01,513 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-14 01:54:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:54:02,004 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-14 01:54:02,006 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:54:02,010 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-14 01:54:02,013 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-14 01:54:02,069 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (exists ((v_ArrVal_3566 (_ BitVec 1))) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base v_ArrVal_3566) |c_create_data_#t~malloc7.base|))) (exists ((v_ArrVal_3564 (_ BitVec 32)) (v_ArrVal_3565 (_ BitVec 32))) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3565) |c_create_data_#t~malloc7.base| v_ArrVal_3564) |c_#length|)))) is different from true [2023-02-14 01:54:02,079 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3564 (_ BitVec 32)) (v_ArrVal_3565 (_ BitVec 32)) (v_ArrVal_3566 (_ BitVec 1)) (create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3565) |create_data_#t~malloc7.base| v_ArrVal_3564) |c_#length|) (= (select (store |c_old(#valid)| create_data_~data~0.base v_ArrVal_3566) |create_data_#t~malloc7.base|) (_ bv0 1)))) is different from true [2023-02-14 01:54:02,310 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3564 (_ BitVec 32)) (v_ArrVal_3565 (_ BitVec 32)) (v_ArrVal_3566 (_ BitVec 1)) (create_data_~data~0.base (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3565) |create_data_#t~malloc7.base| v_ArrVal_3564) create_data_~nextData~0.base (_ bv16 32))) (= (select (store |c_old(#valid)| create_data_~data~0.base v_ArrVal_3566) |create_data_#t~malloc7.base|) (_ bv0 1)))) is different from true [2023-02-14 01:54:02,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:54:02,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:54:02,494 INFO L321 Elim1Store]: treesize reduction 43, result has 41.9 percent of original size [2023-02-14 01:54:02,494 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-14 01:54:02,526 INFO L321 Elim1Store]: treesize reduction 17, result has 45.2 percent of original size [2023-02-14 01:54:02,526 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-14 01:54:02,557 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-14 01:54:02,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:54:04,675 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_append_~node~0#1.offset|))) (and (or (forall ((|v_create_data_#t~malloc7.base_47| (_ BitVec 32)) (v_ArrVal_3579 (_ BitVec 1)) (v_create_data_~data~0.base_72 (_ BitVec 32))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_create_data_~data~0.base_72 v_ArrVal_3579) |v_create_data_#t~malloc7.base_47|))) (not (= (_ bv0 1) (select |c_#valid| v_create_data_~data~0.base_72))))) (bvule |c_ULTIMATE.start_append_~node~0#1.offset| .cse0)) (forall ((v_create_data_~data~0.base_72 (_ BitVec 32))) (or (forall ((|v_create_data_#t~malloc7.base_47| (_ BitVec 32)) (v_ArrVal_3579 (_ BitVec 1))) (or (not (= (_ bv0 1) (select (store |c_#valid| v_create_data_~data~0.base_72 v_ArrVal_3579) |v_create_data_#t~malloc7.base_47|))) (forall ((v_create_data_~nextData~0.base_22 (_ BitVec 32)) (v_ArrVal_3577 (_ BitVec 32)) (v_ArrVal_3578 (_ BitVec 32))) (bvule .cse0 (select (store (store (store |c_#length| v_create_data_~data~0.base_72 v_ArrVal_3577) |v_create_data_#t~malloc7.base_47| v_ArrVal_3578) v_create_data_~nextData~0.base_22 (_ bv16 32)) |c_ULTIMATE.start_append_~node~0#1.base|))))) (not (= (_ bv0 1) (select |c_#valid| v_create_data_~data~0.base_72))))))) is different from false [2023-02-14 01:54:04,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:54:04,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1666968711] [2023-02-14 01:54:04,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1666968711] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:54:04,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1128631325] [2023-02-14 01:54:04,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:54:04,681 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 01:54:04,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 01:54:04,682 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-14 01:54:04,682 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (43)] Waiting until timeout for monitored process [2023-02-14 01:54:05,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:54:05,571 INFO L263 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 19 conjunts are in the unsatisfiable core [2023-02-14 01:54:05,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:54:05,595 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-14 01:54:05,599 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-14 01:54:07,881 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (v_ArrVal_3764 (_ BitVec 32)) (v_ArrVal_3765 (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3765) |create_data_#t~malloc7.base| v_ArrVal_3764) create_data_~nextData~0.base (_ bv16 32)) |c_#length|))) is different from true [2023-02-14 01:54:08,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:54:08,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:54:08,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:54:08,077 INFO L321 Elim1Store]: treesize reduction 30, result has 48.3 percent of original size [2023-02-14 01:54:08,077 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-14 01:54:08,103 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-02-14 01:54:08,103 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-14 01:54:08,121 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-14 01:54:08,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:54:08,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1128631325] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:54:08,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:54:08,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2023-02-14 01:54:08,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584679578] [2023-02-14 01:54:08,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:54:08,307 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-14 01:54:08,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:54:08,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-14 01:54:08,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=58, Unknown=6, NotChecked=90, Total=182 [2023-02-14 01:54:08,307 INFO L87 Difference]: Start difference. First operand 295 states and 324 transitions. Second operand has 11 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 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-14 01:54:10,680 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3564 (_ BitVec 32)) (v_ArrVal_3565 (_ BitVec 32)) (v_ArrVal_3566 (_ BitVec 1)) (create_data_~data~0.base (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3565) |create_data_#t~malloc7.base| v_ArrVal_3564) create_data_~nextData~0.base (_ bv16 32))) (= (select (store |c_old(#valid)| create_data_~data~0.base v_ArrVal_3566) |create_data_#t~malloc7.base|) (_ bv0 1)))) (exists ((create_data_~data~0.base (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (v_ArrVal_3764 (_ BitVec 32)) (v_ArrVal_3765 (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= (_ bv0 1) (select (store |c_old(#valid)| create_data_~data~0.base (_ bv1 1)) |create_data_#t~malloc7.base|)) (= (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3765) |create_data_#t~malloc7.base| v_ArrVal_3764) create_data_~nextData~0.base (_ bv16 32)) |c_#length|)))) is different from true [2023-02-14 01:54:12,980 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-14 01:54:15,164 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-14 01:54:15,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:54:15,612 INFO L93 Difference]: Finished difference Result 544 states and 598 transitions. [2023-02-14 01:54:15,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 01:54:15,613 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 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-14 01:54:15,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:54:15,614 INFO L225 Difference]: With dead ends: 544 [2023-02-14 01:54:15,614 INFO L226 Difference]: Without dead ends: 544 [2023-02-14 01:54:15,614 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 100 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=39, Invalid=88, Unknown=7, NotChecked=138, Total=272 [2023-02-14 01:54:15,615 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 252 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 7 mSolverCounterUnsat, 26 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 1561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 26 IncrementalHoareTripleChecker+Unknown, 981 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:54:15,615 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 605 Invalid, 1561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 547 Invalid, 26 Unknown, 981 Unchecked, 5.2s Time] [2023-02-14 01:54:15,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2023-02-14 01:54:15,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 310. [2023-02-14 01:54:15,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 269 states have (on average 1.2156133828996283) internal successors, (327), 298 states have internal predecessors, (327), 3 states have call successors, (3), 3 states have call predecessors, (3), 8 states have return successors, (11), 8 states have call predecessors, (11), 3 states have call successors, (11) [2023-02-14 01:54:15,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 341 transitions. [2023-02-14 01:54:15,620 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 341 transitions. Word has length 55 [2023-02-14 01:54:15,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:54:15,620 INFO L495 AbstractCegarLoop]: Abstraction has 310 states and 341 transitions. [2023-02-14 01:54:15,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 7.7) internal successors, (77), 10 states have internal predecessors, (77), 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-14 01:54:15,620 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 341 transitions. [2023-02-14 01:54:15,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-14 01:54:15,621 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:54:15,621 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-14 01:54:15,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (43)] Forceful destruction successful, exit code 0 [2023-02-14 01:54:15,842 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-14 01:54:16,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-14 01:54:16,033 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-14 01:54:16,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:54:16,033 INFO L85 PathProgramCache]: Analyzing trace with hash 948367783, now seen corresponding path program 1 times [2023-02-14 01:54:16,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:54:16,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [729466766] [2023-02-14 01:54:16,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:54:16,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-14 01:54:16,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:54:16,036 INFO L229 MonitoredProcess]: Starting monitored process 44 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-14 01:54:16,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 (44)] Waiting until timeout for monitored process [2023-02-14 01:54:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:54:16,424 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-14 01:54:16,426 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:54:16,429 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-14 01:54:16,433 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-14 01:54:16,533 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-14 01:54:16,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-14 01:54:16,581 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_3895 (_ BitVec 32)) (v_arrayElimCell_119 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_3895) v_arrayElimCell_119 (_ bv80 32))))) is different from true [2023-02-14 01:54:16,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:54:16,844 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-14 01:54:16,844 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-14 01:54:16,855 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:54:16,856 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-14 01:54:16,887 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-14 01:54:16,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:54:17,117 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:54:17,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [729466766] [2023-02-14 01:54:17,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [729466766] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:54:17,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1159501184] [2023-02-14 01:54:17,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:54:17,118 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 01:54:17,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 01:54:17,119 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-14 01:54:17,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (45)] Waiting until timeout for monitored process [2023-02-14 01:54:17,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:54:17,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-14 01:54:17,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:54:17,755 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-14 01:54:17,759 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-14 01:54:17,802 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (exists ((v_ArrVal_4026 (_ BitVec 32))) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_4026) |create_data_#t~malloc7.base| (_ bv80 32)) |c_#length|)))) is different from true [2023-02-14 01:54:18,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:54:18,094 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-14 01:54:18,094 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-14 01:54:18,108 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:54:18,108 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-14 01:54:18,127 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-14 01:54:18,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:54:18,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1159501184] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:54:18,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 01:54:18,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 9 [2023-02-14 01:54:18,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928079179] [2023-02-14 01:54:18,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:54:18,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-14 01:54:18,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:54:18,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-14 01:54:18,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=72, Unknown=2, NotChecked=34, Total=132 [2023-02-14 01:54:18,129 INFO L87 Difference]: Start difference. First operand 310 states and 341 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-14 01:54:18,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:54:18,724 INFO L93 Difference]: Finished difference Result 395 states and 428 transitions. [2023-02-14 01:54:18,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-14 01:54:18,725 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-14 01:54:18,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:54:18,726 INFO L225 Difference]: With dead ends: 395 [2023-02-14 01:54:18,726 INFO L226 Difference]: Without dead ends: 395 [2023-02-14 01:54:18,726 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=86, Unknown=2, NotChecked=38, Total=156 [2023-02-14 01:54:18,726 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 120 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 305 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-14 01:54:18,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 356 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 347 Invalid, 0 Unknown, 305 Unchecked, 0.6s Time] [2023-02-14 01:54:18,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2023-02-14 01:54:18,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 309. [2023-02-14 01:54:18,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 268 states have (on average 1.212686567164179) internal successors, (325), 298 states have internal predecessors, (325), 3 states have call successors, (3), 3 states have call predecessors, (3), 8 states have return successors, (11), 7 states have call predecessors, (11), 3 states have call successors, (11) [2023-02-14 01:54:18,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 339 transitions. [2023-02-14 01:54:18,730 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 339 transitions. Word has length 56 [2023-02-14 01:54:18,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:54:18,731 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 339 transitions. [2023-02-14 01:54:18,731 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-14 01:54:18,731 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 339 transitions. [2023-02-14 01:54:18,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-14 01:54:18,731 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:54:18,731 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-14 01:54:18,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (45)] Forceful destruction successful, exit code 0 [2023-02-14 01:54:18,948 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 (44)] Forceful destruction successful, exit code 0 [2023-02-14 01:54:19,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,44 /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-14 01:54:19,138 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_LEAK === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-14 01:54:19,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:54:19,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1897094198, now seen corresponding path program 1 times [2023-02-14 01:54:19,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:54:19,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587670326] [2023-02-14 01:54:19,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:54:19,139 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-14 01:54:19,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:54:19,141 INFO L229 MonitoredProcess]: Starting monitored process 46 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-14 01:54:19,141 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 (46)] Waiting until timeout for monitored process [2023-02-14 01:54:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:54:19,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-14 01:54:19,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:54:19,458 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-14 01:54:19,482 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-14 01:54:19,489 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-14 01:54:19,489 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:54:19,489 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:54:19,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1587670326] [2023-02-14 01:54:19,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1587670326] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:54:19,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:54:19,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 01:54:19,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922005540] [2023-02-14 01:54:19,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:54:19,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-14 01:54:19,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:54:19,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-14 01:54:19,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-14 01:54:19,490 INFO L87 Difference]: Start difference. First operand 309 states and 339 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-14 01:54:19,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:54:19,771 INFO L93 Difference]: Finished difference Result 347 states and 377 transitions. [2023-02-14 01:54:19,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-14 01:54:19,772 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-14 01:54:19,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:54:19,773 INFO L225 Difference]: With dead ends: 347 [2023-02-14 01:54:19,773 INFO L226 Difference]: Without dead ends: 347 [2023-02-14 01:54:19,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-14 01:54:19,773 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 151 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2023-02-14 01:54:19,774 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.3s Time] [2023-02-14 01:54:19,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2023-02-14 01:54:19,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 311. [2023-02-14 01:54:19,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 270 states have (on average 1.211111111111111) internal successors, (327), 300 states have internal predecessors, (327), 3 states have call successors, (3), 3 states have call predecessors, (3), 8 states have return successors, (11), 7 states have call predecessors, (11), 3 states have call successors, (11) [2023-02-14 01:54:19,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 341 transitions. [2023-02-14 01:54:19,791 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 341 transitions. Word has length 57 [2023-02-14 01:54:19,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:54:19,791 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 341 transitions. [2023-02-14 01:54:19,791 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-14 01:54:19,791 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 341 transitions. [2023-02-14 01:54:19,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-14 01:54:19,792 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:54:19,792 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-14 01:54:19,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (46)] Forceful destruction successful, exit code 0 [2023-02-14 01:54:19,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /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-14 01:54:19,992 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-14 01:54:19,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:54:19,993 INFO L85 PathProgramCache]: Analyzing trace with hash -1897093746, now seen corresponding path program 1 times [2023-02-14 01:54:19,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:54:19,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1908768788] [2023-02-14 01:54:19,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:54:19,993 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-14 01:54:19,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:54:19,995 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-14 01:54:19,996 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-14 01:54:20,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:54:20,269 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-14 01:54:20,270 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:54:20,323 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-14 01:54:20,346 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-14 01:54:20,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-14 01:54:20,353 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:54:20,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:54:20,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1908768788] [2023-02-14 01:54:20,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1908768788] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:54:20,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:54:20,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 01:54:20,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464398091] [2023-02-14 01:54:20,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:54:20,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 01:54:20,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:54:20,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 01:54:20,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:54:20,354 INFO L87 Difference]: Start difference. First operand 311 states and 341 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-14 01:54:20,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:54:20,738 INFO L93 Difference]: Finished difference Result 329 states and 359 transitions. [2023-02-14 01:54:20,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 01:54:20,739 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-14 01:54:20,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:54:20,740 INFO L225 Difference]: With dead ends: 329 [2023-02-14 01:54:20,740 INFO L226 Difference]: Without dead ends: 329 [2023-02-14 01:54:20,740 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-14 01:54:20,740 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 162 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2023-02-14 01:54:20,741 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.3s Time] [2023-02-14 01:54:20,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2023-02-14 01:54:20,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 313. [2023-02-14 01:54:20,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 272 states have (on average 1.213235294117647) internal successors, (330), 302 states have internal predecessors, (330), 3 states have call successors, (3), 3 states have call predecessors, (3), 8 states have return successors, (11), 7 states have call predecessors, (11), 3 states have call successors, (11) [2023-02-14 01:54:20,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 344 transitions. [2023-02-14 01:54:20,744 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 344 transitions. Word has length 57 [2023-02-14 01:54:20,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:54:20,745 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 344 transitions. [2023-02-14 01:54:20,745 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-14 01:54:20,745 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 344 transitions. [2023-02-14 01:54:20,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-14 01:54:20,745 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:54:20,745 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-14 01:54:20,754 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 (47)] Ended with exit code 0 [2023-02-14 01:54:20,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-14 01:54:20,954 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-14 01:54:20,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:54:20,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1897093745, now seen corresponding path program 1 times [2023-02-14 01:54:20,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:54:20,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [290234423] [2023-02-14 01:54:20,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:54:20,956 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-14 01:54:20,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:54:20,957 INFO L229 MonitoredProcess]: Starting monitored process 48 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-14 01:54:20,957 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 (48)] Waiting until timeout for monitored process [2023-02-14 01:54:21,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:54:21,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-14 01:54:21,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:54:21,365 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-14 01:54:21,369 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-14 01:54:21,483 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-14 01:54:21,513 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-14 01:54:21,519 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_4377 (_ BitVec 32)) (v_arrayElimCell_128 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_4377) v_arrayElimCell_128 (_ bv80 32))))) is different from true [2023-02-14 01:54:21,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:54:21,677 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-14 01:54:21,690 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-14 01:54:21,703 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:54:21,704 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-14 01:54:21,777 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-14 01:54:21,781 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-14 01:54:21,885 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-14 01:54:21,907 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-14 01:54:21,933 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-14 01:54:21,933 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:54:22,078 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-14 01:54:22,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:54:22,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:54:22,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:54:22,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:54:34,416 WARN L233 SmtUtils]: Spent 12.09s 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-14 01:54:34,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:54:34,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [290234423] [2023-02-14 01:54:34,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [290234423] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:54:34,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [661357535] [2023-02-14 01:54:34,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:54:34,417 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 01:54:34,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 01:54:34,418 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-14 01:54:34,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (49)] Waiting until timeout for monitored process [2023-02-14 01:54:35,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:54:35,105 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-14 01:54:35,107 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:54:35,415 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-14 01:54:35,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:54:35,511 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-14 01:54:35,519 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-14 01:54:35,600 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-14 01:54:35,678 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-14 01:54:35,678 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-14 01:54:35,747 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-14 01:54:35,747 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:54:35,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [661357535] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:54:35,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 01:54:35,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [9] total 20 [2023-02-14 01:54:35,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943059312] [2023-02-14 01:54:35,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:54:35,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-14 01:54:35,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:54:35,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-14 01:54:35,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=457, Unknown=1, NotChecked=42, Total=552 [2023-02-14 01:54:35,749 INFO L87 Difference]: Start difference. First operand 313 states and 344 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-14 01:54:38,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:54:38,864 INFO L93 Difference]: Finished difference Result 415 states and 454 transitions. [2023-02-14 01:54:38,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-14 01:54:38,865 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-14 01:54:38,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:54:38,866 INFO L225 Difference]: With dead ends: 415 [2023-02-14 01:54:38,866 INFO L226 Difference]: Without dead ends: 415 [2023-02-14 01:54:38,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=142, Invalid=983, Unknown=1, NotChecked=64, Total=1190 [2023-02-14 01:54:38,869 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 395 mSDsluCounter, 728 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2023-02-14 01:54:38,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 821 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2023-02-14 01:54:38,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2023-02-14 01:54:38,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 313. [2023-02-14 01:54:38,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 272 states have (on average 1.2095588235294117) internal successors, (329), 302 states have internal predecessors, (329), 3 states have call successors, (3), 3 states have call predecessors, (3), 8 states have return successors, (11), 7 states have call predecessors, (11), 3 states have call successors, (11) [2023-02-14 01:54:38,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 343 transitions. [2023-02-14 01:54:38,873 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 343 transitions. Word has length 57 [2023-02-14 01:54:38,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:54:38,873 INFO L495 AbstractCegarLoop]: Abstraction has 313 states and 343 transitions. [2023-02-14 01:54:38,873 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-14 01:54:38,873 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 343 transitions. [2023-02-14 01:54:38,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-14 01:54:38,874 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:54:38,874 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-14 01:54:38,885 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 (48)] Ended with exit code 0 [2023-02-14 01:54:39,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (49)] Forceful destruction successful, exit code 0 [2023-02-14 01:54:39,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-14 01:54:39,274 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-14 01:54:39,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:54:39,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1768854146, now seen corresponding path program 1 times [2023-02-14 01:54:39,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:54:39,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1767779] [2023-02-14 01:54:39,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:54:39,275 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-14 01:54:39,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:54:39,276 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-14 01:54:39,277 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-14 01:54:39,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:54:39,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 23 conjunts are in the unsatisfiable core [2023-02-14 01:54:39,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:54:39,824 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-14 01:54:39,892 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-14 01:54:40,033 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:54:40,033 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 51 treesize of output 50 [2023-02-14 01:54:40,114 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-14 01:54:40,114 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 51 treesize of output 50 [2023-02-14 01:54:40,167 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 39 treesize of output 21 [2023-02-14 01:54:40,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:54:40,661 INFO L321 Elim1Store]: treesize reduction 96, result has 23.8 percent of original size [2023-02-14 01:54:40,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 34 treesize of output 52 [2023-02-14 01:54:40,768 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-02-14 01:54:40,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:54:40,928 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:54:40,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1767779] [2023-02-14 01:54:40,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1767779] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:54:40,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [208570486] [2023-02-14 01:54:40,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:54:40,928 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 01:54:40,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 01:54:40,929 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-14 01:54:40,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (51)] Waiting until timeout for monitored process [2023-02-14 01:54:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:54:41,854 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-14 01:54:41,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:54:41,894 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-14 01:54:42,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:54:42,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:54:42,509 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:54:42,546 INFO L321 Elim1Store]: treesize reduction 39, result has 40.0 percent of original size [2023-02-14 01:54:42,546 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-14 01:54:42,610 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-14 01:54:42,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:54:42,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [208570486] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:54:42,757 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:54:42,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 14 [2023-02-14 01:54:42,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063556722] [2023-02-14 01:54:42,757 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:54:42,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-14 01:54:42,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:54:42,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-14 01:54:42,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=253, Unknown=0, NotChecked=0, Total=306 [2023-02-14 01:54:42,758 INFO L87 Difference]: Start difference. First operand 313 states and 343 transitions. Second operand has 15 states, 14 states have (on average 6.285714285714286) internal successors, (88), 15 states have internal predecessors, (88), 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-14 01:54:54,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:54:54,573 INFO L93 Difference]: Finished difference Result 386 states and 418 transitions. [2023-02-14 01:54:54,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-14 01:54:54,573 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 6.285714285714286) internal successors, (88), 15 states have internal predecessors, (88), 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-14 01:54:54,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:54:54,574 INFO L225 Difference]: With dead ends: 386 [2023-02-14 01:54:54,575 INFO L226 Difference]: Without dead ends: 386 [2023-02-14 01:54:54,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=127, Invalid=571, Unknown=4, NotChecked=0, Total=702 [2023-02-14 01:54:54,575 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 505 mSDsluCounter, 349 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 31 mSolverCounterUnsat, 21 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 21 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-02-14 01:54:54,575 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 424 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 510 Invalid, 21 Unknown, 0 Unchecked, 3.2s Time] [2023-02-14 01:54:54,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2023-02-14 01:54:54,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 325. [2023-02-14 01:54:54,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 284 states have (on average 1.204225352112676) internal successors, (342), 314 states have internal predecessors, (342), 3 states have call successors, (3), 3 states have call predecessors, (3), 8 states have return successors, (11), 7 states have call predecessors, (11), 3 states have call successors, (11) [2023-02-14 01:54:54,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 356 transitions. [2023-02-14 01:54:54,579 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 356 transitions. Word has length 57 [2023-02-14 01:54:54,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:54:54,579 INFO L495 AbstractCegarLoop]: Abstraction has 325 states and 356 transitions. [2023-02-14 01:54:54,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 6.285714285714286) internal successors, (88), 15 states have internal predecessors, (88), 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-14 01:54:54,580 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 356 transitions. [2023-02-14 01:54:54,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2023-02-14 01:54:54,580 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:54:54,580 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-14 01:54:54,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (51)] Forceful destruction successful, exit code 0 [2023-02-14 01:54:54,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 (50)] Forceful destruction successful, exit code 0 [2023-02-14 01:54:54,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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-14 01:54:54,999 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-14 01:54:54,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:54:54,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1768854147, now seen corresponding path program 1 times [2023-02-14 01:54:55,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:54:55,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [814548090] [2023-02-14 01:54:55,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:54:55,000 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-14 01:54:55,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:54:55,002 INFO L229 MonitoredProcess]: Starting monitored process 52 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-14 01:54:55,003 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 (52)] Waiting until timeout for monitored process [2023-02-14 01:54:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:54:55,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-14 01:54:55,585 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:54:55,607 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-14 01:54:55,607 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-14 01:54:55,617 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-14 01:54:55,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:54:55,641 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 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-14 01:54:55,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:54:55,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:54:55,656 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:54:55,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2023-02-14 01:54:55,798 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-14 01:54:55,801 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-14 01:54:58,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:54:58,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:54:58,804 INFO L321 Elim1Store]: treesize reduction 43, result has 41.9 percent of original size [2023-02-14 01:54:58,804 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-14 01:54:58,836 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:54:58,837 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-14 01:54:58,954 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-14 01:54:58,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:54:59,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:54:59,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [814548090] [2023-02-14 01:54:59,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [814548090] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:54:59,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [168719238] [2023-02-14 01:54:59,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:54:59,271 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 01:54:59,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 01:54:59,272 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-14 01:54:59,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (53)] Waiting until timeout for monitored process [2023-02-14 01:55:00,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:55:00,239 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-14 01:55:00,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:55:00,246 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-14 01:55:00,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:55:00,296 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-14 01:55:00,476 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-14 01:55:00,548 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5311 (_ BitVec 32)) (v_ArrVal_5310 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (bvult create_data_~data~0.base |c_#StackHeapBarrier|) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5311) |create_data_#t~malloc7.base| v_ArrVal_5310) |c_#length|) (bvult |create_data_#t~malloc7.base| |c_#StackHeapBarrier|))) (not (= |c_#StackHeapBarrier| (_ bv0 32))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from true [2023-02-14 01:55:00,901 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_5312 (_ BitVec 32)) (v_ArrVal_5311 (_ BitVec 32)) (v_ArrVal_5310 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (create_data_~nextData~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (bvult create_data_~data~0.base |c_#StackHeapBarrier|) (bvult |create_data_#t~malloc7.base| |c_#StackHeapBarrier|) (= |c_#length| (store (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5311) |create_data_#t~malloc7.base| v_ArrVal_5310) create_data_~nextData~0.base v_ArrVal_5312)) (bvult create_data_~nextData~0.base |c_#StackHeapBarrier|))) (not (= |c_#StackHeapBarrier| (_ bv0 32))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from true [2023-02-14 01:55:01,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:55:01,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:55:01,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:55:01,274 INFO L321 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2023-02-14 01:55:01,274 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-14 01:55:01,404 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-14 01:55:01,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:55:05,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [168719238] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:55:05,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:55:05,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 16 [2023-02-14 01:55:05,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003976474] [2023-02-14 01:55:05,651 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:55:05,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-14 01:55:05,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:55:05,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-14 01:55:05,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=249, Unknown=7, NotChecked=66, Total=380 [2023-02-14 01:55:05,652 INFO L87 Difference]: Start difference. First operand 325 states and 356 transitions. Second operand has 17 states, 16 states have (on average 5.625) internal successors, (90), 17 states have internal predecessors, (90), 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-14 01:55:21,218 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-14 01:55:22,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:55:24,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:55:26,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-14 01:55:29,655 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-14 01:55:31,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:55:31,411 INFO L93 Difference]: Finished difference Result 794 states and 855 transitions. [2023-02-14 01:55:31,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-14 01:55:31,441 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 5.625) internal successors, (90), 17 states have internal predecessors, (90), 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-14 01:55:31,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:55:31,443 INFO L225 Difference]: With dead ends: 794 [2023-02-14 01:55:31,443 INFO L226 Difference]: Without dead ends: 794 [2023-02-14 01:55:31,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=195, Invalid=789, Unknown=16, NotChecked=122, Total=1122 [2023-02-14 01:55:31,444 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 1186 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 53 mSolverCounterUnsat, 97 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1186 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 1456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 97 IncrementalHoareTripleChecker+Unknown, 520 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2023-02-14 01:55:31,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1186 Valid, 644 Invalid, 1456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 786 Invalid, 97 Unknown, 520 Unchecked, 15.7s Time] [2023-02-14 01:55:31,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2023-02-14 01:55:31,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 483. [2023-02-14 01:55:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 437 states have (on average 1.1922196796338673) internal successors, (521), 466 states have internal predecessors, (521), 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-14 01:55:31,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 539 transitions. [2023-02-14 01:55:31,450 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 539 transitions. Word has length 57 [2023-02-14 01:55:31,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:55:31,450 INFO L495 AbstractCegarLoop]: Abstraction has 483 states and 539 transitions. [2023-02-14 01:55:31,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 5.625) internal successors, (90), 17 states have internal predecessors, (90), 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-14 01:55:31,450 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 539 transitions. [2023-02-14 01:55:31,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-02-14 01:55:31,451 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:55:31,451 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-14 01:55:31,459 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (53)] Forceful destruction successful, exit code 0 [2023-02-14 01:55:31,671 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 (52)] Ended with exit code 0 [2023-02-14 01:55:31,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,52 /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-14 01:55:31,860 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-14 01:55:31,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:55:31,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1611932791, now seen corresponding path program 1 times [2023-02-14 01:55:31,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:55:31,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1717581830] [2023-02-14 01:55:31,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:55:31,860 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-14 01:55:31,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:55:31,861 INFO L229 MonitoredProcess]: Starting monitored process 54 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-14 01:55:31,864 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 (54)] Waiting until timeout for monitored process [2023-02-14 01:55:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:55:32,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-14 01:55:32,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:55:32,324 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-14 01:55:32,336 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-14 01:55:32,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-14 01:55:32,485 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-14 01:55:32,492 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (v_arrayElimCell_161 (_ BitVec 32)) (v_ArrVal_5439 (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5439) v_arrayElimCell_161 (_ bv80 32))))) is different from true [2023-02-14 01:55:32,636 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:55:32,663 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-14 01:55:32,663 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-14 01:55:32,675 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:55:32,676 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-14 01:55:32,744 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-14 01:55:32,752 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-14 01:55:32,894 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-14 01:55:32,896 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-14 01:55:32,940 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-14 01:55:32,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:55:33,114 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-14 01:55:33,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:55:33,128 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:55:33,130 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:55:33,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:55:33,512 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:55:33,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1717581830] [2023-02-14 01:55:33,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1717581830] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:55:33,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [36239620] [2023-02-14 01:55:33,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:55:33,512 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 01:55:33,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 01:55:33,514 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-14 01:55:33,523 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (55)] Waiting until timeout for monitored process [2023-02-14 01:55:34,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:55:34,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-14 01:55:34,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:55:34,414 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-14 01:55:34,420 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-14 01:55:34,546 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_5571 (_ BitVec 32))) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5571) |create_data_#t~malloc7.base| (_ bv80 32)) |c_#length|)) (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)))) is different from true [2023-02-14 01:55:34,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:55:34,746 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-14 01:55:34,747 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-14 01:55:34,761 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:55:34,761 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-14 01:55:34,887 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-14 01:55:34,896 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-14 01:55:35,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 33 treesize of output 21 [2023-02-14 01:55:35,196 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-14 01:55:35,228 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-14 01:55:35,229 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:55:35,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [36239620] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:55:35,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 01:55:35,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 15 [2023-02-14 01:55:35,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211173072] [2023-02-14 01:55:35,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:55:35,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-14 01:55:35,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:55:35,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-14 01:55:35,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=256, Unknown=2, NotChecked=66, Total=380 [2023-02-14 01:55:35,230 INFO L87 Difference]: Start difference. First operand 483 states and 539 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-14 01:55:36,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:55:36,581 INFO L93 Difference]: Finished difference Result 770 states and 871 transitions. [2023-02-14 01:55:36,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 01:55:36,582 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-14 01:55:36,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:55:36,584 INFO L225 Difference]: With dead ends: 770 [2023-02-14 01:55:36,584 INFO L226 Difference]: Without dead ends: 770 [2023-02-14 01:55:36,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 120 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=88, Invalid=338, Unknown=2, NotChecked=78, Total=506 [2023-02-14 01:55:36,584 INFO L413 NwaCegarLoop]: 113 mSDtfsCounter, 362 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 549 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 262 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-02-14 01:55:36,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 549 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 484 Invalid, 1 Unknown, 262 Unchecked, 1.1s Time] [2023-02-14 01:55:36,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2023-02-14 01:55:36,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 595. [2023-02-14 01:55:36,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 541 states have (on average 1.2033271719038816) internal successors, (651), 570 states have internal predecessors, (651), 8 states have call successors, (8), 4 states have call predecessors, (8), 16 states have return successors, (36), 20 states have call predecessors, (36), 8 states have call successors, (36) [2023-02-14 01:55:36,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 695 transitions. [2023-02-14 01:55:36,596 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 695 transitions. Word has length 61 [2023-02-14 01:55:36,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:55:36,596 INFO L495 AbstractCegarLoop]: Abstraction has 595 states and 695 transitions. [2023-02-14 01:55:36,596 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-14 01:55:36,596 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 695 transitions. [2023-02-14 01:55:36,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-14 01:55:36,597 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:55:36,597 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-14 01:55:36,613 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 (54)] Ended with exit code 0 [2023-02-14 01:55:36,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (55)] Ended with exit code 0 [2023-02-14 01:55:37,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-14 01:55:37,009 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-14 01:55:37,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:55:37,009 INFO L85 PathProgramCache]: Analyzing trace with hash 939726753, now seen corresponding path program 1 times [2023-02-14 01:55:37,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:55:37,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [621528373] [2023-02-14 01:55:37,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:55:37,010 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-14 01:55:37,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:55:37,011 INFO L229 MonitoredProcess]: Starting monitored process 56 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-14 01:55:37,012 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 (56)] Waiting until timeout for monitored process [2023-02-14 01:55:37,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:55:37,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-14 01:55:37,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:55:37,395 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-14 01:55:37,430 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-14 01:55:37,438 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-14 01:55:37,438 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:55:37,438 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:55:37,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [621528373] [2023-02-14 01:55:37,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [621528373] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:55:37,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:55:37,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 01:55:37,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058368014] [2023-02-14 01:55:37,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:55:37,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 01:55:37,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:55:37,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 01:55:37,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:55:37,439 INFO L87 Difference]: Start difference. First operand 595 states and 695 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-14 01:55:37,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:55:37,916 INFO L93 Difference]: Finished difference Result 610 states and 709 transitions. [2023-02-14 01:55:37,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-14 01:55:37,916 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-14 01:55:37,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:55:37,918 INFO L225 Difference]: With dead ends: 610 [2023-02-14 01:55:37,918 INFO L226 Difference]: Without dead ends: 610 [2023-02-14 01:55:37,918 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-14 01:55:37,919 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 127 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 01:55:37,919 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 333 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-14 01:55:37,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2023-02-14 01:55:37,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 598. [2023-02-14 01:55:37,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 544 states have (on average 1.2040441176470589) internal successors, (655), 573 states have internal predecessors, (655), 8 states have call successors, (8), 4 states have call predecessors, (8), 16 states have return successors, (36), 20 states have call predecessors, (36), 8 states have call successors, (36) [2023-02-14 01:55:37,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 699 transitions. [2023-02-14 01:55:37,925 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 699 transitions. Word has length 64 [2023-02-14 01:55:37,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:55:37,925 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 699 transitions. [2023-02-14 01:55:37,926 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-14 01:55:37,926 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 699 transitions. [2023-02-14 01:55:37,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-02-14 01:55:37,926 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:55:37,926 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-14 01:55:37,941 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 (56)] Forceful destruction successful, exit code 0 [2023-02-14 01:55:38,136 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 56 /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-14 01:55:38,136 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-14 01:55:38,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:55:38,137 INFO L85 PathProgramCache]: Analyzing trace with hash 939726754, now seen corresponding path program 1 times [2023-02-14 01:55:38,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:55:38,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430480785] [2023-02-14 01:55:38,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:55:38,137 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-14 01:55:38,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:55:38,138 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-14 01:55:38,139 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-14 01:55:38,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:55:38,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 365 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-14 01:55:38,476 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:55:38,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-14 01:55:38,573 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-14 01:55:38,652 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-14 01:55:38,656 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-14 01:55:38,668 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-14 01:55:38,668 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:55:38,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:55:38,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1430480785] [2023-02-14 01:55:38,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1430480785] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:55:38,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-14 01:55:38,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-14 01:55:38,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702917657] [2023-02-14 01:55:38,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:55:38,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-14 01:55:38,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:55:38,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-14 01:55:38,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-14 01:55:38,669 INFO L87 Difference]: Start difference. First operand 598 states and 699 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-14 01:55:39,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:55:39,126 INFO L93 Difference]: Finished difference Result 626 states and 725 transitions. [2023-02-14 01:55:39,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-14 01:55:39,127 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-14 01:55:39,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:55:39,128 INFO L225 Difference]: With dead ends: 626 [2023-02-14 01:55:39,128 INFO L226 Difference]: Without dead ends: 626 [2023-02-14 01:55:39,129 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-14 01:55:39,129 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 255 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-14 01:55:39,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 296 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-14 01:55:39,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 626 states. [2023-02-14 01:55:39,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 626 to 598. [2023-02-14 01:55:39,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 544 states have (on average 1.2022058823529411) internal successors, (654), 573 states have internal predecessors, (654), 8 states have call successors, (8), 4 states have call predecessors, (8), 16 states have return successors, (36), 20 states have call predecessors, (36), 8 states have call successors, (36) [2023-02-14 01:55:39,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 698 transitions. [2023-02-14 01:55:39,135 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 698 transitions. Word has length 64 [2023-02-14 01:55:39,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:55:39,136 INFO L495 AbstractCegarLoop]: Abstraction has 598 states and 698 transitions. [2023-02-14 01:55:39,136 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-14 01:55:39,136 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 698 transitions. [2023-02-14 01:55:39,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-14 01:55:39,136 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:55:39,137 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-14 01:55:39,145 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-14 01:55:39,345 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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-14 01:55:39,346 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-14 01:55:39,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:55:39,346 INFO L85 PathProgramCache]: Analyzing trace with hash 504851823, now seen corresponding path program 1 times [2023-02-14 01:55:39,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:55:39,346 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [80204989] [2023-02-14 01:55:39,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:55:39,346 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-14 01:55:39,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:55:39,347 INFO L229 MonitoredProcess]: Starting monitored process 58 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-14 01:55:39,348 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 (58)] Waiting until timeout for monitored process [2023-02-14 01:55:39,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:55:39,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-14 01:55:39,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:55:39,835 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-14 01:55:39,846 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-14 01:55:39,973 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-14 01:55:40,009 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-14 01:55:40,017 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_5926 (_ BitVec 32)) (create_data_~data~0.base (_ BitVec 32)) (v_arrayElimCell_176 (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (= |c_#length| (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_5926) v_arrayElimCell_176 (_ bv80 32))))) is different from true [2023-02-14 01:55:40,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:55:40,212 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-14 01:55:40,212 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-14 01:55:40,226 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:55:40,226 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-14 01:55:40,304 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-14 01:55:40,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 11 treesize of output 7 [2023-02-14 01:55:40,466 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-14 01:55:40,481 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-14 01:55:40,517 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-14 01:55:40,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:55:40,711 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-14 01:55:40,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:55:40,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:55:40,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:55:40,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:55:49,181 WARN L233 SmtUtils]: Spent 8.17s 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-14 01:55:49,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:55:49,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [80204989] [2023-02-14 01:55:49,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [80204989] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-14 01:55:49,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [167783692] [2023-02-14 01:55:49,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:55:49,182 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-14 01:55:49,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-14 01:55:49,190 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-14 01:55:49,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (59)] Waiting until timeout for monitored process [2023-02-14 01:55:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:55:50,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 363 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-14 01:55:50,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:55:50,200 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-14 01:55:50,226 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-14 01:55:50,379 WARN L859 $PredicateComparison]: unable to prove that (exists ((create_data_~data~0.base (_ BitVec 32)) (|create_data_#t~malloc7.base| (_ BitVec 32))) (and (= (select |c_old(#valid)| create_data_~data~0.base) (_ bv0 1)) (exists ((v_ArrVal_6057 (_ BitVec 32))) (= (store (store |c_old(#length)| create_data_~data~0.base v_ArrVal_6057) |create_data_#t~malloc7.base| (_ bv80 32)) |c_#length|)))) is different from true [2023-02-14 01:55:50,594 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-14 01:55:50,622 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-02-14 01:55:50,622 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-14 01:55:50,636 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-14 01:55:50,636 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-14 01:55:50,746 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-14 01:55:50,756 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-14 01:55:51,047 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-14 01:55:51,058 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-14 01:55:51,086 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-14 01:55:51,086 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-14 01:55:51,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [167783692] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-14 01:55:51,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-14 01:55:51,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 15 [2023-02-14 01:55:51,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286382713] [2023-02-14 01:55:51,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-14 01:55:51,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-14 01:55:51,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:55:51,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-14 01:55:51,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=256, Unknown=2, NotChecked=66, Total=380 [2023-02-14 01:55:51,087 INFO L87 Difference]: Start difference. First operand 598 states and 698 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-14 01:55:52,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:55:52,414 INFO L93 Difference]: Finished difference Result 815 states and 945 transitions. [2023-02-14 01:55:52,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-14 01:55:52,422 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-14 01:55:52,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:55:52,424 INFO L225 Difference]: With dead ends: 815 [2023-02-14 01:55:52,425 INFO L226 Difference]: Without dead ends: 815 [2023-02-14 01:55:52,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=88, Invalid=338, Unknown=2, NotChecked=78, Total=506 [2023-02-14 01:55:52,425 INFO L413 NwaCegarLoop]: 161 mSDtfsCounter, 249 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 300 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-14 01:55:52,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 641 Invalid, 842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 537 Invalid, 0 Unknown, 300 Unchecked, 1.0s Time] [2023-02-14 01:55:52,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2023-02-14 01:55:52,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 644. [2023-02-14 01:55:52,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 644 states, 588 states have (on average 1.1989795918367347) internal successors, (705), 617 states have internal predecessors, (705), 8 states have call successors, (8), 4 states have call predecessors, (8), 18 states have return successors, (40), 22 states have call predecessors, (40), 8 states have call successors, (40) [2023-02-14 01:55:52,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 644 states to 644 states and 753 transitions. [2023-02-14 01:55:52,438 INFO L78 Accepts]: Start accepts. Automaton has 644 states and 753 transitions. Word has length 65 [2023-02-14 01:55:52,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:55:52,438 INFO L495 AbstractCegarLoop]: Abstraction has 644 states and 753 transitions. [2023-02-14 01:55:52,438 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-14 01:55:52,438 INFO L276 IsEmpty]: Start isEmpty. Operand 644 states and 753 transitions. [2023-02-14 01:55:52,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-14 01:55:52,439 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:55:52,439 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-14 01:55:52,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (59)] Forceful destruction successful, exit code 0 [2023-02-14 01:55:52,657 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 (58)] Ended with exit code 0 [2023-02-14 01:55:52,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,58 /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-14 01:55:52,847 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-14 01:55:52,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:55:52,847 INFO L85 PathProgramCache]: Analyzing trace with hash -665539789, now seen corresponding path program 1 times [2023-02-14 01:55:52,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:55:52,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [794239142] [2023-02-14 01:55:52,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:55:52,848 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-14 01:55:52,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:55:52,849 INFO L229 MonitoredProcess]: Starting monitored process 60 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-14 01:55:52,849 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 (60)] Waiting until timeout for monitored process [2023-02-14 01:55:53,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:55:53,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-14 01:55:53,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:55:53,354 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-14 01:55:53,355 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-14 01:55:53,382 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-14 01:55:53,418 INFO L321 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-02-14 01:55:53,418 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-14 01:55:53,473 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-14 01:55:53,473 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-14 01:55:53,521 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-14 01:55:53,540 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-14 01:55:53,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:55:53,642 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-14 01:55:53,816 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-14 01:55:53,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-14 01:55:53,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [794239142] [2023-02-14 01:55:53,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [794239142] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-14 01:55:53,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-14 01:55:53,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 13 [2023-02-14 01:55:53,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733183669] [2023-02-14 01:55:53,816 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-14 01:55:53,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-14 01:55:53,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-14 01:55:53,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-14 01:55:53,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-02-14 01:55:53,817 INFO L87 Difference]: Start difference. First operand 644 states and 753 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-14 01:55:54,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-14 01:55:54,845 INFO L93 Difference]: Finished difference Result 655 states and 766 transitions. [2023-02-14 01:55:54,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-14 01:55:54,846 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-14 01:55:54,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-14 01:55:54,847 INFO L225 Difference]: With dead ends: 655 [2023-02-14 01:55:54,847 INFO L226 Difference]: Without dead ends: 655 [2023-02-14 01:55:54,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 115 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2023-02-14 01:55:54,848 INFO L413 NwaCegarLoop]: 110 mSDtfsCounter, 248 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-14 01:55:54,848 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 553 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-14 01:55:54,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 655 states. [2023-02-14 01:55:54,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 655 to 643. [2023-02-14 01:55:54,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 588 states have (on average 1.1921768707482994) internal successors, (701), 616 states have internal predecessors, (701), 8 states have call successors, (8), 4 states have call predecessors, (8), 18 states have return successors, (40), 22 states have call predecessors, (40), 8 states have call successors, (40) [2023-02-14 01:55:54,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 749 transitions. [2023-02-14 01:55:54,855 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 749 transitions. Word has length 65 [2023-02-14 01:55:54,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-14 01:55:54,855 INFO L495 AbstractCegarLoop]: Abstraction has 643 states and 749 transitions. [2023-02-14 01:55:54,856 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-14 01:55:54,856 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 749 transitions. [2023-02-14 01:55:54,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-02-14 01:55:54,856 INFO L187 NwaCegarLoop]: Found error trace [2023-02-14 01:55:54,856 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-14 01:55:54,867 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 (60)] Ended with exit code 0 [2023-02-14 01:55:55,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /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-14 01:55:55,065 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_dataErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_dataErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 89 more)] === [2023-02-14 01:55:55,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-14 01:55:55,065 INFO L85 PathProgramCache]: Analyzing trace with hash -665539788, now seen corresponding path program 1 times [2023-02-14 01:55:55,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-14 01:55:55,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [373658852] [2023-02-14 01:55:55,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-14 01:55:55,066 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-14 01:55:55,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-14 01:55:55,067 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-14 01:55:55,067 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-14 01:55:55,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-14 01:55:55,560 INFO L263 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 30 conjunts are in the unsatisfiable core [2023-02-14 01:55:55,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-14 01:55:55,649 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-14 01:55:55,657 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-14 01:55:55,772 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-14 01:55:55,772 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 16 treesize of output 26 [2023-02-14 01:55:55,787 INFO L321 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2023-02-14 01:55:55,787 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-14 01:55:55,863 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-14 01:55:55,863 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-14 01:55:55,883 INFO L321 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2023-02-14 01:55:55,884 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 25 treesize of output 20 [2023-02-14 01:55:55,956 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-14 01:55:55,962 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-14 01:55:55,980 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-14 01:55:55,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-14 01:55:56,652 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-14 01:55:56,655 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 [2023-02-14 01:55:57,221 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