./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0102-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/memsafety/test-0102-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 fa260939b291574cde59d3c10d7828de68c26744f55119227115b01940792a6f --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-15 01:01:27,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 01:01:27,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 01:01:27,478 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 01:01:27,481 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 01:01:27,484 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 01:01:27,485 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 01:01:27,487 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 01:01:27,488 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 01:01:27,491 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 01:01:27,493 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 01:01:27,494 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 01:01:27,495 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 01:01:27,496 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 01:01:27,497 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 01:01:27,498 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 01:01:27,499 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 01:01:27,501 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 01:01:27,502 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 01:01:27,504 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 01:01:27,505 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 01:01:27,506 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 01:01:27,507 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 01:01:27,508 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 01:01:27,513 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 01:01:27,515 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 01:01:27,515 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 01:01:27,516 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 01:01:27,516 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 01:01:27,517 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 01:01:27,517 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 01:01:27,518 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 01:01:27,519 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 01:01:27,520 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 01:01:27,521 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 01:01:27,521 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 01:01:27,522 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 01:01:27,522 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 01:01:27,522 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 01:01:27,523 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 01:01:27,524 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 01:01:27,524 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:01:27,546 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 01:01:27,547 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 01:01:27,547 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 01:01:27,547 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 01:01:27,548 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 01:01:27,548 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 01:01:27,548 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 01:01:27,548 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 01:01:27,549 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 01:01:27,549 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 01:01:27,549 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 01:01:27,549 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 01:01:27,549 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 01:01:27,549 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 01:01:27,549 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 01:01:27,550 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 01:01:27,550 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 01:01:27,550 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 01:01:27,550 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 01:01:27,550 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 01:01:27,550 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 01:01:27,551 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 01:01:27,551 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 01:01:27,551 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 01:01:27,551 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 01:01:27,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:01:27,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 01:01:27,552 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 01:01:27,552 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 01:01:27,553 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 01:01:27,553 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 01:01:27,553 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 01:01:27,553 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 01:01:27,553 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 01:01:27,553 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 -> fa260939b291574cde59d3c10d7828de68c26744f55119227115b01940792a6f [2023-02-15 01:01:27,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 01:01:27,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 01:01:27,779 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 01:01:27,780 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 01:01:27,780 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 01:01:27,781 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0102-1.i [2023-02-15 01:01:28,826 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 01:01:29,137 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 01:01:29,139 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0102-1.i [2023-02-15 01:01:29,154 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d12e700a/c84060b9b6834decb5187e86caa5703e/FLAGb9620e8c2 [2023-02-15 01:01:29,166 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d12e700a/c84060b9b6834decb5187e86caa5703e [2023-02-15 01:01:29,171 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 01:01:29,172 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 01:01:29,175 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 01:01:29,175 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 01:01:29,177 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 01:01:29,177 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:01:29" (1/1) ... [2023-02-15 01:01:29,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3df22978 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:29, skipping insertion in model container [2023-02-15 01:01:29,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:01:29" (1/1) ... [2023-02-15 01:01:29,182 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 01:01:29,208 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 01:01:29,395 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:01:29,412 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:01:29,413 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@44f2eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:29, skipping insertion in model container [2023-02-15 01:01:29,413 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 01:01:29,414 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-15 01:01:29,416 INFO L158 Benchmark]: Toolchain (without parser) took 243.40ms. Allocated memory is still 172.0MB. Free memory was 132.7MB in the beginning and 120.8MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 01:01:29,416 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 172.0MB. Free memory was 112.7MB in the beginning and 112.5MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 01:01:29,417 INFO L158 Benchmark]: CACSL2BoogieTranslator took 239.63ms. Allocated memory is still 172.0MB. Free memory was 132.7MB in the beginning and 120.8MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-15 01:01:29,418 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 172.0MB. Free memory was 112.7MB in the beginning and 112.5MB in the end (delta: 159.5kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 239.63ms. Allocated memory is still 172.0MB. Free memory was 132.7MB in the beginning and 120.8MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 551]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0102-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 fa260939b291574cde59d3c10d7828de68c26744f55119227115b01940792a6f --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-15 01:01:31,048 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 01:01:31,050 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 01:01:31,068 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 01:01:31,069 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 01:01:31,070 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 01:01:31,070 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 01:01:31,072 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 01:01:31,073 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 01:01:31,073 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 01:01:31,074 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 01:01:31,075 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 01:01:31,075 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 01:01:31,076 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 01:01:31,076 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 01:01:31,077 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 01:01:31,078 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 01:01:31,078 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 01:01:31,079 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 01:01:31,080 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 01:01:31,081 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 01:01:31,082 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 01:01:31,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 01:01:31,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 01:01:31,086 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 01:01:31,086 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 01:01:31,086 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 01:01:31,087 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 01:01:31,087 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 01:01:31,088 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 01:01:31,088 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 01:01:31,089 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 01:01:31,089 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 01:01:31,090 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 01:01:31,091 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 01:01:31,091 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 01:01:31,092 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 01:01:31,092 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 01:01:31,092 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 01:01:31,093 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 01:01:31,093 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 01:01:31,094 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:01:31,110 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 01:01:31,110 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 01:01:31,110 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 01:01:31,111 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 01:01:31,111 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 01:01:31,111 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 01:01:31,112 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 01:01:31,112 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 01:01:31,112 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 01:01:31,112 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 01:01:31,113 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 01:01:31,113 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 01:01:31,113 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 01:01:31,113 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 01:01:31,113 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 01:01:31,113 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 01:01:31,114 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 01:01:31,114 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 01:01:31,114 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 01:01:31,114 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 01:01:31,114 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 01:01:31,114 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 01:01:31,115 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 01:01:31,115 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 01:01:31,115 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 01:01:31,115 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 01:01:31,115 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 01:01:31,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:01:31,116 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 01:01:31,116 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 01:01:31,116 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 01:01:31,116 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 01:01:31,116 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 01:01:31,117 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 01:01:31,117 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 01:01:31,117 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 01:01:31,121 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 01:01:31,121 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 -> fa260939b291574cde59d3c10d7828de68c26744f55119227115b01940792a6f [2023-02-15 01:01:31,344 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 01:01:31,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 01:01:31,374 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 01:01:31,375 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 01:01:31,375 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 01:01:31,376 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0102-1.i [2023-02-15 01:01:32,483 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 01:01:32,804 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 01:01:32,806 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0102-1.i [2023-02-15 01:01:32,822 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/935636ea1/9b3f8ff9d8824825985e6a6e2ebabedf/FLAG35b78ec74 [2023-02-15 01:01:32,840 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/935636ea1/9b3f8ff9d8824825985e6a6e2ebabedf [2023-02-15 01:01:32,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 01:01:32,843 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 01:01:32,845 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 01:01:32,845 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 01:01:32,847 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 01:01:32,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:01:32" (1/1) ... [2023-02-15 01:01:32,850 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@706eb9e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:32, skipping insertion in model container [2023-02-15 01:01:32,850 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:01:32" (1/1) ... [2023-02-15 01:01:32,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 01:01:32,892 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 01:01:33,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:01:33,154 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-15 01:01:33,162 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 01:01:33,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:01:33,214 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 01:01:33,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 01:01:33,281 INFO L208 MainTranslator]: Completed translation [2023-02-15 01:01:33,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:33 WrapperNode [2023-02-15 01:01:33,281 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 01:01:33,282 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 01:01:33,282 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 01:01:33,282 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 01:01:33,287 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:01:33" (1/1) ... [2023-02-15 01:01:33,310 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:01:33" (1/1) ... [2023-02-15 01:01:33,336 INFO L138 Inliner]: procedures = 136, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 86 [2023-02-15 01:01:33,337 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 01:01:33,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 01:01:33,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 01:01:33,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 01:01:33,343 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:33" (1/1) ... [2023-02-15 01:01:33,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:33" (1/1) ... [2023-02-15 01:01:33,346 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:33" (1/1) ... [2023-02-15 01:01:33,347 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:33" (1/1) ... [2023-02-15 01:01:33,353 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:33" (1/1) ... [2023-02-15 01:01:33,355 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:33" (1/1) ... [2023-02-15 01:01:33,356 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:33" (1/1) ... [2023-02-15 01:01:33,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:33" (1/1) ... [2023-02-15 01:01:33,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 01:01:33,360 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 01:01:33,360 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 01:01:33,360 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 01:01:33,360 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:33" (1/1) ... [2023-02-15 01:01:33,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 01:01:33,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:01:33,412 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:01:33,427 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:01:33,443 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2023-02-15 01:01:33,443 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2023-02-15 01:01:33,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 01:01:33,447 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 01:01:33,447 INFO L130 BoogieDeclarations]: Found specification of procedure create_sub_list [2023-02-15 01:01:33,447 INFO L138 BoogieDeclarations]: Found implementation of procedure create_sub_list [2023-02-15 01:01:33,448 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 01:01:33,448 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 01:01:33,448 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 01:01:33,448 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_sub [2023-02-15 01:01:33,448 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_sub [2023-02-15 01:01:33,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-15 01:01:33,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 01:01:33,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 01:01:33,449 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-15 01:01:33,449 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 01:01:33,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 01:01:33,531 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 01:01:33,533 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 01:01:33,801 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 01:01:33,806 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 01:01:33,806 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-15 01:01:33,807 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:01:33 BoogieIcfgContainer [2023-02-15 01:01:33,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 01:01:33,809 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 01:01:33,809 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 01:01:33,811 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 01:01:33,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:01:32" (1/3) ... [2023-02-15 01:01:33,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@164de3f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:01:33, skipping insertion in model container [2023-02-15 01:01:33,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:01:33" (2/3) ... [2023-02-15 01:01:33,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@164de3f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:01:33, skipping insertion in model container [2023-02-15 01:01:33,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:01:33" (3/3) ... [2023-02-15 01:01:33,813 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0102-1.i [2023-02-15 01:01:33,825 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 01:01:33,825 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2023-02-15 01:01:33,861 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 01:01:33,865 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;@42e29168, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 01:01:33,865 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-02-15 01:01:33,868 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 46 states have (on average 1.891304347826087) internal successors, (87), 77 states have internal predecessors, (87), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:01:33,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-15 01:01:33,872 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:01:33,872 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-15 01:01:33,873 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:01:33,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:01:33,878 INFO L85 PathProgramCache]: Analyzing trace with hash 106012329, now seen corresponding path program 1 times [2023-02-15 01:01:33,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:01:33,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425870904] [2023-02-15 01:01:33,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:01:33,888 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:01:33,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:01:33,891 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:01:33,905 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:01:33,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:01:33,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-15 01:01:33,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:01:34,000 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:01:34,000 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:01:34,001 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:01:34,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425870904] [2023-02-15 01:01:34,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [425870904] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:01:34,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:01:34,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:01:34,003 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600277244] [2023-02-15 01:01:34,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:01:34,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-15 01:01:34,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:01:34,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-15 01:01:34,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-15 01:01:34,032 INFO L87 Difference]: Start difference. First operand has 87 states, 46 states have (on average 1.891304347826087) internal successors, (87), 77 states have internal predecessors, (87), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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:01:34,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:01:34,054 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2023-02-15 01:01:34,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-15 01:01:34,056 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:01:34,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:01:34,061 INFO L225 Difference]: With dead ends: 87 [2023-02-15 01:01:34,061 INFO L226 Difference]: Without dead ends: 85 [2023-02-15 01:01:34,062 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:01:34,065 INFO L413 NwaCegarLoop]: 93 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, 93 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:01:34,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 01:01:34,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-15 01:01:34,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-02-15 01:01:34,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 45 states have (on average 1.7555555555555555) internal successors, (79), 75 states have internal predecessors, (79), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:01:34,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2023-02-15 01:01:34,098 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 5 [2023-02-15 01:01:34,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:01:34,098 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2023-02-15 01:01:34,098 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:01:34,099 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2023-02-15 01:01:34,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 01:01:34,099 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:01:34,099 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:01:34,125 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 (2)] Forceful destruction successful, exit code 0 [2023-02-15 01:01:34,307 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:01:34,308 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:01:34,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:01:34,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1219357814, now seen corresponding path program 1 times [2023-02-15 01:01:34,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:01:34,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2097138620] [2023-02-15 01:01:34,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:01:34,309 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:01:34,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:01:34,311 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:01:34,313 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:01:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:01:34,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 01:01:34,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:01:34,389 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:01:34,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:01:34,423 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:01:34,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:01:34,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2097138620] [2023-02-15 01:01:34,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2097138620] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:01:34,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:01:34,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:01:34,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645416190] [2023-02-15 01:01:34,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:01:34,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:01:34,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:01:34,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:01:34,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:01:34,426 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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:01:34,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:01:34,652 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2023-02-15 01:01:34,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:01:34,660 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 7 [2023-02-15 01:01:34,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:01:34,662 INFO L225 Difference]: With dead ends: 91 [2023-02-15 01:01:34,662 INFO L226 Difference]: Without dead ends: 91 [2023-02-15 01:01:34,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:01:34,663 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 39 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:01:34,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 190 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:01:34,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-15 01:01:34,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 83. [2023-02-15 01:01:34,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 45 states have (on average 1.711111111111111) internal successors, (77), 73 states have internal predecessors, (77), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:01:34,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2023-02-15 01:01:34,670 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 7 [2023-02-15 01:01:34,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:01:34,670 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2023-02-15 01:01:34,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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:01:34,670 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2023-02-15 01:01:34,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-15 01:01:34,671 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:01:34,671 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:01:34,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 (3)] Forceful destruction successful, exit code 0 [2023-02-15 01:01:34,878 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:01:34,879 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:01:34,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:01:34,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1219357813, now seen corresponding path program 1 times [2023-02-15 01:01:34,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:01:34,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [162916027] [2023-02-15 01:01:34,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:01:34,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:01:34,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:01:34,901 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:01:34,920 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:01:34,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:01:34,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-15 01:01:34,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:01:34,974 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:01:35,014 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:01:35,014 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:01:35,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:01:35,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [162916027] [2023-02-15 01:01:35,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [162916027] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:01:35,015 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:01:35,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 01:01:35,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562278819] [2023-02-15 01:01:35,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:01:35,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 01:01:35,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:01:35,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 01:01:35,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 01:01:35,017 INFO L87 Difference]: Start difference. First operand 83 states and 89 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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:01:35,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:01:35,163 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2023-02-15 01:01:35,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 01:01:35,164 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 7 [2023-02-15 01:01:35,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:01:35,164 INFO L225 Difference]: With dead ends: 87 [2023-02-15 01:01:35,165 INFO L226 Difference]: Without dead ends: 87 [2023-02-15 01:01:35,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:01:35,165 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 5 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:01:35,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 254 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:01:35,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-15 01:01:35,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2023-02-15 01:01:35,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 75 states have internal predecessors, (80), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:01:35,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2023-02-15 01:01:35,171 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 7 [2023-02-15 01:01:35,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:01:35,171 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2023-02-15 01:01:35,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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:01:35,171 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2023-02-15 01:01:35,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 01:01:35,172 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:01:35,172 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:01:35,193 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:01:35,379 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:01:35,379 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting create_sub_listErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:01:35,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:01:35,380 INFO L85 PathProgramCache]: Analyzing trace with hash -778231822, now seen corresponding path program 1 times [2023-02-15 01:01:35,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:01:35,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [604765631] [2023-02-15 01:01:35,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:01:35,381 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:01:35,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:01:35,382 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:01:35,384 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:01:35,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:01:35,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 01:01:35,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:01:35,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 01:01:35,464 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:01:35,464 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:01:35,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:01:35,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [604765631] [2023-02-15 01:01:35,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [604765631] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:01:35,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:01:35,468 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:01:35,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071585984] [2023-02-15 01:01:35,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:01:35,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:01:35,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:01:35,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:01:35,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:01:35,469 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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:01:35,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:01:35,562 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2023-02-15 01:01:35,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:01:35,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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:01:35,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:01:35,564 INFO L225 Difference]: With dead ends: 86 [2023-02-15 01:01:35,564 INFO L226 Difference]: Without dead ends: 86 [2023-02-15 01:01:35,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:01:35,564 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 6 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:01:35,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 132 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:01:35,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-15 01:01:35,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2023-02-15 01:01:35,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 74 states have internal predecessors, (79), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:01:35,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2023-02-15 01:01:35,572 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 11 [2023-02-15 01:01:35,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:01:35,573 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2023-02-15 01:01:35,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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:01:35,574 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2023-02-15 01:01:35,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-15 01:01:35,574 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:01:35,574 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:01:35,583 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:01:35,781 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:01:35,782 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting create_sub_listErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:01:35,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:01:35,782 INFO L85 PathProgramCache]: Analyzing trace with hash -778231821, now seen corresponding path program 1 times [2023-02-15 01:01:35,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:01:35,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264319967] [2023-02-15 01:01:35,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:01:35,782 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:01:35,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:01:35,784 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:01:35,786 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:01:35,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:01:35,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 01:01:35,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:01:35,941 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:01:35,952 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:01:35,953 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:01:35,953 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:01:35,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264319967] [2023-02-15 01:01:35,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [264319967] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:01:35,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:01:35,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 01:01:35,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654039082] [2023-02-15 01:01:35,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:01:35,954 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 01:01:35,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:01:35,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 01:01:35,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:01:35,955 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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:01:36,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:01:36,075 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2023-02-15 01:01:36,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 01:01:36,076 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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:01:36,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:01:36,076 INFO L225 Difference]: With dead ends: 85 [2023-02-15 01:01:36,076 INFO L226 Difference]: Without dead ends: 85 [2023-02-15 01:01:36,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 01:01:36,077 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 5 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:01:36,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 136 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:01:36,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-15 01:01:36,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2023-02-15 01:01:36,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 48 states have (on average 1.625) internal successors, (78), 73 states have internal predecessors, (78), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-15 01:01:36,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2023-02-15 01:01:36,081 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 11 [2023-02-15 01:01:36,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:01:36,081 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2023-02-15 01:01:36,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 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:01:36,081 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2023-02-15 01:01:36,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 01:01:36,082 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:01:36,082 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:01:36,105 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:01:36,289 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:01:36,289 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting list_add_tailErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:01:36,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:01:36,289 INFO L85 PathProgramCache]: Analyzing trace with hash -70636768, now seen corresponding path program 1 times [2023-02-15 01:01:36,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:01:36,290 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1864091302] [2023-02-15 01:01:36,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:01:36,291 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:01:36,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:01:36,293 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:01:36,301 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:01:36,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:01:36,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-15 01:01:36,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:01:36,471 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:01:36,475 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:01:36,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:01:36,591 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:01:36,609 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:01:36,610 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:01:36,671 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:01:36,671 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:01:36,671 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:01:36,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1864091302] [2023-02-15 01:01:36,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1864091302] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:01:36,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:01:36,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 01:01:36,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232092729] [2023-02-15 01:01:36,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:01:36,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 01:01:36,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:01:36,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 01:01:36,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:01:36,674 INFO L87 Difference]: Start difference. First operand 84 states and 90 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:01:37,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:01:37,230 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2023-02-15 01:01:37,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 01:01:37,231 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-15 01:01:37,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:01:37,232 INFO L225 Difference]: With dead ends: 112 [2023-02-15 01:01:37,232 INFO L226 Difference]: Without dead ends: 112 [2023-02-15 01:01:37,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-15 01:01:37,233 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 54 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 01:01:37,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 331 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 01:01:37,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-15 01:01:37,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2023-02-15 01:01:37,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 63 states have (on average 1.6349206349206349) internal successors, (103), 89 states have internal predecessors, (103), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 01:01:37,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2023-02-15 01:01:37,241 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 14 [2023-02-15 01:01:37,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:01:37,241 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2023-02-15 01:01:37,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:01:37,241 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2023-02-15 01:01:37,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 01:01:37,242 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:01:37,242 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:01:37,252 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:01:37,450 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:01:37,450 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting list_add_tailErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:01:37,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:01:37,451 INFO L85 PathProgramCache]: Analyzing trace with hash -70636769, now seen corresponding path program 1 times [2023-02-15 01:01:37,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:01:37,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2065441328] [2023-02-15 01:01:37,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:01:37,451 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:01:37,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:01:37,456 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:01:37,457 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:01:37,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:01:37,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 01:01:37,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:01:37,566 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:01:37,605 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 01:01:37,605 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:01:37,674 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:01:37,674 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:01:37,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:01:37,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2065441328] [2023-02-15 01:01:37,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2065441328] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:01:37,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:01:37,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 01:01:37,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741994934] [2023-02-15 01:01:37,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:01:37,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 01:01:37,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:01:37,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 01:01:37,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 01:01:37,677 INFO L87 Difference]: Start difference. First operand 102 states and 117 transitions. Second operand has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:01:37,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:01:37,956 INFO L93 Difference]: Finished difference Result 131 states and 146 transitions. [2023-02-15 01:01:37,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 01:01:37,956 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-15 01:01:37,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:01:37,957 INFO L225 Difference]: With dead ends: 131 [2023-02-15 01:01:37,957 INFO L226 Difference]: Without dead ends: 131 [2023-02-15 01:01:37,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2023-02-15 01:01:37,958 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 87 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:01:37,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 278 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:01:37,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-15 01:01:37,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 112. [2023-02-15 01:01:37,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 72 states have (on average 1.6666666666666667) internal successors, (120), 98 states have internal predecessors, (120), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 01:01:37,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 134 transitions. [2023-02-15 01:01:37,962 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 134 transitions. Word has length 14 [2023-02-15 01:01:37,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:01:37,962 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 134 transitions. [2023-02-15 01:01:37,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:01:37,962 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2023-02-15 01:01:37,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 01:01:37,962 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:01:37,962 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:01:37,975 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:01:38,163 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:01:38,163 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting list_add_tailErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:01:38,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:01:38,164 INFO L85 PathProgramCache]: Analyzing trace with hash 837542848, now seen corresponding path program 1 times [2023-02-15 01:01:38,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:01:38,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658144094] [2023-02-15 01:01:38,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:01:38,164 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:01:38,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:01:38,166 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:01:38,168 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:01:38,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:01:38,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 01:01:38,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:01:38,327 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:01:38,327 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:01:38,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:01:38,327 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [658144094] [2023-02-15 01:01:38,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [658144094] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:01:38,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:01:38,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 01:01:38,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533447452] [2023-02-15 01:01:38,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:01:38,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 01:01:38,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:01:38,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 01:01:38,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 01:01:38,328 INFO L87 Difference]: Start difference. First operand 112 states and 134 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:01:38,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:01:38,409 INFO L93 Difference]: Finished difference Result 111 states and 131 transitions. [2023-02-15 01:01:38,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 01:01:38,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-15 01:01:38,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:01:38,410 INFO L225 Difference]: With dead ends: 111 [2023-02-15 01:01:38,410 INFO L226 Difference]: Without dead ends: 111 [2023-02-15 01:01:38,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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:01:38,411 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 27 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:01:38,411 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 169 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:01:38,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-15 01:01:38,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-02-15 01:01:38,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 72 states have (on average 1.625) internal successors, (117), 97 states have internal predecessors, (117), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 01:01:38,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 131 transitions. [2023-02-15 01:01:38,415 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 131 transitions. Word has length 16 [2023-02-15 01:01:38,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:01:38,415 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 131 transitions. [2023-02-15 01:01:38,415 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:01:38,415 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 131 transitions. [2023-02-15 01:01:38,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 01:01:38,415 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:01:38,415 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:01:38,432 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:01:38,627 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:01:38,627 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting list_add_tailErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:01:38,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:01:38,628 INFO L85 PathProgramCache]: Analyzing trace with hash 837542849, now seen corresponding path program 1 times [2023-02-15 01:01:38,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:01:38,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2009904488] [2023-02-15 01:01:38,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:01:38,628 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:01:38,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:01:38,629 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:01:38,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 (10)] Waiting until timeout for monitored process [2023-02-15 01:01:38,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:01:38,710 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-15 01:01:38,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:01:38,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:01:38,790 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:01:38,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:01:38,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2009904488] [2023-02-15 01:01:38,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2009904488] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:01:38,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:01:38,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-15 01:01:38,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337835792] [2023-02-15 01:01:38,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:01:38,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 01:01:38,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:01:38,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 01:01:38,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-02-15 01:01:38,791 INFO L87 Difference]: Start difference. First operand 111 states and 131 transitions. Second operand has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:01:39,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:01:39,012 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2023-02-15 01:01:39,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 01:01:39,013 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-15 01:01:39,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:01:39,014 INFO L225 Difference]: With dead ends: 119 [2023-02-15 01:01:39,014 INFO L226 Difference]: Without dead ends: 119 [2023-02-15 01:01:39,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2023-02-15 01:01:39,014 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 96 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 511 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:01:39,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 511 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:01:39,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-15 01:01:39,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2023-02-15 01:01:39,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 72 states have (on average 1.6111111111111112) internal successors, (116), 97 states have internal predecessors, (116), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 01:01:39,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 130 transitions. [2023-02-15 01:01:39,018 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 130 transitions. Word has length 16 [2023-02-15 01:01:39,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:01:39,018 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 130 transitions. [2023-02-15 01:01:39,018 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 8 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:01:39,018 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2023-02-15 01:01:39,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 01:01:39,019 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:01:39,019 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:01:39,039 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-15 01:01:39,233 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:01:39,233 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting list_add_tailErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:01:39,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:01:39,233 INFO L85 PathProgramCache]: Analyzing trace with hash 194024551, now seen corresponding path program 1 times [2023-02-15 01:01:39,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:01:39,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [313614817] [2023-02-15 01:01:39,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:01:39,234 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:01:39,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:01:39,235 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:01:39,237 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:01:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:01:39,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 01:01:39,364 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:01:39,370 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:01:39,391 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:01:39,392 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:01:39,392 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:01:39,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [313614817] [2023-02-15 01:01:39,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [313614817] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:01:39,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:01:39,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 01:01:39,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225237878] [2023-02-15 01:01:39,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:01:39,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 01:01:39,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:01:39,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 01:01:39,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:01:39,393 INFO L87 Difference]: Start difference. First operand 111 states and 130 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:01:39,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:01:39,561 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2023-02-15 01:01:39,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 01:01:39,561 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-15 01:01:39,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:01:39,562 INFO L225 Difference]: With dead ends: 118 [2023-02-15 01:01:39,562 INFO L226 Difference]: Without dead ends: 118 [2023-02-15 01:01:39,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 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:01:39,562 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 49 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 01:01:39,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 251 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 01:01:39,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-02-15 01:01:39,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2023-02-15 01:01:39,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 96 states have internal predecessors, (111), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 01:01:39,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2023-02-15 01:01:39,566 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 17 [2023-02-15 01:01:39,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:01:39,566 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2023-02-15 01:01:39,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:01:39,566 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2023-02-15 01:01:39,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-15 01:01:39,567 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:01:39,567 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:01:39,593 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:01:39,780 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:01:39,781 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting list_add_tailErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:01:39,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:01:39,781 INFO L85 PathProgramCache]: Analyzing trace with hash 194024552, now seen corresponding path program 1 times [2023-02-15 01:01:39,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:01:39,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1267012451] [2023-02-15 01:01:39,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:01:39,781 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:01:39,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:01:39,783 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:01:39,785 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:01:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:01:39,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 01:01:39,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:01:39,923 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:01:39,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:01:39,974 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:01:39,975 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:01:39,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1267012451] [2023-02-15 01:01:39,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1267012451] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:01:39,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:01:39,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 01:01:39,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579734504] [2023-02-15 01:01:39,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:01:39,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 01:01:39,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:01:39,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 01:01:39,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 01:01:39,976 INFO L87 Difference]: Start difference. First operand 110 states and 125 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:01:40,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:01:40,195 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2023-02-15 01:01:40,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 01:01:40,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-02-15 01:01:40,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:01:40,196 INFO L225 Difference]: With dead ends: 116 [2023-02-15 01:01:40,196 INFO L226 Difference]: Without dead ends: 116 [2023-02-15 01:01:40,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 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:01:40,197 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 36 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:01:40,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 271 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 01:01:40,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-15 01:01:40,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 110. [2023-02-15 01:01:40,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 96 states have internal predecessors, (107), 7 states have call successors, (7), 6 states have call predecessors, (7), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-02-15 01:01:40,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2023-02-15 01:01:40,207 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 17 [2023-02-15 01:01:40,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:01:40,207 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2023-02-15 01:01:40,207 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:01:40,207 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2023-02-15 01:01:40,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 01:01:40,208 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:01:40,208 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:01:40,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-15 01:01:40,415 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:01:40,416 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting list_add_tailErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:01:40,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:01:40,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1774001130, now seen corresponding path program 1 times [2023-02-15 01:01:40,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:01:40,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741040510] [2023-02-15 01:01:40,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:01:40,417 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:01:40,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:01:40,418 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:01:40,420 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:01:40,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:01:40,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-15 01:01:40,556 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:01:40,558 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:01:40,593 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:01:40,616 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 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 01:01:40,631 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:01:40,631 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:01:40,656 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:01:40,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2023-02-15 01:01:40,733 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:01:40,733 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:01:40,733 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:01:40,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741040510] [2023-02-15 01:01:40,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741040510] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:01:40,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:01:40,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 01:01:40,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061267217] [2023-02-15 01:01:40,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:01:40,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 01:01:40,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:01:40,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 01:01:40,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-02-15 01:01:40,734 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:01:41,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:01:41,280 INFO L93 Difference]: Finished difference Result 145 states and 161 transitions. [2023-02-15 01:01:41,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 01:01:41,281 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-15 01:01:41,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:01:41,282 INFO L225 Difference]: With dead ends: 145 [2023-02-15 01:01:41,282 INFO L226 Difference]: Without dead ends: 145 [2023-02-15 01:01:41,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2023-02-15 01:01:41,283 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 59 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 01:01:41,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 435 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 01:01:41,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-15 01:01:41,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 132. [2023-02-15 01:01:41,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 92 states have (on average 1.423913043478261) internal successors, (131), 116 states have internal predecessors, (131), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 01:01:41,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 149 transitions. [2023-02-15 01:01:41,286 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 149 transitions. Word has length 19 [2023-02-15 01:01:41,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:01:41,286 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 149 transitions. [2023-02-15 01:01:41,286 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:01:41,287 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2023-02-15 01:01:41,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-15 01:01:41,287 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:01:41,287 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:01:41,315 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:01:41,500 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:01:41,501 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting list_add_tailErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:01:41,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:01:41,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1774001131, now seen corresponding path program 1 times [2023-02-15 01:01:41,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:01:41,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320397512] [2023-02-15 01:01:41,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:01:41,501 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:01:41,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:01:41,503 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:01:41,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-15 01:01:41,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:01:41,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-15 01:01:41,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:01:41,687 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:01:41,692 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:01:41,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:01:41,757 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:01:41,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:01:41,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 01:01:41,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:01:41,803 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 01:01:41,824 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:01:41,825 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:01:41,832 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:01:41,867 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:01:41,873 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:01:41,941 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:01:41,944 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:01:41,986 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:01:41,987 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 01:01:41,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:01:41,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320397512] [2023-02-15 01:01:41,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1320397512] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 01:01:41,987 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 01:01:41,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-15 01:01:41,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57499629] [2023-02-15 01:01:41,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 01:01:41,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 01:01:41,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:01:41,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 01:01:41,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-02-15 01:01:41,988 INFO L87 Difference]: Start difference. First operand 132 states and 149 transitions. Second operand has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:01:42,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:01:42,699 INFO L93 Difference]: Finished difference Result 135 states and 150 transitions. [2023-02-15 01:01:42,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 01:01:42,699 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-02-15 01:01:42,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:01:42,700 INFO L225 Difference]: With dead ends: 135 [2023-02-15 01:01:42,700 INFO L226 Difference]: Without dead ends: 135 [2023-02-15 01:01:42,701 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=73, Invalid=307, Unknown=0, NotChecked=0, Total=380 [2023-02-15 01:01:42,701 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 32 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 01:01:42,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 508 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 01:01:42,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-15 01:01:42,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2023-02-15 01:01:42,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 119 states have internal predecessors, (132), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2023-02-15 01:01:42,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2023-02-15 01:01:42,705 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 19 [2023-02-15 01:01:42,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:01:42,705 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2023-02-15 01:01:42,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:01:42,705 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2023-02-15 01:01:42,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-15 01:01:42,705 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:01:42,705 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:01:42,716 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:01:42,914 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:01:42,914 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:01:42,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:01:42,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1031850971, now seen corresponding path program 1 times [2023-02-15 01:01:42,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:01:42,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281691301] [2023-02-15 01:01:42,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:01:42,915 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:01:42,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:01:42,916 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:01:42,918 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:01:43,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:01:43,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-15 01:01:43,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:01:43,057 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:01:43,060 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:01:43,102 WARN L859 $PredicateComparison]: unable to prove that (exists ((|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_448 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_448))) (= (_ bv0 1) (select |c_old(#valid)| |create_sub_list_insert_sub_~sub~0#1.base|)))) is different from true [2023-02-15 01:01:43,114 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:01:43,137 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:01:43,138 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:01:43,143 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:01:43,143 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:01:43,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:01:43,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:01:45,585 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:01:45,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281691301] [2023-02-15 01:01:45,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1281691301] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:01:45,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1131015358] [2023-02-15 01:01:45,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:01:45,586 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 01:01:45,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 01:01:45,602 INFO L229 MonitoredProcess]: Starting monitored process 16 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:01:45,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2023-02-15 01:01:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:01:45,895 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-15 01:01:45,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:01:45,901 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:01:45,905 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:01:46,024 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:01:46,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:01:46,360 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:01:46,369 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:01:46,369 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:01:46,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:01:46,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:01:46,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1131015358] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:01:46,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:01:46,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 13 [2023-02-15 01:01:46,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565436192] [2023-02-15 01:01:46,889 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:01:46,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-15 01:01:46,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:01:46,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-15 01:01:46,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=4, NotChecked=32, Total=342 [2023-02-15 01:01:46,890 INFO L87 Difference]: Start difference. First operand 135 states and 150 transitions. Second operand has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 01:01:49,477 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 01:01:53,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 01:01:56,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:01:56,240 INFO L93 Difference]: Finished difference Result 163 states and 184 transitions. [2023-02-15 01:01:56,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-15 01:01:56,241 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2023-02-15 01:01:56,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:01:56,242 INFO L225 Difference]: With dead ends: 163 [2023-02-15 01:01:56,242 INFO L226 Difference]: Without dead ends: 163 [2023-02-15 01:01:56,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=80, Invalid=470, Unknown=6, NotChecked=44, Total=600 [2023-02-15 01:01:56,243 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 82 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 90 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:01:56,243 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 292 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 664 Invalid, 2 Unknown, 90 Unchecked, 5.0s Time] [2023-02-15 01:01:56,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-02-15 01:01:56,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 143. [2023-02-15 01:01:56,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 100 states have (on average 1.39) internal successors, (139), 124 states have internal predecessors, (139), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2023-02-15 01:01:56,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 160 transitions. [2023-02-15 01:01:56,246 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 160 transitions. Word has length 29 [2023-02-15 01:01:56,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:01:56,247 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 160 transitions. [2023-02-15 01:01:56,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-02-15 01:01:56,247 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 160 transitions. [2023-02-15 01:01:56,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 01:01:56,247 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:01:56,247 INFO L195 NwaCegarLoop]: trace histogram [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:01:56,254 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Forceful destruction successful, exit code 0 [2023-02-15 01:01:56,457 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:01:56,648 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:01:56,648 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting list_add_tailErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:01:56,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:01:56,649 INFO L85 PathProgramCache]: Analyzing trace with hash 343570640, now seen corresponding path program 1 times [2023-02-15 01:01:56,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:01:56,649 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [484718079] [2023-02-15 01:01:56,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:01:56,649 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:01:56,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:01:56,650 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:01:56,652 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:01:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:01:56,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-15 01:01:56,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:01:57,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:01:57,195 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 14 treesize of output 16 [2023-02-15 01:01:57,202 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:01:57,202 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:01:57,313 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:01:57,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:01:58,782 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 60 treesize of output 54 [2023-02-15 01:01:58,844 INFO L321 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-02-15 01:01:58,844 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 50 treesize of output 67 [2023-02-15 01:01:59,353 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 01:01:59,354 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 38 treesize of output 32 [2023-02-15 01:01:59,370 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-15 01:01:59,370 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 15 treesize of output 14 [2023-02-15 01:01:59,776 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:01:59,776 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 38 treesize of output 40 [2023-02-15 01:01:59,862 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-15 01:01:59,862 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 15 treesize of output 14 [2023-02-15 01:02:00,092 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:02:00,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:02:00,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [484718079] [2023-02-15 01:02:00,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [484718079] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:02:00,092 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:02:00,092 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15] total 30 [2023-02-15 01:02:00,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096148973] [2023-02-15 01:02:00,092 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:02:00,093 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-15 01:02:00,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:02:00,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-15 01:02:00,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=844, Unknown=0, NotChecked=0, Total=930 [2023-02-15 01:02:00,094 INFO L87 Difference]: Start difference. First operand 143 states and 160 transitions. Second operand has 31 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 25 states have internal predecessors, (58), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 01:02:04,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:02:04,208 INFO L93 Difference]: Finished difference Result 151 states and 164 transitions. [2023-02-15 01:02:04,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-02-15 01:02:04,210 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 25 states have internal predecessors, (58), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2023-02-15 01:02:04,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:02:04,211 INFO L225 Difference]: With dead ends: 151 [2023-02-15 01:02:04,211 INFO L226 Difference]: Without dead ends: 151 [2023-02-15 01:02:04,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=231, Invalid=1575, Unknown=0, NotChecked=0, Total=1806 [2023-02-15 01:02:04,212 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 241 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-02-15 01:02:04,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 718 Invalid, 979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-02-15 01:02:04,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2023-02-15 01:02:04,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 140. [2023-02-15 01:02:04,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 99 states have (on average 1.3333333333333333) internal successors, (132), 121 states have internal predecessors, (132), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2023-02-15 01:02:04,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 153 transitions. [2023-02-15 01:02:04,215 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 153 transitions. Word has length 36 [2023-02-15 01:02:04,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:02:04,215 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 153 transitions. [2023-02-15 01:02:04,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 28 states have (on average 2.0714285714285716) internal successors, (58), 25 states have internal predecessors, (58), 8 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 01:02:04,215 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 153 transitions. [2023-02-15 01:02:04,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 01:02:04,216 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:02:04,216 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-15 01:02:04,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-02-15 01:02:04,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:02:04,429 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting list_add_tailErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:02:04,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:02:04,429 INFO L85 PathProgramCache]: Analyzing trace with hash 2012582842, now seen corresponding path program 1 times [2023-02-15 01:02:04,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:02:04,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1932278187] [2023-02-15 01:02:04,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:02:04,430 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:02:04,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:02:04,431 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:02:04,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-02-15 01:02:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:02:04,815 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 76 conjunts are in the unsatisfiable core [2023-02-15 01:02:04,832 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:02:04,838 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:02:04,874 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:02:04,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:02:04,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:02:04,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 01:02:04,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:02:04,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 01:02:04,938 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 01:02:04,938 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:02:05,005 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:02:05,020 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:02:05,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:02:05,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:02:05,851 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 65 treesize of output 36 [2023-02-15 01:02:05,881 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2023-02-15 01:02:05,882 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 128 [2023-02-15 01:02:05,887 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 132 treesize of output 96 [2023-02-15 01:02:05,910 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 42 treesize of output 24 [2023-02-15 01:02:05,927 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 0 case distinctions, treesize of input 87 treesize of output 30 [2023-02-15 01:02:06,045 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2023-02-15 01:02:06,046 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:02:06,133 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:02:06,361 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-02-15 01:02:06,586 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:02:06,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:02:06,926 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_713 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_713) |c_create_sub_list_insert_sub_~head#1.base|) (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (_ bv1 1)))) is different from false [2023-02-15 01:02:08,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:02:08,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1932278187] [2023-02-15 01:02:08,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1932278187] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:02:08,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [535812399] [2023-02-15 01:02:08,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:02:08,447 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 01:02:08,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 01:02:08,448 INFO L229 MonitoredProcess]: Starting monitored process 19 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:02:08,449 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Waiting until timeout for monitored process [2023-02-15 01:02:09,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:02:09,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 79 conjunts are in the unsatisfiable core [2023-02-15 01:02:09,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:02:09,030 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:02:09,069 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:02:09,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:02:09,091 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:02:09,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 01:02:09,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:02:09,100 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 01:02:09,156 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 01:02:09,157 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:02:09,201 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:02:09,221 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:02:09,234 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:02:09,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:02:09,907 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 65 treesize of output 36 [2023-02-15 01:02:09,947 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2023-02-15 01:02:09,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 128 [2023-02-15 01:02:09,953 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 26 [2023-02-15 01:02:09,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:02:09,959 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 120 treesize of output 84 [2023-02-15 01:02:09,973 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 0 case distinctions, treesize of input 87 treesize of output 22 [2023-02-15 01:02:10,054 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2023-02-15 01:02:10,055 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:02:10,187 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:02:10,419 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:02:10,595 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:02:10,595 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:02:10,617 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_835 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_835) |c_create_sub_list_insert_sub_~head#1.base|) (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (_ bv1 1)))) is different from false [2023-02-15 01:02:13,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [535812399] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:02:13,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:02:13,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 27 [2023-02-15 01:02:13,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019760560] [2023-02-15 01:02:13,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:02:13,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-15 01:02:13,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:02:13,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-15 01:02:13,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1184, Unknown=44, NotChecked=142, Total=1482 [2023-02-15 01:02:13,729 INFO L87 Difference]: Start difference. First operand 140 states and 153 transitions. Second operand has 28 states, 25 states have (on average 1.64) internal successors, (41), 24 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:02:20,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:02:20,374 INFO L93 Difference]: Finished difference Result 160 states and 174 transitions. [2023-02-15 01:02:20,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-02-15 01:02:20,376 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 25 states have (on average 1.64) internal successors, (41), 24 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2023-02-15 01:02:20,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:02:20,376 INFO L225 Difference]: With dead ends: 160 [2023-02-15 01:02:20,377 INFO L226 Difference]: Without dead ends: 160 [2023-02-15 01:02:20,377 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 55 SyntacticMatches, 4 SemanticMatches, 56 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=303, Invalid=2706, Unknown=79, NotChecked=218, Total=3306 [2023-02-15 01:02:20,378 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 79 mSDsluCounter, 976 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 22 mSolverCounterUnsat, 14 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 1302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 14 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-02-15 01:02:20,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 1052 Invalid, 1302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1266 Invalid, 14 Unknown, 0 Unchecked, 3.6s Time] [2023-02-15 01:02:20,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-02-15 01:02:20,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 154. [2023-02-15 01:02:20,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 111 states have (on average 1.3063063063063063) internal successors, (145), 134 states have internal predecessors, (145), 11 states have call successors, (11), 10 states have call predecessors, (11), 9 states have return successors, (12), 9 states have call predecessors, (12), 11 states have call successors, (12) [2023-02-15 01:02:20,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 168 transitions. [2023-02-15 01:02:20,385 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 168 transitions. Word has length 35 [2023-02-15 01:02:20,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:02:20,386 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 168 transitions. [2023-02-15 01:02:20,386 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 25 states have (on average 1.64) internal successors, (41), 24 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 01:02:20,386 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 168 transitions. [2023-02-15 01:02:20,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 01:02:20,386 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:02:20,387 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-15 01:02:20,404 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (19)] Ended with exit code 0 [2023-02-15 01:02:20,601 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 (18)] Ended with exit code 0 [2023-02-15 01:02:20,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:02:20,801 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting list_add_tailErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:02:20,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:02:20,801 INFO L85 PathProgramCache]: Analyzing trace with hash 2012582843, now seen corresponding path program 1 times [2023-02-15 01:02:20,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:02:20,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820437835] [2023-02-15 01:02:20,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:02:20,802 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:02:20,802 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:02:20,803 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:02:20,805 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-02-15 01:02:21,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:02:21,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 95 conjunts are in the unsatisfiable core [2023-02-15 01:02:21,172 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:02:21,175 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:02:21,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:02:21,220 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:02:21,246 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:02:21,246 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 01:02:21,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:02:21,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 01:02:21,282 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 01:02:21,283 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:02:21,302 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:02:21,379 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:02:21,389 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:02:21,410 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:02:21,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:02:22,640 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 91 [2023-02-15 01:02:22,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:02:22,659 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 36 treesize of output 27 [2023-02-15 01:02:22,664 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 73 treesize of output 38 [2023-02-15 01:02:22,692 INFO L321 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2023-02-15 01:02:22,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 125 [2023-02-15 01:02:22,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:02:22,696 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 129 treesize of output 89 [2023-02-15 01:02:22,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:02:22,736 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 16 treesize of output 20 [2023-02-15 01:02:22,918 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-02-15 01:02:22,918 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:02:22,946 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:02:23,089 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:02:23,105 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:02:23,106 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 74 treesize of output 64 [2023-02-15 01:02:23,354 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:02:23,362 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:02:23,507 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:02:23,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:02:24,294 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (and (forall ((v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_965) |c_create_sub_list_insert_sub_~head#1.base|) .cse1))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_964 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_965 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_965) |c_create_sub_list_insert_sub_~head#1.base|) .cse1) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_964) |c_create_sub_list_insert_sub_~head#1.base|) .cse1)))))) is different from false [2023-02-15 01:02:33,179 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:02:33,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820437835] [2023-02-15 01:02:33,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820437835] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:02:33,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1012251496] [2023-02-15 01:02:33,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:02:33,179 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 01:02:33,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 01:02:33,181 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-15 01:02:33,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Waiting until timeout for monitored process [2023-02-15 01:02:33,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:02:34,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 100 conjunts are in the unsatisfiable core [2023-02-15 01:02:34,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:02:34,032 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:02:34,053 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:02:34,061 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:02:34,086 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:02:34,087 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 01:02:34,109 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:02:34,110 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 01:02:34,119 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:02:34,165 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 01:02:34,165 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:02:34,227 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:02:34,249 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:02:34,260 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:02:34,264 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-02-15 01:02:38,352 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 120 treesize of output 91 [2023-02-15 01:02:38,360 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:02:38,364 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 36 treesize of output 27 [2023-02-15 01:02:38,370 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 86 treesize of output 45 [2023-02-15 01:02:38,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:02:38,377 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 16 treesize of output 20 [2023-02-15 01:02:38,409 INFO L321 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2023-02-15 01:02:38,409 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 95 treesize of output 125 [2023-02-15 01:02:38,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:02:38,415 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 129 treesize of output 89 [2023-02-15 01:02:38,824 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-02-15 01:02:38,824 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:02:38,856 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:02:39,192 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 01:02:39,192 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 105 treesize of output 89 [2023-02-15 01:02:39,200 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:02:39,218 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:02:39,225 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:02:39,254 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:02:39,261 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 01:02:39,546 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:02:39,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:02:39,635 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (and (forall ((v_ArrVal_1104 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1105 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1104) |c_create_sub_list_insert_sub_~head#1.base|) .cse0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1105) |c_create_sub_list_insert_sub_~head#1.base|) .cse0)))) (forall ((v_ArrVal_1104 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1104) |c_create_sub_list_insert_sub_~head#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))))) is different from false [2023-02-15 01:02:47,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1012251496] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:02:47,963 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:02:47,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 30 [2023-02-15 01:02:47,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188262610] [2023-02-15 01:02:47,963 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:02:47,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-15 01:02:47,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:02:47,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-15 01:02:47,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1419, Unknown=30, NotChecked=154, Total=1722 [2023-02-15 01:02:47,965 INFO L87 Difference]: Start difference. First operand 154 states and 168 transitions. Second operand has 31 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 28 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:02:58,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:02:58,541 INFO L93 Difference]: Finished difference Result 154 states and 167 transitions. [2023-02-15 01:02:58,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 01:02:58,542 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 28 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 35 [2023-02-15 01:02:58,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:02:58,543 INFO L225 Difference]: With dead ends: 154 [2023-02-15 01:02:58,543 INFO L226 Difference]: Without dead ends: 154 [2023-02-15 01:02:58,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 557 ImplicationChecksByTransitivity, 21.1s TimeCoverageRelationStatistics Valid=217, Invalid=2405, Unknown=38, NotChecked=202, Total=2862 [2023-02-15 01:02:58,544 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 53 mSDsluCounter, 678 mSDsCounter, 0 mSdLazyCounter, 977 mSolverCounterSat, 14 mSolverCounterUnsat, 19 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 977 IncrementalHoareTripleChecker+Invalid, 19 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-02-15 01:02:58,544 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 751 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 977 Invalid, 19 Unknown, 0 Unchecked, 4.0s Time] [2023-02-15 01:02:58,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2023-02-15 01:02:58,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2023-02-15 01:02:58,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 134 states have internal predecessors, (144), 11 states have call successors, (11), 10 states have call predecessors, (11), 9 states have return successors, (12), 9 states have call predecessors, (12), 11 states have call successors, (12) [2023-02-15 01:02:58,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 167 transitions. [2023-02-15 01:02:58,547 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 167 transitions. Word has length 35 [2023-02-15 01:02:58,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:02:58,548 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 167 transitions. [2023-02-15 01:02:58,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 28 states have internal predecessors, (46), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-02-15 01:02:58,548 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 167 transitions. [2023-02-15 01:02:58,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-15 01:02:58,552 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:02:58,553 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-15 01:02:58,562 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 (20)] Forceful destruction successful, exit code 0 [2023-02-15 01:02:58,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (21)] Ended with exit code 0 [2023-02-15 01:02:58,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-15 01:02:58,973 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting list_add_tailErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:02:58,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:02:58,974 INFO L85 PathProgramCache]: Analyzing trace with hash -796271557, now seen corresponding path program 1 times [2023-02-15 01:02:58,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:02:58,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750882345] [2023-02-15 01:02:58,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:02:58,974 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:02:58,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:02:58,976 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:02:58,979 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:02:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:02:59,309 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-15 01:02:59,312 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:02:59,438 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:02:59,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:02:59,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:02:59,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 01:02:59,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:02:59,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 01:02:59,518 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:02:59,518 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:02:59,566 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:02:59,572 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:02:59,673 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:02:59,678 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:02:59,745 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:02:59,745 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:02:59,919 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:02:59,919 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 46 treesize of output 50 [2023-02-15 01:03:00,295 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (and (forall ((v_ArrVal_1240 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1240) |c_create_sub_list_insert_sub_~head#1.base|) .cse0) |c_create_sub_list_insert_sub_~head#1.base|)) (forall ((v_ArrVal_1241 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1241) |c_create_sub_list_insert_sub_~head#1.base|) .cse0)) (bvadd (_ bv8 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (forall ((v_ArrVal_1241 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1241) |c_create_sub_list_insert_sub_~head#1.base|) .cse0))) (bvule .cse1 (bvadd (_ bv4 32) .cse1)))))) is different from false [2023-02-15 01:03:03,530 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:03:03,530 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 2 case distinctions, treesize of input 49 treesize of output 42 [2023-02-15 01:03:03,535 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 50 treesize of output 32 [2023-02-15 01:03:03,540 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 17 treesize of output 9 [2023-02-15 01:03:03,579 INFO L321 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2023-02-15 01:03:03,579 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 2 case distinctions, treesize of input 25 treesize of output 1 [2023-02-15 01:03:03,605 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:03:03,605 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 2 case distinctions, treesize of input 29 treesize of output 35 [2023-02-15 01:03:03,607 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-15 01:03:03,609 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:03:04,301 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:03:04,301 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 44 treesize of output 66 [2023-02-15 01:03:04,506 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-15 01:03:04,507 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 16 treesize of output 15 [2023-02-15 01:03:04,541 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-15 01:03:04,541 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 16 treesize of output 15 [2023-02-15 01:03:04,561 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-02-15 01:03:04,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:03:04,561 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750882345] [2023-02-15 01:03:04,561 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750882345] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:03:04,561 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:03:04,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 29 [2023-02-15 01:03:04,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714225133] [2023-02-15 01:03:04,561 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:03:04,562 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-15 01:03:04,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:03:04,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-15 01:03:04,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=733, Unknown=7, NotChecked=54, Total=870 [2023-02-15 01:03:04,562 INFO L87 Difference]: Start difference. First operand 154 states and 167 transitions. Second operand has 30 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 7 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:03:07,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 01:03:09,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 01:03:15,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-02-15 01:03:26,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:03:26,940 INFO L93 Difference]: Finished difference Result 165 states and 178 transitions. [2023-02-15 01:03:26,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-15 01:03:26,940 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 7 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 41 [2023-02-15 01:03:26,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:03:26,941 INFO L225 Difference]: With dead ends: 165 [2023-02-15 01:03:26,941 INFO L226 Difference]: Without dead ends: 165 [2023-02-15 01:03:26,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 407 ImplicationChecksByTransitivity, 14.6s TimeCoverageRelationStatistics Valid=327, Invalid=2321, Unknown=8, NotChecked=100, Total=2756 [2023-02-15 01:03:26,942 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 158 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 42 mSolverCounterUnsat, 42 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 1273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 42 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:03:26,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 1063 Invalid, 1273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1097 Invalid, 42 Unknown, 92 Unchecked, 12.3s Time] [2023-02-15 01:03:26,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2023-02-15 01:03:26,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 157. [2023-02-15 01:03:26,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 113 states have (on average 1.2831858407079646) internal successors, (145), 137 states have internal predecessors, (145), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (12), 9 states have call predecessors, (12), 11 states have call successors, (12) [2023-02-15 01:03:26,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 168 transitions. [2023-02-15 01:03:26,946 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 168 transitions. Word has length 41 [2023-02-15 01:03:26,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:03:26,946 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 168 transitions. [2023-02-15 01:03:26,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 7 states have call successors, (7), 5 states have call predecessors, (7), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 01:03:26,946 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 168 transitions. [2023-02-15 01:03:26,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 01:03:26,947 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:03:26,947 INFO L195 NwaCegarLoop]: trace histogram [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] [2023-02-15 01:03:26,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-02-15 01:03:27,156 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:03:27,156 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:03:27,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:03:27,156 INFO L85 PathProgramCache]: Analyzing trace with hash 782352299, now seen corresponding path program 1 times [2023-02-15 01:03:27,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:03:27,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [916783393] [2023-02-15 01:03:27,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:03:27,157 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:03:27,157 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:03:27,158 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:03:27,159 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:03:27,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:03:27,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 01:03:27,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:03:27,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 5 [2023-02-15 01:03:27,520 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:03:27,618 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:03:27,736 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:03:27,736 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:03:27,749 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_create_sub_list_insert_sub_~sub~0#1.base_38| (_ BitVec 32)) (|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32)) (v_ArrVal_1343 (_ BitVec 32)) (v_ArrVal_1342 (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_create_sub_list_insert_sub_~sub~0#1.base_38|)) (= (store (store |c_old(#length)| |v_create_sub_list_insert_sub_~sub~0#1.base_38| v_ArrVal_1342) |create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1343) |c_#length|) (not (= |c_create_sub_list_#in~sub#1.base| |create_sub_list_insert_sub_~sub~0#1.base|)))) is different from true [2023-02-15 01:03:27,784 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:03:27,784 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-02-15 01:03:27,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:03:27,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:03:27,862 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:03:27,862 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 15 treesize of output 23 [2023-02-15 01:03:27,877 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:03:27,878 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:03:27,948 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 5 not checked. [2023-02-15 01:03:27,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:03:28,325 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-15 01:03:28,325 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 15 treesize of output 14 [2023-02-15 01:03:30,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:03:30,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [916783393] [2023-02-15 01:03:30,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [916783393] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:03:30,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1617929446] [2023-02-15 01:03:30,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:03:30,626 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 01:03:30,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 01:03:30,627 INFO L229 MonitoredProcess]: Starting monitored process 24 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:03:30,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Waiting until timeout for monitored process [2023-02-15 01:03:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:03:31,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-15 01:03:31,213 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:03:31,220 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:03:31,226 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 01:03:31,423 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:03:31,574 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:03:31,575 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:03:31,700 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:03:31,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 1 case distinctions, treesize of input 9 treesize of output 15 [2023-02-15 01:03:31,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:03:32,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:03:32,061 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:03:32,061 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 15 treesize of output 23 [2023-02-15 01:03:32,070 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:03:32,070 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:03:32,081 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 01:03:32,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:03:32,684 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-15 01:03:32,685 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 15 treesize of output 14 [2023-02-15 01:03:35,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1617929446] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:03:35,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:03:35,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 21 [2023-02-15 01:03:35,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283780466] [2023-02-15 01:03:35,373 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:03:35,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-15 01:03:35,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:03:35,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-15 01:03:35,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=582, Unknown=5, NotChecked=48, Total=702 [2023-02-15 01:03:35,376 INFO L87 Difference]: Start difference. First operand 157 states and 168 transitions. Second operand has 22 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 01:03:37,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 01:03:42,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 01:03:46,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 01:03:49,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:03:49,060 INFO L93 Difference]: Finished difference Result 241 states and 276 transitions. [2023-02-15 01:03:49,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-15 01:03:49,061 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 45 [2023-02-15 01:03:49,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:03:49,063 INFO L225 Difference]: With dead ends: 241 [2023-02-15 01:03:49,063 INFO L226 Difference]: Without dead ends: 241 [2023-02-15 01:03:49,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 73 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=117, Invalid=936, Unknown=7, NotChecked=62, Total=1122 [2023-02-15 01:03:49,064 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 156 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 23 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 186 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2023-02-15 01:03:49,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 392 Invalid, 1544 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [23 Valid, 1332 Invalid, 3 Unknown, 186 Unchecked, 8.9s Time] [2023-02-15 01:03:49,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2023-02-15 01:03:49,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 159. [2023-02-15 01:03:49,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 138 states have internal predecessors, (148), 11 states have call successors, (11), 10 states have call predecessors, (11), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2023-02-15 01:03:49,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 171 transitions. [2023-02-15 01:03:49,068 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 171 transitions. Word has length 45 [2023-02-15 01:03:49,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:03:49,068 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 171 transitions. [2023-02-15 01:03:49,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 3.05) internal successors, (61), 19 states have internal predecessors, (61), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 01:03:49,068 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 171 transitions. [2023-02-15 01:03:49,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 01:03:49,069 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:03:49,069 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 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] [2023-02-15 01:03:49,077 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (24)] Forceful destruction successful, exit code 0 [2023-02-15 01:03:49,279 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:03:49,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:03:49,480 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting list_add_tailErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:03:49,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:03:49,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1563009013, now seen corresponding path program 1 times [2023-02-15 01:03:49,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:03:49,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [884690297] [2023-02-15 01:03:49,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:03:49,481 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:03:49,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:03:49,482 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:03:49,483 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:03:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:03:49,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-15 01:03:49,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:03:49,847 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:03:49,875 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:03:49,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:03:49,917 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:03:49,934 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:03:49,934 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:03:49,973 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:03:50,070 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:03:50,156 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32)) (v_ArrVal_1571 (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1571)) (bvult |create_sub_list_insert_sub_~sub~0#1.base| |c_#StackHeapBarrier|))) (not (= |c_#StackHeapBarrier| (_ bv0 32))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from true [2023-02-15 01:03:50,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:03:50,218 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:03:50,313 WARN L859 $PredicateComparison]: unable to prove that (exists ((|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |create_sub_list_insert_sub_~sub~0#1.base| (_ bv12 32)))) is different from true [2023-02-15 01:03:50,323 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:03:50,384 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (= (select |c_#length| |create_sub_list_insert_sub_~sub~0#1.base|) (_ bv12 32))) (exists ((|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |create_sub_list_insert_sub_~sub~0#1.base| (_ bv12 32))))) is different from true [2023-02-15 01:03:50,420 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:03:50,420 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:03:50,619 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-02-15 01:03:50,619 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:03:51,004 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:03:51,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [884690297] [2023-02-15 01:03:51,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [884690297] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:03:51,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2130769690] [2023-02-15 01:03:51,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:03:51,005 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 01:03:51,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 01:03:51,006 INFO L229 MonitoredProcess]: Starting monitored process 26 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:03:51,007 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Waiting until timeout for monitored process [2023-02-15 01:03:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:03:52,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-15 01:03:52,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:03:52,161 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:03:52,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:03:52,218 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:03:52,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:03:52,385 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:03:52,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:03:52,492 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:03:52,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 01:03:52,545 WARN L859 $PredicateComparison]: unable to prove that (and (not (= |c_#StackHeapBarrier| (_ bv0 32))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32))) (exists ((v_ArrVal_1687 (_ BitVec 32)) (|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (and (= |c_#length| (store |c_old(#length)| |create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1687)) (bvult |create_sub_list_insert_sub_~sub~0#1.base| |c_#StackHeapBarrier|)))) is different from true [2023-02-15 01:03:52,571 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:03:52,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:03:52,660 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:03:52,866 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 7 not checked. [2023-02-15 01:03:52,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:03:56,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2130769690] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:03:56,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:03:56,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 21 [2023-02-15 01:03:56,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040379269] [2023-02-15 01:03:56,312 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:03:56,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-15 01:03:56,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:03:56,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-15 01:03:56,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=437, Unknown=6, NotChecked=180, Total=702 [2023-02-15 01:03:56,313 INFO L87 Difference]: Start difference. First operand 159 states and 171 transitions. Second operand has 22 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-15 01:03:59,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:03:59,246 INFO L93 Difference]: Finished difference Result 213 states and 238 transitions. [2023-02-15 01:03:59,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 01:03:59,247 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 51 [2023-02-15 01:03:59,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:03:59,248 INFO L225 Difference]: With dead ends: 213 [2023-02-15 01:03:59,248 INFO L226 Difference]: Without dead ends: 213 [2023-02-15 01:03:59,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 83 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=177, Invalid=817, Unknown=14, NotChecked=252, Total=1260 [2023-02-15 01:03:59,248 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 308 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 840 mSolverCounterSat, 77 mSolverCounterUnsat, 44 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 840 IncrementalHoareTripleChecker+Invalid, 44 IncrementalHoareTripleChecker+Unknown, 423 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-02-15 01:03:59,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 306 Invalid, 1384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 840 Invalid, 44 Unknown, 423 Unchecked, 2.2s Time] [2023-02-15 01:03:59,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2023-02-15 01:03:59,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 182. [2023-02-15 01:03:59,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 132 states have (on average 1.3106060606060606) internal successors, (173), 156 states have internal predecessors, (173), 14 states have call successors, (14), 11 states have call predecessors, (14), 13 states have return successors, (21), 14 states have call predecessors, (21), 14 states have call successors, (21) [2023-02-15 01:03:59,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 208 transitions. [2023-02-15 01:03:59,259 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 208 transitions. Word has length 51 [2023-02-15 01:03:59,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:03:59,260 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 208 transitions. [2023-02-15 01:03:59,260 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 3.0) internal successors, (57), 18 states have internal predecessors, (57), 7 states have call successors, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2023-02-15 01:03:59,260 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 208 transitions. [2023-02-15 01:03:59,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 01:03:59,261 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:03:59,261 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 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] [2023-02-15 01:03:59,269 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Ended with exit code 0 [2023-02-15 01:03:59,483 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:03:59,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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:03:59,667 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting list_add_tailErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:03:59,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:03:59,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1563009014, now seen corresponding path program 1 times [2023-02-15 01:03:59,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:03:59,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1191953922] [2023-02-15 01:03:59,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:03:59,668 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:03:59,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:03:59,679 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:03:59,694 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:04:00,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:04:00,031 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-15 01:04:00,033 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:04:00,039 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:04:00,075 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 01:04:00,076 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:04:00,099 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2023-02-15 01:04:00,168 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:04:00,222 WARN L859 $PredicateComparison]: unable to prove that (and (not (= |c_#StackHeapBarrier| (_ bv0 32))) (exists ((v_ArrVal_1803 (_ BitVec 1)) (|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1803)) (bvult |create_sub_list_insert_sub_~sub~0#1.base| |c_#StackHeapBarrier|))) (not (= (bvadd |c_#StackHeapBarrier| (_ bv1 32)) (_ bv0 32)))) is different from true [2023-02-15 01:04:00,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:04:00,261 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 14 treesize of output 20 [2023-02-15 01:04:00,319 WARN L859 $PredicateComparison]: unable to prove that (exists ((|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |create_sub_list_insert_sub_~sub~0#1.base| (_ bv1 1)))) is different from true [2023-02-15 01:04:00,326 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:04:00,382 WARN L859 $PredicateComparison]: unable to prove that (and (exists ((|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (= (_ bv0 1) (bvadd (select |c_#valid| |create_sub_list_insert_sub_~sub~0#1.base|) (_ bv1 1)))) (exists ((|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (= |c_#valid| (store |c_old(#valid)| |create_sub_list_insert_sub_~sub~0#1.base| (_ bv1 1))))) is different from true [2023-02-15 01:04:00,411 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 01:04:00,412 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:04:00,504 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-02-15 01:04:00,504 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:04:00,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:04:00,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1191953922] [2023-02-15 01:04:00,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1191953922] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:04:00,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1291310585] [2023-02-15 01:04:00,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 01:04:00,676 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 01:04:00,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 01:04:00,677 INFO L229 MonitoredProcess]: Starting monitored process 28 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:04:00,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Waiting until timeout for monitored process [2023-02-15 01:04:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 01:04:01,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-15 01:04:01,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:04:02,016 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 01:04:02,016 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:04:02,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:04:02,072 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:04:02,093 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 01:04:02,093 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 1 case distinctions, treesize of input 21 treesize of output 36 [2023-02-15 01:04:02,181 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 01:04:02,181 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 24 treesize of output 20 [2023-02-15 01:04:02,293 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:04:02,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:04:02,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:04:02,413 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 01:04:02,414 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 1 case distinctions, treesize of input 30 treesize of output 45 [2023-02-15 01:04:02,493 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 01:04:02,494 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 24 treesize of output 20 [2023-02-15 01:04:02,561 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:04:02,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:04:02,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:04:02,642 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 01:04:02,643 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 1 case distinctions, treesize of input 30 treesize of output 45 [2023-02-15 01:04:02,913 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-02-15 01:04:02,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:04:02,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1291310585] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:04:02,981 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:04:02,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2023-02-15 01:04:02,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485887106] [2023-02-15 01:04:02,982 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:04:02,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-15 01:04:02,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:04:02,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-15 01:04:02,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=466, Unknown=5, NotChecked=138, Total=702 [2023-02-15 01:04:02,983 INFO L87 Difference]: Start difference. First operand 182 states and 208 transitions. Second operand has 22 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 6 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 01:04:05,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:04:05,375 INFO L93 Difference]: Finished difference Result 335 states and 370 transitions. [2023-02-15 01:04:05,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-15 01:04:05,375 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 6 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 51 [2023-02-15 01:04:05,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:04:05,377 INFO L225 Difference]: With dead ends: 335 [2023-02-15 01:04:05,377 INFO L226 Difference]: Without dead ends: 335 [2023-02-15 01:04:05,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 84 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=207, Invalid=915, Unknown=12, NotChecked=198, Total=1332 [2023-02-15 01:04:05,378 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 373 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 989 mSolverCounterSat, 80 mSolverCounterUnsat, 42 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 375 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 1631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 989 IncrementalHoareTripleChecker+Invalid, 42 IncrementalHoareTripleChecker+Unknown, 520 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-15 01:04:05,378 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [375 Valid, 578 Invalid, 1631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 989 Invalid, 42 Unknown, 520 Unchecked, 1.8s Time] [2023-02-15 01:04:05,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2023-02-15 01:04:05,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 224. [2023-02-15 01:04:05,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 168 states have (on average 1.25) internal successors, (210), 192 states have internal predecessors, (210), 16 states have call successors, (16), 15 states have call predecessors, (16), 17 states have return successors, (23), 16 states have call predecessors, (23), 16 states have call successors, (23) [2023-02-15 01:04:05,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 249 transitions. [2023-02-15 01:04:05,392 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 249 transitions. Word has length 51 [2023-02-15 01:04:05,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:04:05,392 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 249 transitions. [2023-02-15 01:04:05,392 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 2.736842105263158) internal successors, (52), 18 states have internal predecessors, (52), 6 states have call successors, (8), 7 states have call predecessors, (8), 4 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-02-15 01:04:05,392 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 249 transitions. [2023-02-15 01:04:05,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 01:04:05,393 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:04:05,393 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:04:05,408 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 (27)] Forceful destruction successful, exit code 0 [2023-02-15 01:04:05,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Forceful destruction successful, exit code 0 [2023-02-15 01:04:05,805 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,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-15 01:04:05,805 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting list_add_tailErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:04:05,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:04:05,806 INFO L85 PathProgramCache]: Analyzing trace with hash -1771803766, now seen corresponding path program 2 times [2023-02-15 01:04:05,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:04:05,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2147043381] [2023-02-15 01:04:05,806 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 01:04:05,806 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:04:05,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:04:05,808 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:04:05,809 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:04:06,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 01:04:06,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 01:04:06,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 110 conjunts are in the unsatisfiable core [2023-02-15 01:04:06,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:04:06,515 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:04:06,564 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:04:06,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:04:06,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:04:06,601 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 01:04:06,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:04:06,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 01:04:06,679 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:04:06,679 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:04:06,775 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:04:06,795 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:04:07,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:04:07,562 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 0 case distinctions, treesize of input 72 treesize of output 46 [2023-02-15 01:04:07,599 INFO L321 Elim1Store]: treesize reduction 54, result has 16.9 percent of original size [2023-02-15 01:04:07,599 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 102 treesize of output 130 [2023-02-15 01:04:07,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:04:07,604 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 134 treesize of output 92 [2023-02-15 01:04:07,606 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 205 treesize of output 121 [2023-02-15 01:04:07,617 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 0 case distinctions, treesize of input 73 treesize of output 20 [2023-02-15 01:04:07,724 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 01:04:07,724 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:04:07,897 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:04:07,920 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 20 treesize of output 8 [2023-02-15 01:04:09,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:04:09,098 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 0 case distinctions, treesize of input 47 treesize of output 33 [2023-02-15 01:04:09,133 INFO L321 Elim1Store]: treesize reduction 40, result has 27.3 percent of original size [2023-02-15 01:04:09,133 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 2 case distinctions, treesize of input 51 treesize of output 57 [2023-02-15 01:04:09,294 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:04:09,356 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2023-02-15 01:04:09,357 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:04:09,541 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 42 treesize of output 38 [2023-02-15 01:04:10,106 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 43 treesize of output 23 [2023-02-15 01:04:10,113 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2023-02-15 01:04:10,358 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:04:10,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:04:13,237 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 24 treesize of output 22 [2023-02-15 01:04:13,256 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2023-02-15 01:04:14,359 WARN L837 $PredicateComparison]: unable to prove that (and (or (not (bvule (bvadd (_ bv8 32) |c_create_sub_list_~sub#1.offset|) (_ bv12 32))) (not (= (select |c_#valid| |c_create_sub_list_~sub#1.base|) (_ bv0 1)))) (forall ((v_ArrVal_2090 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2082 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_2091 (Array (_ BitVec 32) (_ BitVec 32))) (|v_create_sub_list_insert_sub_~sub~0#1.base_66| (_ BitVec 32)) (v_ArrVal_2080 (_ BitVec 1))) (or (= (bvadd (select (store |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_66| v_ArrVal_2080) (select (select (store (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~head#1.base|)) (.cse1 (bvadd (_ bv4 32) |c_create_sub_list_insert_sub_~head#1.offset|))) (store (store (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~head#1.base| (store .cse0 .cse1 |c_create_sub_list_insert_sub_~sub~0#1.base|)) |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_2090) (select .cse0 .cse1) v_ArrVal_2091)) |v_create_sub_list_insert_sub_~sub~0#1.base_66| v_ArrVal_2082) |c_create_sub_list_~sub#1.base|) (bvadd (_ bv4 32) |c_create_sub_list_~sub#1.offset|))) (_ bv1 1)) (_ bv0 1)) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_66|))) (= |v_create_sub_list_insert_sub_~sub~0#1.base_66| |c_create_sub_list_~sub#1.base|)))) is different from false [2023-02-15 01:04:14,363 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:04:14,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2147043381] [2023-02-15 01:04:14,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2147043381] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:04:14,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2039969496] [2023-02-15 01:04:14,364 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 01:04:14,364 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-15 01:04:14,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-15 01:04:14,365 INFO L229 MonitoredProcess]: Starting monitored process 30 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:04:14,366 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Waiting until timeout for monitored process [2023-02-15 01:04:14,923 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-02-15 01:04:14,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [73846063] [2023-02-15 01:04:14,923 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 01:04:14,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:04:14,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 01:04:14,924 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-02-15 01:04:14,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2023-02-15 01:04:14,936 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 1 [2023-02-15 01:04:15,788 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 01:04:15,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 01:04:15,798 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 116 conjunts are in the unsatisfiable core [2023-02-15 01:04:15,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:04:15,808 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:04:15,814 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:04:16,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:04:16,172 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:04:16,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:04:16,333 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 01:04:16,344 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:04:16,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:04:16,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 01:04:16,378 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:04:16,378 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:04:16,525 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:04:16,532 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:04:17,253 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 65 treesize of output 36 [2023-02-15 01:04:17,292 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2023-02-15 01:04:17,292 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 83 treesize of output 117 [2023-02-15 01:04:17,297 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 121 treesize of output 89 [2023-02-15 01:04:17,302 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 42 treesize of output 24 [2023-02-15 01:04:17,564 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 01:04:17,565 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:04:17,903 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-02-15 01:04:17,903 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 102 treesize of output 92 [2023-02-15 01:04:17,935 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:04:18,125 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-02-15 01:04:19,746 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 36 treesize of output 23 [2023-02-15 01:04:19,781 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2023-02-15 01:04:19,782 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 2 case distinctions, treesize of input 39 treesize of output 46 [2023-02-15 01:04:20,058 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2023-02-15 01:04:20,059 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:04:20,217 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:04:20,574 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-02-15 01:04:20,733 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 32 refuted. 6 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:04:20,733 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:04:24,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [73846063] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-15 01:04:24,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:04:24,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 52 [2023-02-15 01:04:24,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828479835] [2023-02-15 01:04:24,708 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:04:24,709 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-02-15 01:04:24,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:04:24,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-02-15 01:04:24,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=3965, Unknown=116, NotChecked=128, Total=4422 [2023-02-15 01:04:24,710 INFO L87 Difference]: Start difference. First operand 224 states and 249 transitions. Second operand has 53 states, 50 states have (on average 1.56) internal successors, (78), 47 states have internal predecessors, (78), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 01:04:42,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:04:42,441 INFO L93 Difference]: Finished difference Result 225 states and 248 transitions. [2023-02-15 01:04:42,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-02-15 01:04:42,442 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 50 states have (on average 1.56) internal successors, (78), 47 states have internal predecessors, (78), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 51 [2023-02-15 01:04:42,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:04:42,443 INFO L225 Difference]: With dead ends: 225 [2023-02-15 01:04:42,443 INFO L226 Difference]: Without dead ends: 225 [2023-02-15 01:04:42,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 60 SyntacticMatches, 5 SemanticMatches, 91 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2120 ImplicationChecksByTransitivity, 19.0s TimeCoverageRelationStatistics Valid=529, Invalid=7662, Unknown=185, NotChecked=180, Total=8556 [2023-02-15 01:04:42,445 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 117 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 3374 mSolverCounterSat, 42 mSolverCounterUnsat, 121 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1357 SdHoareTripleChecker+Invalid, 3537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 3374 IncrementalHoareTripleChecker+Invalid, 121 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2023-02-15 01:04:42,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1357 Invalid, 3537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 3374 Invalid, 121 Unknown, 0 Unchecked, 12.3s Time] [2023-02-15 01:04:42,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2023-02-15 01:04:42,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 224. [2023-02-15 01:04:42,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 168 states have (on average 1.244047619047619) internal successors, (209), 192 states have internal predecessors, (209), 16 states have call successors, (16), 15 states have call predecessors, (16), 17 states have return successors, (23), 16 states have call predecessors, (23), 16 states have call successors, (23) [2023-02-15 01:04:42,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 248 transitions. [2023-02-15 01:04:42,452 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 248 transitions. Word has length 51 [2023-02-15 01:04:42,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:04:42,452 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 248 transitions. [2023-02-15 01:04:42,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 50 states have (on average 1.56) internal successors, (78), 47 states have internal predecessors, (78), 8 states have call successors, (8), 6 states have call predecessors, (8), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-02-15 01:04:42,452 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 248 transitions. [2023-02-15 01:04:42,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-15 01:04:42,453 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:04:42,453 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:04:42,466 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 (29)] Ended with exit code 0 [2023-02-15 01:04:42,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2023-02-15 01:04:42,875 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,31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-02-15 01:04:42,875 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting list_add_tailErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [create_sub_listErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, create_sub_listErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2023-02-15 01:04:42,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:04:42,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1771803765, now seen corresponding path program 2 times [2023-02-15 01:04:42,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:04:42,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1398620787] [2023-02-15 01:04:42,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 01:04:42,876 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:04:42,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:04:42,877 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:04:42,879 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:04:43,566 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 01:04:43,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 01:04:43,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 122 conjunts are in the unsatisfiable core [2023-02-15 01:04:43,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:04:43,593 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:04:43,643 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:04:43,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 01:04:43,682 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 01:04:43,703 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 01:04:43,703 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:04:43,754 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:04:43,952 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:04:44,050 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:04:44,050 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:04:44,062 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:04:44,161 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:04:44,161 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 20 treesize of output 26 [2023-02-15 01:04:44,162 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:04:45,496 INFO L321 Elim1Store]: treesize reduction 27, result has 48.1 percent of original size [2023-02-15 01:04:45,497 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 31 treesize of output 46 [2023-02-15 01:04:45,635 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2023-02-15 01:04:45,723 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 01:04:45,723 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:04:45,742 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:04:45,839 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:04:45,870 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-02-15 01:04:46,332 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-15 01:04:46,481 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:04:46,481 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:04:46,492 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:04:46,654 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 01:04:46,654 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 20 treesize of output 26 [2023-02-15 01:04:46,656 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 01:04:46,838 INFO L321 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2023-02-15 01:04:46,839 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 26 treesize of output 38 [2023-02-15 01:04:46,853 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:04:47,061 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 58 treesize of output 39 [2023-02-15 01:04:47,095 INFO L321 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2023-02-15 01:04:47,095 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 2 case distinctions, treesize of input 72 treesize of output 75 [2023-02-15 01:04:47,313 INFO L321 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2023-02-15 01:04:47,313 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 1 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 01:04:47,342 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-02-15 01:04:47,343 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:04:47,479 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:04:47,484 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:04:47,910 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-02-15 01:04:47,932 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:04:48,194 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 01:04:48,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:04:50,761 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:04:50,761 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 74 treesize of output 75 [2023-02-15 01:04:50,798 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 01:04:50,798 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 3778 treesize of output 3735 [2023-02-15 01:04:50,813 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 3718 treesize of output 3686 [2023-02-15 01:04:50,827 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 3686 treesize of output 3622 [2023-02-15 01:04:50,840 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 3622 treesize of output 3494