./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7e1ff0e6 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/heap-manipulation/bubble_sort_linux-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 a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-15 01:22:13,601 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 01:22:13,603 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 01:22:13,638 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 01:22:13,638 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 01:22:13,641 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 01:22:13,642 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 01:22:13,645 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 01:22:13,646 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 01:22:13,650 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 01:22:13,652 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 01:22:13,653 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 01:22:13,654 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 01:22:13,656 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 01:22:13,657 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 01:22:13,658 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 01:22:13,659 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 01:22:13,660 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 01:22:13,661 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 01:22:13,665 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 01:22:13,667 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 01:22:13,667 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 01:22:13,669 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 01:22:13,669 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 01:22:13,676 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 01:22:13,677 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 01:22:13,677 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 01:22:13,678 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 01:22:13,679 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 01:22:13,680 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 01:22:13,681 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 01:22:13,681 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 01:22:13,683 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 01:22:13,683 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 01:22:13,684 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 01:22:13,685 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 01:22:13,685 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 01:22:13,685 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 01:22:13,686 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 01:22:13,687 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 01:22:13,688 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 01:22:13,688 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 01:22:13,715 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 01:22:13,715 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 01:22:13,716 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 01:22:13,716 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 01:22:13,717 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 01:22:13,717 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 01:22:13,718 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 01:22:13,718 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 01:22:13,718 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 01:22:13,718 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 01:22:13,720 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 01:22:13,720 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 01:22:13,720 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 01:22:13,721 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 01:22:13,721 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 01:22:13,721 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 01:22:13,721 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 01:22:13,721 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 01:22:13,721 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 01:22:13,722 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 01:22:13,722 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 01:22:13,722 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 01:22:13,722 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 01:22:13,722 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 01:22:13,722 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 01:22:13,723 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:22:13,723 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 01:22:13,723 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 01:22:13,723 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 01:22:13,724 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 01:22:13,724 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 01:22:13,724 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 01:22:13,724 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 01:22:13,724 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 01:22:13,725 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 [2023-02-15 01:22:13,939 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 01:22:13,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 01:22:13,963 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 01:22:13,964 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 01:22:13,965 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 01:22:13,966 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2023-02-15 01:22:15,058 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 01:22:15,293 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 01:22:15,294 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2023-02-15 01:22:15,312 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e10198627/addcffe7af2245bda852b272f601b103/FLAGf3763b081 [2023-02-15 01:22:15,327 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e10198627/addcffe7af2245bda852b272f601b103 [2023-02-15 01:22:15,329 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 01:22:15,330 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 01:22:15,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 01:22:15,333 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 01:22:15,335 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 01:22:15,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:22:15" (1/1) ... [2023-02-15 01:22:15,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64ab8d1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:22:15, skipping insertion in model container [2023-02-15 01:22:15,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:22:15" (1/1) ... [2023-02-15 01:22:15,342 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 01:22:15,383 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 01:22:15,651 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2023-02-15 01:22:15,670 WARN L569 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2023-02-15 01:22:15,671 WARN L569 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2023-02-15 01:22:15,672 WARN L569 CHandler]: More than one settings change for restart is not yet implemented; using only the first one to be reported [2023-02-15 01:22:15,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:22:15,713 ERROR L326 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-02-15 01:22:15,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2ceab6c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:22:15, skipping insertion in model container [2023-02-15 01:22:15,714 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 01:22:15,714 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-15 01:22:15,716 INFO L158 Benchmark]: Toolchain (without parser) took 385.12ms. Allocated memory is still 130.0MB. Free memory was 90.0MB in the beginning and 75.3MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-15 01:22:15,716 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 130.0MB. Free memory is still 69.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 01:22:15,716 INFO L158 Benchmark]: CACSL2BoogieTranslator took 381.88ms. Allocated memory is still 130.0MB. Free memory was 90.0MB in the beginning and 75.3MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-02-15 01:22:15,718 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 130.0MB. Free memory is still 69.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 381.88ms. Allocated memory is still 130.0MB. Free memory was 90.0MB in the beginning and 75.3MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 860]: 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/heap-manipulation/bubble_sort_linux-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 a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-15 01:22:17,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 01:22:17,450 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 01:22:17,475 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 01:22:17,476 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 01:22:17,477 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 01:22:17,478 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 01:22:17,479 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 01:22:17,483 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 01:22:17,487 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 01:22:17,488 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 01:22:17,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 01:22:17,492 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 01:22:17,493 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 01:22:17,496 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 01:22:17,497 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 01:22:17,498 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 01:22:17,499 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 01:22:17,500 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 01:22:17,503 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 01:22:17,505 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 01:22:17,505 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 01:22:17,506 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 01:22:17,507 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 01:22:17,512 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 01:22:17,512 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 01:22:17,512 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 01:22:17,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 01:22:17,514 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 01:22:17,515 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 01:22:17,518 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 01:22:17,519 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 01:22:17,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 01:22:17,520 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 01:22:17,521 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 01:22:17,522 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 01:22:17,522 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 01:22:17,523 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 01:22:17,523 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 01:22:17,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 01:22:17,524 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 01:22:17,524 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-15 01:22:17,547 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 01:22:17,547 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 01:22:17,547 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 01:22:17,547 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 01:22:17,548 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 01:22:17,548 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 01:22:17,549 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 01:22:17,549 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 01:22:17,549 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 01:22:17,549 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 01:22:17,549 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 01:22:17,549 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 01:22:17,549 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 01:22:17,550 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 01:22:17,550 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 01:22:17,550 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 01:22:17,550 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 01:22:17,550 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 01:22:17,550 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 01:22:17,550 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 01:22:17,551 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 01:22:17,551 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 01:22:17,551 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 01:22:17,551 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 01:22:17,551 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 01:22:17,552 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 01:22:17,552 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 01:22:17,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:22:17,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 01:22:17,553 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 01:22:17,553 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 01:22:17,553 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 01:22:17,553 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 01:22:17,553 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 01:22:17,553 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 01:22:17,554 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 01:22:17,554 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 01:22:17,554 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a38de44f112a10364737c35b840e673503a211a020b9f494a50e4a32c8fe31c0 [2023-02-15 01:22:17,834 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 01:22:17,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 01:22:17,855 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 01:22:17,856 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 01:22:17,857 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 01:22:17,858 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2023-02-15 01:22:18,928 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 01:22:19,154 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 01:22:19,155 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i [2023-02-15 01:22:19,173 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef477cca4/5e899869ffd7492686301b66745fd976/FLAGb10f7de86 [2023-02-15 01:22:19,183 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ef477cca4/5e899869ffd7492686301b66745fd976 [2023-02-15 01:22:19,185 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 01:22:19,187 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 01:22:19,188 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 01:22:19,189 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 01:22:19,194 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 01:22:19,195 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:22:19" (1/1) ... [2023-02-15 01:22:19,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b66e420 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:22:19, skipping insertion in model container [2023-02-15 01:22:19,198 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:22:19" (1/1) ... [2023-02-15 01:22:19,203 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 01:22:19,256 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 01:22:19,598 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2023-02-15 01:22:19,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:22:19,654 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-15 01:22:19,657 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 01:22:19,672 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2023-02-15 01:22:19,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:22:19,695 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 01:22:19,731 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/bubble_sort_linux-1.i[33822,33835] [2023-02-15 01:22:19,744 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:22:19,792 INFO L208 MainTranslator]: Completed translation [2023-02-15 01:22:19,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:22:19 WrapperNode [2023-02-15 01:22:19,792 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 01:22:19,793 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 01:22:19,793 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 01:22:19,794 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 01:22:19,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:22:19" (1/1) ... [2023-02-15 01:22:19,826 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:22:19" (1/1) ... [2023-02-15 01:22:19,848 INFO L138 Inliner]: procedures = 235, calls = 75, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 116 [2023-02-15 01:22:19,851 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 01:22:19,852 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 01:22:19,852 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 01:22:19,852 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 01:22:19,858 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:22:19" (1/1) ... [2023-02-15 01:22:19,859 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:22:19" (1/1) ... [2023-02-15 01:22:19,863 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:22:19" (1/1) ... [2023-02-15 01:22:19,868 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:22:19" (1/1) ... [2023-02-15 01:22:19,879 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:22:19" (1/1) ... [2023-02-15 01:22:19,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:22:19" (1/1) ... [2023-02-15 01:22:19,911 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:22:19" (1/1) ... [2023-02-15 01:22:19,917 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:22:19" (1/1) ... [2023-02-15 01:22:19,923 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 01:22:19,926 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 01:22:19,926 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 01:22:19,926 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 01:22:19,927 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:22:19" (1/1) ... [2023-02-15 01:22:19,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:22:19,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:22:19,955 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 01:22:19,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 01:22:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-15 01:22:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 01:22:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure inspect [2023-02-15 01:22:19,988 INFO L138 BoogieDeclarations]: Found implementation of procedure inspect [2023-02-15 01:22:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 01:22:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-15 01:22:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 01:22:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 01:22:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure val_from_node [2023-02-15 01:22:19,988 INFO L138 BoogieDeclarations]: Found implementation of procedure val_from_node [2023-02-15 01:22:19,988 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2023-02-15 01:22:19,989 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2023-02-15 01:22:19,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 01:22:19,989 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 01:22:19,989 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 01:22:19,989 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2023-02-15 01:22:19,989 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2023-02-15 01:22:19,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 01:22:19,990 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 01:22:20,143 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 01:22:20,158 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 01:22:20,879 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 01:22:20,887 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 01:22:20,888 INFO L300 CfgBuilder]: Removed 41 assume(true) statements. [2023-02-15 01:22:20,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:22:20 BoogieIcfgContainer [2023-02-15 01:22:20,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 01:22:20,892 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 01:22:20,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 01:22:20,895 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 01:22:20,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:22:19" (1/3) ... [2023-02-15 01:22:20,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77cf64af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:22:20, skipping insertion in model container [2023-02-15 01:22:20,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:22:19" (2/3) ... [2023-02-15 01:22:20,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77cf64af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:22:20, skipping insertion in model container [2023-02-15 01:22:20,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:22:20" (3/3) ... [2023-02-15 01:22:20,898 INFO L112 eAbstractionObserver]: Analyzing ICFG bubble_sort_linux-1.i [2023-02-15 01:22:20,910 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 01:22:20,911 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 71 error locations. [2023-02-15 01:22:20,955 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 01:22:20,960 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@350ec357, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 01:22:20,961 INFO L358 AbstractCegarLoop]: Starting to check reachability of 71 error locations. [2023-02-15 01:22:20,965 INFO L276 IsEmpty]: Start isEmpty. Operand has 216 states, 117 states have (on average 2.1623931623931623) internal successors, (253), 206 states have internal predecessors, (253), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2023-02-15 01:22:20,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-15 01:22:20,971 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:20,972 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 01:22:20,972 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:22:20,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:20,978 INFO L85 PathProgramCache]: Analyzing trace with hash 378924727, now seen corresponding path program 1 times [2023-02-15 01:22:20,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:22:20,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989592327] [2023-02-15 01:22:20,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:20,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:22:20,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:22:20,992 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:22:20,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-15 01:22:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:21,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-15 01:22:21,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:22:21,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:22:21,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:22:21,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:22:21,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989592327] [2023-02-15 01:22:21,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989592327] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:22:21,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:22:21,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:22:21,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141317958] [2023-02-15 01:22:21,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:22:21,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 01:22:21,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:22:21,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 01:22:21,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 01:22:21,130 INFO L87 Difference]: Start difference. First operand has 216 states, 117 states have (on average 2.1623931623931623) internal successors, (253), 206 states have internal predecessors, (253), 23 states have call successors, (23), 4 states have call predecessors, (23), 4 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:22:21,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:21,159 INFO L93 Difference]: Finished difference Result 212 states and 234 transitions. [2023-02-15 01:22:21,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 01:22:21,161 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-15 01:22:21,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:21,167 INFO L225 Difference]: With dead ends: 212 [2023-02-15 01:22:21,167 INFO L226 Difference]: Without dead ends: 210 [2023-02-15 01:22:21,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 01:22:21,171 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:21,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 234 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:22:21,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-02-15 01:22:21,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2023-02-15 01:22:21,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 115 states have (on average 1.7826086956521738) internal successors, (205), 199 states have internal predecessors, (205), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:22:21,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 232 transitions. [2023-02-15 01:22:21,216 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 232 transitions. Word has length 5 [2023-02-15 01:22:21,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:21,217 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 232 transitions. [2023-02-15 01:22:21,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:22:21,217 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 232 transitions. [2023-02-15 01:22:21,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-15 01:22:21,217 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:21,218 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 01:22:21,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-15 01:22:21,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:22:21,423 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:22:21,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:21,424 INFO L85 PathProgramCache]: Analyzing trace with hash 378924789, now seen corresponding path program 1 times [2023-02-15 01:22:21,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:22:21,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [376903224] [2023-02-15 01:22:21,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:21,424 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:22:21,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:22:21,426 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:22:21,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-15 01:22:21,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:21,474 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 01:22:21,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:22:21,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 01:22:21,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:22:21,538 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:22:21,538 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:22:21,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [376903224] [2023-02-15 01:22:21,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [376903224] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:22:21,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:22:21,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:22:21,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497964824] [2023-02-15 01:22:21,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:22:21,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:22:21,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:22:21,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:22:21,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:22:21,551 INFO L87 Difference]: Start difference. First operand 210 states and 232 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:22:21,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:21,758 INFO L93 Difference]: Finished difference Result 229 states and 251 transitions. [2023-02-15 01:22:21,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:22:21,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-15 01:22:21,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:21,760 INFO L225 Difference]: With dead ends: 229 [2023-02-15 01:22:21,760 INFO L226 Difference]: Without dead ends: 229 [2023-02-15 01:22:21,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:22:21,761 INFO L413 NwaCegarLoop]: 201 mSDtfsCounter, 69 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:21,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 314 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:22:21,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-02-15 01:22:21,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 207. [2023-02-15 01:22:21,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 115 states have (on average 1.7565217391304349) internal successors, (202), 196 states have internal predecessors, (202), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:22:21,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 229 transitions. [2023-02-15 01:22:21,770 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 229 transitions. Word has length 5 [2023-02-15 01:22:21,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:21,770 INFO L495 AbstractCegarLoop]: Abstraction has 207 states and 229 transitions. [2023-02-15 01:22:21,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:22:21,770 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 229 transitions. [2023-02-15 01:22:21,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-15 01:22:21,770 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:21,770 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 01:22:21,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-02-15 01:22:21,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:22:21,975 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:22:21,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:21,975 INFO L85 PathProgramCache]: Analyzing trace with hash 378924790, now seen corresponding path program 1 times [2023-02-15 01:22:21,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:22:21,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1147485852] [2023-02-15 01:22:21,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:21,976 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:22:21,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:22:21,978 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:22:21,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-15 01:22:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:22,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 01:22:22,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:22:22,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:22:22,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:22:22,106 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:22:22,107 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:22:22,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1147485852] [2023-02-15 01:22:22,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1147485852] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:22:22,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:22:22,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:22:22,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194863168] [2023-02-15 01:22:22,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:22:22,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:22:22,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:22:22,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:22:22,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:22:22,111 INFO L87 Difference]: Start difference. First operand 207 states and 229 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:22:22,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:22,348 INFO L93 Difference]: Finished difference Result 205 states and 227 transitions. [2023-02-15 01:22:22,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:22:22,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-02-15 01:22:22,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:22,350 INFO L225 Difference]: With dead ends: 205 [2023-02-15 01:22:22,350 INFO L226 Difference]: Without dead ends: 205 [2023-02-15 01:22:22,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:22:22,351 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 67 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:22,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 306 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:22:22,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2023-02-15 01:22:22,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 204. [2023-02-15 01:22:22,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 115 states have (on average 1.7304347826086957) internal successors, (199), 193 states have internal predecessors, (199), 21 states have call successors, (21), 4 states have call predecessors, (21), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:22:22,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 226 transitions. [2023-02-15 01:22:22,367 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 226 transitions. Word has length 5 [2023-02-15 01:22:22,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:22,367 INFO L495 AbstractCegarLoop]: Abstraction has 204 states and 226 transitions. [2023-02-15 01:22:22,367 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:22:22,368 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 226 transitions. [2023-02-15 01:22:22,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 01:22:22,368 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:22,368 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:22:22,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-15 01:22:22,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:22:22,579 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting list_addErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:22:22,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:22,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1374843154, now seen corresponding path program 1 times [2023-02-15 01:22:22,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:22:22,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1461985142] [2023-02-15 01:22:22,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:22,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:22:22,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:22:22,582 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:22:22,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-15 01:22:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:22,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 01:22:22,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:22:22,691 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 01:22:22,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 01:22:22,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:22:22,747 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:22:22,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:22:22,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1461985142] [2023-02-15 01:22:22,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1461985142] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:22:22,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:22:22,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:22:22,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803875979] [2023-02-15 01:22:22,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:22:22,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:22:22,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:22:22,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:22:22,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:22:22,750 INFO L87 Difference]: Start difference. First operand 204 states and 226 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:22:23,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:23,123 INFO L93 Difference]: Finished difference Result 241 states and 262 transitions. [2023-02-15 01:22:23,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:22:23,124 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-15 01:22:23,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:23,125 INFO L225 Difference]: With dead ends: 241 [2023-02-15 01:22:23,125 INFO L226 Difference]: Without dead ends: 241 [2023-02-15 01:22:23,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:22:23,126 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 269 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:23,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 399 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 01:22:23,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-02-15 01:22:23,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 218. [2023-02-15 01:22:23,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 129 states have (on average 1.751937984496124) internal successors, (226), 206 states have internal predecessors, (226), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:22:23,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 253 transitions. [2023-02-15 01:22:23,137 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 253 transitions. Word has length 8 [2023-02-15 01:22:23,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:23,137 INFO L495 AbstractCegarLoop]: Abstraction has 218 states and 253 transitions. [2023-02-15 01:22:23,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:22:23,137 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 253 transitions. [2023-02-15 01:22:23,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-02-15 01:22:23,138 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:23,138 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:22:23,148 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-15 01:22:23,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:22:23,351 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting list_addErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:22:23,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:23,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1374843155, now seen corresponding path program 1 times [2023-02-15 01:22:23,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:22:23,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [467217390] [2023-02-15 01:22:23,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:23,352 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:22:23,352 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:22:23,353 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:22:23,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-15 01:22:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:23,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 01:22:23,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:22:23,471 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:22:23,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:22:23,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:22:23,533 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:22:23,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:22:23,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [467217390] [2023-02-15 01:22:23,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [467217390] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:22:23,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:22:23,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:22:23,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237357560] [2023-02-15 01:22:23,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:22:23,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 01:22:23,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:22:23,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 01:22:23,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:22:23,535 INFO L87 Difference]: Start difference. First operand 218 states and 253 transitions. Second operand has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:22:24,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:24,004 INFO L93 Difference]: Finished difference Result 222 states and 246 transitions. [2023-02-15 01:22:24,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:22:24,005 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-02-15 01:22:24,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:24,006 INFO L225 Difference]: With dead ends: 222 [2023-02-15 01:22:24,006 INFO L226 Difference]: Without dead ends: 222 [2023-02-15 01:22:24,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:22:24,007 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 267 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:24,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 310 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 01:22:24,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-02-15 01:22:24,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 210. [2023-02-15 01:22:24,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 125 states have (on average 1.696) internal successors, (212), 198 states have internal predecessors, (212), 21 states have call successors, (21), 5 states have call predecessors, (21), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:22:24,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 239 transitions. [2023-02-15 01:22:24,012 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 239 transitions. Word has length 8 [2023-02-15 01:22:24,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:24,021 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 239 transitions. [2023-02-15 01:22:24,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:22:24,021 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 239 transitions. [2023-02-15 01:22:24,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 01:22:24,021 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:24,021 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:22:24,031 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-15 01:22:24,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:22:24,222 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:22:24,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:24,222 INFO L85 PathProgramCache]: Analyzing trace with hash -1625645901, now seen corresponding path program 1 times [2023-02-15 01:22:24,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:22:24,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686662567] [2023-02-15 01:22:24,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:24,223 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:22:24,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:22:24,224 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:22:24,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-15 01:22:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:24,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 01:22:24,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:22:24,346 INFO L321 Elim1Store]: treesize reduction 17, result has 19.0 percent of original size [2023-02-15 01:22:24,347 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 16 [2023-02-15 01:22:24,378 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:22:24,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:22:24,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:22:24,456 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:22:24,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:22:24,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686662567] [2023-02-15 01:22:24,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [686662567] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:22:24,457 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:22:24,457 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 01:22:24,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683921702] [2023-02-15 01:22:24,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:22:24,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 01:22:24,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:22:24,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 01:22:24,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-15 01:22:24,458 INFO L87 Difference]: Start difference. First operand 210 states and 239 transitions. Second operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:22:24,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:24,934 INFO L93 Difference]: Finished difference Result 231 states and 260 transitions. [2023-02-15 01:22:24,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 01:22:24,935 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-15 01:22:24,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:24,937 INFO L225 Difference]: With dead ends: 231 [2023-02-15 01:22:24,937 INFO L226 Difference]: Without dead ends: 231 [2023-02-15 01:22:24,937 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2023-02-15 01:22:24,943 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 41 mSDsluCounter, 833 mSDsCounter, 0 mSdLazyCounter, 298 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:24,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1039 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 298 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 01:22:24,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2023-02-15 01:22:24,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 224. [2023-02-15 01:22:24,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 137 states have (on average 1.686131386861314) internal successors, (231), 211 states have internal predecessors, (231), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 01:22:24,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 260 transitions. [2023-02-15 01:22:24,958 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 260 transitions. Word has length 10 [2023-02-15 01:22:24,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:24,958 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 260 transitions. [2023-02-15 01:22:24,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:22:24,959 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 260 transitions. [2023-02-15 01:22:24,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 01:22:24,959 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:24,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:22:24,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-15 01:22:25,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:22:25,168 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting list_addErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:22:25,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:25,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1625645900, now seen corresponding path program 1 times [2023-02-15 01:22:25,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:22:25,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902348387] [2023-02-15 01:22:25,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:25,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:22:25,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:22:25,171 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:22:25,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-15 01:22:25,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:25,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 25 conjunts are in the unsatisfiable core [2023-02-15 01:22:25,260 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:22:25,327 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:22:25,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-02-15 01:22:25,344 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:22:25,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 01:22:25,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:22:25,424 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:22:25,499 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:22:25,504 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:22:25,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:22:25,549 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:22:25,550 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:22:25,550 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902348387] [2023-02-15 01:22:25,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902348387] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:22:25,550 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:22:25,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 01:22:25,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882947074] [2023-02-15 01:22:25,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:22:25,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-02-15 01:22:25,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:22:25,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-02-15 01:22:25,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-02-15 01:22:25,551 INFO L87 Difference]: Start difference. First operand 224 states and 260 transitions. Second operand has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:22:26,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:26,279 INFO L93 Difference]: Finished difference Result 230 states and 259 transitions. [2023-02-15 01:22:26,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 01:22:26,279 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-15 01:22:26,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:26,280 INFO L225 Difference]: With dead ends: 230 [2023-02-15 01:22:26,280 INFO L226 Difference]: Without dead ends: 230 [2023-02-15 01:22:26,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2023-02-15 01:22:26,281 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 51 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 971 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:26,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 971 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 01:22:26,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2023-02-15 01:22:26,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 224. [2023-02-15 01:22:26,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 137 states have (on average 1.6788321167883211) internal successors, (230), 211 states have internal predecessors, (230), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 01:22:26,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 259 transitions. [2023-02-15 01:22:26,286 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 259 transitions. Word has length 10 [2023-02-15 01:22:26,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:26,286 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 259 transitions. [2023-02-15 01:22:26,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 7 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:22:26,286 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 259 transitions. [2023-02-15 01:22:26,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 01:22:26,286 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:26,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:22:26,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-15 01:22:26,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:22:26,497 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting list_addErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:22:26,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:26,497 INFO L85 PathProgramCache]: Analyzing trace with hash 1144584946, now seen corresponding path program 1 times [2023-02-15 01:22:26,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:22:26,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1195599071] [2023-02-15 01:22:26,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:26,498 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:22:26,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:22:26,499 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:22:26,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-02-15 01:22:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:26,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 01:22:26,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:22:26,572 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 01:22:26,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:22:26,604 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:22:26,604 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:22:26,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1195599071] [2023-02-15 01:22:26,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1195599071] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:22:26,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:22:26,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 01:22:26,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413853697] [2023-02-15 01:22:26,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:22:26,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 01:22:26,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:22:26,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 01:22:26,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:22:26,606 INFO L87 Difference]: Start difference. First operand 224 states and 259 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:22:26,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:26,945 INFO L93 Difference]: Finished difference Result 245 states and 270 transitions. [2023-02-15 01:22:26,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:22:26,946 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-15 01:22:26,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:26,947 INFO L225 Difference]: With dead ends: 245 [2023-02-15 01:22:26,947 INFO L226 Difference]: Without dead ends: 245 [2023-02-15 01:22:26,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:22:26,947 INFO L413 NwaCegarLoop]: 185 mSDtfsCounter, 105 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:26,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 703 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 01:22:26,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2023-02-15 01:22:26,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 223. [2023-02-15 01:22:26,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 137 states have (on average 1.6423357664233578) internal successors, (225), 210 states have internal predecessors, (225), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 01:22:26,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 254 transitions. [2023-02-15 01:22:26,952 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 254 transitions. Word has length 11 [2023-02-15 01:22:26,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:26,953 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 254 transitions. [2023-02-15 01:22:26,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:22:26,953 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 254 transitions. [2023-02-15 01:22:26,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 01:22:26,953 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:26,954 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:22:26,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-15 01:22:27,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:22:27,162 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting list_addErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:22:27,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:27,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1144584947, now seen corresponding path program 1 times [2023-02-15 01:22:27,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:22:27,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [109098460] [2023-02-15 01:22:27,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:27,163 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:22:27,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:22:27,164 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:22:27,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-15 01:22:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:27,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 01:22:27,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:22:27,247 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:22:27,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:22:27,300 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:22:27,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:22:27,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [109098460] [2023-02-15 01:22:27,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [109098460] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:22:27,301 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:22:27,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 01:22:27,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399414458] [2023-02-15 01:22:27,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:22:27,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 01:22:27,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:22:27,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 01:22:27,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:22:27,302 INFO L87 Difference]: Start difference. First operand 223 states and 254 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:22:27,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:27,760 INFO L93 Difference]: Finished difference Result 227 states and 250 transitions. [2023-02-15 01:22:27,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:22:27,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-02-15 01:22:27,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:27,762 INFO L225 Difference]: With dead ends: 227 [2023-02-15 01:22:27,762 INFO L226 Difference]: Without dead ends: 227 [2023-02-15 01:22:27,763 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:22:27,763 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 94 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 315 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:27,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 719 Invalid, 315 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 01:22:27,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-15 01:22:27,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 223. [2023-02-15 01:22:27,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 137 states have (on average 1.6131386861313868) internal successors, (221), 210 states have internal predecessors, (221), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 01:22:27,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 250 transitions. [2023-02-15 01:22:27,768 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 250 transitions. Word has length 11 [2023-02-15 01:22:27,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:27,768 INFO L495 AbstractCegarLoop]: Abstraction has 223 states and 250 transitions. [2023-02-15 01:22:27,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:22:27,769 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 250 transitions. [2023-02-15 01:22:27,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 01:22:27,769 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:27,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:22:27,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-02-15 01:22:27,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:22:27,979 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting list_addErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:22:27,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:27,979 INFO L85 PathProgramCache]: Analyzing trace with hash 434515829, now seen corresponding path program 1 times [2023-02-15 01:22:27,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:22:27,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1897782192] [2023-02-15 01:22:27,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:27,980 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:22:27,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:22:27,981 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:22:27,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-02-15 01:22:28,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:28,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 01:22:28,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:22:28,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:22:28,066 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:22:28,066 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:22:28,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1897782192] [2023-02-15 01:22:28,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1897782192] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:22:28,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:22:28,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:22:28,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874236043] [2023-02-15 01:22:28,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:22:28,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:22:28,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:22:28,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:22:28,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:22:28,068 INFO L87 Difference]: Start difference. First operand 223 states and 250 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:22:28,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:28,238 INFO L93 Difference]: Finished difference Result 222 states and 247 transitions. [2023-02-15 01:22:28,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:22:28,239 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-15 01:22:28,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:28,240 INFO L225 Difference]: With dead ends: 222 [2023-02-15 01:22:28,240 INFO L226 Difference]: Without dead ends: 222 [2023-02-15 01:22:28,240 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 [2023-02-15 01:22:28,240 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 22 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 499 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:28,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 499 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:22:28,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-02-15 01:22:28,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2023-02-15 01:22:28,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 137 states have (on average 1.5912408759124088) internal successors, (218), 209 states have internal predecessors, (218), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 01:22:28,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 247 transitions. [2023-02-15 01:22:28,245 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 247 transitions. Word has length 13 [2023-02-15 01:22:28,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:28,245 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 247 transitions. [2023-02-15 01:22:28,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:22:28,245 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 247 transitions. [2023-02-15 01:22:28,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 01:22:28,246 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:28,246 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:22:28,259 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-15 01:22:28,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:22:28,454 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting list_addErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:22:28,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:28,454 INFO L85 PathProgramCache]: Analyzing trace with hash 434515830, now seen corresponding path program 1 times [2023-02-15 01:22:28,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:22:28,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1941539162] [2023-02-15 01:22:28,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:28,455 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:22:28,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:22:28,457 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:22:28,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-15 01:22:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:28,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 01:22:28,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:22:28,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:22:28,583 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:22:28,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:22:28,583 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1941539162] [2023-02-15 01:22:28,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1941539162] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:22:28,583 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:22:28,583 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 01:22:28,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861527469] [2023-02-15 01:22:28,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:22:28,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:22:28,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:22:28,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:22:28,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:22:28,584 INFO L87 Difference]: Start difference. First operand 222 states and 247 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:22:28,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:28,961 INFO L93 Difference]: Finished difference Result 224 states and 245 transitions. [2023-02-15 01:22:28,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:22:28,961 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-02-15 01:22:28,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:28,962 INFO L225 Difference]: With dead ends: 224 [2023-02-15 01:22:28,962 INFO L226 Difference]: Without dead ends: 224 [2023-02-15 01:22:28,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-02-15 01:22:28,963 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 249 mSDsluCounter, 714 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:28,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 917 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 01:22:28,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-02-15 01:22:28,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2023-02-15 01:22:28,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 137 states have (on average 1.5766423357664234) internal successors, (216), 209 states have internal predecessors, (216), 22 states have call successors, (22), 6 states have call predecessors, (22), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 01:22:28,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 245 transitions. [2023-02-15 01:22:28,968 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 245 transitions. Word has length 13 [2023-02-15 01:22:28,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:28,968 INFO L495 AbstractCegarLoop]: Abstraction has 222 states and 245 transitions. [2023-02-15 01:22:28,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:22:28,969 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 245 transitions. [2023-02-15 01:22:28,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 01:22:28,969 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:28,969 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] [2023-02-15 01:22:28,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-02-15 01:22:29,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:22:29,177 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:22:29,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:29,177 INFO L85 PathProgramCache]: Analyzing trace with hash 853908818, now seen corresponding path program 1 times [2023-02-15 01:22:29,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:22:29,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880103576] [2023-02-15 01:22:29,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:29,178 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:22:29,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:22:29,179 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:22:29,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-15 01:22:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:29,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 01:22:29,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:22:29,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:22:29,307 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:22:29,307 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:22:29,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880103576] [2023-02-15 01:22:29,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1880103576] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:22:29,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:22:29,308 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:22:29,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248032101] [2023-02-15 01:22:29,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:22:29,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:22:29,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:22:29,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:22:29,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:22:29,309 INFO L87 Difference]: Start difference. First operand 222 states and 245 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:22:29,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:29,420 INFO L93 Difference]: Finished difference Result 221 states and 243 transitions. [2023-02-15 01:22:29,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:22:29,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2023-02-15 01:22:29,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:29,421 INFO L225 Difference]: With dead ends: 221 [2023-02-15 01:22:29,421 INFO L226 Difference]: Without dead ends: 221 [2023-02-15 01:22:29,421 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:22:29,422 INFO L413 NwaCegarLoop]: 192 mSDtfsCounter, 297 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 453 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:29,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 453 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:22:29,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2023-02-15 01:22:29,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2023-02-15 01:22:29,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 137 states have (on average 1.5693430656934306) internal successors, (215), 208 states have internal predecessors, (215), 21 states have call successors, (21), 6 states have call predecessors, (21), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 01:22:29,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 243 transitions. [2023-02-15 01:22:29,427 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 243 transitions. Word has length 27 [2023-02-15 01:22:29,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:29,427 INFO L495 AbstractCegarLoop]: Abstraction has 221 states and 243 transitions. [2023-02-15 01:22:29,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:22:29,427 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 243 transitions. [2023-02-15 01:22:29,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 01:22:29,428 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:29,428 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] [2023-02-15 01:22:29,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-15 01:22:29,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:22:29,636 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting inspectErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:22:29,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:29,636 INFO L85 PathProgramCache]: Analyzing trace with hash 853896473, now seen corresponding path program 1 times [2023-02-15 01:22:29,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:22:29,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1720837751] [2023-02-15 01:22:29,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:29,637 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:22:29,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:22:29,638 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:22:29,640 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-15 01:22:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:29,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 01:22:29,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:22:29,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:22:29,789 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:22:29,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:22:29,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1720837751] [2023-02-15 01:22:29,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1720837751] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:22:29,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:22:29,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 01:22:29,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934091434] [2023-02-15 01:22:29,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:22:29,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 01:22:29,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:22:29,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 01:22:29,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 01:22:29,792 INFO L87 Difference]: Start difference. First operand 221 states and 243 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:22:30,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:30,254 INFO L93 Difference]: Finished difference Result 216 states and 238 transitions. [2023-02-15 01:22:30,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 01:22:30,255 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2023-02-15 01:22:30,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:30,255 INFO L225 Difference]: With dead ends: 216 [2023-02-15 01:22:30,255 INFO L226 Difference]: Without dead ends: 216 [2023-02-15 01:22:30,256 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2023-02-15 01:22:30,256 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 381 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:30,256 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 424 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 01:22:30,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2023-02-15 01:22:30,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2023-02-15 01:22:30,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 137 states have (on average 1.532846715328467) internal successors, (210), 203 states have internal predecessors, (210), 21 states have call successors, (21), 6 states have call predecessors, (21), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 01:22:30,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 238 transitions. [2023-02-15 01:22:30,260 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 238 transitions. Word has length 27 [2023-02-15 01:22:30,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:30,260 INFO L495 AbstractCegarLoop]: Abstraction has 216 states and 238 transitions. [2023-02-15 01:22:30,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:22:30,260 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 238 transitions. [2023-02-15 01:22:30,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 01:22:30,261 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:30,261 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] [2023-02-15 01:22:30,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-15 01:22:30,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:22:30,461 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting inspectErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:22:30,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:30,462 INFO L85 PathProgramCache]: Analyzing trace with hash 853896474, now seen corresponding path program 1 times [2023-02-15 01:22:30,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:22:30,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1669564860] [2023-02-15 01:22:30,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:30,462 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:22:30,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:22:30,463 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:22:30,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-15 01:22:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:30,567 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 01:22:30,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:22:30,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:22:30,721 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:22:30,722 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:22:30,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1669564860] [2023-02-15 01:22:30,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1669564860] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:22:30,722 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:22:30,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 01:22:30,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856224389] [2023-02-15 01:22:30,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:22:30,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 01:22:30,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:22:30,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 01:22:30,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:22:30,723 INFO L87 Difference]: Start difference. First operand 216 states and 238 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:22:31,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:31,478 INFO L93 Difference]: Finished difference Result 215 states and 237 transitions. [2023-02-15 01:22:31,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 01:22:31,479 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2023-02-15 01:22:31,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:31,480 INFO L225 Difference]: With dead ends: 215 [2023-02-15 01:22:31,480 INFO L226 Difference]: Without dead ends: 215 [2023-02-15 01:22:31,480 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-02-15 01:22:31,481 INFO L413 NwaCegarLoop]: 133 mSDtfsCounter, 476 mSDsluCounter, 347 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 479 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:31,481 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [479 Valid, 480 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-02-15 01:22:31,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2023-02-15 01:22:31,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2023-02-15 01:22:31,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 137 states have (on average 1.5255474452554745) internal successors, (209), 202 states have internal predecessors, (209), 21 states have call successors, (21), 6 states have call predecessors, (21), 5 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 01:22:31,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 237 transitions. [2023-02-15 01:22:31,485 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 237 transitions. Word has length 27 [2023-02-15 01:22:31,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:31,485 INFO L495 AbstractCegarLoop]: Abstraction has 215 states and 237 transitions. [2023-02-15 01:22:31,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:22:31,485 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 237 transitions. [2023-02-15 01:22:31,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 01:22:31,486 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:31,486 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] [2023-02-15 01:22:31,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-15 01:22:31,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:22:31,686 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:22:31,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:31,687 INFO L85 PathProgramCache]: Analyzing trace with hash -661448180, now seen corresponding path program 1 times [2023-02-15 01:22:31,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:22:31,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299654980] [2023-02-15 01:22:31,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:31,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:22:31,687 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:22:31,688 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:22:31,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-15 01:22:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:31,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 01:22:31,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:22:31,859 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:22:31,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 01:22:31,944 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:22:31,999 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:22:32,026 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:22:32,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-02-15 01:22:32,094 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:22:32,094 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 11 [2023-02-15 01:22:32,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:22:32,110 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:22:32,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:22:32,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299654980] [2023-02-15 01:22:32,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299654980] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:22:32,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:22:32,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-02-15 01:22:32,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575328306] [2023-02-15 01:22:32,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:22:32,110 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-02-15 01:22:32,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:22:32,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-02-15 01:22:32,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2023-02-15 01:22:32,111 INFO L87 Difference]: Start difference. First operand 215 states and 237 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 10 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:22:33,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:33,382 INFO L93 Difference]: Finished difference Result 360 states and 397 transitions. [2023-02-15 01:22:33,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-02-15 01:22:33,382 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 10 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2023-02-15 01:22:33,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:33,389 INFO L225 Difference]: With dead ends: 360 [2023-02-15 01:22:33,389 INFO L226 Difference]: Without dead ends: 360 [2023-02-15 01:22:33,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=473, Unknown=0, NotChecked=0, Total=600 [2023-02-15 01:22:33,391 INFO L413 NwaCegarLoop]: 135 mSDtfsCounter, 991 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 991 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 1134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:33,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [991 Valid, 991 Invalid, 1134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-15 01:22:33,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2023-02-15 01:22:33,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 294. [2023-02-15 01:22:33,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 211 states have (on average 1.5545023696682465) internal successors, (328), 277 states have internal predecessors, (328), 24 states have call successors, (24), 8 states have call predecessors, (24), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-15 01:22:33,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 362 transitions. [2023-02-15 01:22:33,403 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 362 transitions. Word has length 30 [2023-02-15 01:22:33,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:33,403 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 362 transitions. [2023-02-15 01:22:33,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 10 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:22:33,404 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 362 transitions. [2023-02-15 01:22:33,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 01:22:33,404 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:33,404 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:22:33,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-02-15 01:22:33,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:22:33,614 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting list_addErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:22:33,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:33,614 INFO L85 PathProgramCache]: Analyzing trace with hash -662300209, now seen corresponding path program 1 times [2023-02-15 01:22:33,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:22:33,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855371603] [2023-02-15 01:22:33,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:33,615 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:22:33,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:22:33,616 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:22:33,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-15 01:22:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:33,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-15 01:22:33,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:22:33,894 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 01:22:33,895 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-15 01:22:34,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:22:34,242 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:22:34,257 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:22:34,258 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2023-02-15 01:22:34,340 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2023-02-15 01:22:34,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 30 treesize of output 51 [2023-02-15 01:22:34,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 32 [2023-02-15 01:22:34,538 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-02-15 01:22:34,600 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:22:34,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:22:34,695 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_493 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_493) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (_ bv1 1)) (_ bv0 1))) is different from false [2023-02-15 01:22:37,095 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:22:37,096 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-15 01:22:37,098 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:22:37,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2023-02-15 01:22:37,103 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-02-15 01:22:43,023 WARN L233 SmtUtils]: Spent 5.81s on a formula simplification. DAG size of input: 34 DAG size of output: 31 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 01:22:43,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:22:43,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1855371603] [2023-02-15 01:22:43,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1855371603] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:22:43,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [899578346] [2023-02-15 01:22:43,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:43,026 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 01:22:43,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 01:22:43,027 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 01:22:43,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2023-02-15 01:22:43,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:43,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 38 conjunts are in the unsatisfiable core [2023-02-15 01:22:43,351 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:22:43,416 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-02-15 01:22:43,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2023-02-15 01:22:43,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:22:44,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:22:44,162 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:22:44,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2023-02-15 01:22:44,305 INFO L321 Elim1Store]: treesize reduction 78, result has 35.0 percent of original size [2023-02-15 01:22:44,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 67 [2023-02-15 01:22:44,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2023-02-15 01:22:44,543 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-02-15 01:22:44,636 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:22:44,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:22:44,658 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_572) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (_ bv1 1)))) is different from false [2023-02-15 01:22:44,775 WARN L837 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_gl_insert_~node~1#1.base_19| (_ BitVec 32)) (v_ArrVal_570 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_571 (_ BitVec 1)) (v_ArrVal_572 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_19| v_ArrVal_571) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_570) |v_ULTIMATE.start_gl_insert_~node~1#1.base_19| v_ArrVal_572) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (_ bv1 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_19|) (_ bv0 1))))) is different from false [2023-02-15 01:22:44,913 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:22:44,913 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-02-15 01:22:44,916 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:22:44,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 36 [2023-02-15 01:22:44,924 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-02-15 01:22:47,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [899578346] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:22:47,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:22:47,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 29 [2023-02-15 01:22:47,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578180792] [2023-02-15 01:22:47,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:22:47,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-15 01:22:47,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:22:47,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-15 01:22:47,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1406, Unknown=31, NotChecked=240, Total=1892 [2023-02-15 01:22:47,119 INFO L87 Difference]: Start difference. First operand 294 states and 362 transitions. Second operand has 31 states, 29 states have (on average 1.793103448275862) internal successors, (52), 26 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:22:50,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:22:50,909 INFO L93 Difference]: Finished difference Result 375 states and 412 transitions. [2023-02-15 01:22:50,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 01:22:50,910 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.793103448275862) internal successors, (52), 26 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2023-02-15 01:22:50,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:22:50,911 INFO L225 Difference]: With dead ends: 375 [2023-02-15 01:22:50,911 INFO L226 Difference]: Without dead ends: 375 [2023-02-15 01:22:50,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 745 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=423, Invalid=2108, Unknown=31, NotChecked=300, Total=2862 [2023-02-15 01:22:50,912 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 578 mSDsluCounter, 2298 mSDsCounter, 0 mSdLazyCounter, 2194 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 586 SdHoareTripleChecker+Valid, 2441 SdHoareTripleChecker+Invalid, 2240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 2194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-02-15 01:22:50,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [586 Valid, 2441 Invalid, 2240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 2194 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-02-15 01:22:50,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2023-02-15 01:22:50,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 294. [2023-02-15 01:22:50,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 211 states have (on average 1.5497630331753554) internal successors, (327), 277 states have internal predecessors, (327), 24 states have call successors, (24), 8 states have call predecessors, (24), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2023-02-15 01:22:50,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 361 transitions. [2023-02-15 01:22:50,917 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 361 transitions. Word has length 29 [2023-02-15 01:22:50,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:22:50,918 INFO L495 AbstractCegarLoop]: Abstraction has 294 states and 361 transitions. [2023-02-15 01:22:50,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.793103448275862) internal successors, (52), 26 states have internal predecessors, (52), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:22:50,918 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 361 transitions. [2023-02-15 01:22:50,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 01:22:50,918 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:22:50,919 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:22:50,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2023-02-15 01:22:51,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Ended with exit code 0 [2023-02-15 01:22:51,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-15 01:22:51,329 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting list_addErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:22:51,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:22:51,329 INFO L85 PathProgramCache]: Analyzing trace with hash -662300208, now seen corresponding path program 1 times [2023-02-15 01:22:51,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:22:51,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2091426521] [2023-02-15 01:22:51,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:51,330 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:22:51,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:22:51,331 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:22:51,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-15 01:22:51,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:51,565 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 53 conjunts are in the unsatisfiable core [2023-02-15 01:22:51,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:22:51,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:22:51,588 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:22:51,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 01:22:51,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:22:51,807 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:22:51,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:22:51,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:22:51,941 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:22:51,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2023-02-15 01:22:51,948 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 01:22:52,005 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:22:52,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 01:22:52,022 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-15 01:22:52,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 01:22:52,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2023-02-15 01:22:52,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:22:52,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 01:22:52,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:22:52,249 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:22:52,249 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:22:52,516 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_655 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_656 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_656) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_655) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) (forall ((v_ArrVal_656 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_656) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0))))) is different from false [2023-02-15 01:22:54,511 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:22:54,512 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 119 treesize of output 143 [2023-02-15 01:22:54,527 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:22:54,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 107 [2023-02-15 01:22:54,542 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:22:54,542 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 96 treesize of output 97 [2023-02-15 01:22:54,550 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 186 treesize of output 178 [2023-02-15 01:22:54,557 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 442 treesize of output 422 [2023-02-15 01:22:54,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 415 treesize of output 407 [2023-02-15 01:22:54,568 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 407 treesize of output 391 [2023-02-15 01:22:54,573 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 391 treesize of output 375 [2023-02-15 01:22:54,578 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 375 treesize of output 367 [2023-02-15 01:22:54,595 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:22:54,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 367 treesize of output 358 [2023-02-15 01:22:54,602 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 408 treesize of output 396 [2023-02-15 01:22:54,607 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 389 treesize of output 381 [2023-02-15 01:22:54,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 381 treesize of output 377 [2023-02-15 01:22:58,628 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:22:58,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2091426521] [2023-02-15 01:22:58,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2091426521] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:22:58,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [526482677] [2023-02-15 01:22:58,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:22:58,629 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 01:22:58,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 01:22:58,630 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 01:22:58,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2023-02-15 01:22:59,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:22:59,120 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 57 conjunts are in the unsatisfiable core [2023-02-15 01:22:59,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:22:59,226 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 01:22:59,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-15 01:22:59,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:23:00,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:23:00,154 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:23:00,434 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:23:00,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:23:00,470 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:23:00,470 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 46 [2023-02-15 01:23:00,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 01:23:00,627 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-02-15 01:23:00,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2023-02-15 01:23:00,641 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 01:23:00,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2023-02-15 01:23:00,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:23:01,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 01:23:01,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:23:01,037 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:23:01,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:23:01,100 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_745) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (forall ((v_ArrVal_744 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_745) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_744) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))))) is different from false [2023-02-15 01:23:01,172 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_gl_insert_~node~1#1.base_25| (_ BitVec 32))) (or (forall ((v_ArrVal_743 (_ BitVec 32)) (v_ArrVal_744 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_gl_insert_~node~1#1.base_25| v_ArrVal_745) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (select (store |c_#length| |v_ULTIMATE.start_gl_insert_~node~1#1.base_25| v_ArrVal_743) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_gl_insert_~node~1#1.base_25| v_ArrVal_744) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_25|) (_ bv0 1))))) (forall ((|v_ULTIMATE.start_gl_insert_~node~1#1.base_25| (_ BitVec 32))) (or (forall ((v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_gl_insert_~node~1#1.base_25| v_ArrVal_745) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_25|) (_ bv0 1)))))) is different from false [2023-02-15 01:23:01,660 WARN L837 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_741 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_742 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_gl_insert_~node~1#1.base_25| (_ BitVec 32))) (or (forall ((v_ArrVal_743 (_ BitVec 32)) (v_ArrVal_744 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv8 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_741) |v_ULTIMATE.start_gl_insert_~node~1#1.base_25| v_ArrVal_745) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)) (select (store |c_#length| |v_ULTIMATE.start_gl_insert_~node~1#1.base_25| v_ArrVal_743) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_742) |v_ULTIMATE.start_gl_insert_~node~1#1.base_25| v_ArrVal_744) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_25|) (_ bv0 1))))) (forall ((v_ArrVal_741 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_gl_insert_~node~1#1.base_25| (_ BitVec 32))) (or (forall ((v_ArrVal_745 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_741) |v_ULTIMATE.start_gl_insert_~node~1#1.base_25| v_ArrVal_745) |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|))) (bvule (bvadd (_ bv4 32) .cse0) (bvadd (_ bv8 32) .cse0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_gl_insert_~node~1#1.base_25|) (_ bv0 1)))))) is different from false [2023-02-15 01:23:02,084 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:23:02,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 38 [2023-02-15 01:23:02,087 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:23:02,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 34 [2023-02-15 01:23:02,112 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 01:23:02,136 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:23:02,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 49 [2023-02-15 01:23:02,140 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:23:02,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 76 [2023-02-15 01:23:02,156 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:23:02,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 62 [2023-02-15 01:23:02,159 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:23:02,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 84 [2023-02-15 01:23:02,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2023-02-15 01:23:02,177 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 70 [2023-02-15 01:23:03,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [526482677] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:23:03,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:23:03,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2023-02-15 01:23:03,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766658344] [2023-02-15 01:23:03,560 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:23:03,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-15 01:23:03,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:23:03,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-15 01:23:03,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1311, Unknown=9, NotChecked=308, Total=1806 [2023-02-15 01:23:03,562 INFO L87 Difference]: Start difference. First operand 294 states and 361 transitions. Second operand has 30 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 25 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:23:09,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:23:09,064 INFO L93 Difference]: Finished difference Result 374 states and 411 transitions. [2023-02-15 01:23:09,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 01:23:09,065 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 25 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2023-02-15 01:23:09,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:23:09,066 INFO L225 Difference]: With dead ends: 374 [2023-02-15 01:23:09,066 INFO L226 Difference]: Without dead ends: 374 [2023-02-15 01:23:09,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 653 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=437, Invalid=2222, Unknown=9, NotChecked=412, Total=3080 [2023-02-15 01:23:09,067 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 911 mSDsluCounter, 1190 mSDsCounter, 0 mSdLazyCounter, 1744 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 1841 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-02-15 01:23:09,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 1310 Invalid, 1841 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1744 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-02-15 01:23:09,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2023-02-15 01:23:09,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 280. [2023-02-15 01:23:09,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 199 states have (on average 1.5778894472361809) internal successors, (314), 264 states have internal predecessors, (314), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 01:23:09,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 346 transitions. [2023-02-15 01:23:09,073 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 346 transitions. Word has length 29 [2023-02-15 01:23:09,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:23:09,073 INFO L495 AbstractCegarLoop]: Abstraction has 280 states and 346 transitions. [2023-02-15 01:23:09,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 27 states have (on average 1.8518518518518519) internal successors, (50), 25 states have internal predecessors, (50), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 01:23:09,074 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 346 transitions. [2023-02-15 01:23:09,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-02-15 01:23:09,074 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:23:09,074 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] [2023-02-15 01:23:09,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2023-02-15 01:23:09,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-02-15 01:23:09,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:23:09,479 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting inspectErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:23:09,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:23:09,480 INFO L85 PathProgramCache]: Analyzing trace with hash -661459978, now seen corresponding path program 1 times [2023-02-15 01:23:09,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:23:09,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1924134733] [2023-02-15 01:23:09,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:23:09,480 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:23:09,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:23:09,491 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:23:09,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-02-15 01:23:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:23:09,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 01:23:09,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:23:09,704 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:23:09,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 01:23:09,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:23:09,974 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:23:09,974 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:23:09,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1924134733] [2023-02-15 01:23:09,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1924134733] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:23:09,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:23:09,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:23:09,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832377902] [2023-02-15 01:23:09,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:23:09,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 01:23:09,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:23:09,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 01:23:09,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:23:09,976 INFO L87 Difference]: Start difference. First operand 280 states and 346 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:23:10,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:23:10,591 INFO L93 Difference]: Finished difference Result 278 states and 342 transitions. [2023-02-15 01:23:10,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:23:10,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2023-02-15 01:23:10,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:23:10,592 INFO L225 Difference]: With dead ends: 278 [2023-02-15 01:23:10,592 INFO L226 Difference]: Without dead ends: 278 [2023-02-15 01:23:10,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:23:10,593 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 451 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 453 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 01:23:10,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [453 Valid, 219 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 01:23:10,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2023-02-15 01:23:10,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2023-02-15 01:23:10,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 199 states have (on average 1.5577889447236182) internal successors, (310), 262 states have internal predecessors, (310), 23 states have call successors, (23), 7 states have call predecessors, (23), 6 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 01:23:10,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 342 transitions. [2023-02-15 01:23:10,598 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 342 transitions. Word has length 30 [2023-02-15 01:23:10,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:23:10,598 INFO L495 AbstractCegarLoop]: Abstraction has 278 states and 342 transitions. [2023-02-15 01:23:10,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:23:10,598 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 342 transitions. [2023-02-15 01:23:10,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 01:23:10,599 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:23:10,599 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] [2023-02-15 01:23:10,628 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-02-15 01:23:10,809 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:23:10,810 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:23:10,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:23:10,812 INFO L85 PathProgramCache]: Analyzing trace with hash -244243135, now seen corresponding path program 1 times [2023-02-15 01:23:10,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:23:10,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [804713357] [2023-02-15 01:23:10,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:23:10,812 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:23:10,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:23:10,814 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:23:10,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-02-15 01:23:10,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:23:10,981 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 45 conjunts are in the unsatisfiable core [2023-02-15 01:23:10,983 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:23:11,036 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:23:11,037 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 01:23:11,075 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:23:11,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:23:11,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:23:11,105 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:23:11,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:23:11,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 44 [2023-02-15 01:23:11,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:23:11,840 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2023-02-15 01:23:11,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:23:11,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2023-02-15 01:23:11,859 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-02-15 01:23:11,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 01:23:11,960 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:23:11,960 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2023-02-15 01:23:12,207 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-15 01:23:12,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:23:12,264 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:23:12,264 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:23:12,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [804713357] [2023-02-15 01:23:12,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [804713357] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:23:12,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:23:12,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-02-15 01:23:12,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289996765] [2023-02-15 01:23:12,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:23:12,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-02-15 01:23:12,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:23:12,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-02-15 01:23:12,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=225, Unknown=13, NotChecked=0, Total=272 [2023-02-15 01:23:12,266 INFO L87 Difference]: Start difference. First operand 278 states and 342 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:23:19,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:23:19,107 INFO L93 Difference]: Finished difference Result 452 states and 534 transitions. [2023-02-15 01:23:19,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 01:23:19,107 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2023-02-15 01:23:19,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:23:19,109 INFO L225 Difference]: With dead ends: 452 [2023-02-15 01:23:19,109 INFO L226 Difference]: Without dead ends: 452 [2023-02-15 01:23:19,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=94, Invalid=533, Unknown=23, NotChecked=0, Total=650 [2023-02-15 01:23:19,110 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 400 mSDsluCounter, 1221 mSDsCounter, 0 mSdLazyCounter, 2190 mSolverCounterSat, 44 mSolverCounterUnsat, 168 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 1316 SdHoareTripleChecker+Invalid, 2402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2190 IncrementalHoareTripleChecker+Invalid, 168 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:23:19,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 1316 Invalid, 2402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2190 Invalid, 168 Unknown, 0 Unchecked, 6.1s Time] [2023-02-15 01:23:19,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2023-02-15 01:23:19,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 379. [2023-02-15 01:23:19,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 292 states have (on average 1.5273972602739727) internal successors, (446), 356 states have internal predecessors, (446), 28 states have call successors, (28), 10 states have call predecessors, (28), 9 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2023-02-15 01:23:19,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 488 transitions. [2023-02-15 01:23:19,116 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 488 transitions. Word has length 33 [2023-02-15 01:23:19,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:23:19,116 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 488 transitions. [2023-02-15 01:23:19,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 14 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:23:19,118 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 488 transitions. [2023-02-15 01:23:19,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 01:23:19,119 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:23:19,119 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] [2023-02-15 01:23:19,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-02-15 01:23:19,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:23:19,328 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:23:19,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:23:19,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1920035533, now seen corresponding path program 1 times [2023-02-15 01:23:19,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:23:19,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664874127] [2023-02-15 01:23:19,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:23:19,328 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:23:19,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:23:19,329 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:23:19,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-02-15 01:23:19,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:23:19,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-15 01:23:19,505 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:23:19,563 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:23:19,563 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 01:23:19,606 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:23:19,615 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:23:19,629 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:23:19,636 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:23:20,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:23:20,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 44 [2023-02-15 01:23:20,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:23:20,381 INFO L321 Elim1Store]: treesize reduction 44, result has 6.4 percent of original size [2023-02-15 01:23:20,381 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 38 [2023-02-15 01:23:20,387 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:23:20,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2023-02-15 01:23:20,393 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-02-15 01:23:20,468 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 01:23:20,490 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:23:20,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2023-02-15 01:23:20,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-02-15 01:23:20,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:23:20,917 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:23:20,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:23:20,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664874127] [2023-02-15 01:23:20,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664874127] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:23:20,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:23:20,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-02-15 01:23:20,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299931615] [2023-02-15 01:23:20,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:23:20,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 01:23:20,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:23:20,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 01:23:20,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=259, Unknown=11, NotChecked=0, Total=306 [2023-02-15 01:23:20,919 INFO L87 Difference]: Start difference. First operand 379 states and 488 transitions. Second operand has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 15 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:23:27,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:23:27,206 INFO L93 Difference]: Finished difference Result 451 states and 532 transitions. [2023-02-15 01:23:27,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 01:23:27,207 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 15 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2023-02-15 01:23:27,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:23:27,208 INFO L225 Difference]: With dead ends: 451 [2023-02-15 01:23:27,208 INFO L226 Difference]: Without dead ends: 451 [2023-02-15 01:23:27,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=104, Invalid=630, Unknown=22, NotChecked=0, Total=756 [2023-02-15 01:23:27,209 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 462 mSDsluCounter, 1322 mSDsCounter, 0 mSdLazyCounter, 2084 mSolverCounterSat, 42 mSolverCounterUnsat, 126 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 1419 SdHoareTripleChecker+Invalid, 2252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2084 IncrementalHoareTripleChecker+Invalid, 126 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2023-02-15 01:23:27,209 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 1419 Invalid, 2252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2084 Invalid, 126 Unknown, 0 Unchecked, 5.4s Time] [2023-02-15 01:23:27,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2023-02-15 01:23:27,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 379. [2023-02-15 01:23:27,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 292 states have (on average 1.523972602739726) internal successors, (445), 356 states have internal predecessors, (445), 28 states have call successors, (28), 10 states have call predecessors, (28), 9 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2023-02-15 01:23:27,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 487 transitions. [2023-02-15 01:23:27,217 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 487 transitions. Word has length 37 [2023-02-15 01:23:27,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:23:27,218 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 487 transitions. [2023-02-15 01:23:27,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 15 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:23:27,218 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 487 transitions. [2023-02-15 01:23:27,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 01:23:27,221 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:23:27,221 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] [2023-02-15 01:23:27,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-02-15 01:23:27,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:23:27,431 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting inspectErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:23:27,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:23:27,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1920024890, now seen corresponding path program 1 times [2023-02-15 01:23:27,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:23:27,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1214606803] [2023-02-15 01:23:27,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:23:27,432 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:23:27,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:23:27,433 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:23:27,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-02-15 01:23:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:23:27,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-15 01:23:27,614 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:23:27,687 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 01:23:27,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-15 01:23:27,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:23:27,786 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:23:27,805 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:23:27,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:23:28,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:23:28,725 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 44 [2023-02-15 01:23:28,729 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:23:28,745 INFO L321 Elim1Store]: treesize reduction 44, result has 6.4 percent of original size [2023-02-15 01:23:28,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 38 [2023-02-15 01:23:28,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:23:28,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2023-02-15 01:23:28,758 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-02-15 01:23:28,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 01:23:28,896 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:23:28,897 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 37 [2023-02-15 01:23:29,335 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2023-02-15 01:23:29,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:23:29,471 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:23:29,471 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:23:29,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1214606803] [2023-02-15 01:23:29,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1214606803] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:23:29,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:23:29,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-02-15 01:23:29,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834586145] [2023-02-15 01:23:29,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:23:29,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 01:23:29,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:23:29,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 01:23:29,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=256, Unknown=13, NotChecked=0, Total=306 [2023-02-15 01:23:29,472 INFO L87 Difference]: Start difference. First operand 379 states and 487 transitions. Second operand has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:23:37,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:23:37,711 INFO L93 Difference]: Finished difference Result 448 states and 529 transitions. [2023-02-15 01:23:37,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 01:23:37,711 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2023-02-15 01:23:37,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:23:37,713 INFO L225 Difference]: With dead ends: 448 [2023-02-15 01:23:37,713 INFO L226 Difference]: Without dead ends: 448 [2023-02-15 01:23:37,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=101, Invalid=577, Unknown=24, NotChecked=0, Total=702 [2023-02-15 01:23:37,713 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 406 mSDsluCounter, 1027 mSDsCounter, 0 mSdLazyCounter, 2367 mSolverCounterSat, 35 mSolverCounterUnsat, 146 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 1116 SdHoareTripleChecker+Invalid, 2548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2367 IncrementalHoareTripleChecker+Invalid, 146 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:23:37,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 1116 Invalid, 2548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2367 Invalid, 146 Unknown, 0 Unchecked, 7.3s Time] [2023-02-15 01:23:37,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2023-02-15 01:23:37,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 379. [2023-02-15 01:23:37,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 292 states have (on average 1.5205479452054795) internal successors, (444), 356 states have internal predecessors, (444), 28 states have call successors, (28), 10 states have call predecessors, (28), 9 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2023-02-15 01:23:37,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 486 transitions. [2023-02-15 01:23:37,722 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 486 transitions. Word has length 37 [2023-02-15 01:23:37,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:23:37,722 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 486 transitions. [2023-02-15 01:23:37,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:23:37,722 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 486 transitions. [2023-02-15 01:23:37,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-02-15 01:23:37,729 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:23:37,729 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] [2023-02-15 01:23:37,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-02-15 01:23:37,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:23:37,934 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting inspectErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:23:37,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:23:37,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1920024891, now seen corresponding path program 1 times [2023-02-15 01:23:37,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:23:37,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1430157780] [2023-02-15 01:23:37,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:23:37,935 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:23:37,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:23:37,936 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:23:37,938 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-02-15 01:23:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:23:38,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 64 conjunts are in the unsatisfiable core [2023-02-15 01:23:38,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:23:38,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:23:38,232 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:23:38,232 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 01:23:38,284 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:23:38,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:23:38,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:23:38,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:23:39,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:23:39,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 89 [2023-02-15 01:23:39,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:23:39,927 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2023-02-15 01:23:39,946 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 01:23:39,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 47 [2023-02-15 01:23:39,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:23:39,955 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2023-02-15 01:23:39,975 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-15 01:23:39,975 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 33 [2023-02-15 01:23:39,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:23:39,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2023-02-15 01:23:40,145 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 01:23:40,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 01:23:40,175 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:23:40,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2023-02-15 01:23:40,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-15 01:23:40,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:23:40,699 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 01:23:40,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:23:40,918 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:23:40,918 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:23:40,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1430157780] [2023-02-15 01:23:40,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1430157780] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:23:40,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:23:40,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2023-02-15 01:23:40,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672094111] [2023-02-15 01:23:40,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:23:40,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 01:23:40,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:23:40,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 01:23:40,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=256, Unknown=11, NotChecked=0, Total=306 [2023-02-15 01:23:40,919 INFO L87 Difference]: Start difference. First operand 379 states and 486 transitions. Second operand has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:23:51,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:23:51,661 INFO L93 Difference]: Finished difference Result 447 states and 528 transitions. [2023-02-15 01:23:51,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-02-15 01:23:51,662 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 37 [2023-02-15 01:23:51,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:23:51,663 INFO L225 Difference]: With dead ends: 447 [2023-02-15 01:23:51,663 INFO L226 Difference]: Without dead ends: 447 [2023-02-15 01:23:51,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=107, Invalid=628, Unknown=21, NotChecked=0, Total=756 [2023-02-15 01:23:51,664 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 442 mSDsluCounter, 1107 mSDsCounter, 0 mSdLazyCounter, 2310 mSolverCounterSat, 45 mSolverCounterUnsat, 113 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 1202 SdHoareTripleChecker+Invalid, 2468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2310 IncrementalHoareTripleChecker+Invalid, 113 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2023-02-15 01:23:51,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 1202 Invalid, 2468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2310 Invalid, 113 Unknown, 0 Unchecked, 9.6s Time] [2023-02-15 01:23:51,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2023-02-15 01:23:51,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 379. [2023-02-15 01:23:51,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 292 states have (on average 1.5102739726027397) internal successors, (441), 356 states have internal predecessors, (441), 28 states have call successors, (28), 10 states have call predecessors, (28), 9 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2023-02-15 01:23:51,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 483 transitions. [2023-02-15 01:23:51,676 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 483 transitions. Word has length 37 [2023-02-15 01:23:51,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:23:51,676 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 483 transitions. [2023-02-15 01:23:51,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0) internal successors, (34), 15 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:23:51,677 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 483 transitions. [2023-02-15 01:23:51,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 01:23:51,677 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:23:51,677 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] [2023-02-15 01:23:51,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-02-15 01:23:51,885 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:23:51,886 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:23:51,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:23:51,886 INFO L85 PathProgramCache]: Analyzing trace with hash -912874368, now seen corresponding path program 1 times [2023-02-15 01:23:51,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:23:51,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588676056] [2023-02-15 01:23:51,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:23:51,887 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:23:51,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:23:51,888 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:23:51,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-02-15 01:23:52,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:23:52,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 68 conjunts are in the unsatisfiable core [2023-02-15 01:23:52,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:23:52,158 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:23:52,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 01:23:52,199 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:23:52,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:23:52,218 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:23:52,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:23:55,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:23:55,191 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 157 [2023-02-15 01:23:55,212 INFO L321 Elim1Store]: treesize reduction 17, result has 34.6 percent of original size [2023-02-15 01:23:55,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 52 [2023-02-15 01:23:55,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:23:55,222 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2023-02-15 01:23:55,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:23:55,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2023-02-15 01:23:55,421 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:23:55,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 22 [2023-02-15 01:23:55,428 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:23:55,438 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:23:55,438 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:23:55,441 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 01:23:55,441 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2023-02-15 01:23:55,628 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:23:55,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 48 [2023-02-15 01:23:55,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:23:55,641 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:23:55,643 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-15 01:23:55,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 42 [2023-02-15 01:23:56,171 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-15 01:23:56,436 INFO L321 Elim1Store]: treesize reduction 21, result has 27.6 percent of original size [2023-02-15 01:23:56,436 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 20 [2023-02-15 01:23:56,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:23:56,535 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:23:56,535 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:23:56,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588676056] [2023-02-15 01:23:56,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588676056] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:23:56,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:23:56,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-02-15 01:23:56,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377590739] [2023-02-15 01:23:56,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:23:56,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 01:23:56,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:23:56,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 01:23:56,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=291, Unknown=10, NotChecked=0, Total=342 [2023-02-15 01:23:56,536 INFO L87 Difference]: Start difference. First operand 379 states and 483 transitions. Second operand has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 16 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:24:07,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:24:07,371 INFO L93 Difference]: Finished difference Result 446 states and 526 transitions. [2023-02-15 01:24:07,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 01:24:07,372 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 16 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2023-02-15 01:24:07,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:24:07,373 INFO L225 Difference]: With dead ends: 446 [2023-02-15 01:24:07,373 INFO L226 Difference]: Without dead ends: 446 [2023-02-15 01:24:07,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=119, Invalid=734, Unknown=17, NotChecked=0, Total=870 [2023-02-15 01:24:07,374 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 438 mSDsluCounter, 1293 mSDsCounter, 0 mSdLazyCounter, 2307 mSolverCounterSat, 40 mSolverCounterUnsat, 58 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 1396 SdHoareTripleChecker+Invalid, 2405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2307 IncrementalHoareTripleChecker+Invalid, 58 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2023-02-15 01:24:07,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 1396 Invalid, 2405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2307 Invalid, 58 Unknown, 0 Unchecked, 9.6s Time] [2023-02-15 01:24:07,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2023-02-15 01:24:07,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 379. [2023-02-15 01:24:07,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 292 states have (on average 1.5068493150684932) internal successors, (440), 356 states have internal predecessors, (440), 28 states have call successors, (28), 10 states have call predecessors, (28), 9 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2023-02-15 01:24:07,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 482 transitions. [2023-02-15 01:24:07,388 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 482 transitions. Word has length 40 [2023-02-15 01:24:07,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:24:07,389 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 482 transitions. [2023-02-15 01:24:07,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.894736842105263) internal successors, (36), 16 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:24:07,389 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 482 transitions. [2023-02-15 01:24:07,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 01:24:07,389 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:24:07,389 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] [2023-02-15 01:24:07,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-02-15 01:24:07,598 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:24:07,598 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:24:07,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:24:07,599 INFO L85 PathProgramCache]: Analyzing trace with hash -8084452, now seen corresponding path program 1 times [2023-02-15 01:24:07,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:24:07,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [167513293] [2023-02-15 01:24:07,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:24:07,599 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:24:07,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:24:07,600 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:24:07,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-02-15 01:24:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:24:07,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 70 conjunts are in the unsatisfiable core [2023-02-15 01:24:07,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:24:07,897 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:24:07,898 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 01:24:07,950 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:24:07,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:24:07,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:24:07,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:24:10,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:24:10,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:24:10,217 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:24:10,244 INFO L321 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2023-02-15 01:24:10,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 210 treesize of output 94 [2023-02-15 01:24:10,270 INFO L321 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2023-02-15 01:24:10,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 63 [2023-02-15 01:24:10,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:24:10,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 34 [2023-02-15 01:24:10,285 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:24:10,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 37 [2023-02-15 01:24:10,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:24:10,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:24:10,439 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:24:10,442 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 01:24:10,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 60 [2023-02-15 01:24:10,456 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 01:24:10,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:24:10,607 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:24:10,610 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 01:24:10,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 52 [2023-02-15 01:24:10,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-15 01:24:11,251 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:24:11,580 INFO L321 Elim1Store]: treesize reduction 14, result has 17.6 percent of original size [2023-02-15 01:24:11,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 45 treesize of output 23 [2023-02-15 01:24:11,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:24:11,679 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:24:11,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:24:11,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [167513293] [2023-02-15 01:24:11,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [167513293] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:24:11,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:24:11,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-02-15 01:24:11,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972473192] [2023-02-15 01:24:11,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:24:11,680 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 01:24:11,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:24:11,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 01:24:11,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=299, Unknown=3, NotChecked=0, Total=342 [2023-02-15 01:24:11,681 INFO L87 Difference]: Start difference. First operand 379 states and 482 transitions. Second operand has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 16 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:24:27,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:24:27,645 INFO L93 Difference]: Finished difference Result 445 states and 524 transitions. [2023-02-15 01:24:27,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-02-15 01:24:27,647 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 16 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 43 [2023-02-15 01:24:27,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:24:27,648 INFO L225 Difference]: With dead ends: 445 [2023-02-15 01:24:27,648 INFO L226 Difference]: Without dead ends: 445 [2023-02-15 01:24:27,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=118, Invalid=749, Unknown=3, NotChecked=0, Total=870 [2023-02-15 01:24:27,651 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 432 mSDsluCounter, 1272 mSDsCounter, 0 mSdLazyCounter, 2206 mSolverCounterSat, 38 mSolverCounterUnsat, 67 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 2311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2206 IncrementalHoareTripleChecker+Invalid, 67 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2023-02-15 01:24:27,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 1377 Invalid, 2311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2206 Invalid, 67 Unknown, 0 Unchecked, 14.5s Time] [2023-02-15 01:24:27,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2023-02-15 01:24:27,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 379. [2023-02-15 01:24:27,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 292 states have (on average 1.5034246575342465) internal successors, (439), 356 states have internal predecessors, (439), 28 states have call successors, (28), 10 states have call predecessors, (28), 9 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2023-02-15 01:24:27,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 481 transitions. [2023-02-15 01:24:27,657 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 481 transitions. Word has length 43 [2023-02-15 01:24:27,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:24:27,657 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 481 transitions. [2023-02-15 01:24:27,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.0526315789473686) internal successors, (39), 16 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:24:27,657 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 481 transitions. [2023-02-15 01:24:27,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 01:24:27,658 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:24:27,658 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] [2023-02-15 01:24:27,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2023-02-15 01:24:27,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:24:27,867 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:24:27,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:24:27,868 INFO L85 PathProgramCache]: Analyzing trace with hash -610222928, now seen corresponding path program 1 times [2023-02-15 01:24:27,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:24:27,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1464188400] [2023-02-15 01:24:27,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:24:27,868 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:24:27,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:24:27,869 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:24:27,871 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-02-15 01:24:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:24:28,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 01:24:28,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:24:28,039 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 18 [2023-02-15 01:24:28,104 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:24:28,104 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 01:24:28,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:24:28,121 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:24:28,121 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:24:28,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1464188400] [2023-02-15 01:24:28,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1464188400] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:24:28,121 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:24:28,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:24:28,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144620227] [2023-02-15 01:24:28,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:24:28,122 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:24:28,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:24:28,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:24:28,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:24:28,122 INFO L87 Difference]: Start difference. First operand 379 states and 481 transitions. Second operand has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:24:28,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:24:28,405 INFO L93 Difference]: Finished difference Result 378 states and 477 transitions. [2023-02-15 01:24:28,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:24:28,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2023-02-15 01:24:28,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:24:28,407 INFO L225 Difference]: With dead ends: 378 [2023-02-15 01:24:28,407 INFO L226 Difference]: Without dead ends: 378 [2023-02-15 01:24:28,407 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:24:28,407 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 288 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:24:28,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 288 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 01:24:28,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2023-02-15 01:24:28,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 378. [2023-02-15 01:24:28,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 292 states have (on average 1.4931506849315068) internal successors, (436), 355 states have internal predecessors, (436), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2023-02-15 01:24:28,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 477 transitions. [2023-02-15 01:24:28,419 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 477 transitions. Word has length 46 [2023-02-15 01:24:28,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:24:28,420 INFO L495 AbstractCegarLoop]: Abstraction has 378 states and 477 transitions. [2023-02-15 01:24:28,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.4) internal successors, (42), 4 states have internal predecessors, (42), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:24:28,420 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 477 transitions. [2023-02-15 01:24:28,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 01:24:28,420 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:24:28,420 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] [2023-02-15 01:24:28,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Forceful destruction successful, exit code 0 [2023-02-15 01:24:28,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:24:28,628 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting inspectErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:24:28,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:24:28,629 INFO L85 PathProgramCache]: Analyzing trace with hash -610231965, now seen corresponding path program 1 times [2023-02-15 01:24:28,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:24:28,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [206597590] [2023-02-15 01:24:28,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:24:28,629 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:24:28,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:24:28,630 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:24:28,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Waiting until timeout for monitored process [2023-02-15 01:24:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:24:28,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 01:24:28,765 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:24:28,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:24:28,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:24:28,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:24:28,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [206597590] [2023-02-15 01:24:28,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [206597590] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:24:28,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:24:28,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:24:28,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895899995] [2023-02-15 01:24:28,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:24:28,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:24:28,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:24:28,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:24:28,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:24:28,787 INFO L87 Difference]: Start difference. First operand 378 states and 477 transitions. Second operand has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:24:29,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:24:29,149 INFO L93 Difference]: Finished difference Result 372 states and 459 transitions. [2023-02-15 01:24:29,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:24:29,149 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2023-02-15 01:24:29,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:24:29,150 INFO L225 Difference]: With dead ends: 372 [2023-02-15 01:24:29,150 INFO L226 Difference]: Without dead ends: 372 [2023-02-15 01:24:29,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:24:29,151 INFO L413 NwaCegarLoop]: 149 mSDtfsCounter, 121 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:24:29,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 295 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 01:24:29,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 372 states. [2023-02-15 01:24:29,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 372 to 372. [2023-02-15 01:24:29,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 292 states have (on average 1.4315068493150684) internal successors, (418), 349 states have internal predecessors, (418), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2023-02-15 01:24:29,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 459 transitions. [2023-02-15 01:24:29,170 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 459 transitions. Word has length 46 [2023-02-15 01:24:29,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:24:29,171 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 459 transitions. [2023-02-15 01:24:29,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 14.333333333333334) internal successors, (43), 4 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:24:29,172 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 459 transitions. [2023-02-15 01:24:29,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 01:24:29,172 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:24:29,173 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] [2023-02-15 01:24:29,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-02-15 01:24:29,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:24:29,381 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting inspectErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:24:29,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:24:29,382 INFO L85 PathProgramCache]: Analyzing trace with hash -610231964, now seen corresponding path program 1 times [2023-02-15 01:24:29,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:24:29,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583064700] [2023-02-15 01:24:29,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:24:29,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:24:29,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:24:29,383 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:24:29,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Waiting until timeout for monitored process [2023-02-15 01:24:29,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:24:29,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 66 conjunts are in the unsatisfiable core [2023-02-15 01:24:29,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:24:29,670 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:24:29,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 01:24:29,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:24:29,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:24:29,734 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:24:29,753 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:24:29,759 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:24:31,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:24:31,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 89 [2023-02-15 01:24:31,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:24:31,430 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2023-02-15 01:24:31,449 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 01:24:31,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 47 [2023-02-15 01:24:31,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:24:31,458 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2023-02-15 01:24:31,478 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2023-02-15 01:24:31,478 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 33 [2023-02-15 01:24:31,483 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:24:31,484 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2023-02-15 01:24:31,583 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 01:24:31,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 01:24:31,622 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:24:31,622 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2023-02-15 01:24:31,631 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2023-02-15 01:24:32,086 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:24:32,090 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-02-15 01:24:32,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:24:32,424 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:24:32,424 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:24:32,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583064700] [2023-02-15 01:24:32,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1583064700] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:24:32,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:24:32,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-02-15 01:24:32,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145672666] [2023-02-15 01:24:32,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:24:32,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 01:24:32,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:24:32,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 01:24:32,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=289, Unknown=12, NotChecked=0, Total=342 [2023-02-15 01:24:32,426 INFO L87 Difference]: Start difference. First operand 372 states and 459 transitions. Second operand has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:24:43,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:24:43,255 INFO L93 Difference]: Finished difference Result 424 states and 493 transitions. [2023-02-15 01:24:43,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-02-15 01:24:43,255 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 46 [2023-02-15 01:24:43,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:24:43,256 INFO L225 Difference]: With dead ends: 424 [2023-02-15 01:24:43,257 INFO L226 Difference]: Without dead ends: 424 [2023-02-15 01:24:43,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=128, Invalid=778, Unknown=24, NotChecked=0, Total=930 [2023-02-15 01:24:43,257 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 424 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 2358 mSolverCounterSat, 42 mSolverCounterUnsat, 99 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 2499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2358 IncrementalHoareTripleChecker+Invalid, 99 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2023-02-15 01:24:43,257 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 1330 Invalid, 2499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2358 Invalid, 99 Unknown, 0 Unchecked, 9.4s Time] [2023-02-15 01:24:43,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2023-02-15 01:24:43,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 372. [2023-02-15 01:24:43,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 292 states have (on average 1.4075342465753424) internal successors, (411), 349 states have internal predecessors, (411), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2023-02-15 01:24:43,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 452 transitions. [2023-02-15 01:24:43,262 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 452 transitions. Word has length 46 [2023-02-15 01:24:43,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:24:43,263 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 452 transitions. [2023-02-15 01:24:43,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.388888888888889) internal successors, (43), 16 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:24:43,263 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 452 transitions. [2023-02-15 01:24:43,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-02-15 01:24:43,263 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:24:43,263 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] [2023-02-15 01:24:43,274 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (30)] Forceful destruction successful, exit code 0 [2023-02-15 01:24:43,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:24:43,474 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:24:43,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:24:43,474 INFO L85 PathProgramCache]: Analyzing trace with hash 1176224425, now seen corresponding path program 1 times [2023-02-15 01:24:43,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:24:43,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1637295555] [2023-02-15 01:24:43,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:24:43,475 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:24:43,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:24:43,476 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:24:43,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-02-15 01:24:43,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:24:43,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 72 conjunts are in the unsatisfiable core [2023-02-15 01:24:43,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:24:43,779 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:24:43,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 01:24:43,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:24:43,849 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:24:43,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:24:43,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:24:45,356 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:24:45,356 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 93 [2023-02-15 01:24:45,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:24:45,394 INFO L321 Elim1Store]: treesize reduction 44, result has 6.4 percent of original size [2023-02-15 01:24:45,395 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 95 [2023-02-15 01:24:45,400 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:24:45,401 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 76 [2023-02-15 01:24:45,419 INFO L321 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2023-02-15 01:24:45,419 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 51 [2023-02-15 01:24:45,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:24:45,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2023-02-15 01:24:45,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:24:45,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2023-02-15 01:24:45,536 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 01:24:45,545 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2023-02-15 01:24:45,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:24:45,669 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:24:45,671 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:24:45,671 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 52 [2023-02-15 01:24:45,678 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2023-02-15 01:24:46,707 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:24:46,708 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:24:46,715 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 01:24:46,716 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 27 [2023-02-15 01:24:46,729 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 01:24:46,729 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 18 [2023-02-15 01:24:46,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:24:46,827 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:24:46,827 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:24:46,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1637295555] [2023-02-15 01:24:46,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1637295555] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:24:46,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:24:46,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-02-15 01:24:46,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761205860] [2023-02-15 01:24:46,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:24:46,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-15 01:24:46,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:24:46,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-15 01:24:46,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=363, Unknown=11, NotChecked=0, Total=420 [2023-02-15 01:24:46,829 INFO L87 Difference]: Start difference. First operand 372 states and 452 transitions. Second operand has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 17 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:24:57,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:24:57,690 INFO L93 Difference]: Finished difference Result 422 states and 489 transitions. [2023-02-15 01:24:57,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 01:24:57,691 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 17 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2023-02-15 01:24:57,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:24:57,692 INFO L225 Difference]: With dead ends: 422 [2023-02-15 01:24:57,692 INFO L226 Difference]: Without dead ends: 422 [2023-02-15 01:24:57,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=146, Invalid=951, Unknown=25, NotChecked=0, Total=1122 [2023-02-15 01:24:57,693 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 467 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 1965 mSolverCounterSat, 37 mSolverCounterUnsat, 93 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 2095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1965 IncrementalHoareTripleChecker+Invalid, 93 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:24:57,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 1651 Invalid, 2095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1965 Invalid, 93 Unknown, 0 Unchecked, 9.1s Time] [2023-02-15 01:24:57,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2023-02-15 01:24:57,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 372. [2023-02-15 01:24:57,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 292 states have (on average 1.4006849315068493) internal successors, (409), 349 states have internal predecessors, (409), 27 states have call successors, (27), 10 states have call predecessors, (27), 9 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2023-02-15 01:24:57,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 450 transitions. [2023-02-15 01:24:57,698 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 450 transitions. Word has length 49 [2023-02-15 01:24:57,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:24:57,698 INFO L495 AbstractCegarLoop]: Abstraction has 372 states and 450 transitions. [2023-02-15 01:24:57,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 17 states have internal predecessors, (45), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:24:57,698 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 450 transitions. [2023-02-15 01:24:57,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 01:24:57,699 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:24:57,699 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:24:57,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Forceful destruction successful, exit code 0 [2023-02-15 01:24:57,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:24:57,908 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:24:57,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:24:57,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1567315803, now seen corresponding path program 1 times [2023-02-15 01:24:57,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:24:57,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451193413] [2023-02-15 01:24:57,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:24:57,909 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:24:57,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:24:57,910 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:24:57,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Waiting until timeout for monitored process [2023-02-15 01:24:58,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:24:58,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 73 conjunts are in the unsatisfiable core [2023-02-15 01:24:58,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:24:58,320 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:24:58,320 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 01:24:58,351 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:24:58,359 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:24:58,372 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:24:58,376 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:24:59,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:24:59,030 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 44 [2023-02-15 01:24:59,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:24:59,053 INFO L321 Elim1Store]: treesize reduction 44, result has 6.4 percent of original size [2023-02-15 01:24:59,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 38 [2023-02-15 01:24:59,060 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-15 01:24:59,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:24:59,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2023-02-15 01:24:59,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-15 01:24:59,193 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:24:59,193 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2023-02-15 01:24:59,289 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:24:59,289 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 01:24:59,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2023-02-15 01:24:59,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:24:59,385 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 8 [2023-02-15 01:25:00,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:25:00,172 INFO L321 Elim1Store]: treesize reduction 58, result has 24.7 percent of original size [2023-02-15 01:25:00,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 126 [2023-02-15 01:25:00,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:25:00,189 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 91 [2023-02-15 01:25:00,221 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-02-15 01:25:00,319 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|))) (let ((.cse0 (select .cse8 (bvadd (_ bv4 32) |c_~#gl_list~0.offset|)))) (and (let ((.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (.cse3 (select .cse8 |c_~#gl_list~0.offset|))) (or (and (= .cse0 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) (exists ((v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_2) |c_~#gl_list~0.base| v_DerPreprocessor_3) .cse0 v_DerPreprocessor_1) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_2) |c_~#gl_list~0.base| v_DerPreprocessor_3))) (and (= (select .cse1 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse2) (= (select .cse1 .cse0) v_DerPreprocessor_1) (= .cse3 (select v_DerPreprocessor_3 |c_~#gl_list~0.offset|)))))) (exists ((v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select |c_#memory_$Pointer$.base| .cse0))) (let ((.cse6 (let ((.cse7 (store .cse5 |c_~#gl_list~0.offset| .cse3))) (store (store (store (store (store (store |c_#memory_$Pointer$.base| .cse0 v_DerPreprocessor_1) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_2) |c_~#gl_list~0.base| .cse7) .cse0 v_DerPreprocessor_1) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_2) |c_~#gl_list~0.base| .cse7)))) (let ((.cse4 (select .cse6 .cse0))) (and (= v_DerPreprocessor_1 .cse4) (= .cse5 .cse4) (= (select .cse6 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse2)))))))) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| |c_~#gl_list~0.base|)) (not (= (_ bv3 32) .cse0)) (= (_ bv3 32) |c_~#gl_list~0.base|) (= |c_~#gl_list~0.offset| (_ bv0 32))))) is different from true [2023-02-15 01:25:00,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:25:00,368 INFO L321 Elim1Store]: treesize reduction 18, result has 50.0 percent of original size [2023-02-15 01:25:00,368 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 348 treesize of output 274 [2023-02-15 01:25:00,390 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-02-15 01:25:00,535 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2023-02-15 01:25:00,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-15 01:25:00,915 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-02-15 01:25:00,915 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:25:01,906 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:25:01,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451193413] [2023-02-15 01:25:01,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451193413] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:25:01,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [325242512] [2023-02-15 01:25:01,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:25:01,906 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 01:25:01,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 01:25:01,907 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 01:25:01,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Waiting until timeout for monitored process [2023-02-15 01:25:02,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:25:02,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 75 conjunts are in the unsatisfiable core [2023-02-15 01:25:02,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:25:03,046 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:25:03,047 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 01:25:03,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:25:03,084 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:25:03,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:25:03,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:25:03,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:25:03,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 44 [2023-02-15 01:25:03,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:25:03,680 INFO L321 Elim1Store]: treesize reduction 44, result has 6.4 percent of original size [2023-02-15 01:25:03,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 38 [2023-02-15 01:25:03,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:25:03,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2023-02-15 01:25:03,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 13 [2023-02-15 01:25:03,715 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-15 01:25:03,745 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:25:03,746 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 31 [2023-02-15 01:25:03,818 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:25:03,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 01:25:03,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 26 [2023-02-15 01:25:03,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:25:03,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 8 [2023-02-15 01:25:04,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:25:04,661 INFO L321 Elim1Store]: treesize reduction 58, result has 24.7 percent of original size [2023-02-15 01:25:04,661 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 126 [2023-02-15 01:25:04,666 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:25:04,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 111 treesize of output 91 [2023-02-15 01:25:04,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-02-15 01:25:05,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:25:05,135 INFO L321 Elim1Store]: treesize reduction 18, result has 50.0 percent of original size [2023-02-15 01:25:05,136 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 764 treesize of output 606 [2023-02-15 01:25:05,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-02-15 01:25:05,176 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:05,178 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:05,208 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:05,224 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:05,226 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:05,229 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:05,235 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:05,237 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:05,239 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:05,264 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:05,266 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:05,294 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:05,348 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:05,358 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:05,387 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:05,401 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:05,520 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:05,525 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:05,533 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:05,578 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:05,580 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:05,592 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:05,594 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:05,596 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:05,598 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:05,699 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:05,705 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:05,715 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:05,773 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:05,784 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:05,816 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:05,826 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:05,931 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2023-02-15 01:25:06,040 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-02-15 01:25:06,045 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:25:06,045 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:25:06,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [325242512] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:25:06,729 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:25:06,729 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 31 [2023-02-15 01:25:06,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394905547] [2023-02-15 01:25:06,730 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:25:06,730 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-15 01:25:06,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:25:06,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-15 01:25:06,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1095, Unknown=118, NotChecked=70, Total=1406 [2023-02-15 01:25:06,731 INFO L87 Difference]: Start difference. First operand 372 states and 450 transitions. Second operand has 32 states, 32 states have (on average 1.6875) internal successors, (54), 26 states have internal predecessors, (54), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:25:10,987 WARN L859 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|))) (let ((.cse3 (select .cse12 (bvadd (_ bv4 32) |c_~#gl_list~0.offset|)))) (let ((.cse6 (select |c_#memory_$Pointer$.base| .cse3)) (.cse4 (select .cse12 |c_~#gl_list~0.offset|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base|)) (.cse0 (= .cse3 |c_ULTIMATE.start_gl_insert_~node~1#1.base|))) (and (or (and .cse0 (exists ((v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_3 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store (store (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_1) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_2) |c_~#gl_list~0.base| v_DerPreprocessor_3) .cse3 v_DerPreprocessor_1) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_2) |c_~#gl_list~0.base| v_DerPreprocessor_3))) (and (= (select .cse1 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse2) (= (select .cse1 .cse3) v_DerPreprocessor_1) (= .cse4 (select v_DerPreprocessor_3 |c_~#gl_list~0.offset|)))))) (exists ((v_DerPreprocessor_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_2 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (let ((.cse8 (store .cse6 |c_~#gl_list~0.offset| .cse4))) (store (store (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_1) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_2) |c_~#gl_list~0.base| .cse8) .cse3 v_DerPreprocessor_1) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_2) |c_~#gl_list~0.base| .cse8)))) (let ((.cse5 (select .cse7 .cse3))) (and (= v_DerPreprocessor_1 .cse5) (= .cse6 .cse5) (= (select .cse7 |c_ULTIMATE.start_gl_insert_~node~1#1.base|) .cse2)))))) (not (= |c_ULTIMATE.start_gl_insert_~node~1#1.base| |c_~#gl_list~0.base|)) (not (= (_ bv3 32) .cse3)) (= (_ bv3 32) |c_~#gl_list~0.base|) (= |c_~#gl_list~0.offset| (_ bv0 32)) (or (exists ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store (store (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_4) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_5) |c_~#gl_list~0.base| v_DerPreprocessor_6) .cse3 v_DerPreprocessor_4) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_5) |c_~#gl_list~0.base| v_DerPreprocessor_6))) (let ((.cse9 (select .cse10 .cse3))) (and (= .cse9 v_DerPreprocessor_4) (= (store .cse9 |c_~#gl_list~0.offset| .cse4) v_DerPreprocessor_6) (= .cse9 .cse6) (= .cse2 (select .cse10 |c_ULTIMATE.start_gl_insert_~node~1#1.base|)))))) (and (exists ((v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse11 (store (store (store (store (store (store |c_#memory_$Pointer$.base| .cse3 v_DerPreprocessor_4) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_5) |c_~#gl_list~0.base| v_DerPreprocessor_6) .cse3 v_DerPreprocessor_4) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_DerPreprocessor_5) |c_~#gl_list~0.base| v_DerPreprocessor_6))) (and (= .cse4 (select v_DerPreprocessor_6 |c_~#gl_list~0.offset|)) (= (select .cse11 .cse3) v_DerPreprocessor_4) (= .cse2 (select .cse11 |c_ULTIMATE.start_gl_insert_~node~1#1.base|))))) .cse0)))))) is different from true [2023-02-15 01:25:17,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:25:17,895 INFO L93 Difference]: Finished difference Result 577 states and 661 transitions. [2023-02-15 01:25:17,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-02-15 01:25:17,896 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.6875) internal successors, (54), 26 states have internal predecessors, (54), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 52 [2023-02-15 01:25:17,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:25:17,897 INFO L225 Difference]: With dead ends: 577 [2023-02-15 01:25:17,897 INFO L226 Difference]: Without dead ends: 577 [2023-02-15 01:25:17,898 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 95 SyntacticMatches, 7 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 624 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=323, Invalid=2471, Unknown=184, NotChecked=214, Total=3192 [2023-02-15 01:25:17,898 INFO L413 NwaCegarLoop]: 89 mSDtfsCounter, 857 mSDsluCounter, 1439 mSDsCounter, 0 mSdLazyCounter, 3081 mSolverCounterSat, 97 mSolverCounterUnsat, 423 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 1528 SdHoareTripleChecker+Invalid, 3911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 3081 IncrementalHoareTripleChecker+Invalid, 423 IncrementalHoareTripleChecker+Unknown, 310 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2023-02-15 01:25:17,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 1528 Invalid, 3911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 3081 Invalid, 423 Unknown, 310 Unchecked, 8.7s Time] [2023-02-15 01:25:17,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2023-02-15 01:25:17,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 473. [2023-02-15 01:25:17,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 385 states have (on average 1.3974025974025974) internal successors, (538), 443 states have internal predecessors, (538), 32 states have call successors, (32), 13 states have call predecessors, (32), 12 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2023-02-15 01:25:17,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 589 transitions. [2023-02-15 01:25:17,905 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 589 transitions. Word has length 52 [2023-02-15 01:25:17,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:25:17,905 INFO L495 AbstractCegarLoop]: Abstraction has 473 states and 589 transitions. [2023-02-15 01:25:17,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.6875) internal successors, (54), 26 states have internal predecessors, (54), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 01:25:17,906 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 589 transitions. [2023-02-15 01:25:17,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-15 01:25:17,906 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:25:17,906 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] [2023-02-15 01:25:17,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (33)] Ended with exit code 0 [2023-02-15 01:25:18,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (32)] Forceful destruction successful, exit code 0 [2023-02-15 01:25:18,323 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:25:18,324 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:25:18,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:25:18,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1989130177, now seen corresponding path program 1 times [2023-02-15 01:25:18,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:25:18,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237214] [2023-02-15 01:25:18,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:25:18,324 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:25:18,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:25:18,325 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:25:18,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Waiting until timeout for monitored process [2023-02-15 01:25:18,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:25:18,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 70 conjunts are in the unsatisfiable core [2023-02-15 01:25:18,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:25:18,683 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:25:18,684 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 01:25:18,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:25:18,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:25:18,775 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:25:18,779 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:25:20,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:25:20,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 134 treesize of output 93 [2023-02-15 01:25:20,250 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:25:20,279 INFO L321 Elim1Store]: treesize reduction 44, result has 6.4 percent of original size [2023-02-15 01:25:20,280 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 104 treesize of output 95 [2023-02-15 01:25:20,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:25:20,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 76 [2023-02-15 01:25:20,306 INFO L321 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2023-02-15 01:25:20,306 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 51 [2023-02-15 01:25:20,313 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:25:20,316 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2023-02-15 01:25:20,321 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:25:20,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2023-02-15 01:25:20,431 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 01:25:20,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2023-02-15 01:25:20,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:25:20,467 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 35 [2023-02-15 01:25:20,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2023-02-15 01:25:21,581 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:25:21,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:25:21,589 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 01:25:21,589 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 27 [2023-02-15 01:25:21,599 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 01:25:21,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 18 [2023-02-15 01:25:21,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:25:21,682 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:25:21,682 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:25:21,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1237214] [2023-02-15 01:25:21,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1237214] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:25:21,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:25:21,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-02-15 01:25:21,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943716585] [2023-02-15 01:25:21,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:25:21,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 01:25:21,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:25:21,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 01:25:21,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=326, Unknown=12, NotChecked=0, Total=380 [2023-02-15 01:25:21,684 INFO L87 Difference]: Start difference. First operand 473 states and 589 transitions. Second operand has 20 states, 20 states have (on average 2.4) internal successors, (48), 17 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:25:33,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:25:33,271 INFO L93 Difference]: Finished difference Result 519 states and 623 transitions. [2023-02-15 01:25:33,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 01:25:33,272 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 17 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 52 [2023-02-15 01:25:33,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:25:33,273 INFO L225 Difference]: With dead ends: 519 [2023-02-15 01:25:33,273 INFO L226 Difference]: Without dead ends: 519 [2023-02-15 01:25:33,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=146, Invalid=949, Unknown=27, NotChecked=0, Total=1122 [2023-02-15 01:25:33,274 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 407 mSDsluCounter, 1575 mSDsCounter, 0 mSdLazyCounter, 2104 mSolverCounterSat, 32 mSolverCounterUnsat, 98 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 407 SdHoareTripleChecker+Valid, 1694 SdHoareTripleChecker+Invalid, 2234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2104 IncrementalHoareTripleChecker+Invalid, 98 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2023-02-15 01:25:33,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [407 Valid, 1694 Invalid, 2234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2104 Invalid, 98 Unknown, 0 Unchecked, 9.5s Time] [2023-02-15 01:25:33,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2023-02-15 01:25:33,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 473. [2023-02-15 01:25:33,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 385 states have (on average 1.3948051948051947) internal successors, (537), 443 states have internal predecessors, (537), 32 states have call successors, (32), 13 states have call predecessors, (32), 12 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2023-02-15 01:25:33,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 588 transitions. [2023-02-15 01:25:33,281 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 588 transitions. Word has length 52 [2023-02-15 01:25:33,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:25:33,281 INFO L495 AbstractCegarLoop]: Abstraction has 473 states and 588 transitions. [2023-02-15 01:25:33,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.4) internal successors, (48), 17 states have internal predecessors, (48), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:25:33,281 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 588 transitions. [2023-02-15 01:25:33,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-02-15 01:25:33,282 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:25:33,282 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] [2023-02-15 01:25:33,312 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (34)] Forceful destruction successful, exit code 0 [2023-02-15 01:25:33,491 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:25:33,491 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:25:33,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:25:33,492 INFO L85 PathProgramCache]: Analyzing trace with hash -749843176, now seen corresponding path program 1 times [2023-02-15 01:25:33,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:25:33,492 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [276187926] [2023-02-15 01:25:33,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:25:33,492 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:25:33,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:25:33,493 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:25:33,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Waiting until timeout for monitored process [2023-02-15 01:25:33,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:25:33,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 01:25:33,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:25:33,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2023-02-15 01:25:33,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-02-15 01:25:33,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:25:33,856 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:25:33,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:25:33,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [276187926] [2023-02-15 01:25:33,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [276187926] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:25:33,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:25:33,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-02-15 01:25:33,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483305335] [2023-02-15 01:25:33,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:25:33,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 01:25:33,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:25:33,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 01:25:33,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:25:33,858 INFO L87 Difference]: Start difference. First operand 473 states and 588 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:25:34,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:25:34,834 INFO L93 Difference]: Finished difference Result 472 states and 583 transitions. [2023-02-15 01:25:34,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 01:25:34,835 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2023-02-15 01:25:34,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:25:34,837 INFO L225 Difference]: With dead ends: 472 [2023-02-15 01:25:34,837 INFO L226 Difference]: Without dead ends: 472 [2023-02-15 01:25:34,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2023-02-15 01:25:34,838 INFO L413 NwaCegarLoop]: 157 mSDtfsCounter, 155 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-02-15 01:25:34,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 846 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-02-15 01:25:34,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2023-02-15 01:25:34,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2023-02-15 01:25:34,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 385 states have (on average 1.3844155844155843) internal successors, (533), 442 states have internal predecessors, (533), 31 states have call successors, (31), 13 states have call predecessors, (31), 12 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2023-02-15 01:25:34,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 583 transitions. [2023-02-15 01:25:34,845 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 583 transitions. Word has length 55 [2023-02-15 01:25:34,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:25:34,845 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 583 transitions. [2023-02-15 01:25:34,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:25:34,846 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 583 transitions. [2023-02-15 01:25:34,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 01:25:34,846 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:25:34,846 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:25:34,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (35)] Forceful destruction successful, exit code 0 [2023-02-15 01:25:35,053 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:25:35,054 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:25:35,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:25:35,054 INFO L85 PathProgramCache]: Analyzing trace with hash 362585137, now seen corresponding path program 1 times [2023-02-15 01:25:35,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:25:35,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1583044128] [2023-02-15 01:25:35,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:25:35,055 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:25:35,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:25:35,056 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:25:35,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Waiting until timeout for monitored process [2023-02-15 01:25:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:25:35,423 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 82 conjunts are in the unsatisfiable core [2023-02-15 01:25:35,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:25:35,516 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-02-15 01:25:35,517 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 53 [2023-02-15 01:25:35,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:25:35,587 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:25:35,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:25:35,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:25:36,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:25:36,638 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 44 [2023-02-15 01:25:36,642 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:25:36,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2023-02-15 01:25:36,651 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-15 01:25:36,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:25:36,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2023-02-15 01:25:36,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-15 01:25:36,864 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:25:36,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 46 [2023-02-15 01:25:37,114 INFO L321 Elim1Store]: treesize reduction 92, result has 31.3 percent of original size [2023-02-15 01:25:37,114 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 42 treesize of output 77 [2023-02-15 01:25:37,317 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2023-02-15 01:25:37,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:25:37,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2023-02-15 01:25:38,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:25:38,999 INFO L321 Elim1Store]: treesize reduction 66, result has 14.3 percent of original size [2023-02-15 01:25:39,000 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 139 [2023-02-15 01:25:39,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:25:39,010 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 105 [2023-02-15 01:25:39,074 INFO L321 Elim1Store]: treesize reduction 28, result has 34.9 percent of original size [2023-02-15 01:25:39,074 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 38 [2023-02-15 01:25:39,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:25:39,396 INFO L321 Elim1Store]: treesize reduction 31, result has 13.9 percent of original size [2023-02-15 01:25:39,396 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 524 treesize of output 394 [2023-02-15 01:25:39,432 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:39,435 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:39,437 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:39,459 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:39,465 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:39,469 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:39,471 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:39,476 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:39,478 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:39,480 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:39,484 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:39,518 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:25:39,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2023-02-15 01:25:40,194 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2023-02-15 01:25:40,389 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:25:40,389 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:25:40,887 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1996 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_1996) |c_~#gl_list~0.base|) (bvadd (_ bv4 32) |c_~#gl_list~0.offset|)) (_ bv0 32)))) is different from false [2023-02-15 01:25:41,317 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:25:41,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1583044128] [2023-02-15 01:25:41,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1583044128] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:25:41,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1666652001] [2023-02-15 01:25:41,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:25:41,317 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 01:25:41,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 01:25:41,318 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 01:25:41,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (37)] Waiting until timeout for monitored process [2023-02-15 01:25:42,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:25:42,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 78 conjunts are in the unsatisfiable core [2023-02-15 01:25:42,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:25:42,495 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:25:42,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 01:25:42,619 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:25:42,627 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:25:42,642 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:25:42,646 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:25:44,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:25:44,038 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 44 [2023-02-15 01:25:44,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:25:44,054 INFO L321 Elim1Store]: treesize reduction 44, result has 6.4 percent of original size [2023-02-15 01:25:44,054 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 38 [2023-02-15 01:25:44,059 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-15 01:25:44,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:25:44,064 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2023-02-15 01:25:44,175 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-15 01:25:44,197 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:25:44,197 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 37 [2023-02-15 01:25:44,333 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:25:44,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 01:25:44,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2023-02-15 01:25:44,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:25:44,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2023-02-15 01:25:45,774 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:25:45,830 INFO L321 Elim1Store]: treesize reduction 58, result has 24.7 percent of original size [2023-02-15 01:25:45,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 88 treesize of output 132 [2023-02-15 01:25:45,835 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:25:45,838 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 95 [2023-02-15 01:25:45,858 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2023-02-15 01:25:45,913 INFO L321 Elim1Store]: treesize reduction 25, result has 35.9 percent of original size [2023-02-15 01:25:45,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 148 treesize of output 81 [2023-02-15 01:25:45,929 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-02-15 01:25:46,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2023-02-15 01:25:46,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 27 [2023-02-15 01:25:46,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-02-15 01:25:46,706 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:25:46,706 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:25:47,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1666652001] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:25:47,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:25:47,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 54 [2023-02-15 01:25:47,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569456534] [2023-02-15 01:25:47,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:25:47,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2023-02-15 01:25:47,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:25:47,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2023-02-15 01:25:47,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=3516, Unknown=129, NotChecked=122, Total=4032 [2023-02-15 01:25:47,650 INFO L87 Difference]: Start difference. First operand 472 states and 583 transitions. Second operand has 55 states, 55 states have (on average 1.8) internal successors, (99), 47 states have internal predecessors, (99), 7 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 01:26:07,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:26:07,685 INFO L93 Difference]: Finished difference Result 627 states and 733 transitions. [2023-02-15 01:26:07,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2023-02-15 01:26:07,685 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.8) internal successors, (99), 47 states have internal predecessors, (99), 7 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 56 [2023-02-15 01:26:07,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:26:07,687 INFO L225 Difference]: With dead ends: 627 [2023-02-15 01:26:07,687 INFO L226 Difference]: Without dead ends: 627 [2023-02-15 01:26:07,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 93 SyntacticMatches, 4 SemanticMatches, 88 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1898 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=703, Invalid=6944, Unknown=189, NotChecked=174, Total=8010 [2023-02-15 01:26:07,689 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 1181 mSDsluCounter, 2116 mSDsCounter, 0 mSdLazyCounter, 5008 mSolverCounterSat, 84 mSolverCounterUnsat, 277 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1185 SdHoareTripleChecker+Valid, 2207 SdHoareTripleChecker+Invalid, 5369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 5008 IncrementalHoareTripleChecker+Invalid, 277 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.5s IncrementalHoareTripleChecker+Time [2023-02-15 01:26:07,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1185 Valid, 2207 Invalid, 5369 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [84 Valid, 5008 Invalid, 277 Unknown, 0 Unchecked, 13.5s Time] [2023-02-15 01:26:07,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2023-02-15 01:26:07,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 529. [2023-02-15 01:26:07,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 441 states have (on average 1.3945578231292517) internal successors, (615), 498 states have internal predecessors, (615), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (19), 16 states have call predecessors, (19), 19 states have call successors, (19) [2023-02-15 01:26:07,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 665 transitions. [2023-02-15 01:26:07,695 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 665 transitions. Word has length 56 [2023-02-15 01:26:07,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:26:07,695 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 665 transitions. [2023-02-15 01:26:07,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.8) internal successors, (99), 47 states have internal predecessors, (99), 7 states have call successors, (7), 7 states have call predecessors, (7), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 01:26:07,696 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 665 transitions. [2023-02-15 01:26:07,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-02-15 01:26:07,696 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:26:07,696 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:26:07,710 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (37)] Ended with exit code 0 [2023-02-15 01:26:07,913 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (36)] Forceful destruction successful, exit code 0 [2023-02-15 01:26:08,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:26:08,102 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting inspectErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [val_from_nodeErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, val_from_nodeErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, failErr0ASSERT_VIOLATIONMEMORY_LEAK (and 68 more)] === [2023-02-15 01:26:08,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:26:08,103 INFO L85 PathProgramCache]: Analyzing trace with hash 362574494, now seen corresponding path program 1 times [2023-02-15 01:26:08,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:26:08,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [5387390] [2023-02-15 01:26:08,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:26:08,103 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:26:08,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:26:08,104 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:26:08,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (38)] Waiting until timeout for monitored process [2023-02-15 01:26:08,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:26:08,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 80 conjunts are in the unsatisfiable core [2023-02-15 01:26:08,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:26:08,617 INFO L321 Elim1Store]: treesize reduction 66, result has 34.0 percent of original size [2023-02-15 01:26:08,617 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 59 [2023-02-15 01:26:08,694 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:26:08,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:26:08,718 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:26:08,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:26:09,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:26:09,831 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 44 [2023-02-15 01:26:09,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:26:09,850 INFO L321 Elim1Store]: treesize reduction 44, result has 6.4 percent of original size [2023-02-15 01:26:09,850 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 38 [2023-02-15 01:26:09,856 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-15 01:26:09,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:26:09,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2023-02-15 01:26:09,983 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-15 01:26:10,020 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:26:10,020 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 62 [2023-02-15 01:26:10,256 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-02-15 01:26:10,257 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 40 treesize of output 46 [2023-02-15 01:26:10,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 52 [2023-02-15 01:26:10,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:26:10,452 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 16 [2023-02-15 01:26:11,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:26:11,265 INFO L321 Elim1Store]: treesize reduction 66, result has 14.3 percent of original size [2023-02-15 01:26:11,265 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 153 [2023-02-15 01:26:11,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:26:11,272 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 143 treesize of output 109 [2023-02-15 01:26:11,285 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 35 [2023-02-15 01:26:11,406 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2023-02-15 01:26:11,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 54 [2023-02-15 01:26:11,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2023-02-15 01:26:12,034 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:26:12,034 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:26:14,825 INFO L321 Elim1Store]: treesize reduction 7, result has 86.3 percent of original size [2023-02-15 01:26:14,826 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 56 [2023-02-15 01:26:15,042 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:26:15,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [5387390] [2023-02-15 01:26:15,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [5387390] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:26:15,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [647841659] [2023-02-15 01:26:15,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:26:15,057 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 01:26:15,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 01:26:15,061 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 01:26:15,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (39)] Waiting until timeout for monitored process [2023-02-15 01:26:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:26:15,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 81 conjunts are in the unsatisfiable core [2023-02-15 01:26:15,998 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:26:16,130 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-02-15 01:26:16,130 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2023-02-15 01:26:16,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:26:16,270 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 01:26:16,295 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:26:16,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:26:17,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:26:17,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 44 [2023-02-15 01:26:17,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:26:17,991 INFO L321 Elim1Store]: treesize reduction 44, result has 6.4 percent of original size [2023-02-15 01:26:17,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 38 [2023-02-15 01:26:17,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-15 01:26:18,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:26:18,002 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2023-02-15 01:26:18,180 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-15 01:26:18,218 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 01:26:18,219 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 46 [2023-02-15 01:26:18,437 INFO L321 Elim1Store]: treesize reduction 78, result has 35.0 percent of original size [2023-02-15 01:26:18,437 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 37 treesize of output 67 [2023-02-15 01:26:18,628 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 47 [2023-02-15 01:26:18,684 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:26:18,685 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 23 [2023-02-15 01:26:20,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:26:20,681 INFO L321 Elim1Store]: treesize reduction 66, result has 14.3 percent of original size [2023-02-15 01:26:20,681 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 107 treesize of output 139 [2023-02-15 01:26:20,686 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:26:20,687 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 105 [2023-02-15 01:26:20,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 35 [2023-02-15 01:26:21,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2023-02-15 01:26:21,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 46 [2023-02-15 01:26:21,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 23 [2023-02-15 01:26:22,387 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:26:22,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:26:24,898 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2419 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2420 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2270 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2421 (_ BitVec 32))) (= (bvadd (select |c_#valid| (select (select (store (let ((.cse0 (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_~#gl_list~0.base|) |c_~#gl_list~0.offset|) v_ArrVal_2419) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2420))) (store .cse0 |c_~#gl_list~0.base| (store (select .cse0 |c_~#gl_list~0.base|) |c_~#gl_list~0.offset| v_ArrVal_2421))) |c_ULTIMATE.start_gl_insert_~node~1#1.base| v_ArrVal_2270) |c_~#gl_list~0.base|) (bvadd (_ bv4 32) |c_~#gl_list~0.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-02-15 01:26:24,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [647841659] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:26:24,900 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:26:24,900 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 52 [2023-02-15 01:26:24,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865106432] [2023-02-15 01:26:24,900 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:26:24,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-02-15 01:26:24,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:26:24,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-02-15 01:26:24,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=3350, Unknown=94, NotChecked=118, Total=3782 [2023-02-15 01:26:24,902 INFO L87 Difference]: Start difference. First operand 529 states and 665 transitions. Second operand has 54 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 47 states have internal predecessors, (102), 6 states have call successors, (6), 6 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)