./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c 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_test10-1.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 b06fba6fbf61d996c1af57497d908c6dba492febf0212a36ee7b28f5806d365e --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 01:24:57,387 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 01:24:57,389 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 01:24:57,418 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 01:24:57,419 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 01:24:57,419 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 01:24:57,423 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 01:24:57,427 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 01:24:57,429 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 01:24:57,433 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 01:24:57,434 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 01:24:57,435 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 01:24:57,436 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 01:24:57,437 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 01:24:57,439 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 01:24:57,440 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 01:24:57,441 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 01:24:57,442 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 01:24:57,445 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 01:24:57,448 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 01:24:57,450 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 01:24:57,451 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 01:24:57,451 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 01:24:57,452 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 01:24:57,453 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 01:24:57,456 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 01:24:57,456 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 01:24:57,457 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 01:24:57,457 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 01:24:57,458 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 01:24:57,458 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 01:24:57,458 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 01:24:57,460 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 01:24:57,460 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 01:24:57,461 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 01:24:57,461 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 01:24:57,461 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 01:24:57,462 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 01:24:57,462 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 01:24:57,462 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 01:24:57,462 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 01:24:57,464 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 01:24:57,465 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-13 01:24:57,490 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 01:24:57,490 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 01:24:57,491 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 01:24:57,491 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 01:24:57,491 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 01:24:57,491 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 01:24:57,492 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 01:24:57,492 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 01:24:57,492 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 01:24:57,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 01:24:57,493 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 01:24:57,493 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 01:24:57,493 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 01:24:57,493 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 01:24:57,493 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 01:24:57,494 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-13 01:24:57,494 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-13 01:24:57,494 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-13 01:24:57,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 01:24:57,495 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 01:24:57,495 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 01:24:57,496 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 01:24:57,496 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 01:24:57,496 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 01:24:57,496 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 01:24:57,496 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:24:57,496 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 01:24:57,496 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 01:24:57,497 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 01:24:57,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 01:24:57,497 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b06fba6fbf61d996c1af57497d908c6dba492febf0212a36ee7b28f5806d365e [2022-07-13 01:24:57,702 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 01:24:57,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 01:24:57,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 01:24:57,726 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 01:24:57,727 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 01:24:57,728 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_test10-1.i [2022-07-13 01:24:57,790 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c010d62c2/2068661c772e441d98a2ca7a171a99ec/FLAGa81aeb732 [2022-07-13 01:24:58,216 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 01:24:58,216 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-1.i [2022-07-13 01:24:58,227 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c010d62c2/2068661c772e441d98a2ca7a171a99ec/FLAGa81aeb732 [2022-07-13 01:24:58,236 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c010d62c2/2068661c772e441d98a2ca7a171a99ec [2022-07-13 01:24:58,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 01:24:58,240 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 01:24:58,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 01:24:58,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 01:24:58,246 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 01:24:58,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:24:58" (1/1) ... [2022-07-13 01:24:58,247 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cb6ca82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:24:58, skipping insertion in model container [2022-07-13 01:24:58,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:24:58" (1/1) ... [2022-07-13 01:24:58,253 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 01:24:58,289 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 01:24:58,590 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_test10-1.i[33022,33035] [2022-07-13 01:24:58,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:24:58,762 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-13 01:24:58,762 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@5b0d0ee2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:24:58, skipping insertion in model container [2022-07-13 01:24:58,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 01:24:58,763 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2022-07-13 01:24:58,764 INFO L158 Benchmark]: Toolchain (without parser) took 525.19ms. Allocated memory is still 119.5MB. Free memory was 85.9MB in the beginning and 77.1MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 01:24:58,765 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 88.1MB. Free memory was 46.8MB in the beginning and 46.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 01:24:58,765 INFO L158 Benchmark]: CACSL2BoogieTranslator took 519.39ms. Allocated memory is still 119.5MB. Free memory was 85.7MB in the beginning and 77.1MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 01:24:58,766 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 88.1MB. Free memory was 46.8MB in the beginning and 46.7MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 519.39ms. Allocated memory is still 119.5MB. Free memory was 85.7MB in the beginning and 77.1MB in the end (delta: 8.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 734]: 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_test10-1.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 b06fba6fbf61d996c1af57497d908c6dba492febf0212a36ee7b28f5806d365e --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-13 01:25:00,204 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 01:25:00,206 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 01:25:00,233 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 01:25:00,234 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 01:25:00,235 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 01:25:00,239 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 01:25:00,241 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 01:25:00,243 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 01:25:00,246 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 01:25:00,246 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 01:25:00,248 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 01:25:00,248 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 01:25:00,249 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 01:25:00,251 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 01:25:00,256 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 01:25:00,256 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 01:25:00,257 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 01:25:00,260 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 01:25:00,262 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 01:25:00,265 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 01:25:00,265 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 01:25:00,266 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 01:25:00,267 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 01:25:00,268 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 01:25:00,272 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 01:25:00,274 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 01:25:00,274 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 01:25:00,275 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 01:25:00,275 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 01:25:00,276 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 01:25:00,276 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 01:25:00,277 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 01:25:00,277 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 01:25:00,278 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 01:25:00,279 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 01:25:00,279 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 01:25:00,280 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 01:25:00,280 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 01:25:00,280 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 01:25:00,280 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 01:25:00,282 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 01:25:00,285 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-13 01:25:00,313 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 01:25:00,314 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 01:25:00,314 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 01:25:00,314 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 01:25:00,315 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 01:25:00,315 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 01:25:00,316 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 01:25:00,316 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 01:25:00,316 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 01:25:00,316 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 01:25:00,317 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 01:25:00,317 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-13 01:25:00,317 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 01:25:00,317 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 01:25:00,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 01:25:00,325 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-13 01:25:00,325 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-13 01:25:00,325 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-13 01:25:00,325 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 01:25:00,325 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 01:25:00,326 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 01:25:00,326 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 01:25:00,326 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 01:25:00,326 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 01:25:00,326 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 01:25:00,326 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 01:25:00,327 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 01:25:00,327 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:25:00,327 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 01:25:00,327 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 01:25:00,327 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 01:25:00,328 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 01:25:00,328 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 01:25:00,328 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 -> b06fba6fbf61d996c1af57497d908c6dba492febf0212a36ee7b28f5806d365e [2022-07-13 01:25:00,569 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 01:25:00,587 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 01:25:00,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 01:25:00,589 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 01:25:00,589 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 01:25:00,590 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_test10-1.i [2022-07-13 01:25:00,631 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ef5bc4b1/aec34a54682542ddb9e089167213d029/FLAG9cff6297a [2022-07-13 01:25:01,068 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 01:25:01,069 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-1.i [2022-07-13 01:25:01,087 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ef5bc4b1/aec34a54682542ddb9e089167213d029/FLAG9cff6297a [2022-07-13 01:25:01,098 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7ef5bc4b1/aec34a54682542ddb9e089167213d029 [2022-07-13 01:25:01,100 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 01:25:01,102 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 01:25:01,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 01:25:01,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 01:25:01,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 01:25:01,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:25:01" (1/1) ... [2022-07-13 01:25:01,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61b256aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:25:01, skipping insertion in model container [2022-07-13 01:25:01,108 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 01:25:01" (1/1) ... [2022-07-13 01:25:01,112 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 01:25:01,160 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 01:25:01,505 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_test10-1.i[33022,33035] [2022-07-13 01:25:01,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:25:01,716 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-07-13 01:25:01,726 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 01:25:01,746 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_test10-1.i[33022,33035] [2022-07-13 01:25:01,866 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:25:01,875 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 01:25:01,900 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_test10-1.i[33022,33035] [2022-07-13 01:25:01,979 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 01:25:02,008 INFO L208 MainTranslator]: Completed translation [2022-07-13 01:25:02,009 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:25:02 WrapperNode [2022-07-13 01:25:02,009 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 01:25:02,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 01:25:02,011 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 01:25:02,011 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 01:25:02,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:25:02" (1/1) ... [2022-07-13 01:25:02,060 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:25:02" (1/1) ... [2022-07-13 01:25:02,135 INFO L137 Inliner]: procedures = 180, calls = 524, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 2184 [2022-07-13 01:25:02,135 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 01:25:02,136 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 01:25:02,137 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 01:25:02,137 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 01:25:02,143 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:25:02" (1/1) ... [2022-07-13 01:25:02,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:25:02" (1/1) ... [2022-07-13 01:25:02,157 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:25:02" (1/1) ... [2022-07-13 01:25:02,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:25:02" (1/1) ... [2022-07-13 01:25:02,227 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:25:02" (1/1) ... [2022-07-13 01:25:02,249 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:25:02" (1/1) ... [2022-07-13 01:25:02,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:25:02" (1/1) ... [2022-07-13 01:25:02,265 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 01:25:02,266 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 01:25:02,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 01:25:02,267 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 01:25:02,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:25:02" (1/1) ... [2022-07-13 01:25:02,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 01:25:02,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 01:25:02,290 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-13 01:25:02,300 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-13 01:25:02,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2022-07-13 01:25:02,328 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2022-07-13 01:25:02,328 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2022-07-13 01:25:02,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 01:25:02,329 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 01:25:02,329 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 01:25:02,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-13 01:25:02,329 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-13 01:25:02,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-13 01:25:02,329 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 01:25:02,329 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-13 01:25:02,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 01:25:02,330 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-07-13 01:25:02,330 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-13 01:25:02,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 01:25:02,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 01:25:02,330 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 01:25:02,330 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 01:25:02,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 01:25:02,579 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 01:25:02,580 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 01:25:02,583 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-13 01:25:08,262 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 01:25:08,276 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 01:25:08,276 INFO L299 CfgBuilder]: Removed 151 assume(true) statements. [2022-07-13 01:25:08,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 01:25:08 BoogieIcfgContainer [2022-07-13 01:25:08,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 01:25:08,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 01:25:08,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 01:25:08,282 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 01:25:08,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 01:25:01" (1/3) ... [2022-07-13 01:25:08,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a23fd9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 01:25:08, skipping insertion in model container [2022-07-13 01:25:08,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 01:25:02" (2/3) ... [2022-07-13 01:25:08,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a23fd9f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 01:25:08, skipping insertion in model container [2022-07-13 01:25:08,284 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 01:25:08" (3/3) ... [2022-07-13 01:25:08,284 INFO L111 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test10-1.i [2022-07-13 01:25:08,293 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 01:25:08,294 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 990 error locations. [2022-07-13 01:25:08,335 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 01:25:08,339 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@18a5adb0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3fc91bc0 [2022-07-13 01:25:08,340 INFO L358 AbstractCegarLoop]: Starting to check reachability of 990 error locations. [2022-07-13 01:25:08,346 INFO L276 IsEmpty]: Start isEmpty. Operand has 2060 states, 1058 states have (on average 2.2041587901701325) internal successors, (2332), 2046 states have internal predecessors, (2332), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-07-13 01:25:08,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-13 01:25:08,350 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:25:08,350 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-13 01:25:08,351 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:25:08,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:25:08,354 INFO L85 PathProgramCache]: Analyzing trace with hash 66598, now seen corresponding path program 1 times [2022-07-13 01:25:08,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:25:08,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1845384898] [2022-07-13 01:25:08,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:25:08,363 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:25:08,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:25:08,365 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-13 01:25:08,374 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-13 01:25:08,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:25:08,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:25:08,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:25:08,573 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-13 01:25:08,606 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-13 01:25:08,606 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:25:08,607 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:25:08,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1845384898] [2022-07-13 01:25:08,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1845384898] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:25:08,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:25:08,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:25:08,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566644812] [2022-07-13 01:25:08,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:25:08,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:25:08,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:25:08,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:25:08,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:25:08,648 INFO L87 Difference]: Start difference. First operand has 2060 states, 1058 states have (on average 2.2041587901701325) internal successors, (2332), 2046 states have internal predecessors, (2332), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:25:11,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:25:11,110 INFO L93 Difference]: Finished difference Result 2558 states and 2724 transitions. [2022-07-13 01:25:11,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:25:11,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-13 01:25:11,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:25:11,134 INFO L225 Difference]: With dead ends: 2558 [2022-07-13 01:25:11,134 INFO L226 Difference]: Without dead ends: 2556 [2022-07-13 01:25:11,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:25:11,141 INFO L413 NwaCegarLoop]: 1273 mSDtfsCounter, 1951 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1961 SdHoareTripleChecker+Valid, 1646 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-13 01:25:11,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1961 Valid, 1646 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-13 01:25:11,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2022-07-13 01:25:11,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2202. [2022-07-13 01:25:11,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2202 states, 1224 states have (on average 2.037581699346405) internal successors, (2494), 2186 states have internal predecessors, (2494), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2022-07-13 01:25:11,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2202 states to 2202 states and 2526 transitions. [2022-07-13 01:25:11,217 INFO L78 Accepts]: Start accepts. Automaton has 2202 states and 2526 transitions. Word has length 3 [2022-07-13 01:25:11,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:25:11,218 INFO L495 AbstractCegarLoop]: Abstraction has 2202 states and 2526 transitions. [2022-07-13 01:25:11,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:25:11,218 INFO L276 IsEmpty]: Start isEmpty. Operand 2202 states and 2526 transitions. [2022-07-13 01:25:11,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-13 01:25:11,218 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:25:11,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-13 01:25:11,227 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-13 01:25:11,425 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-13 01:25:11,426 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:25:11,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:25:11,427 INFO L85 PathProgramCache]: Analyzing trace with hash 66599, now seen corresponding path program 1 times [2022-07-13 01:25:11,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:25:11,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785813605] [2022-07-13 01:25:11,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:25:11,428 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:25:11,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:25:11,429 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-13 01:25:11,430 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-13 01:25:11,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:25:11,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:25:11,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:25:11,577 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-13 01:25:11,583 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-13 01:25:11,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:25:11,584 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:25:11,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1785813605] [2022-07-13 01:25:11,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1785813605] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:25:11,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:25:11,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:25:11,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700657855] [2022-07-13 01:25:11,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:25:11,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:25:11,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:25:11,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:25:11,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:25:11,586 INFO L87 Difference]: Start difference. First operand 2202 states and 2526 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:25:14,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:25:14,904 INFO L93 Difference]: Finished difference Result 2973 states and 3378 transitions. [2022-07-13 01:25:14,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:25:14,905 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-07-13 01:25:14,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:25:14,912 INFO L225 Difference]: With dead ends: 2973 [2022-07-13 01:25:14,912 INFO L226 Difference]: Without dead ends: 2973 [2022-07-13 01:25:14,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:25:14,913 INFO L413 NwaCegarLoop]: 1837 mSDtfsCounter, 844 mSDsluCounter, 1180 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 3017 SdHoareTripleChecker+Invalid, 1326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-13 01:25:14,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 3017 Invalid, 1326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-13 01:25:14,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2022-07-13 01:25:14,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 2651. [2022-07-13 01:25:14,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2651 states, 1671 states have (on average 1.9970077797725914) internal successors, (3337), 2632 states have internal predecessors, (3337), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2022-07-13 01:25:14,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2651 states to 2651 states and 3375 transitions. [2022-07-13 01:25:14,980 INFO L78 Accepts]: Start accepts. Automaton has 2651 states and 3375 transitions. Word has length 3 [2022-07-13 01:25:14,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:25:14,980 INFO L495 AbstractCegarLoop]: Abstraction has 2651 states and 3375 transitions. [2022-07-13 01:25:14,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:25:14,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2651 states and 3375 transitions. [2022-07-13 01:25:14,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-13 01:25:14,982 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:25:14,982 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:25:14,997 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-13 01:25:15,188 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-13 01:25:15,191 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:25:15,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:25:15,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1375609072, now seen corresponding path program 1 times [2022-07-13 01:25:15,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:25:15,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [629703944] [2022-07-13 01:25:15,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:25:15,192 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:25:15,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:25:15,193 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-13 01:25:15,195 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-13 01:25:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:25:15,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 01:25:15,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:25:15,351 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-13 01:25:15,356 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-13 01:25:15,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 01:25:15,394 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-13 01:25:15,403 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 01:25:15,403 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 12 treesize of output 12 [2022-07-13 01:25:15,417 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-13 01:25:15,417 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:25:15,417 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:25:15,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [629703944] [2022-07-13 01:25:15,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [629703944] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:25:15,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:25:15,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:25:15,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252567980] [2022-07-13 01:25:15,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:25:15,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:25:15,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:25:15,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:25:15,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:25:15,419 INFO L87 Difference]: Start difference. First operand 2651 states and 3375 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-13 01:25:21,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:25:21,004 INFO L93 Difference]: Finished difference Result 4906 states and 5782 transitions. [2022-07-13 01:25:21,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:25:21,005 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2022-07-13 01:25:21,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:25:21,017 INFO L225 Difference]: With dead ends: 4906 [2022-07-13 01:25:21,017 INFO L226 Difference]: Without dead ends: 4906 [2022-07-13 01:25:21,017 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:25:21,019 INFO L413 NwaCegarLoop]: 776 mSDtfsCounter, 4307 mSDsluCounter, 1291 mSDsCounter, 0 mSdLazyCounter, 2713 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4317 SdHoareTripleChecker+Valid, 2067 SdHoareTripleChecker+Invalid, 2758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-13 01:25:21,023 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4317 Valid, 2067 Invalid, 2758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2713 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-07-13 01:25:21,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4906 states. [2022-07-13 01:25:21,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4906 to 3370. [2022-07-13 01:25:21,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3370 states, 2390 states have (on average 2.0351464435146442) internal successors, (4864), 3345 states have internal predecessors, (4864), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:25:21,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3370 states to 3370 states and 4914 transitions. [2022-07-13 01:25:21,097 INFO L78 Accepts]: Start accepts. Automaton has 3370 states and 4914 transitions. Word has length 7 [2022-07-13 01:25:21,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:25:21,097 INFO L495 AbstractCegarLoop]: Abstraction has 3370 states and 4914 transitions. [2022-07-13 01:25:21,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 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-13 01:25:21,100 INFO L276 IsEmpty]: Start isEmpty. Operand 3370 states and 4914 transitions. [2022-07-13 01:25:21,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-13 01:25:21,100 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:25:21,100 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:25:21,114 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-13 01:25:21,307 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-13 01:25:21,308 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:25:21,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:25:21,308 INFO L85 PathProgramCache]: Analyzing trace with hash -305791726, now seen corresponding path program 1 times [2022-07-13 01:25:21,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:25:21,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [635108111] [2022-07-13 01:25:21,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:25:21,309 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:25:21,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:25:21,310 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-13 01:25:21,312 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-13 01:25:21,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:25:21,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:25:21,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:25:21,451 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-13 01:25:21,457 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-13 01:25:21,457 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:25:21,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:25:21,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [635108111] [2022-07-13 01:25:21,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [635108111] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:25:21,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:25:21,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:25:21,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548772711] [2022-07-13 01:25:21,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:25:21,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:25:21,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:25:21,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:25:21,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:25:21,459 INFO L87 Difference]: Start difference. First operand 3370 states and 4914 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-13 01:25:23,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:25:23,660 INFO L93 Difference]: Finished difference Result 4574 states and 6431 transitions. [2022-07-13 01:25:23,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:25:23,660 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2022-07-13 01:25:23,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:25:23,672 INFO L225 Difference]: With dead ends: 4574 [2022-07-13 01:25:23,672 INFO L226 Difference]: Without dead ends: 4574 [2022-07-13 01:25:23,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-13 01:25:23,673 INFO L413 NwaCegarLoop]: 1967 mSDtfsCounter, 1998 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2008 SdHoareTripleChecker+Valid, 2622 SdHoareTripleChecker+Invalid, 1475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:25:23,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2008 Valid, 2622 Invalid, 1475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 1373 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-13 01:25:23,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4574 states. [2022-07-13 01:25:23,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4574 to 3279. [2022-07-13 01:25:23,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3279 states, 2390 states have (on average 1.9460251046025105) internal successors, (4651), 3254 states have internal predecessors, (4651), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:25:23,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3279 states to 3279 states and 4701 transitions. [2022-07-13 01:25:23,725 INFO L78 Accepts]: Start accepts. Automaton has 3279 states and 4701 transitions. Word has length 8 [2022-07-13 01:25:23,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:25:23,725 INFO L495 AbstractCegarLoop]: Abstraction has 3279 states and 4701 transitions. [2022-07-13 01:25:23,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-13 01:25:23,726 INFO L276 IsEmpty]: Start isEmpty. Operand 3279 states and 4701 transitions. [2022-07-13 01:25:23,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-13 01:25:23,726 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:25:23,726 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:25:23,735 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-13 01:25:23,933 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-13 01:25:23,933 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:25:23,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:25:23,934 INFO L85 PathProgramCache]: Analyzing trace with hash -305791725, now seen corresponding path program 1 times [2022-07-13 01:25:23,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:25:23,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [275145610] [2022-07-13 01:25:23,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:25:23,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:25:23,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:25:23,936 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-13 01:25:23,937 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-13 01:25:24,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:25:24,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:25:24,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:25:24,074 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-13 01:25:24,089 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-13 01:25:24,089 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:25:24,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:25:24,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [275145610] [2022-07-13 01:25:24,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [275145610] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:25:24,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:25:24,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 01:25:24,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940414205] [2022-07-13 01:25:24,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:25:24,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:25:24,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:25:24,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:25:24,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:25:24,091 INFO L87 Difference]: Start difference. First operand 3279 states and 4701 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-13 01:25:27,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:25:27,337 INFO L93 Difference]: Finished difference Result 4996 states and 7060 transitions. [2022-07-13 01:25:27,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:25:27,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2022-07-13 01:25:27,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:25:27,355 INFO L225 Difference]: With dead ends: 4996 [2022-07-13 01:25:27,356 INFO L226 Difference]: Without dead ends: 4996 [2022-07-13 01:25:27,356 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-13 01:25:27,356 INFO L413 NwaCegarLoop]: 2347 mSDtfsCounter, 1371 mSDsluCounter, 988 mSDsCounter, 0 mSdLazyCounter, 1470 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1375 SdHoareTripleChecker+Valid, 3335 SdHoareTripleChecker+Invalid, 1493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-13 01:25:27,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1375 Valid, 3335 Invalid, 1493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1470 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-13 01:25:27,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4996 states. [2022-07-13 01:25:27,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4996 to 3601. [2022-07-13 01:25:27,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3601 states, 2722 states have (on average 1.9335047759000734) internal successors, (5263), 3576 states have internal predecessors, (5263), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:25:27,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3601 states to 3601 states and 5313 transitions. [2022-07-13 01:25:27,421 INFO L78 Accepts]: Start accepts. Automaton has 3601 states and 5313 transitions. Word has length 8 [2022-07-13 01:25:27,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:25:27,421 INFO L495 AbstractCegarLoop]: Abstraction has 3601 states and 5313 transitions. [2022-07-13 01:25:27,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-13 01:25:27,422 INFO L276 IsEmpty]: Start isEmpty. Operand 3601 states and 5313 transitions. [2022-07-13 01:25:27,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-13 01:25:27,422 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:25:27,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:25:27,431 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-13 01:25:27,631 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-13 01:25:27,631 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr658REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:25:27,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:25:27,632 INFO L85 PathProgramCache]: Analyzing trace with hash -690352907, now seen corresponding path program 1 times [2022-07-13 01:25:27,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:25:27,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1915116788] [2022-07-13 01:25:27,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:25:27,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:25:27,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:25:27,633 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-13 01:25:27,635 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-13 01:25:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:25:27,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 01:25:27,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:25:27,773 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-13 01:25:27,774 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:25:27,774 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:25:27,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1915116788] [2022-07-13 01:25:27,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1915116788] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:25:27,774 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:25:27,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:25:27,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756049558] [2022-07-13 01:25:27,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:25:27,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:25:27,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:25:27,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:25:27,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:25:27,776 INFO L87 Difference]: Start difference. First operand 3601 states and 5313 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-13 01:25:27,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:25:27,802 INFO L93 Difference]: Finished difference Result 3541 states and 5227 transitions. [2022-07-13 01:25:27,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:25:27,802 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-13 01:25:27,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:25:27,811 INFO L225 Difference]: With dead ends: 3541 [2022-07-13 01:25:27,811 INFO L226 Difference]: Without dead ends: 3541 [2022-07-13 01:25:27,811 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-13 01:25:27,812 INFO L413 NwaCegarLoop]: 2011 mSDtfsCounter, 801 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 3227 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-13 01:25:27,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 3227 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:25:27,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3541 states. [2022-07-13 01:25:27,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3541 to 3541. [2022-07-13 01:25:27,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3541 states, 2686 states have (on average 1.9274013402829486) internal successors, (5177), 3516 states have internal predecessors, (5177), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:25:27,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3541 states to 3541 states and 5227 transitions. [2022-07-13 01:25:27,856 INFO L78 Accepts]: Start accepts. Automaton has 3541 states and 5227 transitions. Word has length 11 [2022-07-13 01:25:27,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:25:27,856 INFO L495 AbstractCegarLoop]: Abstraction has 3541 states and 5227 transitions. [2022-07-13 01:25:27,856 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-13 01:25:27,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3541 states and 5227 transitions. [2022-07-13 01:25:27,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-13 01:25:27,857 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:25:27,857 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:25:27,868 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-13 01:25:28,078 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-13 01:25:28,078 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr682REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:25:28,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:25:28,079 INFO L85 PathProgramCache]: Analyzing trace with hash -2004126129, now seen corresponding path program 1 times [2022-07-13 01:25:28,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:25:28,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1894930867] [2022-07-13 01:25:28,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:25:28,079 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:25:28,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:25:28,082 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-13 01:25:28,084 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-13 01:25:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:25:28,222 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:25:28,224 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:25:28,239 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-13 01:25:28,239 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:25:28,239 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:25:28,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1894930867] [2022-07-13 01:25:28,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1894930867] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:25:28,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:25:28,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:25:28,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345918506] [2022-07-13 01:25:28,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:25:28,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:25:28,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:25:28,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:25:28,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:25:28,242 INFO L87 Difference]: Start difference. First operand 3541 states and 5227 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-13 01:25:28,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:25:28,321 INFO L93 Difference]: Finished difference Result 3513 states and 5171 transitions. [2022-07-13 01:25:28,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:25:28,322 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-13 01:25:28,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:25:28,340 INFO L225 Difference]: With dead ends: 3513 [2022-07-13 01:25:28,340 INFO L226 Difference]: Without dead ends: 3513 [2022-07-13 01:25:28,341 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-13 01:25:28,341 INFO L413 NwaCegarLoop]: 1966 mSDtfsCounter, 772 mSDsluCounter, 3175 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 776 SdHoareTripleChecker+Valid, 5141 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-13 01:25:28,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [776 Valid, 5141 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:25:28,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3513 states. [2022-07-13 01:25:28,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3513 to 3511. [2022-07-13 01:25:28,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3511 states, 2670 states have (on average 1.9172284644194757) internal successors, (5119), 3486 states have internal predecessors, (5119), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:25:28,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3511 states to 3511 states and 5169 transitions. [2022-07-13 01:25:28,382 INFO L78 Accepts]: Start accepts. Automaton has 3511 states and 5169 transitions. Word has length 13 [2022-07-13 01:25:28,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:25:28,382 INFO L495 AbstractCegarLoop]: Abstraction has 3511 states and 5169 transitions. [2022-07-13 01:25:28,383 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-13 01:25:28,384 INFO L276 IsEmpty]: Start isEmpty. Operand 3511 states and 5169 transitions. [2022-07-13 01:25:28,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 01:25:28,384 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:25:28,385 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] [2022-07-13 01:25:28,391 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-13 01:25:28,591 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-13 01:25:28,592 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:25:28,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:25:28,593 INFO L85 PathProgramCache]: Analyzing trace with hash 445820063, now seen corresponding path program 1 times [2022-07-13 01:25:28,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:25:28,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1451060140] [2022-07-13 01:25:28,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:25:28,593 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:25:28,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:25:28,595 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-13 01:25:28,596 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-13 01:25:28,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:25:28,759 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 01:25:28,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:25:28,769 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-13 01:25:28,769 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:25:28,770 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:25:28,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1451060140] [2022-07-13 01:25:28,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1451060140] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:25:28,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:25:28,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:25:28,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864209422] [2022-07-13 01:25:28,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:25:28,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:25:28,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:25:28,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:25:28,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:25:28,772 INFO L87 Difference]: Start difference. First operand 3511 states and 5169 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-13 01:25:28,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:25:28,807 INFO L93 Difference]: Finished difference Result 4760 states and 6526 transitions. [2022-07-13 01:25:28,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:25:28,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2022-07-13 01:25:28,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:25:28,814 INFO L225 Difference]: With dead ends: 4760 [2022-07-13 01:25:28,815 INFO L226 Difference]: Without dead ends: 4760 [2022-07-13 01:25:28,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-13 01:25:28,816 INFO L413 NwaCegarLoop]: 3299 mSDtfsCounter, 1892 mSDsluCounter, 1406 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1902 SdHoareTripleChecker+Valid, 4705 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-13 01:25:28,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1902 Valid, 4705 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:25:28,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4760 states. [2022-07-13 01:25:28,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4760 to 3451. [2022-07-13 01:25:28,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3451 states, 2634 states have (on average 1.910782080485953) internal successors, (5033), 3426 states have internal predecessors, (5033), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:25:28,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3451 states to 3451 states and 5083 transitions. [2022-07-13 01:25:28,876 INFO L78 Accepts]: Start accepts. Automaton has 3451 states and 5083 transitions. Word has length 20 [2022-07-13 01:25:28,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:25:28,876 INFO L495 AbstractCegarLoop]: Abstraction has 3451 states and 5083 transitions. [2022-07-13 01:25:28,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-13 01:25:28,877 INFO L276 IsEmpty]: Start isEmpty. Operand 3451 states and 5083 transitions. [2022-07-13 01:25:28,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 01:25:28,878 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:25:28,878 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] [2022-07-13 01:25:28,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-13 01:25:29,086 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-13 01:25:29,086 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr334REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:25:29,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:25:29,086 INFO L85 PathProgramCache]: Analyzing trace with hash 591123743, now seen corresponding path program 1 times [2022-07-13 01:25:29,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:25:29,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [990944008] [2022-07-13 01:25:29,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:25:29,087 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:25:29,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:25:29,088 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-13 01:25:29,090 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-13 01:25:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:25:29,262 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-13 01:25:29,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:25:29,275 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-13 01:25:29,276 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:25:29,276 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:25:29,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [990944008] [2022-07-13 01:25:29,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [990944008] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:25:29,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:25:29,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:25:29,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073594561] [2022-07-13 01:25:29,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:25:29,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:25:29,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:25:29,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:25:29,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:25:29,278 INFO L87 Difference]: Start difference. First operand 3451 states and 5083 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-13 01:25:29,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:25:29,317 INFO L93 Difference]: Finished difference Result 4593 states and 6235 transitions. [2022-07-13 01:25:29,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:25:29,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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 20 [2022-07-13 01:25:29,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:25:29,327 INFO L225 Difference]: With dead ends: 4593 [2022-07-13 01:25:29,327 INFO L226 Difference]: Without dead ends: 4593 [2022-07-13 01:25:29,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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-13 01:25:29,329 INFO L413 NwaCegarLoop]: 3208 mSDtfsCounter, 1849 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1859 SdHoareTripleChecker+Valid, 4566 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-13 01:25:29,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1859 Valid, 4566 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:25:29,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4593 states. [2022-07-13 01:25:29,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4593 to 3319. [2022-07-13 01:25:29,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3319 states, 2526 states have (on average 1.8903404592240696) internal successors, (4775), 3294 states have internal predecessors, (4775), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:25:29,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3319 states to 3319 states and 4825 transitions. [2022-07-13 01:25:29,373 INFO L78 Accepts]: Start accepts. Automaton has 3319 states and 4825 transitions. Word has length 20 [2022-07-13 01:25:29,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:25:29,374 INFO L495 AbstractCegarLoop]: Abstraction has 3319 states and 4825 transitions. [2022-07-13 01:25:29,374 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-13 01:25:29,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3319 states and 4825 transitions. [2022-07-13 01:25:29,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 01:25:29,375 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:25:29,376 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] [2022-07-13 01:25:29,383 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-13 01:25:29,583 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-13 01:25:29,583 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:25:29,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:25:29,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1063651591, now seen corresponding path program 1 times [2022-07-13 01:25:29,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:25:29,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204723281] [2022-07-13 01:25:29,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:25:29,584 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:25:29,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:25:29,585 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-13 01:25:29,587 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-13 01:25:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:25:29,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:25:29,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:25:29,759 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-13 01:25:29,760 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:25:29,760 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:25:29,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204723281] [2022-07-13 01:25:29,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [204723281] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:25:29,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:25:29,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:25:29,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673259407] [2022-07-13 01:25:29,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:25:29,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:25:29,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:25:29,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:25:29,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:25:29,761 INFO L87 Difference]: Start difference. First operand 3319 states and 4825 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-13 01:25:29,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:25:29,826 INFO L93 Difference]: Finished difference Result 4558 states and 6169 transitions. [2022-07-13 01:25:29,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:25:29,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2022-07-13 01:25:29,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:25:29,832 INFO L225 Difference]: With dead ends: 4558 [2022-07-13 01:25:29,833 INFO L226 Difference]: Without dead ends: 4558 [2022-07-13 01:25:29,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-13 01:25:29,833 INFO L413 NwaCegarLoop]: 3168 mSDtfsCounter, 1820 mSDsluCounter, 4524 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1830 SdHoareTripleChecker+Valid, 7692 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-13 01:25:29,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1830 Valid, 7692 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:25:29,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4558 states. [2022-07-13 01:25:29,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4558 to 3289. [2022-07-13 01:25:29,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3289 states, 2510 states have (on average 1.8792828685258964) internal successors, (4717), 3264 states have internal predecessors, (4717), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:25:29,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3289 states to 3289 states and 4767 transitions. [2022-07-13 01:25:29,872 INFO L78 Accepts]: Start accepts. Automaton has 3289 states and 4767 transitions. Word has length 22 [2022-07-13 01:25:29,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:25:29,872 INFO L495 AbstractCegarLoop]: Abstraction has 3289 states and 4767 transitions. [2022-07-13 01:25:29,872 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-13 01:25:29,872 INFO L276 IsEmpty]: Start isEmpty. Operand 3289 states and 4767 transitions. [2022-07-13 01:25:29,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 01:25:29,873 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:25:29,873 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] [2022-07-13 01:25:29,880 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-13 01:25:30,080 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-13 01:25:30,081 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr359REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:25:30,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:25:30,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1134259450, now seen corresponding path program 1 times [2022-07-13 01:25:30,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:25:30,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [380184575] [2022-07-13 01:25:30,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:25:30,082 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:25:30,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:25:30,083 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-13 01:25:30,113 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-13 01:25:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:25:30,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:25:30,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:25:30,289 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-13 01:25:30,289 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:25:30,289 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:25:30,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [380184575] [2022-07-13 01:25:30,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [380184575] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:25:30,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:25:30,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:25:30,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891496742] [2022-07-13 01:25:30,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:25:30,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:25:30,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:25:30,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:25:30,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:25:30,291 INFO L87 Difference]: Start difference. First operand 3289 states and 4767 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-13 01:25:30,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:25:30,355 INFO L93 Difference]: Finished difference Result 4485 states and 5980 transitions. [2022-07-13 01:25:30,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:25:30,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2022-07-13 01:25:30,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:25:30,362 INFO L225 Difference]: With dead ends: 4485 [2022-07-13 01:25:30,363 INFO L226 Difference]: Without dead ends: 4485 [2022-07-13 01:25:30,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-13 01:25:30,363 INFO L413 NwaCegarLoop]: 3093 mSDtfsCounter, 1785 mSDsluCounter, 4409 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1795 SdHoareTripleChecker+Valid, 7502 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-13 01:25:30,364 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1795 Valid, 7502 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:25:30,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4485 states. [2022-07-13 01:25:30,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4485 to 3227. [2022-07-13 01:25:30,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3227 states, 2462 states have (on average 1.8452477660438669) internal successors, (4543), 3202 states have internal predecessors, (4543), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:25:30,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3227 states to 3227 states and 4593 transitions. [2022-07-13 01:25:30,399 INFO L78 Accepts]: Start accepts. Automaton has 3227 states and 4593 transitions. Word has length 22 [2022-07-13 01:25:30,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:25:30,399 INFO L495 AbstractCegarLoop]: Abstraction has 3227 states and 4593 transitions. [2022-07-13 01:25:30,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-13 01:25:30,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3227 states and 4593 transitions. [2022-07-13 01:25:30,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 01:25:30,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:25:30,400 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-13 01:25:30,408 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-13 01:25:30,608 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-13 01:25:30,609 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr696REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:25:30,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:25:30,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1056519613, now seen corresponding path program 1 times [2022-07-13 01:25:30,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:25:30,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116518064] [2022-07-13 01:25:30,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:25:30,609 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:25:30,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:25:30,610 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-13 01:25:30,611 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-13 01:25:30,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:25:30,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:25:30,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:25:30,751 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-13 01:25:30,786 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-13 01:25:30,786 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:25:30,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:25:30,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1116518064] [2022-07-13 01:25:30,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1116518064] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:25:30,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:25:30,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:25:30,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352454428] [2022-07-13 01:25:30,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:25:30,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:25:30,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:25:30,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:25:30,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:25:30,788 INFO L87 Difference]: Start difference. First operand 3227 states and 4593 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-13 01:25:32,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:25:32,841 INFO L93 Difference]: Finished difference Result 3502 states and 4766 transitions. [2022-07-13 01:25:32,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:25:32,842 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-13 01:25:32,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:25:32,847 INFO L225 Difference]: With dead ends: 3502 [2022-07-13 01:25:32,847 INFO L226 Difference]: Without dead ends: 3502 [2022-07-13 01:25:32,847 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-13 01:25:32,848 INFO L413 NwaCegarLoop]: 1123 mSDtfsCounter, 2363 mSDsluCounter, 894 mSDsCounter, 0 mSdLazyCounter, 1498 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2369 SdHoareTripleChecker+Valid, 2017 SdHoareTripleChecker+Invalid, 1519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:25:32,849 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2369 Valid, 2017 Invalid, 1519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1498 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-13 01:25:32,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3502 states. [2022-07-13 01:25:32,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3502 to 3223. [2022-07-13 01:25:32,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3223 states, 2462 states have (on average 1.8419983753046303) internal successors, (4535), 3198 states have internal predecessors, (4535), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:25:32,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3223 states to 3223 states and 4585 transitions. [2022-07-13 01:25:32,889 INFO L78 Accepts]: Start accepts. Automaton has 3223 states and 4585 transitions. Word has length 27 [2022-07-13 01:25:32,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:25:32,889 INFO L495 AbstractCegarLoop]: Abstraction has 3223 states and 4585 transitions. [2022-07-13 01:25:32,889 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-13 01:25:32,890 INFO L276 IsEmpty]: Start isEmpty. Operand 3223 states and 4585 transitions. [2022-07-13 01:25:32,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-13 01:25:32,892 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:25:32,892 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-13 01:25:32,901 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-13 01:25:33,099 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-13 01:25:33,099 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr697REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:25:33,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:25:33,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1056519614, now seen corresponding path program 1 times [2022-07-13 01:25:33,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:25:33,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902575580] [2022-07-13 01:25:33,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:25:33,100 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:25:33,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:25:33,101 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-13 01:25:33,103 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-13 01:25:33,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:25:33,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 01:25:33,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:25:33,256 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-13 01:25:33,357 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-13 01:25:33,357 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:25:33,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:25:33,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902575580] [2022-07-13 01:25:33,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902575580] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:25:33,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:25:33,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:25:33,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94527369] [2022-07-13 01:25:33,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:25:33,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:25:33,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:25:33,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:25:33,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:25:33,359 INFO L87 Difference]: Start difference. First operand 3223 states and 4585 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-13 01:25:36,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:25:36,724 INFO L93 Difference]: Finished difference Result 3925 states and 5359 transitions. [2022-07-13 01:25:36,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 01:25:36,724 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-13 01:25:36,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:25:36,729 INFO L225 Difference]: With dead ends: 3925 [2022-07-13 01:25:36,729 INFO L226 Difference]: Without dead ends: 3925 [2022-07-13 01:25:36,729 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-13 01:25:36,729 INFO L413 NwaCegarLoop]: 1540 mSDtfsCounter, 1487 mSDsluCounter, 1935 mSDsCounter, 0 mSdLazyCounter, 2011 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1487 SdHoareTripleChecker+Valid, 3475 SdHoareTripleChecker+Invalid, 2023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2011 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-13 01:25:36,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1487 Valid, 3475 Invalid, 2023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2011 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-13 01:25:36,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3925 states. [2022-07-13 01:25:36,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3925 to 3259. [2022-07-13 01:25:36,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3259 states, 2498 states have (on average 1.831865492393915) internal successors, (4576), 3234 states have internal predecessors, (4576), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:25:36,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3259 states to 3259 states and 4626 transitions. [2022-07-13 01:25:36,761 INFO L78 Accepts]: Start accepts. Automaton has 3259 states and 4626 transitions. Word has length 27 [2022-07-13 01:25:36,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:25:36,762 INFO L495 AbstractCegarLoop]: Abstraction has 3259 states and 4626 transitions. [2022-07-13 01:25:36,762 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-13 01:25:36,762 INFO L276 IsEmpty]: Start isEmpty. Operand 3259 states and 4626 transitions. [2022-07-13 01:25:36,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 01:25:36,764 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:25:36,764 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] [2022-07-13 01:25:36,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-13 01:25:36,971 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-13 01:25:36,972 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:25:36,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:25:36,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128551, now seen corresponding path program 1 times [2022-07-13 01:25:36,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:25:36,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1688163863] [2022-07-13 01:25:36,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:25:36,973 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:25:36,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:25:36,974 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-13 01:25:36,976 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-13 01:25:37,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:25:37,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:25:37,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:25:37,151 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-13 01:25:37,182 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-13 01:25:37,183 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:25:37,183 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:25:37,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1688163863] [2022-07-13 01:25:37,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1688163863] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:25:37,183 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:25:37,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:25:37,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598719017] [2022-07-13 01:25:37,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:25:37,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:25:37,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:25:37,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:25:37,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:25:37,185 INFO L87 Difference]: Start difference. First operand 3259 states and 4626 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-13 01:25:40,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:25:40,560 INFO L93 Difference]: Finished difference Result 6304 states and 8790 transitions. [2022-07-13 01:25:40,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:25:40,562 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-07-13 01:25:40,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:25:40,572 INFO L225 Difference]: With dead ends: 6304 [2022-07-13 01:25:40,572 INFO L226 Difference]: Without dead ends: 6304 [2022-07-13 01:25:40,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-13 01:25:40,573 INFO L413 NwaCegarLoop]: 2393 mSDtfsCounter, 3502 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 2544 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3509 SdHoareTripleChecker+Valid, 4226 SdHoareTripleChecker+Invalid, 2587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-13 01:25:40,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3509 Valid, 4226 Invalid, 2587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2544 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-13 01:25:40,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6304 states. [2022-07-13 01:25:40,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6304 to 3255. [2022-07-13 01:25:40,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3255 states, 2498 states have (on average 1.8286629303442754) internal successors, (4568), 3230 states have internal predecessors, (4568), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:25:40,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3255 states to 3255 states and 4618 transitions. [2022-07-13 01:25:40,633 INFO L78 Accepts]: Start accepts. Automaton has 3255 states and 4618 transitions. Word has length 36 [2022-07-13 01:25:40,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:25:40,633 INFO L495 AbstractCegarLoop]: Abstraction has 3255 states and 4618 transitions. [2022-07-13 01:25:40,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-13 01:25:40,634 INFO L276 IsEmpty]: Start isEmpty. Operand 3255 states and 4618 transitions. [2022-07-13 01:25:40,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 01:25:40,634 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:25:40,634 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] [2022-07-13 01:25:40,642 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Ended with exit code 0 [2022-07-13 01:25:40,841 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-13 01:25:40,842 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:25:40,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:25:40,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1781128552, now seen corresponding path program 1 times [2022-07-13 01:25:40,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:25:40,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1093729437] [2022-07-13 01:25:40,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:25:40,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:25:40,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:25:40,845 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-13 01:25:40,847 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-13 01:25:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:25:41,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 01:25:41,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:25:41,047 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-13 01:25:41,146 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-13 01:25:41,146 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:25:41,146 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:25:41,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1093729437] [2022-07-13 01:25:41,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1093729437] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:25:41,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:25:41,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:25:41,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306211750] [2022-07-13 01:25:41,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:25:41,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:25:41,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:25:41,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:25:41,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:25:41,147 INFO L87 Difference]: Start difference. First operand 3255 states and 4618 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-13 01:25:45,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:25:45,915 INFO L93 Difference]: Finished difference Result 5973 states and 8166 transitions. [2022-07-13 01:25:45,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:25:45,915 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-07-13 01:25:45,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:25:45,921 INFO L225 Difference]: With dead ends: 5973 [2022-07-13 01:25:45,921 INFO L226 Difference]: Without dead ends: 5973 [2022-07-13 01:25:45,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-13 01:25:45,921 INFO L413 NwaCegarLoop]: 2332 mSDtfsCounter, 2860 mSDsluCounter, 2293 mSDsCounter, 0 mSdLazyCounter, 2545 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2864 SdHoareTripleChecker+Valid, 4625 SdHoareTripleChecker+Invalid, 2557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-13 01:25:45,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2864 Valid, 4625 Invalid, 2557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2545 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-07-13 01:25:45,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5973 states. [2022-07-13 01:25:45,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5973 to 3251. [2022-07-13 01:25:45,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3251 states, 2498 states have (on average 1.8254603682946358) internal successors, (4560), 3226 states have internal predecessors, (4560), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:25:45,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3251 states to 3251 states and 4610 transitions. [2022-07-13 01:25:45,962 INFO L78 Accepts]: Start accepts. Automaton has 3251 states and 4610 transitions. Word has length 36 [2022-07-13 01:25:45,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:25:45,963 INFO L495 AbstractCegarLoop]: Abstraction has 3251 states and 4610 transitions. [2022-07-13 01:25:45,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-13 01:25:45,964 INFO L276 IsEmpty]: Start isEmpty. Operand 3251 states and 4610 transitions. [2022-07-13 01:25:45,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 01:25:45,964 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:25:45,964 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] [2022-07-13 01:25:45,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-13 01:25:46,173 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-13 01:25:46,174 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr372REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:25:46,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:25:46,174 INFO L85 PathProgramCache]: Analyzing trace with hash -526454297, now seen corresponding path program 1 times [2022-07-13 01:25:46,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:25:46,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1829079481] [2022-07-13 01:25:46,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:25:46,174 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:25:46,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:25:46,176 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-13 01:25:46,176 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-13 01:25:46,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:25:46,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:25:46,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:25:46,348 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-13 01:25:46,387 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-13 01:25:46,387 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:25:46,387 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:25:46,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1829079481] [2022-07-13 01:25:46,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1829079481] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:25:46,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:25:46,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:25:46,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184911831] [2022-07-13 01:25:46,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:25:46,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:25:46,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:25:46,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:25:46,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:25:46,389 INFO L87 Difference]: Start difference. First operand 3251 states and 4610 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-13 01:25:50,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:25:50,135 INFO L93 Difference]: Finished difference Result 6748 states and 9302 transitions. [2022-07-13 01:25:50,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 01:25:50,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-07-13 01:25:50,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:25:50,141 INFO L225 Difference]: With dead ends: 6748 [2022-07-13 01:25:50,142 INFO L226 Difference]: Without dead ends: 6748 [2022-07-13 01:25:50,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-13 01:25:50,142 INFO L413 NwaCegarLoop]: 1965 mSDtfsCounter, 4494 mSDsluCounter, 2025 mSDsCounter, 0 mSdLazyCounter, 2554 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4504 SdHoareTripleChecker+Valid, 3990 SdHoareTripleChecker+Invalid, 2605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 2554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-13 01:25:50,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4504 Valid, 3990 Invalid, 2605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 2554 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-07-13 01:25:50,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6748 states. [2022-07-13 01:25:50,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6748 to 3248. [2022-07-13 01:25:50,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3248 states, 2498 states have (on average 1.8166533226581265) internal successors, (4538), 3223 states have internal predecessors, (4538), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:25:50,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3248 states to 3248 states and 4588 transitions. [2022-07-13 01:25:50,185 INFO L78 Accepts]: Start accepts. Automaton has 3248 states and 4588 transitions. Word has length 36 [2022-07-13 01:25:50,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:25:50,185 INFO L495 AbstractCegarLoop]: Abstraction has 3248 states and 4588 transitions. [2022-07-13 01:25:50,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-13 01:25:50,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3248 states and 4588 transitions. [2022-07-13 01:25:50,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-13 01:25:50,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:25:50,186 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] [2022-07-13 01:25:50,193 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-13 01:25:50,393 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-13 01:25:50,393 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr373REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:25:50,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:25:50,393 INFO L85 PathProgramCache]: Analyzing trace with hash -526454296, now seen corresponding path program 1 times [2022-07-13 01:25:50,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:25:50,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [428502127] [2022-07-13 01:25:50,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:25:50,394 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:25:50,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:25:50,395 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-13 01:25:50,396 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-13 01:25:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:25:50,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-13 01:25:50,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:25:50,573 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-13 01:25:50,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-13 01:25:50,672 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:25:50,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:25:50,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [428502127] [2022-07-13 01:25:50,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [428502127] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:25:50,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:25:50,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:25:50,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915206847] [2022-07-13 01:25:50,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:25:50,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:25:50,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:25:50,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:25:50,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:25:50,674 INFO L87 Difference]: Start difference. First operand 3248 states and 4588 transitions. Second operand has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-13 01:25:54,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:25:54,616 INFO L93 Difference]: Finished difference Result 4807 states and 6551 transitions. [2022-07-13 01:25:54,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:25:54,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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 36 [2022-07-13 01:25:54,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:25:54,620 INFO L225 Difference]: With dead ends: 4807 [2022-07-13 01:25:54,620 INFO L226 Difference]: Without dead ends: 4807 [2022-07-13 01:25:54,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-13 01:25:54,621 INFO L413 NwaCegarLoop]: 2238 mSDtfsCounter, 2208 mSDsluCounter, 1865 mSDsCounter, 0 mSdLazyCounter, 2217 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2208 SdHoareTripleChecker+Valid, 4103 SdHoareTripleChecker+Invalid, 2229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-13 01:25:54,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2208 Valid, 4103 Invalid, 2229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2217 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-13 01:25:54,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4807 states. [2022-07-13 01:25:54,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4807 to 3248. [2022-07-13 01:25:54,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3248 states, 2498 states have (on average 1.8134507606084869) internal successors, (4530), 3223 states have internal predecessors, (4530), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:25:54,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3248 states to 3248 states and 4580 transitions. [2022-07-13 01:25:54,652 INFO L78 Accepts]: Start accepts. Automaton has 3248 states and 4580 transitions. Word has length 36 [2022-07-13 01:25:54,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:25:54,652 INFO L495 AbstractCegarLoop]: Abstraction has 3248 states and 4580 transitions. [2022-07-13 01:25:54,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 12.0) internal successors, (36), 4 states have internal predecessors, (36), 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-13 01:25:54,652 INFO L276 IsEmpty]: Start isEmpty. Operand 3248 states and 4580 transitions. [2022-07-13 01:25:54,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-13 01:25:54,653 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:25:54,653 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] [2022-07-13 01:25:54,665 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-07-13 01:25:54,863 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-13 01:25:54,864 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:25:54,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:25:54,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1782356879, now seen corresponding path program 1 times [2022-07-13 01:25:54,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:25:54,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [691596800] [2022-07-13 01:25:54,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:25:54,864 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:25:54,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:25:54,865 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-13 01:25:54,866 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-13 01:25:55,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:25:55,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:25:55,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:25:55,069 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-13 01:25:55,069 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:25:55,070 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:25:55,070 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [691596800] [2022-07-13 01:25:55,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [691596800] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:25:55,070 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:25:55,070 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:25:55,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967701848] [2022-07-13 01:25:55,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:25:55,073 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:25:55,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:25:55,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:25:55,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:25:55,073 INFO L87 Difference]: Start difference. First operand 3248 states and 4580 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-13 01:25:55,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:25:55,120 INFO L93 Difference]: Finished difference Result 3236 states and 4556 transitions. [2022-07-13 01:25:55,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:25:55,120 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2022-07-13 01:25:55,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:25:55,124 INFO L225 Difference]: With dead ends: 3236 [2022-07-13 01:25:55,124 INFO L226 Difference]: Without dead ends: 3236 [2022-07-13 01:25:55,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 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-13 01:25:55,125 INFO L413 NwaCegarLoop]: 1797 mSDtfsCounter, 756 mSDsluCounter, 2825 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 760 SdHoareTripleChecker+Valid, 4622 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-13 01:25:55,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [760 Valid, 4622 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:25:55,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3236 states. [2022-07-13 01:25:55,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3236 to 3236. [2022-07-13 01:25:55,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3236 states, 2486 states have (on average 1.8125502815768302) internal successors, (4506), 3211 states have internal predecessors, (4506), 25 states have call successors, (25), 3 states have call predecessors, (25), 3 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-13 01:25:55,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3236 states to 3236 states and 4556 transitions. [2022-07-13 01:25:55,157 INFO L78 Accepts]: Start accepts. Automaton has 3236 states and 4556 transitions. Word has length 40 [2022-07-13 01:25:55,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:25:55,157 INFO L495 AbstractCegarLoop]: Abstraction has 3236 states and 4556 transitions. [2022-07-13 01:25:55,157 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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-13 01:25:55,157 INFO L276 IsEmpty]: Start isEmpty. Operand 3236 states and 4556 transitions. [2022-07-13 01:25:55,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-13 01:25:55,158 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:25:55,158 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] [2022-07-13 01:25:55,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-13 01:25:55,365 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-13 01:25:55,365 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr704REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:25:55,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:25:55,366 INFO L85 PathProgramCache]: Analyzing trace with hash -263031357, now seen corresponding path program 1 times [2022-07-13 01:25:55,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:25:55,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1453898420] [2022-07-13 01:25:55,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:25:55,366 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:25:55,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:25:55,368 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-13 01:25:55,370 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-13 01:25:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:25:55,532 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:25:55,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:25:55,649 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-13 01:25:55,649 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:25:55,649 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:25:55,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1453898420] [2022-07-13 01:25:55,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1453898420] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:25:55,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:25:55,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:25:55,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218370706] [2022-07-13 01:25:55,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:25:55,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:25:55,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:25:55,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:25:55,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:25:55,651 INFO L87 Difference]: Start difference. First operand 3236 states and 4556 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-13 01:25:55,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:25:55,755 INFO L93 Difference]: Finished difference Result 4684 states and 6375 transitions. [2022-07-13 01:25:55,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:25:55,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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 48 [2022-07-13 01:25:55,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:25:55,761 INFO L225 Difference]: With dead ends: 4684 [2022-07-13 01:25:55,761 INFO L226 Difference]: Without dead ends: 4684 [2022-07-13 01:25:55,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 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-13 01:25:55,761 INFO L413 NwaCegarLoop]: 1820 mSDtfsCounter, 1180 mSDsluCounter, 1682 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1189 SdHoareTripleChecker+Valid, 3502 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:25:55,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1189 Valid, 3502 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 01:25:55,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4684 states. [2022-07-13 01:25:55,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4684 to 4020. [2022-07-13 01:25:55,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4020 states, 3266 states have (on average 1.7988364972443356) internal successors, (5875), 3988 states have internal predecessors, (5875), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-13 01:25:55,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4020 states to 4020 states and 5939 transitions. [2022-07-13 01:25:55,799 INFO L78 Accepts]: Start accepts. Automaton has 4020 states and 5939 transitions. Word has length 48 [2022-07-13 01:25:55,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:25:55,799 INFO L495 AbstractCegarLoop]: Abstraction has 4020 states and 5939 transitions. [2022-07-13 01:25:55,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 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-13 01:25:55,799 INFO L276 IsEmpty]: Start isEmpty. Operand 4020 states and 5939 transitions. [2022-07-13 01:25:55,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-13 01:25:55,800 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:25:55,800 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] [2022-07-13 01:25:55,810 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-13 01:25:56,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:25:56,014 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:25:56,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:25:56,014 INFO L85 PathProgramCache]: Analyzing trace with hash -435335443, now seen corresponding path program 1 times [2022-07-13 01:25:56,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:25:56,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1389107892] [2022-07-13 01:25:56,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:25:56,015 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:25:56,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:25:56,016 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:25:56,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-13 01:25:56,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:25:56,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:25:56,249 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:25:56,272 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-13 01:25:56,272 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:25:56,272 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:25:56,272 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1389107892] [2022-07-13 01:25:56,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1389107892] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:25:56,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:25:56,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:25:56,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782506574] [2022-07-13 01:25:56,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:25:56,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:25:56,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:25:56,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:25:56,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:25:56,274 INFO L87 Difference]: Start difference. First operand 4020 states and 5939 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-13 01:25:56,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:25:56,324 INFO L93 Difference]: Finished difference Result 4959 states and 6922 transitions. [2022-07-13 01:25:56,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:25:56,325 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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 51 [2022-07-13 01:25:56,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:25:56,330 INFO L225 Difference]: With dead ends: 4959 [2022-07-13 01:25:56,330 INFO L226 Difference]: Without dead ends: 4959 [2022-07-13 01:25:56,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 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-13 01:25:56,333 INFO L413 NwaCegarLoop]: 2867 mSDtfsCounter, 1755 mSDsluCounter, 3959 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1765 SdHoareTripleChecker+Valid, 6826 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-13 01:25:56,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1765 Valid, 6826 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:25:56,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4959 states. [2022-07-13 01:25:56,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4959 to 3978. [2022-07-13 01:25:56,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3978 states, 3224 states have (on average 1.8005583126550868) internal successors, (5805), 3946 states have internal predecessors, (5805), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-13 01:25:56,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3978 states to 3978 states and 5869 transitions. [2022-07-13 01:25:56,391 INFO L78 Accepts]: Start accepts. Automaton has 3978 states and 5869 transitions. Word has length 51 [2022-07-13 01:25:56,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:25:56,392 INFO L495 AbstractCegarLoop]: Abstraction has 3978 states and 5869 transitions. [2022-07-13 01:25:56,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 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-13 01:25:56,392 INFO L276 IsEmpty]: Start isEmpty. Operand 3978 states and 5869 transitions. [2022-07-13 01:25:56,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-13 01:25:56,392 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:25:56,393 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] [2022-07-13 01:25:56,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-07-13 01:25:56,601 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:25:56,602 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:25:56,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:25:56,602 INFO L85 PathProgramCache]: Analyzing trace with hash -273786554, now seen corresponding path program 1 times [2022-07-13 01:25:56,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:25:56,603 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1477188797] [2022-07-13 01:25:56,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:25:56,603 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:25:56,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:25:56,604 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-13 01:25:56,607 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-13 01:25:56,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:25:56,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:25:56,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:25:56,857 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-13 01:25:56,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:25:56,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:25:56,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1477188797] [2022-07-13 01:25:56,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1477188797] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:25:56,858 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:25:56,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:25:56,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88661359] [2022-07-13 01:25:56,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:25:56,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:25:56,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:25:56,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:25:56,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:25:56,859 INFO L87 Difference]: Start difference. First operand 3978 states and 5869 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-13 01:25:56,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:25:56,910 INFO L93 Difference]: Finished difference Result 4695 states and 6408 transitions. [2022-07-13 01:25:56,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:25:56,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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 54 [2022-07-13 01:25:56,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:25:56,916 INFO L225 Difference]: With dead ends: 4695 [2022-07-13 01:25:56,916 INFO L226 Difference]: Without dead ends: 4695 [2022-07-13 01:25:56,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 51 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-13 01:25:56,918 INFO L413 NwaCegarLoop]: 2907 mSDtfsCounter, 1746 mSDsluCounter, 4048 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1756 SdHoareTripleChecker+Valid, 6955 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-13 01:25:56,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1756 Valid, 6955 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:25:56,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4695 states. [2022-07-13 01:25:56,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4695 to 3960. [2022-07-13 01:25:56,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3960 states, 3206 states have (on average 1.8013100436681222) internal successors, (5775), 3928 states have internal predecessors, (5775), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-13 01:25:56,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3960 states to 3960 states and 5839 transitions. [2022-07-13 01:25:56,959 INFO L78 Accepts]: Start accepts. Automaton has 3960 states and 5839 transitions. Word has length 54 [2022-07-13 01:25:56,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:25:56,959 INFO L495 AbstractCegarLoop]: Abstraction has 3960 states and 5839 transitions. [2022-07-13 01:25:56,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 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-13 01:25:56,959 INFO L276 IsEmpty]: Start isEmpty. Operand 3960 states and 5839 transitions. [2022-07-13 01:25:56,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-13 01:25:56,959 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:25:56,960 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] [2022-07-13 01:25:56,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Ended with exit code 0 [2022-07-13 01:25:57,168 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:25:57,169 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:25:57,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:25:57,169 INFO L85 PathProgramCache]: Analyzing trace with hash -495130849, now seen corresponding path program 1 times [2022-07-13 01:25:57,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:25:57,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [88687417] [2022-07-13 01:25:57,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:25:57,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:25:57,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:25:57,171 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:25:57,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-13 01:25:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:25:57,391 INFO L263 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 01:25:57,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:25:57,399 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 01:25:57,400 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-13 01:25:57,446 INFO L356 Elim1Store]: treesize reduction 165, result has 13.6 percent of original size [2022-07-13 01:25:57,447 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 3 case distinctions, treesize of input 29 treesize of output 36 [2022-07-13 01:25:57,472 INFO L356 Elim1Store]: treesize reduction 66, result has 1.5 percent of original size [2022-07-13 01:25:57,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 20 [2022-07-13 01:25:57,493 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-13 01:25:57,494 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:25:57,494 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:25:57,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [88687417] [2022-07-13 01:25:57,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [88687417] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:25:57,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:25:57,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:25:57,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133480199] [2022-07-13 01:25:57,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:25:57,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:25:57,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:25:57,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:25:57,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:25:57,496 INFO L87 Difference]: Start difference. First operand 3960 states and 5839 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:25:58,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:25:58,613 INFO L93 Difference]: Finished difference Result 3926 states and 5804 transitions. [2022-07-13 01:25:58,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:25:58,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-07-13 01:25:58,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:25:58,619 INFO L225 Difference]: With dead ends: 3926 [2022-07-13 01:25:58,619 INFO L226 Difference]: Without dead ends: 3926 [2022-07-13 01:25:58,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:25:58,620 INFO L413 NwaCegarLoop]: 1695 mSDtfsCounter, 759 mSDsluCounter, 2564 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 763 SdHoareTripleChecker+Valid, 4259 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 112 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:25:58,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [763 Valid, 4259 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 277 Invalid, 0 Unknown, 112 Unchecked, 1.1s Time] [2022-07-13 01:25:58,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3926 states. [2022-07-13 01:25:58,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3926 to 3926. [2022-07-13 01:25:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3926 states, 3172 states have (on average 1.8095838587641866) internal successors, (5740), 3894 states have internal predecessors, (5740), 32 states have call successors, (32), 3 states have call predecessors, (32), 3 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-13 01:25:58,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3926 states to 3926 states and 5804 transitions. [2022-07-13 01:25:58,656 INFO L78 Accepts]: Start accepts. Automaton has 3926 states and 5804 transitions. Word has length 57 [2022-07-13 01:25:58,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:25:58,656 INFO L495 AbstractCegarLoop]: Abstraction has 3926 states and 5804 transitions. [2022-07-13 01:25:58,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 01:25:58,657 INFO L276 IsEmpty]: Start isEmpty. Operand 3926 states and 5804 transitions. [2022-07-13 01:25:58,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-13 01:25:58,657 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:25:58,657 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] [2022-07-13 01:25:58,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-13 01:25:58,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:25:58,866 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr437REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:25:58,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:25:58,867 INFO L85 PathProgramCache]: Analyzing trace with hash 122106401, now seen corresponding path program 1 times [2022-07-13 01:25:58,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:25:58,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [279551556] [2022-07-13 01:25:58,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:25:58,868 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:25:58,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:25:58,869 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:25:58,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-13 01:25:59,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:25:59,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:25:59,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:25:59,252 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-13 01:25:59,253 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:25:59,253 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:25:59,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [279551556] [2022-07-13 01:25:59,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [279551556] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:25:59,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:25:59,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:25:59,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760615322] [2022-07-13 01:25:59,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:25:59,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-13 01:25:59,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:25:59,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-13 01:25:59,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-13 01:25:59,254 INFO L87 Difference]: Start difference. First operand 3926 states and 5804 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-13 01:25:59,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:25:59,371 INFO L93 Difference]: Finished difference Result 5186 states and 7398 transitions. [2022-07-13 01:25:59,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-13 01:25:59,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 59 [2022-07-13 01:25:59,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:25:59,378 INFO L225 Difference]: With dead ends: 5186 [2022-07-13 01:25:59,378 INFO L226 Difference]: Without dead ends: 5186 [2022-07-13 01:25:59,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 57 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-13 01:25:59,379 INFO L413 NwaCegarLoop]: 1948 mSDtfsCounter, 870 mSDsluCounter, 1673 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 3621 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:25:59,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 3621 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 01:25:59,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5186 states. [2022-07-13 01:25:59,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5186 to 4843. [2022-07-13 01:25:59,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4843 states, 4083 states have (on average 1.7891256429096252) internal successors, (7305), 4802 states have internal predecessors, (7305), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-07-13 01:25:59,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4843 states to 4843 states and 7387 transitions. [2022-07-13 01:25:59,425 INFO L78 Accepts]: Start accepts. Automaton has 4843 states and 7387 transitions. Word has length 59 [2022-07-13 01:25:59,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:25:59,425 INFO L495 AbstractCegarLoop]: Abstraction has 4843 states and 7387 transitions. [2022-07-13 01:25:59,425 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-13 01:25:59,425 INFO L276 IsEmpty]: Start isEmpty. Operand 4843 states and 7387 transitions. [2022-07-13 01:25:59,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-13 01:25:59,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:25:59,426 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] [2022-07-13 01:25:59,437 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Ended with exit code 0 [2022-07-13 01:25:59,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:25:59,635 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr73REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:25:59,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:25:59,636 INFO L85 PathProgramCache]: Analyzing trace with hash -45497454, now seen corresponding path program 1 times [2022-07-13 01:25:59,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:25:59,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2062282102] [2022-07-13 01:25:59,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:25:59,636 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:25:59,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:25:59,638 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:25:59,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-07-13 01:26:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:26:00,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-13 01:26:00,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:26:00,041 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-13 01:26:00,045 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-13 01:26:00,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-13 01:26:00,300 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-13 01:26:00,307 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 01:26:00,307 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-13 01:26:00,316 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-13 01:26:00,316 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:26:00,316 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:26:00,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2062282102] [2022-07-13 01:26:00,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2062282102] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:26:00,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:26:00,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 01:26:00,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577423032] [2022-07-13 01:26:00,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:26:00,317 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:26:00,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:26:00,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:26:00,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:26:00,317 INFO L87 Difference]: Start difference. First operand 4843 states and 7387 transitions. Second operand has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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-13 01:26:03,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:26:03,322 INFO L93 Difference]: Finished difference Result 6874 states and 10400 transitions. [2022-07-13 01:26:03,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:26:03,322 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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 62 [2022-07-13 01:26:03,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:26:03,330 INFO L225 Difference]: With dead ends: 6874 [2022-07-13 01:26:03,331 INFO L226 Difference]: Without dead ends: 6874 [2022-07-13 01:26:03,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:26:03,331 INFO L413 NwaCegarLoop]: 642 mSDtfsCounter, 4069 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 1562 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4083 SdHoareTripleChecker+Valid, 1047 SdHoareTripleChecker+Invalid, 1680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 1562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-13 01:26:03,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4083 Valid, 1047 Invalid, 1680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 1562 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-13 01:26:03,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6874 states. [2022-07-13 01:26:03,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6874 to 4603. [2022-07-13 01:26:03,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4603 states, 3927 states have (on average 1.7122485357779476) internal successors, (6724), 4562 states have internal predecessors, (6724), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-07-13 01:26:03,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4603 states to 4603 states and 6806 transitions. [2022-07-13 01:26:03,382 INFO L78 Accepts]: Start accepts. Automaton has 4603 states and 6806 transitions. Word has length 62 [2022-07-13 01:26:03,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:26:03,383 INFO L495 AbstractCegarLoop]: Abstraction has 4603 states and 6806 transitions. [2022-07-13 01:26:03,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 20.666666666666668) internal successors, (62), 4 states have internal predecessors, (62), 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-13 01:26:03,383 INFO L276 IsEmpty]: Start isEmpty. Operand 4603 states and 6806 transitions. [2022-07-13 01:26:03,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 01:26:03,384 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:26:03,384 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-13 01:26:03,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2022-07-13 01:26:03,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:26:03,595 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:26:03,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:26:03,596 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391416, now seen corresponding path program 1 times [2022-07-13 01:26:03,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:26:03,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1170006118] [2022-07-13 01:26:03,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:26:03,597 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:26:03,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:26:03,598 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:26:03,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-07-13 01:26:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:26:03,853 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 01:26:03,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:26:03,866 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-13 01:26:03,874 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-13 01:26:03,888 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-13 01:26:03,894 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-13 01:26:03,894 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:26:03,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:26:03,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1170006118] [2022-07-13 01:26:03,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1170006118] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:26:03,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:26:03,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:26:03,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67939809] [2022-07-13 01:26:03,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:26:03,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 01:26:03,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:26:03,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 01:26:03,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:26:03,896 INFO L87 Difference]: Start difference. First operand 4603 states and 6806 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-13 01:26:06,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:26:06,557 INFO L93 Difference]: Finished difference Result 4602 states and 6803 transitions. [2022-07-13 01:26:06,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 01:26:06,558 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2022-07-13 01:26:06,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:26:06,562 INFO L225 Difference]: With dead ends: 4602 [2022-07-13 01:26:06,562 INFO L226 Difference]: Without dead ends: 4602 [2022-07-13 01:26:06,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 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-13 01:26:06,563 INFO L413 NwaCegarLoop]: 1716 mSDtfsCounter, 4 mSDsluCounter, 2873 mSDsCounter, 0 mSdLazyCounter, 2280 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4589 SdHoareTripleChecker+Invalid, 2281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-13 01:26:06,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4589 Invalid, 2281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2280 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-13 01:26:06,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4602 states. [2022-07-13 01:26:06,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4602 to 4602. [2022-07-13 01:26:06,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4602 states, 3927 states have (on average 1.711484593837535) internal successors, (6721), 4561 states have internal predecessors, (6721), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-07-13 01:26:06,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4602 states to 4602 states and 6803 transitions. [2022-07-13 01:26:06,600 INFO L78 Accepts]: Start accepts. Automaton has 4602 states and 6803 transitions. Word has length 67 [2022-07-13 01:26:06,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:26:06,600 INFO L495 AbstractCegarLoop]: Abstraction has 4602 states and 6803 transitions. [2022-07-13 01:26:06,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-13 01:26:06,600 INFO L276 IsEmpty]: Start isEmpty. Operand 4602 states and 6803 transitions. [2022-07-13 01:26:06,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 01:26:06,601 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:26:06,601 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-13 01:26:06,611 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2022-07-13 01:26:06,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:26:06,811 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:26:06,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:26:06,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1308391415, now seen corresponding path program 1 times [2022-07-13 01:26:06,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:26:06,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1186264555] [2022-07-13 01:26:06,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:26:06,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:26:06,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:26:06,813 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:26:06,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2022-07-13 01:26:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:26:07,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 01:26:07,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:26:07,095 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-13 01:26:07,110 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-13 01:26:07,116 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-13 01:26:07,145 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-13 01:26:07,148 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-13 01:26:07,158 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-13 01:26:07,158 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:26:07,159 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:26:07,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1186264555] [2022-07-13 01:26:07,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1186264555] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:26:07,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:26:07,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:26:07,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582484566] [2022-07-13 01:26:07,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:26:07,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 01:26:07,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:26:07,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 01:26:07,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:26:07,162 INFO L87 Difference]: Start difference. First operand 4602 states and 6803 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-13 01:26:10,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:26:10,781 INFO L93 Difference]: Finished difference Result 4601 states and 6800 transitions. [2022-07-13 01:26:10,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 01:26:10,782 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2022-07-13 01:26:10,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:26:10,786 INFO L225 Difference]: With dead ends: 4601 [2022-07-13 01:26:10,787 INFO L226 Difference]: Without dead ends: 4601 [2022-07-13 01:26:10,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 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-13 01:26:10,787 INFO L413 NwaCegarLoop]: 1716 mSDtfsCounter, 2 mSDsluCounter, 2846 mSDsCounter, 0 mSdLazyCounter, 2305 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4562 SdHoareTripleChecker+Invalid, 2306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-13 01:26:10,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4562 Invalid, 2306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2305 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-07-13 01:26:10,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4601 states. [2022-07-13 01:26:10,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4601 to 4601. [2022-07-13 01:26:10,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4601 states, 3924 states have (on average 1.7120285423037718) internal successors, (6718), 4560 states have internal predecessors, (6718), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-07-13 01:26:10,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4601 states to 4601 states and 6800 transitions. [2022-07-13 01:26:10,822 INFO L78 Accepts]: Start accepts. Automaton has 4601 states and 6800 transitions. Word has length 67 [2022-07-13 01:26:10,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:26:10,822 INFO L495 AbstractCegarLoop]: Abstraction has 4601 states and 6800 transitions. [2022-07-13 01:26:10,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-13 01:26:10,822 INFO L276 IsEmpty]: Start isEmpty. Operand 4601 states and 6800 transitions. [2022-07-13 01:26:10,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 01:26:10,823 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:26:10,823 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-13 01:26:10,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2022-07-13 01:26:11,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:26:11,028 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr396REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:26:11,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:26:11,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1173564532, now seen corresponding path program 1 times [2022-07-13 01:26:11,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:26:11,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1429338512] [2022-07-13 01:26:11,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:26:11,029 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:26:11,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:26:11,031 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:26:11,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2022-07-13 01:26:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:26:11,296 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 01:26:11,298 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:26:11,303 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-13 01:26:11,315 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-13 01:26:11,329 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-13 01:26:11,336 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-13 01:26:11,336 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:26:11,336 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:26:11,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1429338512] [2022-07-13 01:26:11,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1429338512] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:26:11,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:26:11,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:26:11,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007161589] [2022-07-13 01:26:11,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:26:11,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 01:26:11,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:26:11,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 01:26:11,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:26:11,338 INFO L87 Difference]: Start difference. First operand 4601 states and 6800 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-13 01:26:13,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:26:13,870 INFO L93 Difference]: Finished difference Result 4600 states and 6796 transitions. [2022-07-13 01:26:13,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 01:26:13,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2022-07-13 01:26:13,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:26:13,875 INFO L225 Difference]: With dead ends: 4600 [2022-07-13 01:26:13,875 INFO L226 Difference]: Without dead ends: 4600 [2022-07-13 01:26:13,875 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 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-13 01:26:13,875 INFO L413 NwaCegarLoop]: 1714 mSDtfsCounter, 4 mSDsluCounter, 2870 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 4584 SdHoareTripleChecker+Invalid, 2278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-07-13 01:26:13,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 4584 Invalid, 2278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-07-13 01:26:13,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4600 states. [2022-07-13 01:26:13,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4600 to 4600. [2022-07-13 01:26:13,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4600 states, 3924 states have (on average 1.7110091743119267) internal successors, (6714), 4559 states have internal predecessors, (6714), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-07-13 01:26:13,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4600 states to 4600 states and 6796 transitions. [2022-07-13 01:26:13,913 INFO L78 Accepts]: Start accepts. Automaton has 4600 states and 6796 transitions. Word has length 67 [2022-07-13 01:26:13,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:26:13,913 INFO L495 AbstractCegarLoop]: Abstraction has 4600 states and 6796 transitions. [2022-07-13 01:26:13,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-13 01:26:13,913 INFO L276 IsEmpty]: Start isEmpty. Operand 4600 states and 6796 transitions. [2022-07-13 01:26:13,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-13 01:26:13,914 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:26:13,914 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-13 01:26:13,925 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (28)] Ended with exit code 0 [2022-07-13 01:26:14,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:26:14,123 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr397REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:26:14,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:26:14,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1173564533, now seen corresponding path program 1 times [2022-07-13 01:26:14,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:26:14,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1869141190] [2022-07-13 01:26:14,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:26:14,124 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:26:14,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:26:14,125 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:26:14,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2022-07-13 01:26:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:26:14,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-13 01:26:14,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:26:14,423 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-13 01:26:14,437 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-13 01:26:14,444 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-13 01:26:14,469 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-13 01:26:14,471 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-13 01:26:14,481 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-13 01:26:14,481 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:26:14,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:26:14,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1869141190] [2022-07-13 01:26:14,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1869141190] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:26:14,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:26:14,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:26:14,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851355455] [2022-07-13 01:26:14,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:26:14,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 01:26:14,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:26:14,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 01:26:14,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 01:26:14,483 INFO L87 Difference]: Start difference. First operand 4600 states and 6796 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-13 01:26:18,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:26:18,109 INFO L93 Difference]: Finished difference Result 4599 states and 6792 transitions. [2022-07-13 01:26:18,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 01:26:18,110 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2022-07-13 01:26:18,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:26:18,114 INFO L225 Difference]: With dead ends: 4599 [2022-07-13 01:26:18,114 INFO L226 Difference]: Without dead ends: 4599 [2022-07-13 01:26:18,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 63 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-13 01:26:18,115 INFO L413 NwaCegarLoop]: 1714 mSDtfsCounter, 2 mSDsluCounter, 2843 mSDsCounter, 0 mSdLazyCounter, 2302 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 4557 SdHoareTripleChecker+Invalid, 2303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-13 01:26:18,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 4557 Invalid, 2303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2302 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-07-13 01:26:18,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4599 states. [2022-07-13 01:26:18,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4599 to 4599. [2022-07-13 01:26:18,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4599 states, 3920 states have (on average 1.711734693877551) internal successors, (6710), 4558 states have internal predecessors, (6710), 41 states have call successors, (41), 3 states have call predecessors, (41), 3 states have return successors, (41), 38 states have call predecessors, (41), 41 states have call successors, (41) [2022-07-13 01:26:18,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4599 states to 4599 states and 6792 transitions. [2022-07-13 01:26:18,166 INFO L78 Accepts]: Start accepts. Automaton has 4599 states and 6792 transitions. Word has length 67 [2022-07-13 01:26:18,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:26:18,167 INFO L495 AbstractCegarLoop]: Abstraction has 4599 states and 6792 transitions. [2022-07-13 01:26:18,167 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 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-13 01:26:18,167 INFO L276 IsEmpty]: Start isEmpty. Operand 4599 states and 6792 transitions. [2022-07-13 01:26:18,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-07-13 01:26:18,168 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:26:18,168 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, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:26:18,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2022-07-13 01:26:18,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:26:18,372 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:26:18,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:26:18,373 INFO L85 PathProgramCache]: Analyzing trace with hash 2062362287, now seen corresponding path program 1 times [2022-07-13 01:26:18,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:26:18,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910561229] [2022-07-13 01:26:18,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:26:18,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:26:18,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:26:18,375 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:26:18,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2022-07-13 01:26:18,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:26:18,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 01:26:18,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:26:18,669 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-13 01:26:18,669 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 01:26:18,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:26:18,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910561229] [2022-07-13 01:26:18,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910561229] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 01:26:18,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 01:26:18,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 01:26:18,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519000265] [2022-07-13 01:26:18,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 01:26:18,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 01:26:18,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:26:18,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 01:26:18,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 01:26:18,672 INFO L87 Difference]: Start difference. First operand 4599 states and 6792 transitions. Second operand has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-13 01:26:18,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:26:18,730 INFO L93 Difference]: Finished difference Result 4602 states and 6801 transitions. [2022-07-13 01:26:18,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 01:26:18,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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 75 [2022-07-13 01:26:18,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:26:18,747 INFO L225 Difference]: With dead ends: 4602 [2022-07-13 01:26:18,747 INFO L226 Difference]: Without dead ends: 4602 [2022-07-13 01:26:18,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 72 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-13 01:26:18,747 INFO L413 NwaCegarLoop]: 1713 mSDtfsCounter, 2 mSDsluCounter, 3418 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 5131 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 01:26:18,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 5131 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 01:26:18,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4602 states. [2022-07-13 01:26:18,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4602 to 4602. [2022-07-13 01:26:18,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4602 states, 3922 states have (on average 1.7116267210606833) internal successors, (6713), 4561 states have internal predecessors, (6713), 41 states have call successors, (41), 3 states have call predecessors, (41), 4 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2022-07-13 01:26:18,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4602 states to 4602 states and 6801 transitions. [2022-07-13 01:26:18,824 INFO L78 Accepts]: Start accepts. Automaton has 4602 states and 6801 transitions. Word has length 75 [2022-07-13 01:26:18,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:26:18,824 INFO L495 AbstractCegarLoop]: Abstraction has 4602 states and 6801 transitions. [2022-07-13 01:26:18,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 18.25) internal successors, (73), 4 states have internal predecessors, (73), 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-13 01:26:18,825 INFO L276 IsEmpty]: Start isEmpty. Operand 4602 states and 6801 transitions. [2022-07-13 01:26:18,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-07-13 01:26:18,825 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:26:18,825 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:26:18,838 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2022-07-13 01:26:19,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:26:19,036 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:26:19,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:26:19,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1092552202, now seen corresponding path program 1 times [2022-07-13 01:26:19,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:26:19,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [849696410] [2022-07-13 01:26:19,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:26:19,037 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:26:19,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:26:19,038 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:26:19,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2022-07-13 01:26:19,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:26:19,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-13 01:26:19,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:26:19,331 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-13 01:26:19,332 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:26:19,402 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-13 01:26:19,402 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:26:19,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [849696410] [2022-07-13 01:26:19,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [849696410] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:26:19,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:26:19,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-07-13 01:26:19,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121227039] [2022-07-13 01:26:19,403 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:26:19,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 01:26:19,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:26:19,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 01:26:19,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-13 01:26:19,404 INFO L87 Difference]: Start difference. First operand 4602 states and 6801 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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-13 01:26:19,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:26:19,598 INFO L93 Difference]: Finished difference Result 4614 states and 6823 transitions. [2022-07-13 01:26:19,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-13 01:26:19,599 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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-13 01:26:19,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:26:19,608 INFO L225 Difference]: With dead ends: 4614 [2022-07-13 01:26:19,608 INFO L226 Difference]: Without dead ends: 4614 [2022-07-13 01:26:19,608 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 144 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-13 01:26:19,609 INFO L413 NwaCegarLoop]: 1713 mSDtfsCounter, 15 mSDsluCounter, 6827 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 8540 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:26:19,609 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 8540 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 01:26:19,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4614 states. [2022-07-13 01:26:19,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4614 to 4612. [2022-07-13 01:26:19,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4612 states, 3931 states have (on average 1.7115237852963623) internal successors, (6728), 4570 states have internal predecessors, (6728), 41 states have call successors, (41), 4 states have call predecessors, (41), 5 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2022-07-13 01:26:19,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4612 states to 4612 states and 6816 transitions. [2022-07-13 01:26:19,656 INFO L78 Accepts]: Start accepts. Automaton has 4612 states and 6816 transitions. Word has length 76 [2022-07-13 01:26:19,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:26:19,656 INFO L495 AbstractCegarLoop]: Abstraction has 4612 states and 6816 transitions. [2022-07-13 01:26:19,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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-13 01:26:19,657 INFO L276 IsEmpty]: Start isEmpty. Operand 4612 states and 6816 transitions. [2022-07-13 01:26:19,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-13 01:26:19,657 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:26:19,657 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:26:19,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2022-07-13 01:26:19,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:26:19,858 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:26:19,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:26:19,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1024769937, now seen corresponding path program 2 times [2022-07-13 01:26:19,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:26:19,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1933190355] [2022-07-13 01:26:19,859 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 01:26:19,859 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:26:19,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:26:19,860 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:26:19,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2022-07-13 01:26:20,418 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 01:26:20,419 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:26:20,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-13 01:26:20,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:26:20,487 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-13 01:26:20,488 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:26:20,619 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-13 01:26:20,619 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:26:20,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1933190355] [2022-07-13 01:26:20,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1933190355] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:26:20,620 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:26:20,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-07-13 01:26:20,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562391260] [2022-07-13 01:26:20,620 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:26:20,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 01:26:20,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:26:20,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 01:26:20,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-13 01:26:20,621 INFO L87 Difference]: Start difference. First operand 4612 states and 6816 transitions. Second operand has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 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-13 01:26:21,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:26:21,162 INFO L93 Difference]: Finished difference Result 4633 states and 6864 transitions. [2022-07-13 01:26:21,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-13 01:26:21,163 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 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 79 [2022-07-13 01:26:21,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:26:21,177 INFO L225 Difference]: With dead ends: 4633 [2022-07-13 01:26:21,177 INFO L226 Difference]: Without dead ends: 4629 [2022-07-13 01:26:21,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 144 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-13 01:26:21,179 INFO L413 NwaCegarLoop]: 1716 mSDtfsCounter, 50 mSDsluCounter, 10264 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 11980 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-13 01:26:21,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 11980 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-13 01:26:21,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4629 states. [2022-07-13 01:26:21,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4629 to 4621. [2022-07-13 01:26:21,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4621 states, 3940 states have (on average 1.7106598984771573) internal successors, (6740), 4579 states have internal predecessors, (6740), 41 states have call successors, (41), 4 states have call predecessors, (41), 5 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2022-07-13 01:26:21,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4621 states to 4621 states and 6828 transitions. [2022-07-13 01:26:21,244 INFO L78 Accepts]: Start accepts. Automaton has 4621 states and 6828 transitions. Word has length 79 [2022-07-13 01:26:21,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:26:21,244 INFO L495 AbstractCegarLoop]: Abstraction has 4621 states and 6828 transitions. [2022-07-13 01:26:21,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 6.0) internal successors, (84), 14 states have internal predecessors, (84), 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-13 01:26:21,245 INFO L276 IsEmpty]: Start isEmpty. Operand 4621 states and 6828 transitions. [2022-07-13 01:26:21,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-13 01:26:21,245 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:26:21,245 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:26:21,260 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2022-07-13 01:26:21,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:26:21,458 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:26:21,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:26:21,459 INFO L85 PathProgramCache]: Analyzing trace with hash 876217103, now seen corresponding path program 3 times [2022-07-13 01:26:21,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:26:21,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1205961699] [2022-07-13 01:26:21,459 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 01:26:21,459 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:26:21,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:26:21,460 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:26:21,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Waiting until timeout for monitored process [2022-07-13 01:26:22,171 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-13 01:26:22,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:26:22,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 01:26:22,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:26:22,310 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-13 01:26:22,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:26:22,824 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-13 01:26:22,825 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:26:22,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1205961699] [2022-07-13 01:26:22,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1205961699] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:26:22,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:26:22,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-07-13 01:26:22,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583700704] [2022-07-13 01:26:22,825 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:26:22,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-07-13 01:26:22,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:26:22,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-07-13 01:26:22,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2022-07-13 01:26:22,827 INFO L87 Difference]: Start difference. First operand 4621 states and 6828 transitions. Second operand has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 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-13 01:26:25,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:26:25,571 INFO L93 Difference]: Finished difference Result 4663 states and 6965 transitions. [2022-07-13 01:26:25,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-13 01:26:25,576 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 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 85 [2022-07-13 01:26:25,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:26:25,583 INFO L225 Difference]: With dead ends: 4663 [2022-07-13 01:26:25,583 INFO L226 Difference]: Without dead ends: 4657 [2022-07-13 01:26:25,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=793, Invalid=1559, Unknown=0, NotChecked=0, Total=2352 [2022-07-13 01:26:25,584 INFO L413 NwaCegarLoop]: 1720 mSDtfsCounter, 125 mSDsluCounter, 20567 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 22287 SdHoareTripleChecker+Invalid, 1070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-13 01:26:25,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 22287 Invalid, 1070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-13 01:26:25,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4657 states. [2022-07-13 01:26:25,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4657 to 4639. [2022-07-13 01:26:25,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4639 states, 3958 states have (on average 1.7086912582112177) internal successors, (6763), 4597 states have internal predecessors, (6763), 41 states have call successors, (41), 4 states have call predecessors, (41), 5 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2022-07-13 01:26:25,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4639 states to 4639 states and 6851 transitions. [2022-07-13 01:26:25,628 INFO L78 Accepts]: Start accepts. Automaton has 4639 states and 6851 transitions. Word has length 85 [2022-07-13 01:26:25,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:26:25,628 INFO L495 AbstractCegarLoop]: Abstraction has 4639 states and 6851 transitions. [2022-07-13 01:26:25,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6923076923076925) internal successors, (96), 26 states have internal predecessors, (96), 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-13 01:26:25,628 INFO L276 IsEmpty]: Start isEmpty. Operand 4639 states and 6851 transitions. [2022-07-13 01:26:25,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-13 01:26:25,638 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:26:25,638 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:26:25,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (33)] Forceful destruction successful, exit code 0 [2022-07-13 01:26:25,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:26:25,850 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:26:25,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:26:25,850 INFO L85 PathProgramCache]: Analyzing trace with hash -990633905, now seen corresponding path program 4 times [2022-07-13 01:26:25,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:26:25,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1557722836] [2022-07-13 01:26:25,851 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-13 01:26:25,851 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:26:25,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:26:25,852 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:26:25,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2022-07-13 01:26:26,206 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-13 01:26:26,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:26:26,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 584 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-13 01:26:26,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:26:26,504 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-13 01:26:26,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:26:27,812 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-13 01:26:27,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:26:27,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1557722836] [2022-07-13 01:26:27,813 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1557722836] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 01:26:27,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:26:27,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2022-07-13 01:26:27,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677903852] [2022-07-13 01:26:27,813 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:26:27,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-13 01:26:27,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:26:27,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-13 01:26:27,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=1778, Unknown=0, NotChecked=0, Total=2450 [2022-07-13 01:26:27,815 INFO L87 Difference]: Start difference. First operand 4639 states and 6851 transitions. Second operand has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 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-13 01:26:38,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:26:38,256 INFO L93 Difference]: Finished difference Result 4719 states and 7068 transitions. [2022-07-13 01:26:38,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2022-07-13 01:26:38,257 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 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 97 [2022-07-13 01:26:38,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:26:38,268 INFO L225 Difference]: With dead ends: 4719 [2022-07-13 01:26:38,269 INFO L226 Difference]: Without dead ends: 4715 [2022-07-13 01:26:38,271 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1383 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=3791, Invalid=9319, Unknown=0, NotChecked=0, Total=13110 [2022-07-13 01:26:38,271 INFO L413 NwaCegarLoop]: 1733 mSDtfsCounter, 419 mSDsluCounter, 41453 mSDsCounter, 0 mSdLazyCounter, 3046 mSolverCounterSat, 460 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 43186 SdHoareTripleChecker+Invalid, 3506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 460 IncrementalHoareTripleChecker+Valid, 3046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-07-13 01:26:38,272 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 43186 Invalid, 3506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [460 Valid, 3046 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-13 01:26:38,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4715 states. [2022-07-13 01:26:38,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4715 to 4673. [2022-07-13 01:26:38,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4673 states, 3992 states have (on average 1.7056613226452906) internal successors, (6809), 4631 states have internal predecessors, (6809), 41 states have call successors, (41), 4 states have call predecessors, (41), 5 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2022-07-13 01:26:38,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4673 states to 4673 states and 6897 transitions. [2022-07-13 01:26:38,340 INFO L78 Accepts]: Start accepts. Automaton has 4673 states and 6897 transitions. Word has length 97 [2022-07-13 01:26:38,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:26:38,341 INFO L495 AbstractCegarLoop]: Abstraction has 4673 states and 6897 transitions. [2022-07-13 01:26:38,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.4) internal successors, (120), 50 states have internal predecessors, (120), 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-13 01:26:38,344 INFO L276 IsEmpty]: Start isEmpty. Operand 4673 states and 6897 transitions. [2022-07-13 01:26:38,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-13 01:26:38,345 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:26:38,346 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:26:38,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2022-07-13 01:26:38,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:26:38,558 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:26:38,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:26:38,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1014357521, now seen corresponding path program 5 times [2022-07-13 01:26:38,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:26:38,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2105324747] [2022-07-13 01:26:38,560 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 01:26:38,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:26:38,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:26:38,561 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:26:38,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2022-07-13 01:26:39,828 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-13 01:26:39,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:26:39,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-13 01:26:39,879 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:26:39,883 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-13 01:26:39,957 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 01:26:39,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-13 01:26:39,973 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-13 01:26:40,029 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 22 treesize of output 10 [2022-07-13 01:26:41,061 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:26:41,061 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 34 treesize of output 35 [2022-07-13 01:26:41,082 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 31 treesize of output 13 [2022-07-13 01:26:41,101 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-13 01:26:41,101 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:26:41,304 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2712 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_2712) |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-13 01:26:41,305 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:26:41,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2105324747] [2022-07-13 01:26:41,305 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2105324747] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 01:26:41,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1987615929] [2022-07-13 01:26:41,306 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-13 01:26:41,306 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 01:26:41,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 01:26:41,307 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-13 01:26:41,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Waiting until timeout for monitored process [2022-07-13 01:28:05,363 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2022-07-13 01:28:05,363 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 01:28:05,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-13 01:28:05,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:28:05,629 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-13 01:28:05,702 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-13 01:28:05,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-13 01:28:05,712 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-13 01:28:05,750 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 22 treesize of output 10 [2022-07-13 01:28:06,739 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:28:06,739 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 34 treesize of output 35 [2022-07-13 01:28:06,759 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 31 treesize of output 13 [2022-07-13 01:28:06,765 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-13 01:28:06,765 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:28:06,928 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3175 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3175) |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-13 01:28:06,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1987615929] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 01:28:06,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 01:28:06,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2022-07-13 01:28:06,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304721132] [2022-07-13 01:28:06,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 01:28:06,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 01:28:06,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 01:28:06,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 01:28:06,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=78, Unknown=10, NotChecked=38, Total=156 [2022-07-13 01:28:06,931 INFO L87 Difference]: Start difference. First operand 4673 states and 6897 transitions. Second operand has 9 states, 7 states have (on average 10.714285714285714) internal successors, (75), 9 states have internal predecessors, (75), 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-13 01:28:10,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 01:28:10,122 INFO L93 Difference]: Finished difference Result 6840 states and 10243 transitions. [2022-07-13 01:28:10,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 01:28:10,123 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 10.714285714285714) internal successors, (75), 9 states have internal predecessors, (75), 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 119 [2022-07-13 01:28:10,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 01:28:10,133 INFO L225 Difference]: With dead ends: 6840 [2022-07-13 01:28:10,133 INFO L226 Difference]: Without dead ends: 6836 [2022-07-13 01:28:10,133 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 141 SyntacticMatches, 92 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=43, Invalid=109, Unknown=12, NotChecked=46, Total=210 [2022-07-13 01:28:10,134 INFO L413 NwaCegarLoop]: 972 mSDtfsCounter, 1589 mSDsluCounter, 4270 mSDsCounter, 0 mSdLazyCounter, 2601 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1598 SdHoareTripleChecker+Valid, 5242 SdHoareTripleChecker+Invalid, 5916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 2601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3303 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-13 01:28:10,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1598 Valid, 5242 Invalid, 5916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 2601 Invalid, 0 Unknown, 3303 Unchecked, 3.1s Time] [2022-07-13 01:28:10,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6836 states. [2022-07-13 01:28:10,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6836 to 4721. [2022-07-13 01:28:10,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4721 states, 4040 states have (on average 1.6967821782178218) internal successors, (6855), 4678 states have internal predecessors, (6855), 41 states have call successors, (41), 5 states have call predecessors, (41), 6 states have return successors, (47), 38 states have call predecessors, (47), 41 states have call successors, (47) [2022-07-13 01:28:10,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4721 states to 4721 states and 6943 transitions. [2022-07-13 01:28:10,183 INFO L78 Accepts]: Start accepts. Automaton has 4721 states and 6943 transitions. Word has length 119 [2022-07-13 01:28:10,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 01:28:10,184 INFO L495 AbstractCegarLoop]: Abstraction has 4721 states and 6943 transitions. [2022-07-13 01:28:10,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 10.714285714285714) internal successors, (75), 9 states have internal predecessors, (75), 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-13 01:28:10,184 INFO L276 IsEmpty]: Start isEmpty. Operand 4721 states and 6943 transitions. [2022-07-13 01:28:10,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-13 01:28:10,185 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 01:28:10,185 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 01:28:10,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (36)] Forceful destruction successful, exit code 0 [2022-07-13 01:28:10,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2022-07-13 01:28:10,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 01:28:10,604 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 987 more)] === [2022-07-13 01:28:10,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 01:28:10,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1014357520, now seen corresponding path program 1 times [2022-07-13 01:28:10,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 01:28:10,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [556330733] [2022-07-13 01:28:10,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:28:10,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 01:28:10,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 01:28:10,606 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 01:28:10,607 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (37)] Waiting until timeout for monitored process [2022-07-13 01:28:11,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 01:28:11,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 826 conjuncts, 109 conjunts are in the unsatisfiable core [2022-07-13 01:28:11,370 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 01:28:11,372 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-13 01:28:11,437 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-13 01:28:11,438 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-13 01:28:11,442 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-13 01:28:11,454 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-13 01:28:11,459 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-13 01:28:11,520 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 22 treesize of output 10 [2022-07-13 01:28:11,524 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 9 treesize of output 3 [2022-07-13 01:28:11,640 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3560 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3560))) (exists ((v_ArrVal_3559 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3559)))) is different from true [2022-07-13 01:28:11,647 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3561 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3561))) (exists ((v_ArrVal_3562 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3562))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29)))) is different from true [2022-07-13 01:28:11,667 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3564 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3564) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3563 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3563) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 01:28:11,764 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3575 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3575) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3576 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3576)))) is different from true [2022-07-13 01:28:11,806 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3581 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3581))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3582 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3582)))) is different from true [2022-07-13 01:28:11,813 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3583 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3583))) (exists ((v_ArrVal_3584 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3584)))) is different from true [2022-07-13 01:28:11,820 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3585 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3585) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3586 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3586)))) is different from true [2022-07-13 01:28:11,844 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3589 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3589))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3590 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3590)))) is different from true [2022-07-13 01:28:11,886 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3595 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3595))) (exists ((v_ArrVal_3596 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3596) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 01:28:11,916 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3599 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3599))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3600 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3600) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:28:11,942 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3604 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3604) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3603 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3603) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 01:28:11,948 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3605 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3605) |c_#memory_$Pointer$.base|)) (exists ((v_ArrVal_3606 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3606)))) is different from true [2022-07-13 01:28:11,955 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3608 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3608) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3607 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3607) |c_#memory_$Pointer$.base|))) is different from true [2022-07-13 01:28:11,961 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3609 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3609) |c_#memory_$Pointer$.offset|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3610 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3610)))) is different from true [2022-07-13 01:28:11,987 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3614 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3614) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3613 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3613) |c_#memory_$Pointer$.offset|))) is different from true [2022-07-13 01:28:11,994 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3615 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3615) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3616 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3616)))) is different from true [2022-07-13 01:28:12,001 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3617 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3617) |c_#memory_$Pointer$.offset|)) (exists ((v_ArrVal_3618 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3618)))) is different from true [2022-07-13 01:28:12,026 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3621 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3621))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3622 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3622)))) is different from true [2022-07-13 01:28:12,066 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3625 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3625))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3626 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3626)))) is different from true [2022-07-13 01:28:12,073 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3627 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3627))) (exists ((v_ArrVal_3628 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3628)))) is different from true [2022-07-13 01:28:12,118 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3633 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3633))) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3634 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3634)))) is different from true [2022-07-13 01:28:12,125 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_ArrVal_3636 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3636))) (exists ((v_ArrVal_3635 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3635) |c_#memory_$Pointer$.base|)) (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29)))) is different from true [2022-07-13 01:28:12,133 WARN L855 $PredicateComparison]: unable to prove that (and (exists ((v_arrayElimCell_29 (_ BitVec 32))) (= (_ bv44 32) (select |c_#length| v_arrayElimCell_29))) (exists ((v_ArrVal_3637 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3637))) (exists ((v_ArrVal_3638 (Array (_ BitVec 32) (_ BitVec 32)))) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_#Ultimate.C_memset_#ptr.base| v_ArrVal_3638)))) is different from true [2022-07-13 01:28:12,157 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-13 01:28:12,158 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-13 01:28:12,162 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-13 01:28:12,185 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 31 treesize of output 13 [2022-07-13 01:28:12,188 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 19 treesize of output 7 [2022-07-13 01:28:12,206 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 210 trivial. 759 not checked. [2022-07-13 01:28:12,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 01:28:12,801 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_3730 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3730) |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 .cse0 (_ bv20 32))))) (forall ((v_ArrVal_3730 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_3729 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (bvadd (_ bv8 32) |c_ULTIMATE.start_main_~user~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3730) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) (_ bv20 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem39#1.base| v_ArrVal_3729) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) is different from false [2022-07-13 01:28:12,807 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 01:28:12,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [556330733] [2022-07-13 01:28:12,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [556330733] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-13 01:28:12,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [899612473] [2022-07-13 01:28:12,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 01:28:12,807 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-07-13 01:28:12,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-07-13 01:28:12,808 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-07-13 01:28:12,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (38)] Waiting until timeout for monitored process