./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 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/uthash-2.0.2/uthash_JEN_test1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60f6803c5e3744d9299e1af81cd011414f5ac623b556345642fa85a1d93686e4 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 12:58:48,455 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 12:58:48,457 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 12:58:48,494 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 12:58:48,494 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 12:58:48,496 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 12:58:48,498 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 12:58:48,500 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 12:58:48,501 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 12:58:48,505 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 12:58:48,506 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 12:58:48,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 12:58:48,508 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 12:58:48,509 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 12:58:48,510 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 12:58:48,511 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 12:58:48,512 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 12:58:48,513 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 12:58:48,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 12:58:48,520 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 12:58:48,522 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 12:58:48,523 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 12:58:48,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 12:58:48,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 12:58:48,525 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 12:58:48,531 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 12:58:48,531 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 12:58:48,531 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 12:58:48,532 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 12:58:48,532 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 12:58:48,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 12:58:48,534 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 12:58:48,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 12:58:48,535 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 12:58:48,536 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 12:58:48,536 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 12:58:48,536 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 12:58:48,537 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 12:58:48,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 12:58:48,538 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 12:58:48,539 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 12:58:48,540 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 12:58:48,541 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 12:58:48,554 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 12:58:48,554 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 12:58:48,554 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 12:58:48,555 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 12:58:48,555 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 12:58:48,555 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 12:58:48,556 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 12:58:48,556 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 12:58:48,556 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 12:58:48,556 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 12:58:48,557 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 12:58:48,557 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 12:58:48,557 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 12:58:48,557 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 12:58:48,557 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 12:58:48,557 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 12:58:48,557 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 12:58:48,558 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 12:58:48,558 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 12:58:48,558 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 12:58:48,558 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 12:58:48,558 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 12:58:48,558 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 12:58:48,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 12:58:48,559 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 12:58:48,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 12:58:48,559 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 12:58:48,559 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 12:58:48,559 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 12:58:48,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 12:58:48,560 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 60f6803c5e3744d9299e1af81cd011414f5ac623b556345642fa85a1d93686e4 [2022-07-20 12:58:48,711 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 12:58:48,728 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 12:58:48,729 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 12:58:48,730 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 12:58:48,730 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 12:58:48,731 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-2.i [2022-07-20 12:58:48,782 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eadaac989/16c529b01e5e479ca09439a5e8658b44/FLAG389d252b4 [2022-07-20 12:58:49,181 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 12:58:49,182 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-2.i [2022-07-20 12:58:49,196 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eadaac989/16c529b01e5e479ca09439a5e8658b44/FLAG389d252b4 [2022-07-20 12:58:49,216 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eadaac989/16c529b01e5e479ca09439a5e8658b44 [2022-07-20 12:58:49,218 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 12:58:49,219 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 12:58:49,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 12:58:49,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 12:58:49,224 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 12:58:49,224 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 12:58:49" (1/1) ... [2022-07-20 12:58:49,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35bfe900 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:58:49, skipping insertion in model container [2022-07-20 12:58:49,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 12:58:49" (1/1) ... [2022-07-20 12:58:49,229 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 12:58:49,278 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 12:58:49,553 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-2.i[33021,33034] [2022-07-20 12:58:49,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 12:58:49,667 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-20 12:58:49,668 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4bbf41a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:58:49, skipping insertion in model container [2022-07-20 12:58:49,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 12:58:49,668 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-20 12:58:49,670 INFO L158 Benchmark]: Toolchain (without parser) took 449.87ms. Allocated memory is still 94.4MB. Free memory was 58.7MB in the beginning and 61.3MB in the end (delta: -2.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-20 12:58:49,671 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 94.4MB. Free memory was 49.0MB in the beginning and 48.9MB in the end (delta: 37.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 12:58:49,673 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.19ms. Allocated memory is still 94.4MB. Free memory was 58.4MB in the beginning and 61.3MB in the end (delta: -2.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-20 12:58:49,675 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.14ms. Allocated memory is still 94.4MB. Free memory was 49.0MB in the beginning and 48.9MB in the end (delta: 37.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 448.19ms. Allocated memory is still 94.4MB. Free memory was 58.4MB in the beginning and 61.3MB in the end (delta: -2.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 751]: 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/uthash-2.0.2/uthash_JEN_test1-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 60f6803c5e3744d9299e1af81cd011414f5ac623b556345642fa85a1d93686e4 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 12:58:51,282 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 12:58:51,285 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 12:58:51,317 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 12:58:51,317 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 12:58:51,319 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 12:58:51,322 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 12:58:51,324 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 12:58:51,325 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 12:58:51,329 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 12:58:51,330 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 12:58:51,331 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 12:58:51,332 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 12:58:51,333 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 12:58:51,334 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 12:58:51,338 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 12:58:51,339 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 12:58:51,340 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 12:58:51,341 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 12:58:51,346 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 12:58:51,347 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 12:58:51,348 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 12:58:51,349 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 12:58:51,350 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 12:58:51,351 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 12:58:51,356 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 12:58:51,357 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 12:58:51,357 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 12:58:51,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 12:58:51,358 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 12:58:51,359 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 12:58:51,359 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 12:58:51,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 12:58:51,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 12:58:51,362 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 12:58:51,363 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 12:58:51,363 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 12:58:51,364 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 12:58:51,365 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 12:58:51,365 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 12:58:51,365 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 12:58:51,366 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 12:58:51,370 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-20 12:58:51,395 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 12:58:51,396 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 12:58:51,396 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 12:58:51,396 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 12:58:51,397 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 12:58:51,397 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 12:58:51,398 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 12:58:51,398 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 12:58:51,403 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 12:58:51,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 12:58:51,405 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 12:58:51,405 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 12:58:51,405 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 12:58:51,405 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 12:58:51,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 12:58:51,405 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 12:58:51,406 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 12:58:51,406 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 12:58:51,406 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 12:58:51,406 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 12:58:51,406 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 12:58:51,406 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 12:58:51,407 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 12:58:51,407 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 12:58:51,407 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 12:58:51,407 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 12:58:51,407 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 12:58:51,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 12:58:51,408 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 12:58:51,408 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 12:58:51,408 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 12:58:51,408 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 12:58:51,408 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 12:58:51,409 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 60f6803c5e3744d9299e1af81cd011414f5ac623b556345642fa85a1d93686e4 [2022-07-20 12:58:51,692 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 12:58:51,710 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 12:58:51,720 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 12:58:51,721 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 12:58:51,722 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 12:58:51,723 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-2.i [2022-07-20 12:58:51,779 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65d077599/1ead16c64d6444c290c831b06d972d89/FLAG02996644d [2022-07-20 12:58:52,189 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 12:58:52,189 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-2.i [2022-07-20 12:58:52,200 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65d077599/1ead16c64d6444c290c831b06d972d89/FLAG02996644d [2022-07-20 12:58:52,551 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/65d077599/1ead16c64d6444c290c831b06d972d89 [2022-07-20 12:58:52,553 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 12:58:52,554 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 12:58:52,557 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 12:58:52,557 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 12:58:52,559 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 12:58:52,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 12:58:52" (1/1) ... [2022-07-20 12:58:52,560 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b2b7db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:58:52, skipping insertion in model container [2022-07-20 12:58:52,560 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 12:58:52" (1/1) ... [2022-07-20 12:58:52,565 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 12:58:52,591 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 12:58:52,834 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-2.i[33021,33034] [2022-07-20 12:58:52,952 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 12:58:52,969 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-20 12:58:52,981 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 12:58:53,001 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-2.i[33021,33034] [2022-07-20 12:58:53,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 12:58:53,061 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 12:58:53,087 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test1-2.i[33021,33034] [2022-07-20 12:58:53,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 12:58:53,179 INFO L208 MainTranslator]: Completed translation [2022-07-20 12:58:53,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:58:53 WrapperNode [2022-07-20 12:58:53,181 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 12:58:53,182 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 12:58:53,183 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 12:58:53,183 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 12:58:53,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:58:53" (1/1) ... [2022-07-20 12:58:53,227 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:58:53" (1/1) ... [2022-07-20 12:58:53,285 INFO L137 Inliner]: procedures = 180, calls = 237, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 792 [2022-07-20 12:58:53,286 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 12:58:53,287 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 12:58:53,287 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 12:58:53,287 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 12:58:53,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:58:53" (1/1) ... [2022-07-20 12:58:53,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:58:53" (1/1) ... [2022-07-20 12:58:53,299 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:58:53" (1/1) ... [2022-07-20 12:58:53,300 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:58:53" (1/1) ... [2022-07-20 12:58:53,349 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:58:53" (1/1) ... [2022-07-20 12:58:53,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:58:53" (1/1) ... [2022-07-20 12:58:53,362 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:58:53" (1/1) ... [2022-07-20 12:58:53,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 12:58:53,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 12:58:53,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 12:58:53,379 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 12:58:53,380 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:58:53" (1/1) ... [2022-07-20 12:58:53,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 12:58:53,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 12:58:53,401 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-20 12:58:53,428 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-20 12:58:53,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-20 12:58:53,451 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-20 12:58:53,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-20 12:58:53,453 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-20 12:58:53,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-20 12:58:53,454 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-20 12:58:53,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 12:58:53,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 12:58:53,454 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 12:58:53,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 12:58:53,454 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 12:58:53,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 12:58:53,454 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-20 12:58:53,455 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-20 12:58:53,455 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 12:58:53,455 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 12:58:53,636 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 12:58:53,637 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 12:58:53,640 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-20 12:58:55,547 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 12:58:55,559 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 12:58:55,564 INFO L299 CfgBuilder]: Removed 40 assume(true) statements. [2022-07-20 12:58:55,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:58:55 BoogieIcfgContainer [2022-07-20 12:58:55,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 12:58:55,568 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 12:58:55,568 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 12:58:55,570 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 12:58:55,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 12:58:52" (1/3) ... [2022-07-20 12:58:55,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b02f08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 12:58:55, skipping insertion in model container [2022-07-20 12:58:55,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 12:58:53" (2/3) ... [2022-07-20 12:58:55,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73b02f08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 12:58:55, skipping insertion in model container [2022-07-20 12:58:55,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 12:58:55" (3/3) ... [2022-07-20 12:58:55,573 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test1-2.i [2022-07-20 12:58:55,582 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 12:58:55,582 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 435 error locations. [2022-07-20 12:58:55,641 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 12:58:55,646 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@720f0be1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@7654174d [2022-07-20 12:58:55,647 INFO L358 AbstractCegarLoop]: Starting to check reachability of 435 error locations. [2022-07-20 12:58:55,653 INFO L276 IsEmpty]: Start isEmpty. Operand has 867 states, 419 states have (on average 2.252983293556086) internal successors, (944), 861 states have internal predecessors, (944), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-20 12:58:55,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-20 12:58:55,657 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 12:58:55,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-20 12:58:55,658 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-20 12:58:55,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 12:58:55,662 INFO L85 PathProgramCache]: Analyzing trace with hash 37287509, now seen corresponding path program 1 times [2022-07-20 12:58:55,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 12:58:55,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [634932127] [2022-07-20 12:58:55,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 12:58:55,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 12:58:55,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 12:58:55,672 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-20 12:58:55,675 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-20 12:58:55,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 12:58:55,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-20 12:58:55,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 12:58:55,795 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-20 12:58:55,795 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 12:58:55,796 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 12:58:55,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [634932127] [2022-07-20 12:58:55,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [634932127] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 12:58:55,797 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 12:58:55,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 12:58:55,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123722534] [2022-07-20 12:58:55,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 12:58:55,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-20 12:58:55,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 12:58:55,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-20 12:58:55,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 12:58:55,822 INFO L87 Difference]: Start difference. First operand has 867 states, 419 states have (on average 2.252983293556086) internal successors, (944), 861 states have internal predecessors, (944), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 12:58:55,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 12:58:55,865 INFO L93 Difference]: Finished difference Result 858 states and 916 transitions. [2022-07-20 12:58:55,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-20 12:58:55,867 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-20 12:58:55,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 12:58:55,878 INFO L225 Difference]: With dead ends: 858 [2022-07-20 12:58:55,879 INFO L226 Difference]: Without dead ends: 856 [2022-07-20 12:58:55,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-20 12:58:55,882 INFO L413 NwaCegarLoop]: 916 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 916 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 12:58:55,883 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 12:58:55,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2022-07-20 12:58:55,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 856. [2022-07-20 12:58:55,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 414 states have (on average 2.1449275362318843) internal successors, (888), 850 states have internal predecessors, (888), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-20 12:58:55,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 914 transitions. [2022-07-20 12:58:55,934 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 914 transitions. Word has length 5 [2022-07-20 12:58:55,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 12:58:55,934 INFO L495 AbstractCegarLoop]: Abstraction has 856 states and 914 transitions. [2022-07-20 12:58:55,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 12:58:55,935 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 914 transitions. [2022-07-20 12:58:55,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-20 12:58:55,935 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 12:58:55,935 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-20 12:58:55,944 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-20 12:58:56,141 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-20 12:58:56,141 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-20 12:58:56,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 12:58:56,142 INFO L85 PathProgramCache]: Analyzing trace with hash 37287571, now seen corresponding path program 1 times [2022-07-20 12:58:56,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 12:58:56,142 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1277927526] [2022-07-20 12:58:56,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 12:58:56,142 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 12:58:56,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 12:58:56,144 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-20 12:58:56,150 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-20 12:58:56,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 12:58:56,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 12:58:56,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 12:58:56,290 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-20 12:58:56,299 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-20 12:58:56,299 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 12:58:56,300 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 12:58:56,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1277927526] [2022-07-20 12:58:56,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1277927526] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 12:58:56,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 12:58:56,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 12:58:56,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426556899] [2022-07-20 12:58:56,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 12:58:56,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 12:58:56,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 12:58:56,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 12:58:56,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 12:58:56,302 INFO L87 Difference]: Start difference. First operand 856 states and 914 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 12:58:57,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 12:58:57,148 INFO L93 Difference]: Finished difference Result 814 states and 873 transitions. [2022-07-20 12:58:57,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 12:58:57,149 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-20 12:58:57,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 12:58:57,152 INFO L225 Difference]: With dead ends: 814 [2022-07-20 12:58:57,153 INFO L226 Difference]: Without dead ends: 814 [2022-07-20 12:58:57,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 12:58:57,154 INFO L413 NwaCegarLoop]: 544 mSDtfsCounter, 596 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 609 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-20 12:58:57,154 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [609 Valid, 662 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-20 12:58:57,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814 states. [2022-07-20 12:58:57,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814 to 807. [2022-07-20 12:58:57,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 807 states, 414 states have (on average 2.026570048309179) internal successors, (839), 801 states have internal predecessors, (839), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-20 12:58:57,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 865 transitions. [2022-07-20 12:58:57,187 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 865 transitions. Word has length 5 [2022-07-20 12:58:57,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 12:58:57,187 INFO L495 AbstractCegarLoop]: Abstraction has 807 states and 865 transitions. [2022-07-20 12:58:57,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 12:58:57,187 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 865 transitions. [2022-07-20 12:58:57,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-20 12:58:57,188 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 12:58:57,188 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-20 12:58:57,197 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-20 12:58:57,391 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-20 12:58:57,391 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-20 12:58:57,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 12:58:57,392 INFO L85 PathProgramCache]: Analyzing trace with hash 37287572, now seen corresponding path program 1 times [2022-07-20 12:58:57,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 12:58:57,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [217851456] [2022-07-20 12:58:57,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 12:58:57,393 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 12:58:57,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 12:58:57,394 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-20 12:58:57,396 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-20 12:58:57,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 12:58:57,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 12:58:57,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 12:58:57,481 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-20 12:58:57,496 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-20 12:58:57,496 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 12:58:57,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 12:58:57,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [217851456] [2022-07-20 12:58:57,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [217851456] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 12:58:57,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 12:58:57,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 12:58:57,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980101344] [2022-07-20 12:58:57,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 12:58:57,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 12:58:57,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 12:58:57,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 12:58:57,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 12:58:57,498 INFO L87 Difference]: Start difference. First operand 807 states and 865 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 12:58:58,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 12:58:58,555 INFO L93 Difference]: Finished difference Result 874 states and 936 transitions. [2022-07-20 12:58:58,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 12:58:58,555 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-07-20 12:58:58,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 12:58:58,558 INFO L225 Difference]: With dead ends: 874 [2022-07-20 12:58:58,558 INFO L226 Difference]: Without dead ends: 874 [2022-07-20 12:58:58,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 12:58:58,559 INFO L413 NwaCegarLoop]: 740 mSDtfsCounter, 254 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 1065 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-20 12:58:58,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 1065 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-07-20 12:58:58,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2022-07-20 12:58:58,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 829. [2022-07-20 12:58:58,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 446 states have (on average 2.006726457399103) internal successors, (895), 823 states have internal predecessors, (895), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-20 12:58:58,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 921 transitions. [2022-07-20 12:58:58,577 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 921 transitions. Word has length 5 [2022-07-20 12:58:58,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 12:58:58,577 INFO L495 AbstractCegarLoop]: Abstraction has 829 states and 921 transitions. [2022-07-20 12:58:58,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 12:58:58,578 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 921 transitions. [2022-07-20 12:58:58,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-20 12:58:58,578 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 12:58:58,578 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-20 12:58:58,589 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-20 12:58:58,784 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-20 12:58:58,784 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr322REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-20 12:58:58,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 12:58:58,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1156735106, now seen corresponding path program 1 times [2022-07-20 12:58:58,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 12:58:58,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [869578940] [2022-07-20 12:58:58,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 12:58:58,786 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 12:58:58,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 12:58:58,791 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-20 12:58:58,792 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-20 12:58:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 12:58:58,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 12:58:58,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 12:58:58,864 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-20 12:58:58,864 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 12:58:58,864 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 12:58:58,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [869578940] [2022-07-20 12:58:58,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [869578940] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 12:58:58,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 12:58:58,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 12:58:58,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228037404] [2022-07-20 12:58:58,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 12:58:58,865 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 12:58:58,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 12:58:58,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 12:58:58,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 12:58:58,866 INFO L87 Difference]: Start difference. First operand 829 states and 921 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-20 12:58:58,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 12:58:58,908 INFO L93 Difference]: Finished difference Result 1410 states and 1563 transitions. [2022-07-20 12:58:58,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 12:58:58,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-20 12:58:58,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 12:58:58,914 INFO L225 Difference]: With dead ends: 1410 [2022-07-20 12:58:58,914 INFO L226 Difference]: Without dead ends: 1410 [2022-07-20 12:58:58,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-20 12:58:58,915 INFO L413 NwaCegarLoop]: 1076 mSDtfsCounter, 569 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 1925 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 12:58:58,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 1925 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 12:58:58,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2022-07-20 12:58:58,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 830. [2022-07-20 12:58:58,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 447 states have (on average 2.004474272930649) internal successors, (896), 824 states have internal predecessors, (896), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-20 12:58:58,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 922 transitions. [2022-07-20 12:58:58,946 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 922 transitions. Word has length 6 [2022-07-20 12:58:58,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 12:58:58,946 INFO L495 AbstractCegarLoop]: Abstraction has 830 states and 922 transitions. [2022-07-20 12:58:58,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 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-20 12:58:58,947 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 922 transitions. [2022-07-20 12:58:58,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 12:58:58,947 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 12:58:58,947 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 12:58:58,972 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-20 12:58:59,153 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-20 12:58:59,153 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-20 12:58:59,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 12:58:59,154 INFO L85 PathProgramCache]: Analyzing trace with hash 334651453, now seen corresponding path program 1 times [2022-07-20 12:58:59,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 12:58:59,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003845785] [2022-07-20 12:58:59,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 12:58:59,155 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 12:58:59,155 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 12:58:59,156 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-20 12:58:59,157 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-20 12:58:59,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 12:58:59,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 12:58:59,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 12:58:59,276 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-20 12:58:59,277 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 12:58:59,277 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 12:58:59,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1003845785] [2022-07-20 12:58:59,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1003845785] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 12:58:59,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 12:58:59,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 12:58:59,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621122809] [2022-07-20 12:58:59,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 12:58:59,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 12:58:59,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 12:58:59,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 12:58:59,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 12:58:59,279 INFO L87 Difference]: Start difference. First operand 830 states and 922 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-20 12:58:59,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 12:58:59,301 INFO L93 Difference]: Finished difference Result 794 states and 885 transitions. [2022-07-20 12:58:59,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 12:58:59,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2022-07-20 12:58:59,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 12:58:59,306 INFO L225 Difference]: With dead ends: 794 [2022-07-20 12:58:59,306 INFO L226 Difference]: Without dead ends: 794 [2022-07-20 12:58:59,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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-20 12:58:59,308 INFO L413 NwaCegarLoop]: 807 mSDtfsCounter, 773 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 786 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 12:58:59,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [786 Valid, 837 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 12:58:59,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2022-07-20 12:58:59,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 788. [2022-07-20 12:58:59,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 788 states, 429 states have (on average 1.9883449883449884) internal successors, (853), 782 states have internal predecessors, (853), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-20 12:58:59,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 879 transitions. [2022-07-20 12:58:59,321 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 879 transitions. Word has length 11 [2022-07-20 12:58:59,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 12:58:59,321 INFO L495 AbstractCegarLoop]: Abstraction has 788 states and 879 transitions. [2022-07-20 12:58:59,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-20 12:58:59,322 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 879 transitions. [2022-07-20 12:58:59,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 12:58:59,322 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 12:58:59,322 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 12:58:59,334 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-20 12:58:59,529 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-20 12:58:59,530 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-20 12:58:59,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 12:58:59,530 INFO L85 PathProgramCache]: Analyzing trace with hash -522505033, now seen corresponding path program 1 times [2022-07-20 12:58:59,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 12:58:59,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [906775228] [2022-07-20 12:58:59,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 12:58:59,531 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 12:58:59,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 12:58:59,532 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-20 12:58:59,533 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-20 12:58:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 12:58:59,654 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 12:58:59,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 12:58:59,671 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-20 12:58:59,671 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 12:58:59,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 12:58:59,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [906775228] [2022-07-20 12:58:59,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [906775228] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 12:58:59,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 12:58:59,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 12:58:59,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446726044] [2022-07-20 12:58:59,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 12:58:59,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 12:58:59,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 12:58:59,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 12:58:59,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 12:58:59,673 INFO L87 Difference]: Start difference. First operand 788 states and 879 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-20 12:58:59,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 12:58:59,729 INFO L93 Difference]: Finished difference Result 773 states and 857 transitions. [2022-07-20 12:58:59,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 12:58:59,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-07-20 12:58:59,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 12:58:59,732 INFO L225 Difference]: With dead ends: 773 [2022-07-20 12:58:59,732 INFO L226 Difference]: Without dead ends: 773 [2022-07-20 12:58:59,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 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-20 12:58:59,733 INFO L413 NwaCegarLoop]: 762 mSDtfsCounter, 744 mSDsluCounter, 785 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 757 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 12:58:59,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [757 Valid, 1547 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 12:58:59,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2022-07-20 12:58:59,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 766. [2022-07-20 12:58:59,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 421 states have (on average 1.9572446555819478) internal successors, (824), 760 states have internal predecessors, (824), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-20 12:58:59,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 850 transitions. [2022-07-20 12:58:59,744 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 850 transitions. Word has length 13 [2022-07-20 12:58:59,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 12:58:59,744 INFO L495 AbstractCegarLoop]: Abstraction has 766 states and 850 transitions. [2022-07-20 12:58:59,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-20 12:58:59,745 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 850 transitions. [2022-07-20 12:58:59,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 12:58:59,745 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 12:58:59,745 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 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-20 12:58:59,769 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-20 12:58:59,953 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-20 12:58:59,953 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-20 12:58:59,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 12:58:59,954 INFO L85 PathProgramCache]: Analyzing trace with hash -22216187, now seen corresponding path program 1 times [2022-07-20 12:58:59,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 12:58:59,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [839758120] [2022-07-20 12:58:59,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 12:58:59,954 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 12:58:59,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 12:58:59,958 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-20 12:58:59,964 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-20 12:59:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 12:59:00,072 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 12:59:00,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 12:59:00,079 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-20 12:59:00,127 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-20 12:59:00,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 12:59:00,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 12:59:00,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [839758120] [2022-07-20 12:59:00,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [839758120] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 12:59:00,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 12:59:00,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 12:59:00,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542659438] [2022-07-20 12:59:00,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 12:59:00,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 12:59:00,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 12:59:00,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 12:59:00,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 12:59:00,130 INFO L87 Difference]: Start difference. First operand 766 states and 850 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-20 12:59:01,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 12:59:01,368 INFO L93 Difference]: Finished difference Result 993 states and 1108 transitions. [2022-07-20 12:59:01,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 12:59:01,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2022-07-20 12:59:01,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 12:59:01,372 INFO L225 Difference]: With dead ends: 993 [2022-07-20 12:59:01,372 INFO L226 Difference]: Without dead ends: 993 [2022-07-20 12:59:01,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-20 12:59:01,373 INFO L413 NwaCegarLoop]: 418 mSDtfsCounter, 1151 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 703 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1161 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 703 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-20 12:59:01,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1161 Valid, 718 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 703 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-20 12:59:01,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2022-07-20 12:59:01,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 762. [2022-07-20 12:59:01,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 762 states, 421 states have (on average 1.9477434679334917) internal successors, (820), 756 states have internal predecessors, (820), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-20 12:59:01,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 762 states to 762 states and 846 transitions. [2022-07-20 12:59:01,397 INFO L78 Accepts]: Start accepts. Automaton has 762 states and 846 transitions. Word has length 27 [2022-07-20 12:59:01,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 12:59:01,397 INFO L495 AbstractCegarLoop]: Abstraction has 762 states and 846 transitions. [2022-07-20 12:59:01,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-20 12:59:01,397 INFO L276 IsEmpty]: Start isEmpty. Operand 762 states and 846 transitions. [2022-07-20 12:59:01,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 12:59:01,398 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 12:59:01,398 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 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-20 12:59:01,418 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-20 12:59:01,605 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-20 12:59:01,606 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-20 12:59:01,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 12:59:01,606 INFO L85 PathProgramCache]: Analyzing trace with hash -22216186, now seen corresponding path program 1 times [2022-07-20 12:59:01,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 12:59:01,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [501532111] [2022-07-20 12:59:01,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 12:59:01,607 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 12:59:01,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 12:59:01,608 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-20 12:59:01,609 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-20 12:59:01,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 12:59:01,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 12:59:01,713 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 12:59:01,720 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-20 12:59:01,843 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-20 12:59:01,843 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 12:59:01,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 12:59:01,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [501532111] [2022-07-20 12:59:01,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [501532111] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 12:59:01,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 12:59:01,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 12:59:01,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337375727] [2022-07-20 12:59:01,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 12:59:01,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 12:59:01,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 12:59:01,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 12:59:01,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 12:59:01,847 INFO L87 Difference]: Start difference. First operand 762 states and 846 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-20 12:59:03,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 12:59:03,711 INFO L93 Difference]: Finished difference Result 1043 states and 1128 transitions. [2022-07-20 12:59:03,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 12:59:03,712 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2022-07-20 12:59:03,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 12:59:03,715 INFO L225 Difference]: With dead ends: 1043 [2022-07-20 12:59:03,716 INFO L226 Difference]: Without dead ends: 1043 [2022-07-20 12:59:03,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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-20 12:59:03,717 INFO L413 NwaCegarLoop]: 604 mSDtfsCounter, 561 mSDsluCounter, 650 mSDsCounter, 0 mSdLazyCounter, 902 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 906 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 902 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-20 12:59:03,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 1254 Invalid, 906 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 902 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-20 12:59:03,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2022-07-20 12:59:03,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 758. [2022-07-20 12:59:03,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 421 states have (on average 1.9382422802850356) internal successors, (816), 752 states have internal predecessors, (816), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-20 12:59:03,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 842 transitions. [2022-07-20 12:59:03,730 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 842 transitions. Word has length 27 [2022-07-20 12:59:03,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 12:59:03,730 INFO L495 AbstractCegarLoop]: Abstraction has 758 states and 842 transitions. [2022-07-20 12:59:03,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 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-20 12:59:03,730 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 842 transitions. [2022-07-20 12:59:03,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 12:59:03,731 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 12:59:03,731 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:59:03,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-20 12:59:03,956 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-20 12:59:03,957 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-20 12:59:03,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 12:59:03,957 INFO L85 PathProgramCache]: Analyzing trace with hash 810363537, now seen corresponding path program 1 times [2022-07-20 12:59:03,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 12:59:03,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1254340954] [2022-07-20 12:59:03,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 12:59:03,958 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 12:59:03,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 12:59:03,959 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-20 12:59:03,960 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-20 12:59:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 12:59:04,087 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 12:59:04,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 12:59:04,126 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-20 12:59:04,126 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 12:59:04,126 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 12:59:04,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1254340954] [2022-07-20 12:59:04,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1254340954] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 12:59:04,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 12:59:04,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 12:59:04,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293802614] [2022-07-20 12:59:04,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 12:59:04,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 12:59:04,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 12:59:04,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 12:59:04,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 12:59:04,129 INFO L87 Difference]: Start difference. First operand 758 states and 842 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-20 12:59:04,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 12:59:04,174 INFO L93 Difference]: Finished difference Result 758 states and 838 transitions. [2022-07-20 12:59:04,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 12:59:04,174 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 42 [2022-07-20 12:59:04,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 12:59:04,176 INFO L225 Difference]: With dead ends: 758 [2022-07-20 12:59:04,176 INFO L226 Difference]: Without dead ends: 758 [2022-07-20 12:59:04,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 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-20 12:59:04,178 INFO L413 NwaCegarLoop]: 756 mSDtfsCounter, 720 mSDsluCounter, 769 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 12:59:04,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 1525 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 12:59:04,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2022-07-20 12:59:04,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 752. [2022-07-20 12:59:04,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 752 states, 415 states have (on average 1.9421686746987952) internal successors, (806), 746 states have internal predecessors, (806), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-20 12:59:04,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 752 states to 752 states and 832 transitions. [2022-07-20 12:59:04,202 INFO L78 Accepts]: Start accepts. Automaton has 752 states and 832 transitions. Word has length 42 [2022-07-20 12:59:04,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 12:59:04,203 INFO L495 AbstractCegarLoop]: Abstraction has 752 states and 832 transitions. [2022-07-20 12:59:04,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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-20 12:59:04,203 INFO L276 IsEmpty]: Start isEmpty. Operand 752 states and 832 transitions. [2022-07-20 12:59:04,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-20 12:59:04,206 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 12:59:04,206 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:59:04,218 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-20 12:59:04,414 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-20 12:59:04,416 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr108REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-20 12:59:04,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 12:59:04,417 INFO L85 PathProgramCache]: Analyzing trace with hash 2087041861, now seen corresponding path program 1 times [2022-07-20 12:59:04,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 12:59:04,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [294398760] [2022-07-20 12:59:04,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 12:59:04,418 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 12:59:04,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 12:59:04,419 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-20 12:59:04,420 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-20 12:59:04,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 12:59:04,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 12:59:04,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 12:59:04,750 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-20 12:59:04,750 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 12:59:04,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 12:59:04,750 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [294398760] [2022-07-20 12:59:04,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [294398760] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 12:59:04,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 12:59:04,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 12:59:04,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527362069] [2022-07-20 12:59:04,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 12:59:04,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 12:59:04,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 12:59:04,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 12:59:04,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 12:59:04,752 INFO L87 Difference]: Start difference. First operand 752 states and 832 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-20 12:59:04,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 12:59:04,902 INFO L93 Difference]: Finished difference Result 993 states and 1082 transitions. [2022-07-20 12:59:04,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 12:59:04,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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 50 [2022-07-20 12:59:04,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 12:59:04,910 INFO L225 Difference]: With dead ends: 993 [2022-07-20 12:59:04,910 INFO L226 Difference]: Without dead ends: 993 [2022-07-20 12:59:04,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 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-20 12:59:04,911 INFO L413 NwaCegarLoop]: 835 mSDtfsCounter, 269 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 1465 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 12:59:04,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 1465 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 12:59:04,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2022-07-20 12:59:04,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 798. [2022-07-20 12:59:04,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 461 states have (on average 1.8481561822125814) internal successors, (852), 792 states have internal predecessors, (852), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-20 12:59:04,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 878 transitions. [2022-07-20 12:59:04,922 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 878 transitions. Word has length 50 [2022-07-20 12:59:04,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 12:59:04,922 INFO L495 AbstractCegarLoop]: Abstraction has 798 states and 878 transitions. [2022-07-20 12:59:04,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 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-20 12:59:04,922 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 878 transitions. [2022-07-20 12:59:04,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-20 12:59:04,923 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 12:59:04,923 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:59:04,932 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-20 12:59:05,131 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-20 12:59:05,132 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-20 12:59:05,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 12:59:05,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1009990608, now seen corresponding path program 1 times [2022-07-20 12:59:05,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 12:59:05,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561752761] [2022-07-20 12:59:05,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 12:59:05,133 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 12:59:05,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 12:59:05,140 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-20 12:59:05,141 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-20 12:59:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 12:59:05,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 12:59:05,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 12:59:05,426 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-20 12:59:05,430 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-20 12:59:05,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 12:59:05,709 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 12 treesize of output 14 [2022-07-20 12:59:05,717 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 12:59:05,718 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-20 12:59:05,729 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-20 12:59:05,729 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 12:59:05,729 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 12:59:05,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561752761] [2022-07-20 12:59:05,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1561752761] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 12:59:05,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 12:59:05,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 12:59:05,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195196748] [2022-07-20 12:59:05,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 12:59:05,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 12:59:05,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 12:59:05,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 12:59:05,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 12:59:05,731 INFO L87 Difference]: Start difference. First operand 798 states and 878 transitions. Second operand has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 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-20 12:59:06,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 12:59:06,908 INFO L93 Difference]: Finished difference Result 767 states and 848 transitions. [2022-07-20 12:59:06,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 12:59:06,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 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 53 [2022-07-20 12:59:06,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 12:59:06,911 INFO L225 Difference]: With dead ends: 767 [2022-07-20 12:59:06,911 INFO L226 Difference]: Without dead ends: 767 [2022-07-20 12:59:06,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 12:59:06,911 INFO L413 NwaCegarLoop]: 409 mSDtfsCounter, 441 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-20 12:59:06,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 677 Invalid, 668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 623 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-20 12:59:06,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2022-07-20 12:59:06,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 728. [2022-07-20 12:59:06,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 429 states have (on average 1.7435897435897436) internal successors, (748), 722 states have internal predecessors, (748), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-20 12:59:06,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 774 transitions. [2022-07-20 12:59:06,920 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 774 transitions. Word has length 53 [2022-07-20 12:59:06,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 12:59:06,921 INFO L495 AbstractCegarLoop]: Abstraction has 728 states and 774 transitions. [2022-07-20 12:59:06,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 17.666666666666668) internal successors, (53), 4 states have internal predecessors, (53), 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-20 12:59:06,921 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 774 transitions. [2022-07-20 12:59:06,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-20 12:59:06,922 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 12:59:06,922 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:59:06,944 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-20 12:59:07,132 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-20 12:59:07,132 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-20 12:59:07,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 12:59:07,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678057, now seen corresponding path program 1 times [2022-07-20 12:59:07,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 12:59:07,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [491025054] [2022-07-20 12:59:07,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 12:59:07,133 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 12:59:07,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 12:59:07,145 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-20 12:59:07,146 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-20 12:59:07,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 12:59:07,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 12:59:07,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 12:59:07,320 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-20 12:59:07,348 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 13 treesize of output 9 [2022-07-20 12:59:07,364 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 21 treesize of output 9 [2022-07-20 12:59:07,369 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-20 12:59:07,369 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 12:59:07,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 12:59:07,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [491025054] [2022-07-20 12:59:07,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [491025054] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 12:59:07,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 12:59:07,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 12:59:07,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011167295] [2022-07-20 12:59:07,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 12:59:07,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 12:59:07,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 12:59:07,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 12:59:07,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 12:59:07,371 INFO L87 Difference]: Start difference. First operand 728 states and 774 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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-20 12:59:08,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 12:59:08,660 INFO L93 Difference]: Finished difference Result 727 states and 773 transitions. [2022-07-20 12:59:08,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 12:59:08,661 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2022-07-20 12:59:08,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 12:59:08,663 INFO L225 Difference]: With dead ends: 727 [2022-07-20 12:59:08,663 INFO L226 Difference]: Without dead ends: 727 [2022-07-20 12:59:08,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 12:59:08,664 INFO L413 NwaCegarLoop]: 722 mSDtfsCounter, 4 mSDsluCounter, 1128 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1850 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-20 12:59:08,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1850 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-20 12:59:08,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2022-07-20 12:59:08,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 727. [2022-07-20 12:59:08,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 429 states have (on average 1.7412587412587412) internal successors, (747), 721 states have internal predecessors, (747), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-20 12:59:08,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 773 transitions. [2022-07-20 12:59:08,674 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 773 transitions. Word has length 58 [2022-07-20 12:59:08,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 12:59:08,675 INFO L495 AbstractCegarLoop]: Abstraction has 727 states and 773 transitions. [2022-07-20 12:59:08,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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-20 12:59:08,676 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 773 transitions. [2022-07-20 12:59:08,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-20 12:59:08,677 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 12:59:08,678 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:59:08,697 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-20 12:59:08,886 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-20 12:59:08,887 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-20 12:59:08,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 12:59:08,887 INFO L85 PathProgramCache]: Analyzing trace with hash -1993678056, now seen corresponding path program 1 times [2022-07-20 12:59:08,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 12:59:08,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637235374] [2022-07-20 12:59:08,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 12:59:08,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 12:59:08,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 12:59:08,891 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-20 12:59:08,909 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-20 12:59:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 12:59:09,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 12:59:09,104 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 12:59:09,120 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-20 12:59:09,137 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 13 treesize of output 9 [2022-07-20 12:59:09,144 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 13 treesize of output 9 [2022-07-20 12:59:09,175 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 21 treesize of output 9 [2022-07-20 12:59:09,178 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 19 treesize of output 7 [2022-07-20 12:59:09,191 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-20 12:59:09,191 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 12:59:09,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 12:59:09,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637235374] [2022-07-20 12:59:09,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637235374] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 12:59:09,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 12:59:09,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 12:59:09,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033246531] [2022-07-20 12:59:09,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 12:59:09,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 12:59:09,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 12:59:09,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 12:59:09,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 12:59:09,193 INFO L87 Difference]: Start difference. First operand 727 states and 773 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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-20 12:59:11,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 12:59:11,009 INFO L93 Difference]: Finished difference Result 726 states and 772 transitions. [2022-07-20 12:59:11,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 12:59:11,010 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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 58 [2022-07-20 12:59:11,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 12:59:11,011 INFO L225 Difference]: With dead ends: 726 [2022-07-20 12:59:11,011 INFO L226 Difference]: Without dead ends: 726 [2022-07-20 12:59:11,012 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-20 12:59:11,012 INFO L413 NwaCegarLoop]: 722 mSDtfsCounter, 2 mSDsluCounter, 1154 mSDsCounter, 0 mSdLazyCounter, 1015 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1876 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1015 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-20 12:59:11,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1876 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1015 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-20 12:59:11,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 726 states. [2022-07-20 12:59:11,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 726 to 726. [2022-07-20 12:59:11,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 428 states have (on average 1.7429906542056075) internal successors, (746), 720 states have internal predecessors, (746), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 4 states have call predecessors, (13), 13 states have call successors, (13) [2022-07-20 12:59:11,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 772 transitions. [2022-07-20 12:59:11,020 INFO L78 Accepts]: Start accepts. Automaton has 726 states and 772 transitions. Word has length 58 [2022-07-20 12:59:11,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 12:59:11,021 INFO L495 AbstractCegarLoop]: Abstraction has 726 states and 772 transitions. [2022-07-20 12:59:11,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 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-20 12:59:11,021 INFO L276 IsEmpty]: Start isEmpty. Operand 726 states and 772 transitions. [2022-07-20 12:59:11,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-20 12:59:11,022 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 12:59:11,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:59:11,040 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-07-20 12:59:11,232 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-20 12:59:11,232 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-20 12:59:11,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 12:59:11,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1238792034, now seen corresponding path program 1 times [2022-07-20 12:59:11,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 12:59:11,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1828852732] [2022-07-20 12:59:11,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 12:59:11,233 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 12:59:11,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 12:59:11,235 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-20 12:59:11,236 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-20 12:59:11,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 12:59:11,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 12:59:11,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 12:59:11,450 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-20 12:59:11,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 12:59:11,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 12:59:11,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1828852732] [2022-07-20 12:59:11,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1828852732] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 12:59:11,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 12:59:11,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 12:59:11,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355725493] [2022-07-20 12:59:11,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 12:59:11,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 12:59:11,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 12:59:11,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 12:59:11,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 12:59:11,452 INFO L87 Difference]: Start difference. First operand 726 states and 772 transitions. Second operand has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-20 12:59:11,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 12:59:11,485 INFO L93 Difference]: Finished difference Result 729 states and 776 transitions. [2022-07-20 12:59:11,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 12:59:11,485 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-20 12:59:11,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 12:59:11,488 INFO L225 Difference]: With dead ends: 729 [2022-07-20 12:59:11,488 INFO L226 Difference]: Without dead ends: 729 [2022-07-20 12:59:11,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 63 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-20 12:59:11,489 INFO L413 NwaCegarLoop]: 722 mSDtfsCounter, 2 mSDsluCounter, 1439 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2161 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 12:59:11,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2161 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 12:59:11,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 729 states. [2022-07-20 12:59:11,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 729 to 729. [2022-07-20 12:59:11,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 430 states have (on average 1.741860465116279) internal successors, (749), 723 states have internal predecessors, (749), 13 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-07-20 12:59:11,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 776 transitions. [2022-07-20 12:59:11,513 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 776 transitions. Word has length 66 [2022-07-20 12:59:11,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 12:59:11,514 INFO L495 AbstractCegarLoop]: Abstraction has 729 states and 776 transitions. [2022-07-20 12:59:11,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.0) internal successors, (64), 4 states have internal predecessors, (64), 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-20 12:59:11,514 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 776 transitions. [2022-07-20 12:59:11,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-20 12:59:11,514 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 12:59:11,515 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:59:11,526 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-20 12:59:11,724 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-20 12:59:11,724 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-20 12:59:11,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 12:59:11,724 INFO L85 PathProgramCache]: Analyzing trace with hash 1572130281, now seen corresponding path program 1 times [2022-07-20 12:59:11,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 12:59:11,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1702534770] [2022-07-20 12:59:11,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 12:59:11,725 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 12:59:11,725 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 12:59:11,735 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-20 12:59:11,737 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-20 12:59:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 12:59:11,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 12:59:11,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 12:59:11,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 12:59:11,972 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 12:59:12,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 12:59:12,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 12:59:12,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1702534770] [2022-07-20 12:59:12,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1702534770] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 12:59:12,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 12:59:12,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-20 12:59:12,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295393127] [2022-07-20 12:59:12,060 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 12:59:12,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 12:59:12,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 12:59:12,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 12:59:12,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-20 12:59:12,061 INFO L87 Difference]: Start difference. First operand 729 states and 776 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 12:59:12,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 12:59:12,182 INFO L93 Difference]: Finished difference Result 741 states and 793 transitions. [2022-07-20 12:59:12,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 12:59:12,182 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 67 [2022-07-20 12:59:12,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 12:59:12,184 INFO L225 Difference]: With dead ends: 741 [2022-07-20 12:59:12,187 INFO L226 Difference]: Without dead ends: 741 [2022-07-20 12:59:12,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=94, Unknown=0, NotChecked=0, Total=156 [2022-07-20 12:59:12,189 INFO L413 NwaCegarLoop]: 723 mSDtfsCounter, 17 mSDsluCounter, 1442 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 2165 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 12:59:12,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 2165 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 12:59:12,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2022-07-20 12:59:12,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 739. [2022-07-20 12:59:12,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 739 states, 439 states have (on average 1.7403189066059226) internal successors, (764), 732 states have internal predecessors, (764), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-07-20 12:59:12,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 739 states and 791 transitions. [2022-07-20 12:59:12,206 INFO L78 Accepts]: Start accepts. Automaton has 739 states and 791 transitions. Word has length 67 [2022-07-20 12:59:12,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 12:59:12,206 INFO L495 AbstractCegarLoop]: Abstraction has 739 states and 791 transitions. [2022-07-20 12:59:12,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 8 states have internal predecessors, (69), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 12:59:12,207 INFO L276 IsEmpty]: Start isEmpty. Operand 739 states and 791 transitions. [2022-07-20 12:59:12,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-20 12:59:12,207 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 12:59:12,207 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:59:12,217 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Ended with exit code 0 [2022-07-20 12:59:12,407 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-20 12:59:12,408 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-20 12:59:12,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 12:59:12,408 INFO L85 PathProgramCache]: Analyzing trace with hash -512359586, now seen corresponding path program 2 times [2022-07-20 12:59:12,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 12:59:12,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1969239028] [2022-07-20 12:59:12,408 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 12:59:12,409 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 12:59:12,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 12:59:12,410 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-20 12:59:12,410 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-20 12:59:12,750 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 12:59:12,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 12:59:12,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-20 12:59:12,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 12:59:12,798 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 12:59:12,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 12:59:12,957 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 12:59:12,957 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 12:59:12,957 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1969239028] [2022-07-20 12:59:12,957 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1969239028] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 12:59:12,957 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 12:59:12,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-20 12:59:12,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226660230] [2022-07-20 12:59:12,958 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 12:59:12,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 12:59:12,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 12:59:12,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 12:59:12,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-20 12:59:12,959 INFO L87 Difference]: Start difference. First operand 739 states and 791 transitions. Second operand has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 12:59:13,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 12:59:13,420 INFO L93 Difference]: Finished difference Result 760 states and 819 transitions. [2022-07-20 12:59:13,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 12:59:13,421 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 70 [2022-07-20 12:59:13,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 12:59:13,423 INFO L225 Difference]: With dead ends: 760 [2022-07-20 12:59:13,423 INFO L226 Difference]: Without dead ends: 756 [2022-07-20 12:59:13,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=499, Unknown=0, NotChecked=0, Total=756 [2022-07-20 12:59:13,424 INFO L413 NwaCegarLoop]: 726 mSDtfsCounter, 56 mSDsluCounter, 3614 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 4340 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 12:59:13,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 4340 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 12:59:13,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 756 states. [2022-07-20 12:59:13,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 756 to 748. [2022-07-20 12:59:13,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 448 states have (on average 1.7321428571428572) internal successors, (776), 741 states have internal predecessors, (776), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-07-20 12:59:13,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 803 transitions. [2022-07-20 12:59:13,435 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 803 transitions. Word has length 70 [2022-07-20 12:59:13,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 12:59:13,436 INFO L495 AbstractCegarLoop]: Abstraction has 748 states and 803 transitions. [2022-07-20 12:59:13,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.357142857142857) internal successors, (75), 14 states have internal predecessors, (75), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 12:59:13,436 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 803 transitions. [2022-07-20 12:59:13,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-20 12:59:13,440 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 12:59:13,440 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:59:13,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-20 12:59:13,650 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-20 12:59:13,651 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-20 12:59:13,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 12:59:13,651 INFO L85 PathProgramCache]: Analyzing trace with hash 417359742, now seen corresponding path program 3 times [2022-07-20 12:59:13,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 12:59:13,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2087281556] [2022-07-20 12:59:13,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 12:59:13,653 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 12:59:13,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 12:59:13,670 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-20 12:59:13,715 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-20 12:59:14,271 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-20 12:59:14,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 12:59:14,290 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 12:59:14,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 12:59:14,444 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 12:59:14,444 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 12:59:14,984 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 12:59:14,984 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 12:59:14,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2087281556] [2022-07-20 12:59:14,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2087281556] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 12:59:14,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 12:59:14,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-20 12:59:14,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755495066] [2022-07-20 12:59:14,985 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 12:59:14,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-20 12:59:14,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 12:59:14,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-20 12:59:14,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-20 12:59:14,986 INFO L87 Difference]: Start difference. First operand 748 states and 803 transitions. Second operand has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 12:59:17,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 12:59:17,228 INFO L93 Difference]: Finished difference Result 790 states and 865 transitions. [2022-07-20 12:59:17,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-20 12:59:17,229 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 76 [2022-07-20 12:59:17,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 12:59:17,231 INFO L225 Difference]: With dead ends: 790 [2022-07-20 12:59:17,233 INFO L226 Difference]: Without dead ends: 784 [2022-07-20 12:59:17,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-07-20 12:59:17,235 INFO L413 NwaCegarLoop]: 731 mSDtfsCounter, 188 mSDsluCounter, 8714 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 9445 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 12:59:17,235 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 9445 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-20 12:59:17,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 784 states. [2022-07-20 12:59:17,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 784 to 766. [2022-07-20 12:59:17,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 766 states, 466 states have (on average 1.7145922746781115) internal successors, (799), 759 states have internal predecessors, (799), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-07-20 12:59:17,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 766 states to 766 states and 826 transitions. [2022-07-20 12:59:17,262 INFO L78 Accepts]: Start accepts. Automaton has 766 states and 826 transitions. Word has length 76 [2022-07-20 12:59:17,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 12:59:17,262 INFO L495 AbstractCegarLoop]: Abstraction has 766 states and 826 transitions. [2022-07-20 12:59:17,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.3461538461538463) internal successors, (87), 26 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 12:59:17,262 INFO L276 IsEmpty]: Start isEmpty. Operand 766 states and 826 transitions. [2022-07-20 12:59:17,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-20 12:59:17,263 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 12:59:17,263 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:59:17,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-07-20 12:59:17,473 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-20 12:59:17,474 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-20 12:59:17,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 12:59:17,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1945344066, now seen corresponding path program 4 times [2022-07-20 12:59:17,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 12:59:17,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [651050589] [2022-07-20 12:59:17,475 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 12:59:17,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 12:59:17,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 12:59:17,477 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-20 12:59:17,481 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-20 12:59:17,763 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 12:59:17,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 12:59:17,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-20 12:59:17,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 12:59:18,081 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 12:59:18,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 12:59:19,394 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 12:59:19,395 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 12:59:19,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [651050589] [2022-07-20 12:59:19,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [651050589] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 12:59:19,395 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 12:59:19,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-07-20 12:59:19,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712180247] [2022-07-20 12:59:19,397 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 12:59:19,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-20 12:59:19,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 12:59:19,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-20 12:59:19,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-07-20 12:59:19,399 INFO L87 Difference]: Start difference. First operand 766 states and 826 transitions. Second operand has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 12:59:29,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 12:59:29,662 INFO L93 Difference]: Finished difference Result 846 states and 938 transitions. [2022-07-20 12:59:29,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-07-20 12:59:29,663 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 88 [2022-07-20 12:59:29,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 12:59:29,665 INFO L225 Difference]: With dead ends: 846 [2022-07-20 12:59:29,665 INFO L226 Difference]: Without dead ends: 842 [2022-07-20 12:59:29,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-07-20 12:59:29,668 INFO L413 NwaCegarLoop]: 743 mSDtfsCounter, 360 mSDsluCounter, 19151 mSDsCounter, 0 mSdLazyCounter, 2514 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 19894 SdHoareTripleChecker+Invalid, 2881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 2514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-20 12:59:29,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 19894 Invalid, 2881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 2514 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-20 12:59:29,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-07-20 12:59:29,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 800. [2022-07-20 12:59:29,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 500 states have (on average 1.69) internal successors, (845), 793 states have internal predecessors, (845), 13 states have call successors, (13), 3 states have call predecessors, (13), 4 states have return successors, (14), 4 states have call predecessors, (14), 13 states have call successors, (14) [2022-07-20 12:59:29,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 872 transitions. [2022-07-20 12:59:29,678 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 872 transitions. Word has length 88 [2022-07-20 12:59:29,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 12:59:29,678 INFO L495 AbstractCegarLoop]: Abstraction has 800 states and 872 transitions. [2022-07-20 12:59:29,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.22) internal successors, (111), 50 states have internal predecessors, (111), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-20 12:59:29,679 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 872 transitions. [2022-07-20 12:59:29,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-20 12:59:29,679 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 12:59:29,679 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 12:59:29,694 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-07-20 12:59:29,892 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-20 12:59:29,892 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-20 12:59:29,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 12:59:29,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1730227934, now seen corresponding path program 5 times [2022-07-20 12:59:29,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 12:59:29,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1537770499] [2022-07-20 12:59:29,894 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 12:59:29,894 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 12:59:29,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 12:59:29,895 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-20 12:59:29,898 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-20 12:59:30,991 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-20 12:59:30,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 12:59:31,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-20 12:59:31,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 12:59:31,049 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-20 12:59:31,049 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 12 treesize of output 21 [2022-07-20 12:59:31,258 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-20 12:59:31,259 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-07-20 12:59:31,308 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 13 treesize of output 9 [2022-07-20 12:59:31,405 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 43 treesize of output 25 [2022-07-20 12:59:31,563 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1563 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1563)))) is different from true [2022-07-20 12:59:31,695 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1569 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1569)))) is different from true [2022-07-20 12:59:32,020 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1581 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1581)))) is different from true [2022-07-20 12:59:32,080 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1584)))) is different from true [2022-07-20 12:59:32,194 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1589 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1589)))) is different from true [2022-07-20 12:59:32,257 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1592 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1592) |c_#memory_$Pointer$.base|))) is different from true [2022-07-20 12:59:32,355 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1596 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1596) |c_#memory_$Pointer$.base|))) is different from true [2022-07-20 12:59:32,418 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1| (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32))) (and (not (= v_arrayElimCell_11 |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|)) (= (bvadd (select |c_#valid| |v_ULTIMATE.start_main_~user~0#1.base_BEFORE_CALL_1|) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (bvneg (select |c_#valid| v_arrayElimCell_11)) (_ bv1 1))))) (exists ((v_ArrVal_1599 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_1599) |c_#memory_$Pointer$.base|))) is different from true [2022-07-20 12:59:32,601 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 12:59:32,601 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 55 treesize of output 54 [2022-07-20 12:59:32,659 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 52 treesize of output 28 [2022-07-20 12:59:32,712 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 630 trivial. 324 not checked. [2022-07-20 12:59:32,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 12:59:32,917 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1651 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_1651) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (_ bv1 1))) is different from false [2022-07-20 12:59:32,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 12:59:32,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1537770499] [2022-07-20 12:59:32,919 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1537770499] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 12:59:32,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1705108368] [2022-07-20 12:59:32,919 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 12:59:32,919 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 12:59:32,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 12:59:32,927 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 12:59:32,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2022-07-20 13:01:00,391 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-20 13:01:00,391 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 13:01:00,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-20 13:01:00,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:01:00,659 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-20 13:01:00,660 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 12 treesize of output 17 [2022-07-20 13:01:00,849 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-07-20 13:01:00,850 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 41 [2022-07-20 13:01:00,886 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 13 treesize of output 9 [2022-07-20 13:01:01,048 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 32 treesize of output 14 [2022-07-20 13:01:02,806 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 13:01:02,806 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 44 treesize of output 43 [2022-07-20 13:01:02,859 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 41 treesize of output 17 [2022-07-20 13:01:02,893 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-07-20 13:01:02,893 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 13:01:03,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1705108368] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 13:01:03,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 13:01:03,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 8] total 24 [2022-07-20 13:01:03,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454769389] [2022-07-20 13:01:03,049 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 13:01:03,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-20 13:01:03,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 13:01:03,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-20 13:01:03,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=36, NotChecked=414, Total=870 [2022-07-20 13:01:03,051 INFO L87 Difference]: Start difference. First operand 800 states and 872 transitions. Second operand has 26 states, 23 states have (on average 6.434782608695652) internal successors, (148), 25 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 13:01:07,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 13:01:07,234 INFO L93 Difference]: Finished difference Result 1466 states and 1585 transitions. [2022-07-20 13:01:07,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 13:01:07,235 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 6.434782608695652) internal successors, (148), 25 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 110 [2022-07-20 13:01:07,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 13:01:07,239 INFO L225 Difference]: With dead ends: 1466 [2022-07-20 13:01:07,239 INFO L226 Difference]: Without dead ends: 1462 [2022-07-20 13:01:07,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 118 SyntacticMatches, 83 SemanticMatches, 40 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=197, Invalid=836, Unknown=59, NotChecked=630, Total=1722 [2022-07-20 13:01:07,240 INFO L413 NwaCegarLoop]: 432 mSDtfsCounter, 1107 mSDsluCounter, 4009 mSDsCounter, 0 mSdLazyCounter, 3616 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1119 SdHoareTripleChecker+Valid, 4441 SdHoareTripleChecker+Invalid, 13033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 3616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9378 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-20 13:01:07,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1119 Valid, 4441 Invalid, 13033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 3616 Invalid, 0 Unknown, 9378 Unchecked, 3.7s Time] [2022-07-20 13:01:07,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2022-07-20 13:01:07,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 992. [2022-07-20 13:01:07,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 992 states, 690 states have (on average 1.6101449275362318) internal successors, (1111), 982 states have internal predecessors, (1111), 15 states have call successors, (15), 4 states have call predecessors, (15), 5 states have return successors, (16), 6 states have call predecessors, (16), 15 states have call successors, (16) [2022-07-20 13:01:07,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 992 states to 992 states and 1142 transitions. [2022-07-20 13:01:07,255 INFO L78 Accepts]: Start accepts. Automaton has 992 states and 1142 transitions. Word has length 110 [2022-07-20 13:01:07,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 13:01:07,255 INFO L495 AbstractCegarLoop]: Abstraction has 992 states and 1142 transitions. [2022-07-20 13:01:07,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 6.434782608695652) internal successors, (148), 25 states have internal predecessors, (148), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-20 13:01:07,255 INFO L276 IsEmpty]: Start isEmpty. Operand 992 states and 1142 transitions. [2022-07-20 13:01:07,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-20 13:01:07,256 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 13:01:07,256 INFO L195 NwaCegarLoop]: trace histogram [44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 13:01:07,289 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-20 13:01:07,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Forceful destruction successful, exit code 0 [2022-07-20 13:01:07,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-07-20 13:01:07,673 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 432 more)] === [2022-07-20 13:01:07,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 13:01:07,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1730227935, now seen corresponding path program 1 times [2022-07-20 13:01:07,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 13:01:07,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281114454] [2022-07-20 13:01:07,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:01:07,675 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 13:01:07,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 13:01:07,676 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-20 13:01:07,678 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-20 13:01:08,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:01:08,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 110 conjunts are in the unsatisfiable core [2022-07-20 13:01:08,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:01:08,425 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-20 13:01:08,625 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 13:01:08,625 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-20 13:01:08,630 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 6 treesize of output 5 [2022-07-20 13:01:08,663 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 13 treesize of output 9 [2022-07-20 13:01:08,668 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 13 treesize of output 9 [2022-07-20 13:01:08,804 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 18 treesize of output 10 [2022-07-20 13:01:08,807 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 7 treesize of output 3 [2022-07-20 13:01:08,841 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2457 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2457))) (exists ((v_ArrVal_2456 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2456)))) is different from true [2022-07-20 13:01:08,875 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2460 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2460) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2461 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2461)))) is different from true [2022-07-20 13:01:08,903 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2465 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2465))) (exists ((v_ArrVal_2464 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2464)))) is different from true [2022-07-20 13:01:08,913 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2466 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2466))) (exists ((v_ArrVal_2467 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2467)))) is different from true [2022-07-20 13:01:08,921 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2469 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2469))) (exists ((v_ArrVal_2468 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2468) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-20 13:01:08,948 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2473 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2473))) (exists ((v_ArrVal_2472 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2472)))) is different from true [2022-07-20 13:01:08,957 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2475 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2475) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2474 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2474) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-20 13:01:08,965 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2477 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2477))) (exists ((v_ArrVal_2476 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2476)))) is different from true [2022-07-20 13:01:08,973 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2478 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2478) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2479 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2479)))) is different from true [2022-07-20 13:01:08,980 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2481 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2481) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2480 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2480) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-20 13:01:09,005 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2484 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2484))) (exists ((v_ArrVal_2485 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2485)))) is different from true [2022-07-20 13:01:09,013 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2487 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2487) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2486 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2486)))) is different from true [2022-07-20 13:01:09,020 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2488 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2488))) (exists ((v_ArrVal_2489 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2489)))) is different from true [2022-07-20 13:01:09,028 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2491 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2491))) (exists ((v_ArrVal_2490 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2490)))) is different from true [2022-07-20 13:01:09,035 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2493) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2492 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2492) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-20 13:01:09,043 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2495 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2495) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2494 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2494)))) is different from true [2022-07-20 13:01:09,069 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2499 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2499) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2498 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2498) |c_#memory_$Pointer$.base|))) is different from true [2022-07-20 13:01:09,077 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2501 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2501))) (exists ((v_ArrVal_2500 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2500)))) is different from true [2022-07-20 13:01:09,084 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2503 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2503) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2502 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2502)))) is different from true [2022-07-20 13:01:09,112 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2507 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2507) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2506 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2506) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-20 13:01:09,174 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_2515 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2515))) (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2514 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2514) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-20 13:01:09,182 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2517 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2517) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2516 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2516)))) is different from true [2022-07-20 13:01:09,197 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2518 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2518))) (exists ((v_ArrVal_2519 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2519)))) is different from true [2022-07-20 13:01:09,205 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2521 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2521) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_2520 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2520)))) is different from true [2022-07-20 13:01:09,230 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2525 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2525))) (exists ((v_ArrVal_2524 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2524)))) is different from true [2022-07-20 13:01:09,238 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2527 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2527))) (exists ((v_ArrVal_2526 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2526) |c_#memory_$Pointer$.base|))) is different from true [2022-07-20 13:01:09,246 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2528 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2528) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_2529 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2529) |c_#memory_$Pointer$.base|))) is different from true [2022-07-20 13:01:09,272 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2532 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2532))) (exists ((v_ArrVal_2533 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2533)))) is different from true [2022-07-20 13:01:09,316 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2539 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2539))) (exists ((v_ArrVal_2538 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2538)))) is different from true [2022-07-20 13:01:09,343 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_23 (_ BitVec 32))) (= (select |c_#length| v_arrayElimCell_23) (_ bv44 32))) (exists ((v_ArrVal_2543 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2543))) (exists ((v_ArrVal_2542 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_2542)))) is different from true [2022-07-20 13:01:09,367 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 13:01:09,367 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 46 treesize of output 45 [2022-07-20 13:01:09,371 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 22 treesize of output 24 [2022-07-20 13:01:09,400 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 13 [2022-07-20 13:01:09,404 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 15 treesize of output 7 [2022-07-20 13:01:09,425 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 91 trivial. 885 not checked. [2022-07-20 13:01:09,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 13:01:10,076 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2635) |c_ULTIMATE.start_main_~user~0#1.base|) (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|)))) (bvule (bvadd (_ bv16 32) .cse0) (bvadd (_ bv20 32) .cse0)))) (forall ((v_ArrVal_2634 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2635 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (_ bv20 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2635) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem33#1.base| v_ArrVal_2634) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-07-20 13:01:10,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 13:01:10,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281114454] [2022-07-20 13:01:10,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1281114454] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 13:01:10,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [107991536] [2022-07-20 13:01:10,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 13:01:10,083 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-20 13:01:10,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-20 13:01:10,084 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-20 13:01:10,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (23)] Waiting until timeout for monitored process [2022-07-20 13:03:32,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 13:03:32,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 767 conjuncts, 110 conjunts are in the unsatisfiable core [2022-07-20 13:03:32,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 13:03:32,682 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-20 13:03:32,768 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 13:03:32,768 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