./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/hostid.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 791161d1 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/busybox-1.22.0/hostid.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash de0fc62ae58e6d221c3194714bc6cea21909b72dd1b37b4566b87d84683f34c8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 12:29:07,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 12:29:07,433 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 12:29:07,452 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 12:29:07,452 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 12:29:07,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 12:29:07,454 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 12:29:07,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 12:29:07,456 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 12:29:07,456 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 12:29:07,457 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 12:29:07,458 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 12:29:07,458 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 12:29:07,458 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 12:29:07,459 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 12:29:07,460 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 12:29:07,460 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 12:29:07,461 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 12:29:07,462 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 12:29:07,463 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 12:29:07,464 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 12:29:07,468 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 12:29:07,468 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 12:29:07,469 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 12:29:07,470 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 12:29:07,472 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 12:29:07,472 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 12:29:07,472 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 12:29:07,473 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 12:29:07,473 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 12:29:07,474 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 12:29:07,474 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 12:29:07,475 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 12:29:07,475 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 12:29:07,476 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 12:29:07,477 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 12:29:07,477 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 12:29:07,477 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 12:29:07,478 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 12:29:07,478 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 12:29:07,478 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 12:29:07,479 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 12:29:07,480 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2022-07-23 12:29:07,492 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 12:29:07,493 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 12:29:07,493 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 12:29:07,493 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 12:29:07,493 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 12:29:07,494 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 12:29:07,494 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 12:29:07,494 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 12:29:07,494 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 12:29:07,495 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 12:29:07,495 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 12:29:07,495 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 12:29:07,495 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 12:29:07,495 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 12:29:07,495 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 12:29:07,495 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 12:29:07,496 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 12:29:07,496 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 12:29:07,496 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 12:29:07,496 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 12:29:07,496 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 12:29:07,496 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 12:29:07,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 12:29:07,497 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 12:29:07,497 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 12:29:07,497 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 12:29:07,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 12:29:07,497 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de0fc62ae58e6d221c3194714bc6cea21909b72dd1b37b4566b87d84683f34c8 [2022-07-23 12:29:07,644 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 12:29:07,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 12:29:07,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 12:29:07,663 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 12:29:07,664 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 12:29:07,664 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/hostid.i [2022-07-23 12:29:07,716 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7f33f1bc/fa0ccfcef6fd426a911d7cf7cb2709e8/FLAGa34bf43fb [2022-07-23 12:29:08,157 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 12:29:08,158 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/hostid.i [2022-07-23 12:29:08,178 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7f33f1bc/fa0ccfcef6fd426a911d7cf7cb2709e8/FLAGa34bf43fb [2022-07-23 12:29:08,504 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7f33f1bc/fa0ccfcef6fd426a911d7cf7cb2709e8 [2022-07-23 12:29:08,506 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 12:29:08,507 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 12:29:08,510 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 12:29:08,510 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 12:29:08,512 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 12:29:08,512 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:29:08" (1/1) ... [2022-07-23 12:29:08,513 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ada9d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:29:08, skipping insertion in model container [2022-07-23 12:29:08,513 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:29:08" (1/1) ... [2022-07-23 12:29:08,519 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 12:29:08,562 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 12:29:09,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 12:29:09,071 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) [2022-07-23 12:29:09,071 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@3e311bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:29:09, skipping insertion in model container [2022-07-23 12:29:09,071 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 12:29:09,072 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-23 12:29:09,073 INFO L158 Benchmark]: Toolchain (without parser) took 564.63ms. Allocated memory is still 125.8MB. Free memory was 86.0MB in the beginning and 91.5MB in the end (delta: -5.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-23 12:29:09,073 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory was 95.8MB in the beginning and 95.8MB in the end (delta: 21.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-23 12:29:09,074 INFO L158 Benchmark]: CACSL2BoogieTranslator took 561.71ms. Allocated memory is still 125.8MB. Free memory was 86.0MB in the beginning and 91.5MB in the end (delta: -5.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-23 12:29:09,076 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.17ms. Allocated memory is still 125.8MB. Free memory was 95.8MB in the beginning and 95.8MB in the end (delta: 21.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 561.71ms. Allocated memory is still 125.8MB. Free memory was 86.0MB in the beginning and 91.5MB in the end (delta: -5.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 1774]: 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/busybox-1.22.0/hostid.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash de0fc62ae58e6d221c3194714bc6cea21909b72dd1b37b4566b87d84683f34c8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 12:29:10,465 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 12:29:10,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 12:29:10,494 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 12:29:10,494 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 12:29:10,495 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 12:29:10,498 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 12:29:10,501 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 12:29:10,502 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 12:29:10,507 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 12:29:10,512 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 12:29:10,514 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 12:29:10,514 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 12:29:10,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 12:29:10,517 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 12:29:10,518 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 12:29:10,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 12:29:10,523 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 12:29:10,525 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 12:29:10,526 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 12:29:10,527 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 12:29:10,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 12:29:10,530 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 12:29:10,531 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 12:29:10,532 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 12:29:10,534 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 12:29:10,535 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 12:29:10,535 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 12:29:10,536 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 12:29:10,536 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 12:29:10,537 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 12:29:10,537 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 12:29:10,538 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 12:29:10,539 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 12:29:10,540 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 12:29:10,540 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 12:29:10,540 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 12:29:10,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 12:29:10,541 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 12:29:10,541 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 12:29:10,542 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 12:29:10,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 12:29:10,544 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2022-07-23 12:29:10,586 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 12:29:10,587 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 12:29:10,587 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 12:29:10,587 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 12:29:10,588 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 12:29:10,588 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 12:29:10,589 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 12:29:10,589 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 12:29:10,589 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 12:29:10,590 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 12:29:10,590 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 12:29:10,590 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 12:29:10,590 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 12:29:10,590 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 12:29:10,590 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 12:29:10,591 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 12:29:10,591 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 12:29:10,591 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 12:29:10,591 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-23 12:29:10,591 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-23 12:29:10,591 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 12:29:10,592 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 12:29:10,592 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 12:29:10,592 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 12:29:10,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 12:29:10,592 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 12:29:10,592 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 12:29:10,593 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-23 12:29:10,593 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-23 12:29:10,593 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-23 12:29:10,593 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> de0fc62ae58e6d221c3194714bc6cea21909b72dd1b37b4566b87d84683f34c8 [2022-07-23 12:29:10,841 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 12:29:10,869 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 12:29:10,870 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 12:29:10,871 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 12:29:10,872 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 12:29:10,873 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/hostid.i [2022-07-23 12:29:10,914 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/850fa6ed2/e9468102e2f949c68639e93fa56a426b/FLAGe0e9a8434 [2022-07-23 12:29:11,375 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 12:29:11,375 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/hostid.i [2022-07-23 12:29:11,391 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/850fa6ed2/e9468102e2f949c68639e93fa56a426b/FLAGe0e9a8434 [2022-07-23 12:29:11,400 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/850fa6ed2/e9468102e2f949c68639e93fa56a426b [2022-07-23 12:29:11,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 12:29:11,406 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 12:29:11,407 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 12:29:11,407 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 12:29:11,410 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 12:29:11,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:29:11" (1/1) ... [2022-07-23 12:29:11,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ab422c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:29:11, skipping insertion in model container [2022-07-23 12:29:11,413 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 12:29:11" (1/1) ... [2022-07-23 12:29:11,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 12:29:11,454 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 12:29:11,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 12:29:11,960 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-23 12:29:11,975 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 12:29:12,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 12:29:12,048 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 12:29:12,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 12:29:12,196 INFO L208 MainTranslator]: Completed translation [2022-07-23 12:29:12,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:29:12 WrapperNode [2022-07-23 12:29:12,197 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 12:29:12,198 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 12:29:12,198 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 12:29:12,199 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 12:29:12,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:29:12" (1/1) ... [2022-07-23 12:29:12,252 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:29:12" (1/1) ... [2022-07-23 12:29:12,280 INFO L137 Inliner]: procedures = 529, calls = 68, calls flagged for inlining = 7, calls inlined = 6, statements flattened = 137 [2022-07-23 12:29:12,280 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 12:29:12,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 12:29:12,281 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 12:29:12,281 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 12:29:12,286 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:29:12" (1/1) ... [2022-07-23 12:29:12,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:29:12" (1/1) ... [2022-07-23 12:29:12,300 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:29:12" (1/1) ... [2022-07-23 12:29:12,301 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:29:12" (1/1) ... [2022-07-23 12:29:12,314 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:29:12" (1/1) ... [2022-07-23 12:29:12,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:29:12" (1/1) ... [2022-07-23 12:29:12,340 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:29:12" (1/1) ... [2022-07-23 12:29:12,349 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 12:29:12,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 12:29:12,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 12:29:12,353 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 12:29:12,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:29:12" (1/1) ... [2022-07-23 12:29:12,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 12:29:12,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 12:29:12,377 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) [2022-07-23 12:29:12,395 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 [2022-07-23 12:29:12,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 12:29:12,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-23 12:29:12,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 12:29:12,406 INFO L130 BoogieDeclarations]: Found specification of procedure fflush [2022-07-23 12:29:12,406 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 12:29:12,406 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 12:29:12,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 12:29:12,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 12:29:12,406 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-23 12:29:12,407 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-23 12:29:12,407 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 12:29:12,407 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1 [2022-07-23 12:29:12,625 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 12:29:12,626 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 12:29:13,007 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 12:29:13,012 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 12:29:13,012 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-23 12:29:13,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:29:13 BoogieIcfgContainer [2022-07-23 12:29:13,013 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 12:29:13,014 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 12:29:13,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 12:29:13,018 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 12:29:13,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 12:29:11" (1/3) ... [2022-07-23 12:29:13,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4085f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 12:29:13, skipping insertion in model container [2022-07-23 12:29:13,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 12:29:12" (2/3) ... [2022-07-23 12:29:13,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a4085f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 12:29:13, skipping insertion in model container [2022-07-23 12:29:13,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 12:29:13" (3/3) ... [2022-07-23 12:29:13,022 INFO L111 eAbstractionObserver]: Analyzing ICFG hostid.i [2022-07-23 12:29:13,032 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 12:29:13,032 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 37 error locations. [2022-07-23 12:29:13,095 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 12:29:13,101 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=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@68fb49e6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@16f79b64 [2022-07-23 12:29:13,101 INFO L358 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2022-07-23 12:29:13,104 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 92 states have internal predecessors, (102), 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) [2022-07-23 12:29:13,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 12:29:13,109 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:29:13,110 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 12:29:13,110 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-23 12:29:13,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:29:13,114 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-23 12:29:13,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:29:13,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [902605292] [2022-07-23 12:29:13,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:29:13,126 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:29:13,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:29:13,128 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:29:13,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-23 12:29:13,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:29:13,235 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-23 12:29:13,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:29:13,274 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:29:13,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:29:13,287 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:29:13,287 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:29:13,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [902605292] [2022-07-23 12:29:13,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [902605292] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:29:13,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:29:13,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 12:29:13,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758178349] [2022-07-23 12:29:13,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:29:13,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:29:13,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:29:13,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:29:13,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:29:13,310 INFO L87 Difference]: Start difference. First operand has 95 states, 55 states have (on average 1.8545454545454545) internal successors, (102), 92 states have internal predecessors, (102), 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) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2022-07-23 12:29:13,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:29:13,484 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2022-07-23 12:29:13,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:29:13,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-07-23 12:29:13,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:29:13,491 INFO L225 Difference]: With dead ends: 109 [2022-07-23 12:29:13,491 INFO L226 Difference]: Without dead ends: 107 [2022-07-23 12:29:13,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:29:13,494 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 70 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 12:29:13,494 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 88 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 12:29:13,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-23 12:29:13,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 91. [2022-07-23 12:29:13,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 88 states have internal predecessors, (93), 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) [2022-07-23 12:29:13,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 95 transitions. [2022-07-23 12:29:13,532 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 95 transitions. Word has length 3 [2022-07-23 12:29:13,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:29:13,533 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 95 transitions. [2022-07-23 12:29:13,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2022-07-23 12:29:13,533 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 95 transitions. [2022-07-23 12:29:13,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-23 12:29:13,533 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:29:13,533 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-23 12:29:13,545 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-23 12:29:13,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:29:13,744 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-23 12:29:13,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:29:13,744 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-23 12:29:13,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:29:13,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [463836038] [2022-07-23 12:29:13,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:29:13,745 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:29:13,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:29:13,748 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:29:13,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-23 12:29:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:29:13,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 12:29:13,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:29:13,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:29:13,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:29:13,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:29:13,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:29:13,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [463836038] [2022-07-23 12:29:13,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [463836038] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:29:13,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:29:13,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 12:29:13,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522910099] [2022-07-23 12:29:13,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:29:13,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:29:13,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:29:13,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:29:13,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:29:13,861 INFO L87 Difference]: Start difference. First operand 91 states and 95 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2022-07-23 12:29:14,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:29:14,085 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2022-07-23 12:29:14,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:29:14,086 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-07-23 12:29:14,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:29:14,087 INFO L225 Difference]: With dead ends: 90 [2022-07-23 12:29:14,087 INFO L226 Difference]: Without dead ends: 90 [2022-07-23 12:29:14,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:29:14,088 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 9 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 12:29:14,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 142 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 12:29:14,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-23 12:29:14,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-07-23 12:29:14,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 54 states have (on average 1.7037037037037037) internal successors, (92), 87 states have internal predecessors, (92), 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) [2022-07-23 12:29:14,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2022-07-23 12:29:14,093 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 3 [2022-07-23 12:29:14,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:29:14,093 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2022-07-23 12:29:14,093 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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) [2022-07-23 12:29:14,093 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2022-07-23 12:29:14,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-23 12:29:14,093 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:29:14,093 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-23 12:29:14,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-23 12:29:14,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:29:14,300 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-23 12:29:14,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:29:14,300 INFO L85 PathProgramCache]: Analyzing trace with hash 889446313, now seen corresponding path program 1 times [2022-07-23 12:29:14,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:29:14,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760766958] [2022-07-23 12:29:14,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:29:14,301 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:29:14,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:29:14,302 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:29:14,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-23 12:29:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:29:14,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 12:29:14,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:29:14,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:29:14,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:29:14,446 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:29:14,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:29:14,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [760766958] [2022-07-23 12:29:14,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [760766958] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:29:14,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:29:14,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:29:14,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139490830] [2022-07-23 12:29:14,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:29:14,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:29:14,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:29:14,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:29:14,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:29:14,448 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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) [2022-07-23 12:29:14,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:29:14,678 INFO L93 Difference]: Finished difference Result 94 states and 98 transitions. [2022-07-23 12:29:14,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:29:14,679 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2022-07-23 12:29:14,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:29:14,679 INFO L225 Difference]: With dead ends: 94 [2022-07-23 12:29:14,679 INFO L226 Difference]: Without dead ends: 94 [2022-07-23 12:29:14,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:29:14,681 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 13 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 12:29:14,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 141 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 12:29:14,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-23 12:29:14,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2022-07-23 12:29:14,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 56 states have (on average 1.6785714285714286) internal successors, (94), 89 states have internal predecessors, (94), 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) [2022-07-23 12:29:14,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2022-07-23 12:29:14,687 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 6 [2022-07-23 12:29:14,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:29:14,688 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2022-07-23 12:29:14,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 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) [2022-07-23 12:29:14,688 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2022-07-23 12:29:14,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-23 12:29:14,688 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:29:14,688 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:29:14,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-23 12:29:14,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:29:14,897 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-23 12:29:14,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:29:14,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1261842348, now seen corresponding path program 1 times [2022-07-23 12:29:14,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:29:14,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [98886394] [2022-07-23 12:29:14,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:29:14,899 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:29:14,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:29:14,900 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:29:14,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-23 12:29:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:29:14,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 12:29:14,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:29:15,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:29:15,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:29:15,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:29:15,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:29:15,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:29:15,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [98886394] [2022-07-23 12:29:15,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [98886394] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 12:29:15,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:29:15,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2022-07-23 12:29:15,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140287375] [2022-07-23 12:29:15,742 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:29:15,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 12:29:15,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:29:15,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 12:29:15,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-23 12:29:15,743 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 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) [2022-07-23 12:29:17,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:29:17,021 INFO L93 Difference]: Finished difference Result 98 states and 102 transitions. [2022-07-23 12:29:17,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 12:29:17,023 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 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 [2022-07-23 12:29:17,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:29:17,023 INFO L225 Difference]: With dead ends: 98 [2022-07-23 12:29:17,023 INFO L226 Difference]: Without dead ends: 98 [2022-07-23 12:29:17,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-07-23 12:29:17,024 INFO L413 NwaCegarLoop]: 87 mSDtfsCounter, 23 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-23 12:29:17,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 301 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-23 12:29:17,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-23 12:29:17,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-23 12:29:17,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 63 states have (on average 1.5873015873015872) internal successors, (100), 95 states have internal predecessors, (100), 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) [2022-07-23 12:29:17,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2022-07-23 12:29:17,031 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 10 [2022-07-23 12:29:17,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:29:17,031 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2022-07-23 12:29:17,031 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 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) [2022-07-23 12:29:17,031 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2022-07-23 12:29:17,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-23 12:29:17,032 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:29:17,032 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:29:17,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-23 12:29:17,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:29:17,243 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-23 12:29:17,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:29:17,244 INFO L85 PathProgramCache]: Analyzing trace with hash -821954458, now seen corresponding path program 1 times [2022-07-23 12:29:17,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:29:17,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [378477676] [2022-07-23 12:29:17,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:29:17,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:29:17,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:29:17,246 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:29:17,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-23 12:29:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:29:17,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 12:29:17,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:29:17,391 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:29:17,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:29:17,455 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:29:17,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:29:17,456 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [378477676] [2022-07-23 12:29:17,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [378477676] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 12:29:17,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:29:17,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-07-23 12:29:17,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983253571] [2022-07-23 12:29:17,456 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:29:17,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 12:29:17,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:29:17,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 12:29:17,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 12:29:17,457 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 12:29:17,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:29:17,627 INFO L93 Difference]: Finished difference Result 118 states and 122 transitions. [2022-07-23 12:29:17,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 12:29:17,628 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2022-07-23 12:29:17,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:29:17,628 INFO L225 Difference]: With dead ends: 118 [2022-07-23 12:29:17,629 INFO L226 Difference]: Without dead ends: 118 [2022-07-23 12:29:17,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-07-23 12:29:17,630 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 27 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 12:29:17,630 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 624 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 12:29:17,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-23 12:29:17,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-07-23 12:29:17,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 83 states have (on average 1.4457831325301205) internal successors, (120), 115 states have internal predecessors, (120), 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) [2022-07-23 12:29:17,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 122 transitions. [2022-07-23 12:29:17,637 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 122 transitions. Word has length 25 [2022-07-23 12:29:17,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:29:17,637 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 122 transitions. [2022-07-23 12:29:17,637 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.0) internal successors, (40), 10 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 12:29:17,637 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2022-07-23 12:29:17,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-23 12:29:17,638 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:29:17,638 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:29:17,648 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-23 12:29:17,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:29:17,847 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-23 12:29:17,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:29:17,848 INFO L85 PathProgramCache]: Analyzing trace with hash -34072841, now seen corresponding path program 2 times [2022-07-23 12:29:17,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:29:17,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814854077] [2022-07-23 12:29:17,849 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 12:29:17,849 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:29:17,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:29:17,850 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:29:17,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-23 12:29:17,973 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-23 12:29:17,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 12:29:17,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 12:29:17,978 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:29:18,010 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-23 12:29:18,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 14 [2022-07-23 12:29:18,033 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-23 12:29:18,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:29:18,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:29:18,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814854077] [2022-07-23 12:29:18,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1814854077] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:29:18,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:29:18,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 12:29:18,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141241802] [2022-07-23 12:29:18,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:29:18,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 12:29:18,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:29:18,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 12:29:18,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:29:18,035 INFO L87 Difference]: Start difference. First operand 118 states and 122 transitions. Second operand has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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) [2022-07-23 12:29:18,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:29:18,202 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2022-07-23 12:29:18,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 12:29:18,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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 45 [2022-07-23 12:29:18,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:29:18,203 INFO L225 Difference]: With dead ends: 129 [2022-07-23 12:29:18,203 INFO L226 Difference]: Without dead ends: 129 [2022-07-23 12:29:18,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 12:29:18,204 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 55 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 12:29:18,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 91 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 12:29:18,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-23 12:29:18,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 113. [2022-07-23 12:29:18,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 83 states have (on average 1.3855421686746987) internal successors, (115), 110 states have internal predecessors, (115), 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) [2022-07-23 12:29:18,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 117 transitions. [2022-07-23 12:29:18,208 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 117 transitions. Word has length 45 [2022-07-23 12:29:18,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:29:18,209 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 117 transitions. [2022-07-23 12:29:18,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.5) internal successors, (15), 3 states have internal predecessors, (15), 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) [2022-07-23 12:29:18,209 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 117 transitions. [2022-07-23 12:29:18,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-23 12:29:18,209 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:29:18,209 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:29:18,221 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-23 12:29:18,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:29:18,410 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-23 12:29:18,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:29:18,411 INFO L85 PathProgramCache]: Analyzing trace with hash -34072840, now seen corresponding path program 1 times [2022-07-23 12:29:18,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:29:18,411 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [124111130] [2022-07-23 12:29:18,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:29:18,411 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:29:18,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:29:18,412 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:29:18,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-23 12:29:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:29:18,555 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-23 12:29:18,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:29:18,636 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:29:18,637 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:29:18,815 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 12:29:18,816 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:29:18,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [124111130] [2022-07-23 12:29:18,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [124111130] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 12:29:18,816 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:29:18,816 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-07-23 12:29:18,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752434299] [2022-07-23 12:29:18,816 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:29:18,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-23 12:29:18,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:29:18,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-23 12:29:18,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-07-23 12:29:18,817 INFO L87 Difference]: Start difference. First operand 113 states and 117 transitions. Second operand has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 12:29:19,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:29:19,165 INFO L93 Difference]: Finished difference Result 121 states and 125 transitions. [2022-07-23 12:29:19,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 12:29:19,166 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 45 [2022-07-23 12:29:19,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:29:19,166 INFO L225 Difference]: With dead ends: 121 [2022-07-23 12:29:19,166 INFO L226 Difference]: Without dead ends: 121 [2022-07-23 12:29:19,167 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2022-07-23 12:29:19,167 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 33 mSDsluCounter, 1148 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 12:29:19,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 1241 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 12:29:19,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-23 12:29:19,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2022-07-23 12:29:19,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 91 states have (on average 1.3516483516483517) internal successors, (123), 118 states have internal predecessors, (123), 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) [2022-07-23 12:29:19,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2022-07-23 12:29:19,171 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 45 [2022-07-23 12:29:19,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:29:19,171 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2022-07-23 12:29:19,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.0) internal successors, (80), 20 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-23 12:29:19,171 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2022-07-23 12:29:19,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-23 12:29:19,172 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:29:19,172 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:29:19,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-23 12:29:19,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:29:19,383 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-23 12:29:19,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:29:19,383 INFO L85 PathProgramCache]: Analyzing trace with hash 2087093682, now seen corresponding path program 2 times [2022-07-23 12:29:19,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:29:19,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27909073] [2022-07-23 12:29:19,384 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 12:29:19,384 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:29:19,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:29:19,385 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:29:19,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-23 12:29:19,500 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-23 12:29:19,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 12:29:19,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-23 12:29:19,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:29:19,565 INFO L356 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2022-07-23 12:29:19,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2022-07-23 12:29:19,630 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-23 12:29:19,631 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:29:19,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:29:19,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27909073] [2022-07-23 12:29:19,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [27909073] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:29:19,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:29:19,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 12:29:19,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174305609] [2022-07-23 12:29:19,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:29:19,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 12:29:19,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:29:19,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 12:29:19,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 12:29:19,632 INFO L87 Difference]: Start difference. First operand 121 states and 125 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2022-07-23 12:29:19,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:29:19,977 INFO L93 Difference]: Finished difference Result 161 states and 167 transitions. [2022-07-23 12:29:19,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 12:29:19,978 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 [2022-07-23 12:29:19,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:29:19,979 INFO L225 Difference]: With dead ends: 161 [2022-07-23 12:29:19,979 INFO L226 Difference]: Without dead ends: 161 [2022-07-23 12:29:19,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-23 12:29:19,980 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 160 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 12:29:19,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 251 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 12:29:19,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-07-23 12:29:19,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 139. [2022-07-23 12:29:19,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 110 states have (on average 1.4) internal successors, (154), 136 states have internal predecessors, (154), 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) [2022-07-23 12:29:19,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 156 transitions. [2022-07-23 12:29:19,983 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 156 transitions. Word has length 53 [2022-07-23 12:29:19,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:29:19,984 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 156 transitions. [2022-07-23 12:29:19,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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) [2022-07-23 12:29:19,984 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 156 transitions. [2022-07-23 12:29:19,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-23 12:29:19,984 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:29:19,985 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:29:20,000 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-23 12:29:20,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:29:20,188 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-23 12:29:20,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:29:20,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1633693263, now seen corresponding path program 1 times [2022-07-23 12:29:20,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:29:20,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1077352251] [2022-07-23 12:29:20,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:29:20,189 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:29:20,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:29:20,190 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:29:20,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-23 12:29:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:29:20,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-23 12:29:20,480 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:29:20,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 12:29:20,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 12:29:20,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-23 12:29:20,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 12:29:20,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 12:29:20,762 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 12:29:20,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 12:29:20,825 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-23 12:29:20,825 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:29:20,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:29:20,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1077352251] [2022-07-23 12:29:20,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1077352251] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:29:20,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:29:20,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 12:29:20,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527775650] [2022-07-23 12:29:20,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:29:20,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 12:29:20,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:29:20,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 12:29:20,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-07-23 12:29:20,827 INFO L87 Difference]: Start difference. First operand 139 states and 156 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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) [2022-07-23 12:29:20,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:29:20,903 INFO L93 Difference]: Finished difference Result 140 states and 157 transitions. [2022-07-23 12:29:20,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 12:29:20,903 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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 [2022-07-23 12:29:20,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:29:20,904 INFO L225 Difference]: With dead ends: 140 [2022-07-23 12:29:20,904 INFO L226 Difference]: Without dead ends: 140 [2022-07-23 12:29:20,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-07-23 12:29:20,907 INFO L413 NwaCegarLoop]: 80 mSDtfsCounter, 5 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 12:29:20,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 384 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 49 Unchecked, 0.0s Time] [2022-07-23 12:29:20,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-23 12:29:20,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-07-23 12:29:20,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 111 states have (on average 1.3963963963963963) internal successors, (155), 137 states have internal predecessors, (155), 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) [2022-07-23 12:29:20,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 157 transitions. [2022-07-23 12:29:20,912 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 157 transitions. Word has length 56 [2022-07-23 12:29:20,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:29:20,913 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 157 transitions. [2022-07-23 12:29:20,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 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) [2022-07-23 12:29:20,913 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 157 transitions. [2022-07-23 12:29:20,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-23 12:29:20,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:29:20,914 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:29:20,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-23 12:29:21,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:29:21,126 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-23 12:29:21,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:29:21,127 INFO L85 PathProgramCache]: Analyzing trace with hash 895115800, now seen corresponding path program 1 times [2022-07-23 12:29:21,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:29:21,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290959903] [2022-07-23 12:29:21,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:29:21,128 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:29:21,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:29:21,132 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:29:21,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-23 12:29:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:29:21,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 12:29:21,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:29:21,339 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-23 12:29:21,339 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:29:21,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:29:21,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290959903] [2022-07-23 12:29:21,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1290959903] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:29:21,340 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:29:21,340 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:29:21,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520107322] [2022-07-23 12:29:21,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:29:21,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:29:21,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:29:21,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:29:21,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:29:21,341 INFO L87 Difference]: Start difference. First operand 140 states and 157 transitions. Second operand has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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) [2022-07-23 12:29:21,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:29:21,565 INFO L93 Difference]: Finished difference Result 163 states and 189 transitions. [2022-07-23 12:29:21,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:29:21,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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 [2022-07-23 12:29:21,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:29:21,566 INFO L225 Difference]: With dead ends: 163 [2022-07-23 12:29:21,567 INFO L226 Difference]: Without dead ends: 163 [2022-07-23 12:29:21,567 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 12:29:21,567 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 74 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 12:29:21,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 134 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 12:29:21,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-23 12:29:21,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 139. [2022-07-23 12:29:21,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 111 states have (on average 1.3783783783783783) internal successors, (153), 136 states have internal predecessors, (153), 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) [2022-07-23 12:29:21,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 155 transitions. [2022-07-23 12:29:21,571 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 155 transitions. Word has length 57 [2022-07-23 12:29:21,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:29:21,572 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 155 transitions. [2022-07-23 12:29:21,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.333333333333333) internal successors, (19), 4 states have internal predecessors, (19), 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) [2022-07-23 12:29:21,572 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 155 transitions. [2022-07-23 12:29:21,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-23 12:29:21,575 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:29:21,575 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:29:21,586 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-23 12:29:21,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:29:21,783 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-23 12:29:21,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:29:21,784 INFO L85 PathProgramCache]: Analyzing trace with hash 895115801, now seen corresponding path program 1 times [2022-07-23 12:29:21,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:29:21,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688408018] [2022-07-23 12:29:21,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:29:21,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:29:21,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:29:21,785 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:29:21,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-23 12:29:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:29:21,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-23 12:29:21,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:29:22,033 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-23 12:29:22,034 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:29:22,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:29:22,034 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [688408018] [2022-07-23 12:29:22,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [688408018] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:29:22,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:29:22,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 12:29:22,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034327174] [2022-07-23 12:29:22,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:29:22,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 12:29:22,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:29:22,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 12:29:22,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 12:29:22,035 INFO L87 Difference]: Start difference. First operand 139 states and 155 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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) [2022-07-23 12:29:22,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:29:22,247 INFO L93 Difference]: Finished difference Result 143 states and 148 transitions. [2022-07-23 12:29:22,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 12:29:22,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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 [2022-07-23 12:29:22,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:29:22,249 INFO L225 Difference]: With dead ends: 143 [2022-07-23 12:29:22,249 INFO L226 Difference]: Without dead ends: 143 [2022-07-23 12:29:22,249 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-23 12:29:22,249 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 119 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 12:29:22,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 257 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 12:29:22,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-23 12:29:22,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 121. [2022-07-23 12:29:22,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 93 states have (on average 1.3225806451612903) internal successors, (123), 118 states have internal predecessors, (123), 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) [2022-07-23 12:29:22,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 125 transitions. [2022-07-23 12:29:22,252 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 125 transitions. Word has length 57 [2022-07-23 12:29:22,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:29:22,252 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 125 transitions. [2022-07-23 12:29:22,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 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) [2022-07-23 12:29:22,252 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 125 transitions. [2022-07-23 12:29:22,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-23 12:29:22,253 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:29:22,253 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:29:22,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-23 12:29:22,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:29:22,465 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-23 12:29:22,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:29:22,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1978804018, now seen corresponding path program 1 times [2022-07-23 12:29:22,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:29:22,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300631003] [2022-07-23 12:29:22,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:29:22,466 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:29:22,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:29:22,468 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:29:22,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-23 12:29:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:29:22,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-23 12:29:22,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:29:22,707 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-23 12:29:22,708 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:29:22,708 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:29:22,708 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300631003] [2022-07-23 12:29:22,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300631003] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:29:22,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:29:22,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 12:29:22,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516253930] [2022-07-23 12:29:22,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:29:22,708 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 12:29:22,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:29:22,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 12:29:22,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-23 12:29:22,709 INFO L87 Difference]: Start difference. First operand 121 states and 125 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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) [2022-07-23 12:29:23,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:29:23,020 INFO L93 Difference]: Finished difference Result 139 states and 144 transitions. [2022-07-23 12:29:23,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 12:29:23,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 58 [2022-07-23 12:29:23,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:29:23,021 INFO L225 Difference]: With dead ends: 139 [2022-07-23 12:29:23,021 INFO L226 Difference]: Without dead ends: 139 [2022-07-23 12:29:23,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-23 12:29:23,022 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 89 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 12:29:23,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 197 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 12:29:23,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-23 12:29:23,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 132. [2022-07-23 12:29:23,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 105 states have (on average 1.3428571428571427) internal successors, (141), 129 states have internal predecessors, (141), 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) [2022-07-23 12:29:23,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2022-07-23 12:29:23,024 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 58 [2022-07-23 12:29:23,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:29:23,025 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2022-07-23 12:29:23,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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) [2022-07-23 12:29:23,025 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2022-07-23 12:29:23,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-23 12:29:23,025 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:29:23,025 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:29:23,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-07-23 12:29:23,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:29:23,231 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-23 12:29:23,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:29:23,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1213382400, now seen corresponding path program 1 times [2022-07-23 12:29:23,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:29:23,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300556828] [2022-07-23 12:29:23,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:29:23,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:29:23,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:29:23,234 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:29:23,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-23 12:29:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:29:23,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-23 12:29:23,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:29:23,558 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-23 12:29:23,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-23 12:29:23,576 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-23 12:29:23,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 18 [2022-07-23 12:29:23,749 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 12:29:23,749 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 23 [2022-07-23 12:29:23,775 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 12:29:23,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 12:29:23,946 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-23 12:29:23,946 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:29:23,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:29:23,946 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300556828] [2022-07-23 12:29:23,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300556828] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:29:23,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:29:23,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 12:29:23,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244036384] [2022-07-23 12:29:23,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:29:23,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 12:29:23,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:29:23,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 12:29:23,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-07-23 12:29:23,948 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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) [2022-07-23 12:29:24,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:29:24,045 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2022-07-23 12:29:24,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 12:29:24,045 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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 59 [2022-07-23 12:29:24,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:29:24,046 INFO L225 Difference]: With dead ends: 132 [2022-07-23 12:29:24,046 INFO L226 Difference]: Without dead ends: 132 [2022-07-23 12:29:24,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-07-23 12:29:24,046 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 4 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 12:29:24,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 378 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 76 Unchecked, 0.0s Time] [2022-07-23 12:29:24,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-23 12:29:24,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-07-23 12:29:24,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 105 states have (on average 1.3333333333333333) internal successors, (140), 129 states have internal predecessors, (140), 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) [2022-07-23 12:29:24,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2022-07-23 12:29:24,049 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 59 [2022-07-23 12:29:24,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:29:24,049 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2022-07-23 12:29:24,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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) [2022-07-23 12:29:24,049 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2022-07-23 12:29:24,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-23 12:29:24,050 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:29:24,050 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:29:24,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-23 12:29:24,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:29:24,251 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-23 12:29:24,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:29:24,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1213382399, now seen corresponding path program 1 times [2022-07-23 12:29:24,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:29:24,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [702755174] [2022-07-23 12:29:24,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:29:24,252 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:29:24,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:29:24,253 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:29:24,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-23 12:29:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:29:24,544 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-23 12:29:24,546 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:29:24,558 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-23 12:29:24,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 18 [2022-07-23 12:29:24,587 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 12:29:24,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-23 12:29:24,603 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-23 12:29:24,603 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:29:24,603 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:29:24,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [702755174] [2022-07-23 12:29:24,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [702755174] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:29:24,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:29:24,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 12:29:24,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87384099] [2022-07-23 12:29:24,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:29:24,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 12:29:24,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:29:24,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 12:29:24,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:29:24,605 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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) [2022-07-23 12:29:24,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:29:24,794 INFO L93 Difference]: Finished difference Result 139 states and 149 transitions. [2022-07-23 12:29:24,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 12:29:24,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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 59 [2022-07-23 12:29:24,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:29:24,795 INFO L225 Difference]: With dead ends: 139 [2022-07-23 12:29:24,795 INFO L226 Difference]: Without dead ends: 139 [2022-07-23 12:29:24,796 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 12:29:24,796 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 46 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 12:29:24,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 137 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 12:29:24,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-23 12:29:24,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2022-07-23 12:29:24,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 110 states have (on average 1.3363636363636364) internal successors, (147), 133 states have internal predecessors, (147), 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) [2022-07-23 12:29:24,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 149 transitions. [2022-07-23 12:29:24,799 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 149 transitions. Word has length 59 [2022-07-23 12:29:24,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:29:24,799 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 149 transitions. [2022-07-23 12:29:24,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 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) [2022-07-23 12:29:24,799 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 149 transitions. [2022-07-23 12:29:24,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-23 12:29:24,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:29:24,799 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:29:24,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-23 12:29:25,000 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:29:25,000 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-23 12:29:25,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:29:25,000 INFO L85 PathProgramCache]: Analyzing trace with hash 1430304375, now seen corresponding path program 1 times [2022-07-23 12:29:25,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:29:25,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5004374] [2022-07-23 12:29:25,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:29:25,001 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:29:25,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:29:25,002 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:29:25,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-23 12:29:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:29:25,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-23 12:29:25,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:29:25,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:29:25,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-23 12:29:25,488 INFO L356 Elim1Store]: treesize reduction 46, result has 20.7 percent of original size [2022-07-23 12:29:25,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 28 [2022-07-23 12:29:25,565 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2022-07-23 12:29:25,576 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-23 12:29:25,576 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:29:25,576 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:29:25,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [5004374] [2022-07-23 12:29:25,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [5004374] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:29:25,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:29:25,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 12:29:25,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550933276] [2022-07-23 12:29:25,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:29:25,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 12:29:25,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:29:25,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 12:29:25,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-23 12:29:25,577 INFO L87 Difference]: Start difference. First operand 136 states and 149 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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) [2022-07-23 12:29:25,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:29:25,931 INFO L93 Difference]: Finished difference Result 134 states and 145 transitions. [2022-07-23 12:29:25,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 12:29:25,932 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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 62 [2022-07-23 12:29:25,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:29:25,933 INFO L225 Difference]: With dead ends: 134 [2022-07-23 12:29:25,933 INFO L226 Difference]: Without dead ends: 134 [2022-07-23 12:29:25,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-07-23 12:29:25,933 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 70 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 12:29:25,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 205 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 12:29:25,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-23 12:29:25,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-07-23 12:29:25,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 110 states have (on average 1.3) internal successors, (143), 131 states have internal predecessors, (143), 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) [2022-07-23 12:29:25,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 145 transitions. [2022-07-23 12:29:25,936 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 145 transitions. Word has length 62 [2022-07-23 12:29:25,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:29:25,936 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 145 transitions. [2022-07-23 12:29:25,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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) [2022-07-23 12:29:25,936 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 145 transitions. [2022-07-23 12:29:25,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-23 12:29:25,936 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:29:25,936 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:29:25,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-23 12:29:26,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:29:26,150 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-23 12:29:26,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:29:26,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1430304376, now seen corresponding path program 1 times [2022-07-23 12:29:26,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:29:26,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1804873225] [2022-07-23 12:29:26,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:29:26,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:29:26,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:29:26,152 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:29:26,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-23 12:29:26,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:29:26,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-23 12:29:26,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:29:26,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-23 12:29:26,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:29:26,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-23 12:29:26,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-23 12:29:26,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2022-07-23 12:29:26,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-23 12:29:26,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-07-23 12:29:26,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 9 [2022-07-23 12:29:26,733 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-23 12:29:26,733 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:29:26,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:29:26,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1804873225] [2022-07-23 12:29:26,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1804873225] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:29:26,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:29:26,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 12:29:26,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694319727] [2022-07-23 12:29:26,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:29:26,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 12:29:26,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:29:26,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 12:29:26,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-23 12:29:26,734 INFO L87 Difference]: Start difference. First operand 134 states and 145 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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) [2022-07-23 12:29:27,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:29:27,143 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2022-07-23 12:29:27,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 12:29:27,144 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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 62 [2022-07-23 12:29:27,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:29:27,144 INFO L225 Difference]: With dead ends: 133 [2022-07-23 12:29:27,144 INFO L226 Difference]: Without dead ends: 133 [2022-07-23 12:29:27,145 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-23 12:29:27,145 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 72 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 12:29:27,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 204 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 12:29:27,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-23 12:29:27,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-07-23 12:29:27,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 110 states have (on average 1.2818181818181817) internal successors, (141), 130 states have internal predecessors, (141), 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) [2022-07-23 12:29:27,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2022-07-23 12:29:27,147 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 62 [2022-07-23 12:29:27,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:29:27,148 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2022-07-23 12:29:27,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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) [2022-07-23 12:29:27,148 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2022-07-23 12:29:27,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-23 12:29:27,148 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:29:27,148 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:29:27,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Ended with exit code 0 [2022-07-23 12:29:27,358 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:29:27,358 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-23 12:29:27,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:29:27,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1064372062, now seen corresponding path program 1 times [2022-07-23 12:29:27,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:29:27,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [947028026] [2022-07-23 12:29:27,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:29:27,359 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:29:27,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:29:27,361 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:29:27,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-23 12:29:27,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:29:27,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-23 12:29:27,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:29:27,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-23 12:29:27,840 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 12:29:27,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-23 12:29:27,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-23 12:29:27,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2022-07-23 12:29:28,013 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 12:29:28,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2022-07-23 12:29:28,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2022-07-23 12:29:28,130 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-23 12:29:28,130 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:29:28,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:29:28,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [947028026] [2022-07-23 12:29:28,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [947028026] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:29:28,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:29:28,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 12:29:28,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033340183] [2022-07-23 12:29:28,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:29:28,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 12:29:28,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:29:28,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 12:29:28,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-23 12:29:28,132 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 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) [2022-07-23 12:29:28,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:29:28,744 INFO L93 Difference]: Finished difference Result 154 states and 165 transitions. [2022-07-23 12:29:28,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 12:29:28,744 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 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 66 [2022-07-23 12:29:28,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:29:28,745 INFO L225 Difference]: With dead ends: 154 [2022-07-23 12:29:28,745 INFO L226 Difference]: Without dead ends: 154 [2022-07-23 12:29:28,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2022-07-23 12:29:28,745 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 98 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 12:29:28,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 244 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 177 Invalid, 0 Unknown, 51 Unchecked, 0.5s Time] [2022-07-23 12:29:28,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-07-23 12:29:28,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 142. [2022-07-23 12:29:28,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 119 states have (on average 1.3109243697478992) internal successors, (156), 139 states have internal predecessors, (156), 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) [2022-07-23 12:29:28,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 158 transitions. [2022-07-23 12:29:28,748 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 158 transitions. Word has length 66 [2022-07-23 12:29:28,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:29:28,748 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 158 transitions. [2022-07-23 12:29:28,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 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) [2022-07-23 12:29:28,748 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 158 transitions. [2022-07-23 12:29:28,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-23 12:29:28,748 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:29:28,748 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 12:29:28,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-23 12:29:28,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:29:28,960 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-23 12:29:28,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:29:28,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1064372061, now seen corresponding path program 1 times [2022-07-23 12:29:28,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:29:28,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786079628] [2022-07-23 12:29:28,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:29:28,961 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:29:28,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:29:28,962 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:29:28,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-23 12:29:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:29:29,397 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-23 12:29:29,399 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:29:29,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-23 12:29:29,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:29:29,447 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 12:29:29,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 12:29:29,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-23 12:29:29,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-23 12:29:29,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2022-07-23 12:29:29,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-23 12:29:29,673 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 12:29:29,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 57 [2022-07-23 12:29:29,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-23 12:29:29,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2022-07-23 12:29:29,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-07-23 12:29:29,782 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2022-07-23 12:29:29,783 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 12:29:29,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:29:29,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [786079628] [2022-07-23 12:29:29,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [786079628] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 12:29:29,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 12:29:29,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-23 12:29:29,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539393824] [2022-07-23 12:29:29,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 12:29:29,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 12:29:29,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:29:29,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 12:29:29,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-23 12:29:29,784 INFO L87 Difference]: Start difference. First operand 142 states and 158 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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) [2022-07-23 12:29:30,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:29:30,444 INFO L93 Difference]: Finished difference Result 154 states and 162 transitions. [2022-07-23 12:29:30,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 12:29:30,445 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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 66 [2022-07-23 12:29:30,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:29:30,445 INFO L225 Difference]: With dead ends: 154 [2022-07-23 12:29:30,445 INFO L226 Difference]: Without dead ends: 154 [2022-07-23 12:29:30,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2022-07-23 12:29:30,446 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 104 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 12:29:30,446 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 210 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-23 12:29:30,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-07-23 12:29:30,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 142. [2022-07-23 12:29:30,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 119 states have (on average 1.2773109243697478) internal successors, (152), 139 states have internal predecessors, (152), 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) [2022-07-23 12:29:30,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 154 transitions. [2022-07-23 12:29:30,449 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 154 transitions. Word has length 66 [2022-07-23 12:29:30,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:29:30,449 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 154 transitions. [2022-07-23 12:29:30,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 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) [2022-07-23 12:29:30,449 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 154 transitions. [2022-07-23 12:29:30,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-23 12:29:30,449 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:29:30,449 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 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] [2022-07-23 12:29:30,464 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-23 12:29:30,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:29:30,659 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-23 12:29:30,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:29:30,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1328353215, now seen corresponding path program 1 times [2022-07-23 12:29:30,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:29:30,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685599150] [2022-07-23 12:29:30,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:29:30,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:29:30,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:29:30,662 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:29:30,668 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-23 12:29:31,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:29:31,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-23 12:29:31,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:29:31,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-23 12:29:31,267 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-23 12:29:31,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-23 12:29:31,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-23 12:29:31,350 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2022-07-23 12:29:31,442 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 12:29:31,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2022-07-23 12:29:31,519 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 12:29:31,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 44 [2022-07-23 12:29:31,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2022-07-23 12:29:31,614 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2022-07-23 12:29:31,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:29:31,801 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1323 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0) v_ArrVal_1323) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))) (_ bv1 1))) is different from false [2022-07-23 12:29:31,832 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1323 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1322 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem125#1.base| v_ArrVal_1322))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1323)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1))) is different from false [2022-07-23 12:29:31,851 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1323 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1322 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1322))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1323)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1))) is different from false [2022-07-23 12:29:31,874 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1323 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1322 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1321 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select |c_#valid| (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1321))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1322)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) v_ArrVal_1323)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (_ bv1 1))) is different from false [2022-07-23 12:29:31,907 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 12:29:31,907 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 76 [2022-07-23 12:29:31,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3189 treesize of output 2532 [2022-07-23 12:29:31,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2528 treesize of output 2024 [2022-07-23 12:29:31,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2024 treesize of output 1548 [2022-07-23 12:29:31,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1548 treesize of output 1492 [2022-07-23 12:29:40,289 INFO L356 Elim1Store]: treesize reduction 18, result has 28.0 percent of original size [2022-07-23 12:29:40,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing 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 30 treesize of output 30 [2022-07-23 12:29:40,300 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 190 trivial. 2 not checked. [2022-07-23 12:29:40,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:29:40,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [685599150] [2022-07-23 12:29:40,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [685599150] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 12:29:40,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:29:40,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 18 [2022-07-23 12:29:40,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471249404] [2022-07-23 12:29:40,301 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:29:40,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-23 12:29:40,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:29:40,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-23 12:29:40,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=163, Unknown=8, NotChecked=116, Total=342 [2022-07-23 12:29:40,302 INFO L87 Difference]: Start difference. First operand 142 states and 154 transitions. Second operand has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 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) [2022-07-23 12:29:41,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:29:41,309 INFO L93 Difference]: Finished difference Result 150 states and 158 transitions. [2022-07-23 12:29:41,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 12:29:41,309 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 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 71 [2022-07-23 12:29:41,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:29:41,310 INFO L225 Difference]: With dead ends: 150 [2022-07-23 12:29:41,310 INFO L226 Difference]: Without dead ends: 150 [2022-07-23 12:29:41,310 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 123 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=97, Invalid=253, Unknown=8, NotChecked=148, Total=506 [2022-07-23 12:29:41,311 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 165 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 467 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 12:29:41,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 360 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 214 Invalid, 0 Unknown, 467 Unchecked, 0.5s Time] [2022-07-23 12:29:41,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-23 12:29:41,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 141. [2022-07-23 12:29:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 119 states have (on average 1.2605042016806722) internal successors, (150), 138 states have internal predecessors, (150), 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) [2022-07-23 12:29:41,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 152 transitions. [2022-07-23 12:29:41,313 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 152 transitions. Word has length 71 [2022-07-23 12:29:41,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:29:41,313 INFO L495 AbstractCegarLoop]: Abstraction has 141 states and 152 transitions. [2022-07-23 12:29:41,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 19 states have internal predecessors, (51), 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) [2022-07-23 12:29:41,314 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 152 transitions. [2022-07-23 12:29:41,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-23 12:29:41,314 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:29:41,314 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 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] [2022-07-23 12:29:41,331 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-23 12:29:41,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:29:41,515 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-23 12:29:41,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:29:41,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1328353214, now seen corresponding path program 1 times [2022-07-23 12:29:41,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:29:41,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1059510855] [2022-07-23 12:29:41,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 12:29:41,516 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:29:41,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:29:41,517 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:29:41,517 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-23 12:29:42,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 12:29:42,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-23 12:29:42,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:29:42,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-23 12:29:42,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:29:42,084 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 12:29:42,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 12:29:42,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-23 12:29:42,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-23 12:29:42,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2022-07-23 12:29:42,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-23 12:29:42,298 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 12:29:42,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 57 [2022-07-23 12:29:42,307 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-23 12:29:42,444 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 12:29:42,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 57 [2022-07-23 12:29:42,449 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-23 12:29:42,548 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2022-07-23 12:29:42,552 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-07-23 12:29:42,578 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2022-07-23 12:29:42,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:29:43,679 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1442 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_1442) |c_ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32))))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1442 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1441 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_1442) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) (_ bv1 64) ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_1441) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))) is different from false [2022-07-23 12:29:43,802 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1442 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1442) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32))))) (bvule (bvadd .cse0 .cse1) (bvadd (_ bv1 64) .cse0 .cse1)))) (forall ((v_ArrVal_1442 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1441 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1442) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1441) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))) is different from false [2022-07-23 12:29:43,908 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1442 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1441 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1442) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1441) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1442 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 ((_ sign_extend 32) (_ bv1 32))) (.cse3 (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1442) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4)))) (bvule (bvadd .cse2 .cse3) (bvadd .cse2 (_ bv1 64) .cse3))))) is different from false [2022-07-23 12:29:43,973 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1439 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1440 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1442 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem125#1.base| v_ArrVal_1439) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem125#1.base| v_ArrVal_1440) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1442) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (.cse1 ((_ sign_extend 32) (_ bv1 32)))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1439 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1440 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1442 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1441 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem125#1.base| v_ArrVal_1440)) (.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse3 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem125#1.base| v_ArrVal_1439) .cse3 v_ArrVal_1442) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64)) (select |c_#length| (select (select (store .cse5 .cse3 v_ArrVal_1441) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))) is different from false [2022-07-23 12:29:44,273 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1439 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1440 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1442 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 ((_ sign_extend 32) (_ bv1 32))) (.cse1 (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1439) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1440) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1442)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1439 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1440 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1442 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1441 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_1440))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1439) .cse5 v_ArrVal_1442) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6)) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_1441) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))))))))) is different from false [2022-07-23 12:29:44,418 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1437 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1439 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1438 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1440 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1442 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1441 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1437)) (.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1440))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd ((_ sign_extend 32) (_ bv1 32)) (_ bv1 64) (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1438) .cse0 v_ArrVal_1439) .cse1 v_ArrVal_1442) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1441) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1437 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1439 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1438 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1440 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1442 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 ((_ sign_extend 32) (_ bv1 32))) (.cse6 (let ((.cse9 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse8 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1437))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1438) .cse7 v_ArrVal_1439) (select (select (store .cse8 .cse7 v_ArrVal_1440) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9) v_ArrVal_1442))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse9)))) (bvule (bvadd .cse5 .cse6) (bvadd .cse5 (_ bv1 64) .cse6))))) is different from false [2022-07-23 12:29:44,493 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 12:29:44,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 228 treesize of output 216 [2022-07-23 12:29:44,510 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 12:29:44,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 202 treesize of output 138 [2022-07-23 12:29:44,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1481 treesize of output 1238 [2022-07-23 12:29:44,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6771 treesize of output 6366 [2022-07-23 12:29:44,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6362 treesize of output 5690 [2022-07-23 12:29:44,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5690 treesize of output 4570 [2022-07-23 12:29:44,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4570 treesize of output 4066 [2022-07-23 12:29:44,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 4066 treesize of output 3758 [2022-07-23 12:29:44,610 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 3758 treesize of output 3268 [2022-07-23 12:29:48,249 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 12:29:48,250 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 227 treesize of output 228 [2022-07-23 12:29:48,284 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 12:29:48,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 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 214 treesize of output 137 [2022-07-23 12:29:48,291 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 12:29:48,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 1227 treesize of output 768 [2022-07-23 12:29:48,305 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 12:29:48,306 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 12:29:48,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 963 treesize of output 810 [2022-07-23 12:29:48,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 806 treesize of output 722 [2022-07-23 12:29:48,332 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 722 treesize of output 526 [2022-07-23 12:29:48,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 526 treesize of output 470 [2022-07-23 12:29:48,779 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 12:29:48,779 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-23 12:29:48,783 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 3 not checked. [2022-07-23 12:29:48,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-23 12:29:48,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1059510855] [2022-07-23 12:29:48,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1059510855] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 12:29:48,783 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-23 12:29:48,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 23 [2022-07-23 12:29:48,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026040090] [2022-07-23 12:29:48,784 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-23 12:29:48,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-23 12:29:48,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-23 12:29:48,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-23 12:29:48,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=260, Unknown=6, NotChecked=222, Total=552 [2022-07-23 12:29:48,785 INFO L87 Difference]: Start difference. First operand 141 states and 152 transitions. Second operand has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 24 states have internal predecessors, (57), 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) [2022-07-23 12:29:51,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 12:29:51,812 INFO L93 Difference]: Finished difference Result 147 states and 158 transitions. [2022-07-23 12:29:51,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 12:29:51,813 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 24 states have internal predecessors, (57), 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 71 [2022-07-23 12:29:51,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 12:29:51,814 INFO L225 Difference]: With dead ends: 147 [2022-07-23 12:29:51,814 INFO L226 Difference]: Without dead ends: 147 [2022-07-23 12:29:51,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 118 SyntacticMatches, 6 SemanticMatches, 24 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=80, Invalid=318, Unknown=6, NotChecked=246, Total=650 [2022-07-23 12:29:51,815 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 19 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 332 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-23 12:29:51,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 621 Invalid, 544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 202 Invalid, 0 Unknown, 332 Unchecked, 1.9s Time] [2022-07-23 12:29:51,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-23 12:29:51,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2022-07-23 12:29:51,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 124 states have (on average 1.25) internal successors, (155), 143 states have internal predecessors, (155), 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) [2022-07-23 12:29:51,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 157 transitions. [2022-07-23 12:29:51,817 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 157 transitions. Word has length 71 [2022-07-23 12:29:51,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 12:29:51,817 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 157 transitions. [2022-07-23 12:29:51,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.4782608695652173) internal successors, (57), 24 states have internal predecessors, (57), 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) [2022-07-23 12:29:51,817 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 157 transitions. [2022-07-23 12:29:51,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-23 12:29:51,818 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 12:29:51,818 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 3, 3, 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] [2022-07-23 12:29:51,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-23 12:29:52,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-23 12:29:52,019 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 34 more)] === [2022-07-23 12:29:52,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 12:29:52,019 INFO L85 PathProgramCache]: Analyzing trace with hash -20716541, now seen corresponding path program 2 times [2022-07-23 12:29:52,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-23 12:29:52,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [895722918] [2022-07-23 12:29:52,020 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 12:29:52,020 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-23 12:29:52,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-23 12:29:52,021 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-23 12:29:52,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-23 12:29:52,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 12:29:52,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 12:29:52,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-23 12:29:52,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 12:29:52,738 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2022-07-23 12:29:52,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-23 12:29:52,785 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 12:29:52,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 12:29:52,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-23 12:29:52,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-23 12:29:52,933 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 34 [2022-07-23 12:29:52,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2022-07-23 12:29:53,064 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 12:29:53,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 57 [2022-07-23 12:29:53,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-23 12:29:53,248 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 12:29:53,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 57 [2022-07-23 12:29:53,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-23 12:29:53,453 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 12:29:53,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 57 [2022-07-23 12:29:53,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-07-23 12:29:53,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 13 [2022-07-23 12:29:53,582 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 7 [2022-07-23 12:29:53,618 INFO L134 CoverageAnalysis]: Checked inductivity of 201 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-23 12:29:53,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 12:29:54,771 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1569 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (bvule (bvadd (_ bv1 64) ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32))) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_1568) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_1569) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse0))))) (forall ((v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (.cse2 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_1568) |c_ULTIMATE.start_main_~argv~0#1.base|) (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|)))) (bvule (bvadd .cse1 .cse2) (bvadd (_ bv1 64) .cse1 .cse2))))) is different from false [2022-07-23 12:29:54,898 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1569 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1568) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1) (_ bv1 64) ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32)))) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1569) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1568) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (.cse3 ((_ sign_extend 32) (bvadd |c_ULTIMATE.start_main_~j~0#1| (_ bv1 32))))) (bvule (bvadd .cse2 .cse3) (bvadd .cse2 (_ bv1 64) .cse3))))) is different from false [2022-07-23 12:29:55,084 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) v_ArrVal_1568) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (.cse1 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|)))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 .cse1 (_ bv1 64))))) (forall ((v_ArrVal_1569 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse3 v_ArrVal_1568) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|)) (_ bv1 64)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse3 v_ArrVal_1569) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))))))) is different from false [2022-07-23 12:29:55,280 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1569 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1567 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1566 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_1567)) (.cse1 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1))) (bvule (bvadd ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|)) (_ bv1 64) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_1566) .cse0 v_ArrVal_1568) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1569) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1567 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1566 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|))) (.cse4 (let ((.cse5 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_1566) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem127#1.base| v_ArrVal_1567) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_1568) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5)))) (bvule (bvadd .cse3 .cse4) (bvadd .cse3 (_ bv1 64) .cse4))))) is different from false [2022-07-23 12:29:55,570 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1569 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1567 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1566 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse2 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (let ((.cse3 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1567))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1566) .cse1 v_ArrVal_1568) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2) ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|)) (_ bv1 64)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1569) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1567 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1566 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse4 (let ((.cse7 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (store (store |c_#memory_$Pointer$.offset| .cse6 v_ArrVal_1566) (select (select (store |c_#memory_$Pointer$.base| .cse6 v_ArrVal_1567) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) v_ArrVal_1568)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (.cse5 ((_ sign_extend 32) (bvadd (_ bv2 32) |c_ULTIMATE.start_main_~j~0#1|)))) (bvule (bvadd .cse4 .cse5) (bvadd .cse4 .cse5 (_ bv1 64)))))) is different from false [2022-07-23 12:29:55,685 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1567 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1566 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (store (store |c_#memory_$Pointer$.offset| .cse2 v_ArrVal_1566) (select (select (store |c_#memory_$Pointer$.base| .cse2 v_ArrVal_1567) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) v_ArrVal_1568)) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (.cse1 ((_ sign_extend 32) (_ bv2 32)))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1569 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1567 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1566 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (let ((.cse7 (store |c_#memory_$Pointer$.base| .cse4 v_ArrVal_1567))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse4 v_ArrVal_1566) .cse5 v_ArrVal_1568) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6) (_ bv1 64) ((_ sign_extend 32) (_ bv2 32))) (select |c_#length| (select (select (store .cse7 .cse5 v_ArrVal_1569) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse6))))))))) is different from false [2022-07-23 12:29:55,880 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1565 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1564 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1567 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1566 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (let ((.cse4 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse3 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem125#1.base| v_ArrVal_1564))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem125#1.base| v_ArrVal_1565) .cse2 v_ArrVal_1566) (select (select (store .cse3 .cse2 v_ArrVal_1567) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4) v_ArrVal_1568))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse4))) (.cse1 ((_ sign_extend 32) (_ bv2 32)))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1569 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1565 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1564 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1567 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1566 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse9 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem125#1.base| v_ArrVal_1564)) (.cse7 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse5 (select (select .cse9 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (let ((.cse8 (store .cse9 .cse5 v_ArrVal_1567))) (let ((.cse6 (select (select .cse8 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem125#1.base| v_ArrVal_1565) .cse5 v_ArrVal_1566) .cse6 v_ArrVal_1568) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7) (_ bv1 64) ((_ sign_extend 32) (_ bv2 32))) (select |c_#length| (select (select (store .cse8 .cse6 v_ArrVal_1569) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse7))))))))) is different from false [2022-07-23 12:29:57,985 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1569 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1565 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1564 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1567 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1566 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse3 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse5 (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1564))) (let ((.cse1 (select (select .cse5 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (let ((.cse4 (store .cse5 .cse1 v_ArrVal_1567))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3))) (bvule (bvadd (select (select (store (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1565) .cse1 v_ArrVal_1566) .cse2 v_ArrVal_1568) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3) (_ bv1 64) ((_ sign_extend 32) (_ bv2 32))) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_1569) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse3)))))))))) (forall ((v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1565 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1564 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1567 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1566 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse6 (let ((.cse11 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse8 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~argv~0#1.base|) .cse11))) (let ((.cse10 (store |c_#memory_$Pointer$.base| .cse8 v_ArrVal_1564))) (let ((.cse9 (select (select .cse10 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse11))) (store (store (store |c_#memory_$Pointer$.offset| .cse8 v_ArrVal_1565) .cse9 v_ArrVal_1566) (select (select (store .cse10 .cse9 v_ArrVal_1567) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse11) v_ArrVal_1568)))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse11))) (.cse7 ((_ sign_extend 32) (_ bv2 32)))) (bvule (bvadd .cse6 .cse7) (bvadd .cse6 (_ bv1 64) .cse7))))) is different from false [2022-07-23 12:30:00,157 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1565 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1564 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1567 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1566 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1563 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1562 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (let ((.cse5 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (select (select (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1562))) (let ((.cse2 (select (select .cse6 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (let ((.cse4 (store .cse6 .cse2 v_ArrVal_1564))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1563) .cse2 v_ArrVal_1565) .cse3 v_ArrVal_1566) (select (select (store .cse4 .cse3 v_ArrVal_1567) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5) v_ArrVal_1568))))) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse5))) (.cse1 ((_ sign_extend 32) (_ bv2 32)))) (bvule (bvadd .cse0 .cse1) (bvadd .cse0 (_ bv1 64) .cse1)))) (forall ((v_ArrVal_1569 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1568 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1565 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1564 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1567 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1566 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1563 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1562 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1562)) (.cse10 (bvadd (bvmul (_ bv8 64) ((_ sign_extend 32) |c_ULTIMATE.start_main_~i~4#1|)) |c_ULTIMATE.start_main_~argv~0#1.offset|))) (let ((.cse7 (select (select .cse13 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse12 (store .cse13 .cse7 v_ArrVal_1564))) (let ((.cse8 (select (select .cse12 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (let ((.cse11 (store .cse12 .cse8 v_ArrVal_1567))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))) (bvule (bvadd (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~mem_track~0#1.base| v_ArrVal_1563) .cse7 v_ArrVal_1565) .cse8 v_ArrVal_1566) .cse9 v_ArrVal_1568) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10) (_ bv1 64) ((_ sign_extend 32) (_ bv2 32))) (select |c_#length| (select (select (store .cse11 .cse9 v_ArrVal_1569) |c_ULTIMATE.start_main_~argv~0#1.base|) .cse10))))))))))) is different from false [2022-07-23 12:30:00,276 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 12:30:00,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 452 treesize of output 440 [2022-07-23 12:30:00,302 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 12:30:00,302 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 426 treesize of output 258 [2022-07-23 12:30:00,319 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120307 treesize of output 101632 [2022-07-23 12:30:01,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28239409 treesize of output 27386344 [2022-07-23 12:30:38,369 WARN L233 SmtUtils]: Spent 37.17s on a formula simplification that was a NOOP. DAG size: 2308 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 12:31:15,256 WARN L233 SmtUtils]: Spent 36.88s on a formula simplification that was a NOOP. DAG size: 2305 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 12:31:15,339 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27386340 treesize of output 26722852 [2022-07-23 12:31:52,157 WARN L233 SmtUtils]: Spent 36.82s on a formula simplification that was a NOOP. DAG size: 2304 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 12:31:52,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26722852 treesize of output 25788583 [2022-07-23 12:32:29,290 WARN L233 SmtUtils]: Spent 37.05s on a formula simplification that was a NOOP. DAG size: 2303 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 12:32:29,388 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25788583 treesize of output 24495655 [2022-07-23 12:33:06,737 WARN L233 SmtUtils]: Spent 37.35s on a formula simplification that was a NOOP. DAG size: 2302 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 12:33:06,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24495655 treesize of output 19289895 [2022-07-23 12:33:44,284 WARN L233 SmtUtils]: Spent 37.46s on a formula simplification that was a NOOP. DAG size: 2301 (called from [L 813] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-07-23 12:33:44,365 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19289895 treesize of output 18418983