./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 b5317dae 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-?-b5317da-m [2023-02-16 03:10:02,055 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:10:02,058 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:10:02,089 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:10:02,090 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:10:02,092 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:10:02,095 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:10:02,097 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:10:02,098 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:10:02,102 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:10:02,103 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:10:02,105 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:10:02,105 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:10:02,106 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:10:02,108 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:10:02,109 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:10:02,109 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:10:02,111 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:10:02,112 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:10:02,117 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:10:02,118 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:10:02,119 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:10:02,120 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:10:02,121 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:10:02,127 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:10:02,127 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:10:02,127 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:10:02,129 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:10:02,129 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:10:02,130 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:10:02,130 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:10:02,130 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:10:02,131 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:10:02,132 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:10:02,134 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:10:02,134 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:10:02,134 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:10:02,135 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:10:02,135 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:10:02,135 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:10:02,136 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:10:02,137 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-16 03:10:02,160 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:10:02,160 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:10:02,161 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:10:02,161 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:10:02,161 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:10:02,162 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:10:02,162 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:10:02,162 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:10:02,162 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:10:02,162 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:10:02,163 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:10:02,163 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:10:02,163 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:10:02,163 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:10:02,164 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:10:02,164 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:10:02,164 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:10:02,164 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:10:02,164 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:10:02,164 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:10:02,164 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:10:02,165 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:10:02,165 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:10:02,165 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:10:02,165 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:10:02,165 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:10:02,165 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:10:02,165 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:10:02,165 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-16 03:10:02,166 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-16 03:10:02,166 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:10:02,166 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:10:02,166 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:10:02,166 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:10:02,166 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-16 03:10:02,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:10:02,396 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:10:02,398 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:10:02,398 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:10:02,399 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:10:02,399 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-16 03:10:03,708 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:10:03,954 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:10:03,955 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0102-1.i [2023-02-16 03:10:03,966 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40ad82af6/5f66fb74b3d5443f8a9e5553e1ba1865/FLAG316d270ba [2023-02-16 03:10:03,979 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40ad82af6/5f66fb74b3d5443f8a9e5553e1ba1865 [2023-02-16 03:10:03,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:10:03,982 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:10:03,984 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:10:03,984 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:10:03,987 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:10:03,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:10:03" (1/1) ... [2023-02-16 03:10:03,988 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1daf8805 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:03, skipping insertion in model container [2023-02-16 03:10:03,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:10:03" (1/1) ... [2023-02-16 03:10:03,993 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:10:04,028 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:10:04,257 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:10:04,265 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-16 03:10:04,266 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@28daa8d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:04, skipping insertion in model container [2023-02-16 03:10:04,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:10:04,266 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-16 03:10:04,268 INFO L158 Benchmark]: Toolchain (without parser) took 285.13ms. Allocated memory is still 132.1MB. Free memory was 83.4MB in the beginning and 71.4MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-16 03:10:04,268 INFO L158 Benchmark]: CDTParser took 13.12ms. Allocated memory is still 104.9MB. Free memory is still 53.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-02-16 03:10:04,269 INFO L158 Benchmark]: CACSL2BoogieTranslator took 282.31ms. Allocated memory is still 132.1MB. Free memory was 83.4MB in the beginning and 71.4MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-02-16 03:10:04,269 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 13.12ms. Allocated memory is still 104.9MB. Free memory is still 53.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 282.31ms. Allocated memory is still 132.1MB. Free memory was 83.4MB in the beginning and 71.4MB 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-?-b5317da-m [2023-02-16 03:10:06,070 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-16 03:10:06,071 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-16 03:10:06,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-16 03:10:06,099 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-16 03:10:06,102 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-16 03:10:06,103 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-16 03:10:06,105 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-16 03:10:06,109 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-16 03:10:06,112 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-16 03:10:06,113 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-16 03:10:06,115 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-16 03:10:06,115 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-16 03:10:06,116 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-16 03:10:06,117 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-16 03:10:06,120 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-16 03:10:06,120 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-16 03:10:06,121 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-16 03:10:06,123 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-16 03:10:06,127 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-16 03:10:06,127 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-16 03:10:06,128 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-16 03:10:06,129 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-16 03:10:06,129 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-16 03:10:06,134 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-16 03:10:06,135 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-16 03:10:06,135 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-16 03:10:06,136 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-16 03:10:06,137 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-16 03:10:06,137 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-16 03:10:06,138 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-16 03:10:06,142 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-16 03:10:06,142 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-16 03:10:06,144 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-16 03:10:06,145 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-16 03:10:06,146 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-16 03:10:06,146 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-16 03:10:06,146 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-16 03:10:06,146 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-16 03:10:06,147 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-16 03:10:06,147 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-16 03:10:06,148 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-16 03:10:06,173 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-16 03:10:06,173 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-16 03:10:06,174 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-16 03:10:06,174 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-16 03:10:06,175 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-16 03:10:06,175 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-16 03:10:06,176 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-16 03:10:06,176 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-16 03:10:06,176 INFO L138 SettingsManager]: * Use SBE=true [2023-02-16 03:10:06,176 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-16 03:10:06,177 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-16 03:10:06,177 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-16 03:10:06,177 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-16 03:10:06,177 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-16 03:10:06,177 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-16 03:10:06,177 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-16 03:10:06,177 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-16 03:10:06,178 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-16 03:10:06,178 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-16 03:10:06,178 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-16 03:10:06,178 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-16 03:10:06,178 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-16 03:10:06,178 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-16 03:10:06,178 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-16 03:10:06,179 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-16 03:10:06,179 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-16 03:10:06,179 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-16 03:10:06,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:10:06,179 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-16 03:10:06,179 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-16 03:10:06,180 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-16 03:10:06,180 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-16 03:10:06,180 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-16 03:10:06,180 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-16 03:10:06,180 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-16 03:10:06,180 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-16 03:10:06,181 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-16 03:10:06,181 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-16 03:10:06,462 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-16 03:10:06,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-16 03:10:06,478 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-16 03:10:06,479 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-16 03:10:06,479 INFO L275 PluginConnector]: CDTParser initialized [2023-02-16 03:10:06,480 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-16 03:10:07,537 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-16 03:10:07,798 INFO L351 CDTParser]: Found 1 translation units. [2023-02-16 03:10:07,799 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0102-1.i [2023-02-16 03:10:07,814 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46ad3bf0f/2129fce2931644419522211f3679ff30/FLAGbb3fa25ec [2023-02-16 03:10:07,830 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46ad3bf0f/2129fce2931644419522211f3679ff30 [2023-02-16 03:10:07,832 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-16 03:10:07,834 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-16 03:10:07,837 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-16 03:10:07,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-16 03:10:07,839 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-16 03:10:07,840 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:10:07" (1/1) ... [2023-02-16 03:10:07,841 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42902f83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:07, skipping insertion in model container [2023-02-16 03:10:07,841 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.02 03:10:07" (1/1) ... [2023-02-16 03:10:07,846 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-16 03:10:07,876 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:10:08,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:10:08,085 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-16 03:10:08,099 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-16 03:10:08,143 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:10:08,151 INFO L203 MainTranslator]: Completed pre-run [2023-02-16 03:10:08,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-16 03:10:08,204 INFO L208 MainTranslator]: Completed translation [2023-02-16 03:10:08,204 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:08 WrapperNode [2023-02-16 03:10:08,204 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-16 03:10:08,207 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-16 03:10:08,207 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-16 03:10:08,207 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-16 03:10:08,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:08" (1/1) ... [2023-02-16 03:10:08,226 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:08" (1/1) ... [2023-02-16 03:10:08,241 INFO L138 Inliner]: procedures = 136, calls = 38, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 86 [2023-02-16 03:10:08,241 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-16 03:10:08,242 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-16 03:10:08,242 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-16 03:10:08,242 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-16 03:10:08,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:08" (1/1) ... [2023-02-16 03:10:08,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:08" (1/1) ... [2023-02-16 03:10:08,252 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:08" (1/1) ... [2023-02-16 03:10:08,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:08" (1/1) ... [2023-02-16 03:10:08,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:08" (1/1) ... [2023-02-16 03:10:08,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:08" (1/1) ... [2023-02-16 03:10:08,264 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:08" (1/1) ... [2023-02-16 03:10:08,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:08" (1/1) ... [2023-02-16 03:10:08,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-16 03:10:08,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-16 03:10:08,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-16 03:10:08,267 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-16 03:10:08,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:08" (1/1) ... [2023-02-16 03:10:08,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-16 03:10:08,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-16 03:10:08,339 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-16 03:10:08,345 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-16 03:10:08,368 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2023-02-16 03:10:08,369 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2023-02-16 03:10:08,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-16 03:10:08,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-16 03:10:08,369 INFO L130 BoogieDeclarations]: Found specification of procedure create_sub_list [2023-02-16 03:10:08,369 INFO L138 BoogieDeclarations]: Found implementation of procedure create_sub_list [2023-02-16 03:10:08,369 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-16 03:10:08,369 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-16 03:10:08,369 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-16 03:10:08,370 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_sub [2023-02-16 03:10:08,370 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_sub [2023-02-16 03:10:08,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-16 03:10:08,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-16 03:10:08,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-16 03:10:08,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-02-16 03:10:08,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-16 03:10:08,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-16 03:10:08,535 INFO L235 CfgBuilder]: Building ICFG [2023-02-16 03:10:08,537 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-16 03:10:08,915 INFO L276 CfgBuilder]: Performing block encoding [2023-02-16 03:10:08,924 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-16 03:10:08,924 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2023-02-16 03:10:08,926 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:10:08 BoogieIcfgContainer [2023-02-16 03:10:08,926 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-16 03:10:08,928 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-16 03:10:08,928 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-16 03:10:08,930 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-16 03:10:08,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.02 03:10:07" (1/3) ... [2023-02-16 03:10:08,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bfe47b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:10:08, skipping insertion in model container [2023-02-16 03:10:08,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.02 03:10:08" (2/3) ... [2023-02-16 03:10:08,932 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bfe47b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.02 03:10:08, skipping insertion in model container [2023-02-16 03:10:08,932 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.02 03:10:08" (3/3) ... [2023-02-16 03:10:08,933 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0102-1.i [2023-02-16 03:10:08,949 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-16 03:10:08,949 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2023-02-16 03:10:08,991 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-16 03:10:08,996 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;@1b53dcc6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-16 03:10:08,997 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2023-02-16 03:10:09,001 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-16 03:10:09,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-02-16 03:10:09,006 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:09,006 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-02-16 03:10:09,006 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-16 03:10:09,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:09,011 INFO L85 PathProgramCache]: Analyzing trace with hash 106012329, now seen corresponding path program 1 times [2023-02-16 03:10:09,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:09,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1848591631] [2023-02-16 03:10:09,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:09,021 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-16 03:10:09,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:09,024 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-16 03:10:09,025 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-16 03:10:09,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:09,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 1 conjunts are in the unsatisfiable core [2023-02-16 03:10:09,138 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:09,151 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-16 03:10:09,152 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:09,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:09,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1848591631] [2023-02-16 03:10:09,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1848591631] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:09,153 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:09,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:10:09,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672265218] [2023-02-16 03:10:09,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:09,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-02-16 03:10:09,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:09,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-02-16 03:10:09,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-02-16 03:10:09,180 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-16 03:10:09,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:09,195 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2023-02-16 03:10:09,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-02-16 03:10:09,196 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-16 03:10:09,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:09,201 INFO L225 Difference]: With dead ends: 87 [2023-02-16 03:10:09,201 INFO L226 Difference]: Without dead ends: 85 [2023-02-16 03:10:09,202 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-16 03:10:09,205 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-16 03:10:09,205 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-16 03:10:09,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-16 03:10:09,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2023-02-16 03:10:09,229 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-16 03:10:09,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2023-02-16 03:10:09,231 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 5 [2023-02-16 03:10:09,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:09,231 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2023-02-16 03:10:09,231 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-16 03:10:09,232 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2023-02-16 03:10:09,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-16 03:10:09,232 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:09,232 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:09,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-16 03:10:09,446 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-16 03:10:09,447 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-16 03:10:09,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:09,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1219357814, now seen corresponding path program 1 times [2023-02-16 03:10:09,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:09,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1552883811] [2023-02-16 03:10:09,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:09,449 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-16 03:10:09,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:09,450 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-16 03:10:09,452 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-16 03:10:09,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:09,496 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:10:09,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:09,526 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-16 03:10:09,551 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-16 03:10:09,552 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:09,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:09,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1552883811] [2023-02-16 03:10:09,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1552883811] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:09,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:09,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:10:09,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008820346] [2023-02-16 03:10:09,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:09,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:10:09,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:09,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:10:09,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:10:09,562 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-16 03:10:09,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:09,770 INFO L93 Difference]: Finished difference Result 91 states and 99 transitions. [2023-02-16 03:10:09,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:10:09,771 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-16 03:10:09,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:09,773 INFO L225 Difference]: With dead ends: 91 [2023-02-16 03:10:09,773 INFO L226 Difference]: Without dead ends: 91 [2023-02-16 03:10:09,773 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-16 03:10:09,774 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 39 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-16 03:10:09,774 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-16 03:10:09,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2023-02-16 03:10:09,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 83. [2023-02-16 03:10:09,784 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-16 03:10:09,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 89 transitions. [2023-02-16 03:10:09,786 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 89 transitions. Word has length 7 [2023-02-16 03:10:09,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:09,787 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 89 transitions. [2023-02-16 03:10:09,787 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-16 03:10:09,787 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 89 transitions. [2023-02-16 03:10:09,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-02-16 03:10:09,787 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:09,787 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:09,799 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-16 03:10:09,988 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-16 03:10:09,988 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-16 03:10:09,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:09,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1219357813, now seen corresponding path program 1 times [2023-02-16 03:10:09,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:09,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [436076575] [2023-02-16 03:10:09,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:09,989 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:10:09,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:09,993 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-16 03:10:09,996 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-16 03:10:10,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:10,037 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjunts are in the unsatisfiable core [2023-02-16 03:10:10,038 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:10,043 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-16 03:10:10,081 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-16 03:10:10,081 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:10,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:10,082 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [436076575] [2023-02-16 03:10:10,082 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [436076575] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:10,082 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:10,082 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-16 03:10:10,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281492481] [2023-02-16 03:10:10,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:10,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-16 03:10:10,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:10,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-16 03:10:10,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-16 03:10:10,084 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-16 03:10:10,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:10,233 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2023-02-16 03:10:10,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-16 03:10:10,234 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-16 03:10:10,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:10,234 INFO L225 Difference]: With dead ends: 87 [2023-02-16 03:10:10,234 INFO L226 Difference]: Without dead ends: 87 [2023-02-16 03:10:10,235 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-16 03:10:10,235 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-16 03:10:10,236 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-16 03:10:10,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-02-16 03:10:10,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2023-02-16 03:10:10,240 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-16 03:10:10,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2023-02-16 03:10:10,241 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 7 [2023-02-16 03:10:10,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:10,241 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2023-02-16 03:10:10,241 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-16 03:10:10,241 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2023-02-16 03:10:10,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-16 03:10:10,242 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:10,242 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:10,261 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-16 03:10:10,449 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-16 03:10:10,449 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-16 03:10:10,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:10,450 INFO L85 PathProgramCache]: Analyzing trace with hash -778231822, now seen corresponding path program 1 times [2023-02-16 03:10:10,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:10,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1957849274] [2023-02-16 03:10:10,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:10,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-16 03:10:10,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:10,454 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-16 03:10:10,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 (5)] Waiting until timeout for monitored process [2023-02-16 03:10:10,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:10,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-16 03:10:10,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:10,546 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-16 03:10:10,552 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-16 03:10:10,552 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:10,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:10,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1957849274] [2023-02-16 03:10:10,552 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1957849274] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:10,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:10,553 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:10:10,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014824311] [2023-02-16 03:10:10,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:10,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:10:10,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:10,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:10:10,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:10:10,554 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-16 03:10:10,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:10,614 INFO L93 Difference]: Finished difference Result 86 states and 92 transitions. [2023-02-16 03:10:10,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:10:10,615 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-16 03:10:10,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:10,616 INFO L225 Difference]: With dead ends: 86 [2023-02-16 03:10:10,616 INFO L226 Difference]: Without dead ends: 86 [2023-02-16 03:10:10,616 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-16 03:10:10,617 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 6 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-16 03:10:10,617 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-16 03:10:10,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-16 03:10:10,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2023-02-16 03:10:10,620 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-16 03:10:10,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2023-02-16 03:10:10,621 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 11 [2023-02-16 03:10:10,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:10,621 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2023-02-16 03:10:10,621 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-16 03:10:10,621 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2023-02-16 03:10:10,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-02-16 03:10:10,621 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:10,621 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:10,643 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-16 03:10:10,828 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-16 03:10:10,829 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-16 03:10:10,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:10,829 INFO L85 PathProgramCache]: Analyzing trace with hash -778231821, now seen corresponding path program 1 times [2023-02-16 03:10:10,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:10,830 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39970930] [2023-02-16 03:10:10,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:10,830 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-16 03:10:10,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:10,833 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-16 03:10:10,834 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-16 03:10:10,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:10,893 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:10:10,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:10,900 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-16 03:10:10,909 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-16 03:10:10,909 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:10,909 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:10,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39970930] [2023-02-16 03:10:10,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [39970930] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:10,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:10,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-16 03:10:10,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844687860] [2023-02-16 03:10:10,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:10,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-16 03:10:10,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:10,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-16 03:10:10,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-16 03:10:10,911 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-16 03:10:10,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:10,993 INFO L93 Difference]: Finished difference Result 85 states and 91 transitions. [2023-02-16 03:10:10,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-16 03:10:10,994 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-16 03:10:10,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:10,995 INFO L225 Difference]: With dead ends: 85 [2023-02-16 03:10:10,995 INFO L226 Difference]: Without dead ends: 85 [2023-02-16 03:10:10,995 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-16 03:10:10,995 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-16 03:10:10,996 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-16 03:10:10,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2023-02-16 03:10:10,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2023-02-16 03:10:11,000 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-16 03:10:11,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 90 transitions. [2023-02-16 03:10:11,000 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 90 transitions. Word has length 11 [2023-02-16 03:10:11,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:11,001 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 90 transitions. [2023-02-16 03:10:11,001 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-16 03:10:11,001 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 90 transitions. [2023-02-16 03:10:11,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-16 03:10:11,001 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:11,002 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:11,011 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-16 03:10:11,208 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-16 03:10:11,209 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-16 03:10:11,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:11,209 INFO L85 PathProgramCache]: Analyzing trace with hash -70636768, now seen corresponding path program 1 times [2023-02-16 03:10:11,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:11,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [803496791] [2023-02-16 03:10:11,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:11,210 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-16 03:10:11,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:11,211 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-16 03:10:11,213 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-16 03:10:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:11,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-16 03:10:11,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:11,307 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-16 03:10:11,312 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-16 03:10:11,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:10:11,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 12 treesize of output 14 [2023-02-16 03:10:11,385 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:10:11,385 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-16 03:10:11,426 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-16 03:10:11,427 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:11,427 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:11,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [803496791] [2023-02-16 03:10:11,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [803496791] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:11,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:11,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:10:11,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460628807] [2023-02-16 03:10:11,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:11,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:10:11,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:11,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:10:11,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:10:11,429 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-16 03:10:11,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:11,861 INFO L93 Difference]: Finished difference Result 112 states and 118 transitions. [2023-02-16 03:10:11,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-16 03:10:11,862 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-16 03:10:11,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:11,862 INFO L225 Difference]: With dead ends: 112 [2023-02-16 03:10:11,862 INFO L226 Difference]: Without dead ends: 112 [2023-02-16 03:10:11,863 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-16 03:10:11,863 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 54 mSDsluCounter, 263 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:11,863 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.4s Time] [2023-02-16 03:10:11,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-02-16 03:10:11,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 102. [2023-02-16 03:10:11,867 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-16 03:10:11,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 117 transitions. [2023-02-16 03:10:11,868 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 117 transitions. Word has length 14 [2023-02-16 03:10:11,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:11,868 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 117 transitions. [2023-02-16 03:10:11,868 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-16 03:10:11,868 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 117 transitions. [2023-02-16 03:10:11,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-16 03:10:11,869 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:11,869 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:11,889 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-16 03:10:12,077 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-16 03:10:12,077 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-16 03:10:12,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:12,078 INFO L85 PathProgramCache]: Analyzing trace with hash -70636769, now seen corresponding path program 1 times [2023-02-16 03:10:12,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:12,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [344561439] [2023-02-16 03:10:12,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:12,078 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-16 03:10:12,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:12,080 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-16 03:10:12,082 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-16 03:10:12,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:12,170 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 03:10:12,173 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:12,178 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-16 03:10:12,222 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 03:10:12,223 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-16 03:10:12,282 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-16 03:10:12,282 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:12,282 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:12,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [344561439] [2023-02-16 03:10:12,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [344561439] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:12,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:12,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-16 03:10:12,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256224850] [2023-02-16 03:10:12,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:12,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-16 03:10:12,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:12,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-16 03:10:12,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-16 03:10:12,284 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-16 03:10:12,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:12,665 INFO L93 Difference]: Finished difference Result 131 states and 146 transitions. [2023-02-16 03:10:12,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-16 03:10:12,665 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-16 03:10:12,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:12,666 INFO L225 Difference]: With dead ends: 131 [2023-02-16 03:10:12,666 INFO L226 Difference]: Without dead ends: 131 [2023-02-16 03:10:12,666 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-16 03:10:12,666 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 87 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:12,666 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.3s Time] [2023-02-16 03:10:12,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-02-16 03:10:12,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 112. [2023-02-16 03:10:12,669 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-16 03:10:12,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 134 transitions. [2023-02-16 03:10:12,672 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 134 transitions. Word has length 14 [2023-02-16 03:10:12,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:12,673 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 134 transitions. [2023-02-16 03:10:12,673 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-16 03:10:12,673 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2023-02-16 03:10:12,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 03:10:12,673 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:12,674 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:12,688 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 (8)] Ended with exit code 0 [2023-02-16 03:10:12,882 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-16 03:10:12,882 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-16 03:10:12,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:12,883 INFO L85 PathProgramCache]: Analyzing trace with hash 837542848, now seen corresponding path program 1 times [2023-02-16 03:10:12,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:12,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177716936] [2023-02-16 03:10:12,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:12,883 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-16 03:10:12,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:12,884 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-16 03:10:12,886 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-16 03:10:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:12,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-16 03:10:12,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:12,992 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-16 03:10:12,992 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:12,992 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:12,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177716936] [2023-02-16 03:10:12,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [177716936] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:12,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:12,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-16 03:10:12,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178104015] [2023-02-16 03:10:12,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:12,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-16 03:10:12,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:12,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-16 03:10:12,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-16 03:10:12,994 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-16 03:10:13,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:13,097 INFO L93 Difference]: Finished difference Result 111 states and 131 transitions. [2023-02-16 03:10:13,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-16 03:10:13,098 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-16 03:10:13,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:13,098 INFO L225 Difference]: With dead ends: 111 [2023-02-16 03:10:13,098 INFO L226 Difference]: Without dead ends: 111 [2023-02-16 03:10:13,099 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-16 03:10:13,099 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-16 03:10:13,099 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-16 03:10:13,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-02-16 03:10:13,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-02-16 03:10:13,102 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-16 03:10:13,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 131 transitions. [2023-02-16 03:10:13,103 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 131 transitions. Word has length 16 [2023-02-16 03:10:13,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:13,103 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 131 transitions. [2023-02-16 03:10:13,103 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-16 03:10:13,104 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 131 transitions. [2023-02-16 03:10:13,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-16 03:10:13,104 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:13,104 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:13,115 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 (9)] Ended with exit code 0 [2023-02-16 03:10:13,311 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-16 03:10:13,312 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-16 03:10:13,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:13,312 INFO L85 PathProgramCache]: Analyzing trace with hash 837542849, now seen corresponding path program 1 times [2023-02-16 03:10:13,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:13,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1514843458] [2023-02-16 03:10:13,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:13,313 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-16 03:10:13,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:13,318 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-16 03:10:13,325 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-16 03:10:13,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:13,412 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 03:10:13,413 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:13,486 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-16 03:10:13,486 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:13,486 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:13,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1514843458] [2023-02-16 03:10:13,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1514843458] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:13,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:13,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-16 03:10:13,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468749327] [2023-02-16 03:10:13,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:13,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 03:10:13,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:13,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 03:10:13,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:10:13,487 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-16 03:10:13,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:13,730 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2023-02-16 03:10:13,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:10:13,731 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-16 03:10:13,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:13,732 INFO L225 Difference]: With dead ends: 119 [2023-02-16 03:10:13,732 INFO L226 Difference]: Without dead ends: 119 [2023-02-16 03:10:13,732 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-16 03:10:13,732 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 96 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-16 03:10:13,732 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-16 03:10:13,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-02-16 03:10:13,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2023-02-16 03:10:13,735 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-16 03:10:13,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 130 transitions. [2023-02-16 03:10:13,735 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 130 transitions. Word has length 16 [2023-02-16 03:10:13,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:13,736 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 130 transitions. [2023-02-16 03:10:13,736 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-16 03:10:13,736 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2023-02-16 03:10:13,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 03:10:13,736 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:13,736 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:13,756 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-16 03:10:13,944 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-16 03:10:13,945 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-16 03:10:13,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:13,945 INFO L85 PathProgramCache]: Analyzing trace with hash 194024551, now seen corresponding path program 1 times [2023-02-16 03:10:13,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:13,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [3866746] [2023-02-16 03:10:13,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:13,946 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-16 03:10:13,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:13,947 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-16 03:10:13,956 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-16 03:10:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:14,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-16 03:10:14,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:14,051 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-16 03:10:14,074 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-16 03:10:14,074 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:14,074 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:14,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [3866746] [2023-02-16 03:10:14,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [3866746] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:14,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:14,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:10:14,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319878487] [2023-02-16 03:10:14,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:14,075 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:10:14,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:14,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:10:14,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:10:14,076 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-16 03:10:14,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:14,256 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2023-02-16 03:10:14,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-16 03:10:14,257 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-16 03:10:14,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:14,258 INFO L225 Difference]: With dead ends: 118 [2023-02-16 03:10:14,258 INFO L226 Difference]: Without dead ends: 118 [2023-02-16 03:10:14,258 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-16 03:10:14,258 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.2s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:14,258 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.2s Time] [2023-02-16 03:10:14,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-02-16 03:10:14,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2023-02-16 03:10:14,261 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-16 03:10:14,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 125 transitions. [2023-02-16 03:10:14,261 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 125 transitions. Word has length 17 [2023-02-16 03:10:14,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:14,261 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 125 transitions. [2023-02-16 03:10:14,261 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-16 03:10:14,261 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 125 transitions. [2023-02-16 03:10:14,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-02-16 03:10:14,262 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:14,262 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:10:14,269 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-16 03:10:14,469 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-16 03:10:14,469 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-16 03:10:14,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:14,470 INFO L85 PathProgramCache]: Analyzing trace with hash 194024552, now seen corresponding path program 1 times [2023-02-16 03:10:14,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:14,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1241098712] [2023-02-16 03:10:14,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:14,470 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-16 03:10:14,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:14,471 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-16 03:10:14,476 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-16 03:10:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:14,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-16 03:10:14,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:14,615 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-16 03:10:14,668 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-16 03:10:14,668 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:14,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:14,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1241098712] [2023-02-16 03:10:14,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1241098712] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:14,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:14,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-16 03:10:14,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344851120] [2023-02-16 03:10:14,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:14,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-16 03:10:14,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:14,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-16 03:10:14,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-16 03:10:14,670 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-16 03:10:14,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:14,898 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2023-02-16 03:10:14,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-16 03:10:14,899 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-16 03:10:14,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:14,900 INFO L225 Difference]: With dead ends: 116 [2023-02-16 03:10:14,900 INFO L226 Difference]: Without dead ends: 116 [2023-02-16 03:10:14,900 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-16 03:10:14,901 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-16 03:10:14,901 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-16 03:10:14,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-02-16 03:10:14,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 110. [2023-02-16 03:10:14,903 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-16 03:10:14,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2023-02-16 03:10:14,904 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 17 [2023-02-16 03:10:14,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:14,904 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2023-02-16 03:10:14,904 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-16 03:10:14,904 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2023-02-16 03:10:14,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-16 03:10:14,904 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:14,904 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-16 03:10:14,915 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-16 03:10:15,112 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-16 03:10:15,112 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-16 03:10:15,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:15,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1774001130, now seen corresponding path program 1 times [2023-02-16 03:10:15,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:15,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1989409718] [2023-02-16 03:10:15,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:15,114 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-16 03:10:15,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:15,133 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-16 03:10:15,166 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-16 03:10:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:15,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 28 conjunts are in the unsatisfiable core [2023-02-16 03:10:15,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:15,290 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-16 03:10:15,314 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-16 03:10:15,335 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-16 03:10:15,349 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:10:15,349 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-16 03:10:15,376 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-16 03:10:15,430 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-16 03:10:15,460 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-16 03:10:15,461 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:15,461 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:15,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1989409718] [2023-02-16 03:10:15,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1989409718] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:15,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:15,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-16 03:10:15,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759487531] [2023-02-16 03:10:15,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:15,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 03:10:15,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:15,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 03:10:15,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-02-16 03:10:15,462 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-16 03:10:16,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:16,074 INFO L93 Difference]: Finished difference Result 145 states and 161 transitions. [2023-02-16 03:10:16,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-16 03:10:16,075 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-16 03:10:16,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:16,076 INFO L225 Difference]: With dead ends: 145 [2023-02-16 03:10:16,076 INFO L226 Difference]: Without dead ends: 145 [2023-02-16 03:10:16,076 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-16 03:10:16,077 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 59 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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-16 03:10:16,077 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-16 03:10:16,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-02-16 03:10:16,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 132. [2023-02-16 03:10:16,079 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-16 03:10:16,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 149 transitions. [2023-02-16 03:10:16,080 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 149 transitions. Word has length 19 [2023-02-16 03:10:16,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:16,080 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 149 transitions. [2023-02-16 03:10:16,080 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-16 03:10:16,080 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 149 transitions. [2023-02-16 03:10:16,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-02-16 03:10:16,081 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:16,081 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-16 03:10:16,089 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-16 03:10:16,281 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-16 03:10:16,281 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-16 03:10:16,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:16,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1774001131, now seen corresponding path program 1 times [2023-02-16 03:10:16,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:16,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823203483] [2023-02-16 03:10:16,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:16,282 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-16 03:10:16,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:16,284 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-16 03:10:16,286 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-16 03:10:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:16,460 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 46 conjunts are in the unsatisfiable core [2023-02-16 03:10:16,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:16,468 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-16 03:10:16,472 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-16 03:10:16,522 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-16 03:10:16,529 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-16 03:10:16,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:10:16,557 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-16 03:10:16,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:10:16,570 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-16 03:10:16,585 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:10:16,585 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-16 03:10:16,593 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-16 03:10:16,629 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-16 03:10:16,635 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-16 03:10:16,743 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-16 03:10:16,747 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-16 03:10:16,790 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-16 03:10:16,790 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:10:16,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:16,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823203483] [2023-02-16 03:10:16,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823203483] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:10:16,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:10:16,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-02-16 03:10:16,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826442702] [2023-02-16 03:10:16,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:10:16,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-16 03:10:16,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:16,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-16 03:10:16,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2023-02-16 03:10:16,791 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-16 03:10:17,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:17,495 INFO L93 Difference]: Finished difference Result 135 states and 150 transitions. [2023-02-16 03:10:17,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-16 03:10:17,495 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-16 03:10:17,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:17,497 INFO L225 Difference]: With dead ends: 135 [2023-02-16 03:10:17,497 INFO L226 Difference]: Without dead ends: 135 [2023-02-16 03:10:17,497 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-16 03:10:17,497 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-16 03:10:17,497 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-16 03:10:17,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-02-16 03:10:17,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2023-02-16 03:10:17,500 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-16 03:10:17,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 150 transitions. [2023-02-16 03:10:17,501 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 150 transitions. Word has length 19 [2023-02-16 03:10:17,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:17,501 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 150 transitions. [2023-02-16 03:10:17,501 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-16 03:10:17,501 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 150 transitions. [2023-02-16 03:10:17,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-02-16 03:10:17,502 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:17,502 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-16 03:10:17,519 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-16 03:10:17,703 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-16 03:10:17,703 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-16 03:10:17,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:17,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1031850971, now seen corresponding path program 1 times [2023-02-16 03:10:17,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:17,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [922808459] [2023-02-16 03:10:17,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:17,704 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-16 03:10:17,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:17,705 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-16 03:10:17,709 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-16 03:10:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:17,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-16 03:10:17,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:17,886 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-16 03:10:17,891 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-16 03:10:17,934 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-16 03:10:17,959 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-16 03:10:17,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:10:17,994 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-16 03:10:18,000 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:10:18,001 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-16 03:10:18,075 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-16 03:10:18,075 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:10:22,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:22,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [922808459] [2023-02-16 03:10:22,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [922808459] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:10:22,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [639823759] [2023-02-16 03:10:22,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:22,380 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:10:22,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:10:22,382 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-16 03:10:22,383 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-16 03:10:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:22,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-16 03:10:22,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:22,685 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-16 03:10:22,689 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-16 03:10:22,822 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-16 03:10:23,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:10:23,059 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-16 03:10:23,064 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:10:23,064 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-16 03:10:23,073 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-16 03:10:23,073 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:10:23,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [639823759] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:10:23,520 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:10:23,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 12] total 13 [2023-02-16 03:10:23,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747820460] [2023-02-16 03:10:23,520 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:10:23,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-02-16 03:10:23,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:23,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-02-16 03:10:23,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=4, NotChecked=32, Total=342 [2023-02-16 03:10:23,522 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-16 03:10:26,152 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-16 03:10:30,225 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-16 03:10:32,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:32,985 INFO L93 Difference]: Finished difference Result 163 states and 184 transitions. [2023-02-16 03:10:32,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-02-16 03:10:32,986 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-16 03:10:32,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:32,987 INFO L225 Difference]: With dead ends: 163 [2023-02-16 03:10:32,987 INFO L226 Difference]: Without dead ends: 163 [2023-02-16 03:10:32,987 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=80, Invalid=470, Unknown=6, NotChecked=44, Total=600 [2023-02-16 03:10:32,988 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 82 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 9 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s 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.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:32,988 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.1s Time] [2023-02-16 03:10:32,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-02-16 03:10:32,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 143. [2023-02-16 03:10:32,991 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-16 03:10:32,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 160 transitions. [2023-02-16 03:10:32,991 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 160 transitions. Word has length 29 [2023-02-16 03:10:32,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:33,009 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 160 transitions. [2023-02-16 03:10:33,010 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-16 03:10:33,010 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 160 transitions. [2023-02-16 03:10:33,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-16 03:10:33,010 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:33,010 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-16 03:10:33,017 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-16 03:10:33,226 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-16 03:10:33,415 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-16 03:10:33,415 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-16 03:10:33,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:33,416 INFO L85 PathProgramCache]: Analyzing trace with hash 343570640, now seen corresponding path program 1 times [2023-02-16 03:10:33,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:33,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134996037] [2023-02-16 03:10:33,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:33,416 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-16 03:10:33,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:33,418 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-16 03:10:33,419 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-16 03:10:33,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:33,639 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 37 conjunts are in the unsatisfiable core [2023-02-16 03:10:33,642 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:33,647 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-16 03:10:33,651 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-16 03:10:33,744 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-16 03:10:33,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:10:33,859 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-16 03:10:33,868 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:10:33,868 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-16 03:10:33,967 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:10:33,967 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-16 03:10:33,984 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:10:33,984 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-16 03:10:34,081 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:34,081 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:10:43,221 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:10:43,221 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 68 [2023-02-16 03:10:43,753 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:43,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134996037] [2023-02-16 03:10:43,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2134996037] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:10:43,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [558476931] [2023-02-16 03:10:43,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:43,754 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:10:43,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:10:43,755 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:10:43,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Waiting until timeout for monitored process [2023-02-16 03:10:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:44,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 39 conjunts are in the unsatisfiable core [2023-02-16 03:10:44,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:44,167 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-16 03:10:44,173 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-16 03:10:44,260 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-16 03:10:44,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:10:44,390 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-16 03:10:44,402 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:10:44,403 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-16 03:10:44,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:10:44,473 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-16 03:10:44,484 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:10:44,484 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-16 03:10:44,513 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:10:44,514 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:10:45,086 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:10:45,086 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 68 [2023-02-16 03:10:48,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [558476931] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:10:48,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:10:48,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 14 [2023-02-16 03:10:48,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323011552] [2023-02-16 03:10:48,374 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:10:48,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-02-16 03:10:48,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:48,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-02-16 03:10:48,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=369, Unknown=3, NotChecked=0, Total=420 [2023-02-16 03:10:48,375 INFO L87 Difference]: Start difference. First operand 143 states and 160 transitions. Second operand has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 12 states have internal predecessors, (32), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 03:10:50,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:10:50,816 INFO L93 Difference]: Finished difference Result 222 states and 253 transitions. [2023-02-16 03:10:50,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-16 03:10:50,817 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 12 states have internal predecessors, (32), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 36 [2023-02-16 03:10:50,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:10:50,818 INFO L225 Difference]: With dead ends: 222 [2023-02-16 03:10:50,818 INFO L226 Difference]: Without dead ends: 222 [2023-02-16 03:10:50,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 67 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=134, Invalid=855, Unknown=3, NotChecked=0, Total=992 [2023-02-16 03:10:50,819 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 150 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 30 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-16 03:10:50,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 335 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1017 Invalid, 1 Unknown, 0 Unchecked, 1.8s Time] [2023-02-16 03:10:50,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-02-16 03:10:50,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 172. [2023-02-16 03:10:50,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 125 states have (on average 1.36) internal successors, (170), 150 states have internal predecessors, (170), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (13), 10 states have call predecessors, (13), 12 states have call successors, (13) [2023-02-16 03:10:50,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 195 transitions. [2023-02-16 03:10:50,827 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 195 transitions. Word has length 36 [2023-02-16 03:10:50,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:10:50,827 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 195 transitions. [2023-02-16 03:10:50,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 12 states have internal predecessors, (32), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 03:10:50,828 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 195 transitions. [2023-02-16 03:10:50,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-16 03:10:50,829 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:10:50,830 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-16 03:10:50,841 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-16 03:10:51,043 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (18)] Forceful destruction successful, exit code 0 [2023-02-16 03:10:51,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-16 03:10:51,239 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-16 03:10:51,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:10:51,240 INFO L85 PathProgramCache]: Analyzing trace with hash 2012582842, now seen corresponding path program 1 times [2023-02-16 03:10:51,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:10:51,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1987412430] [2023-02-16 03:10:51,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:51,240 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-16 03:10:51,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:10:51,244 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:10:51,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-16 03:10:51,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:51,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 75 conjunts are in the unsatisfiable core [2023-02-16 03:10:51,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:51,668 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-16 03:10:51,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-16 03:10:51,771 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-16 03:10:51,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:10:51,838 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-16 03:10:51,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:10:51,852 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-16 03:10:51,889 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:10:51,890 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-16 03:10:51,991 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-16 03:10:52,008 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-16 03:10:52,056 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-16 03:10:52,060 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-16 03:10:52,880 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-16 03:10:52,918 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2023-02-16 03:10:52,919 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-16 03:10:52,924 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-16 03:10:52,931 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-16 03:10:52,940 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-16 03:10:53,098 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2023-02-16 03:10:53,099 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-16 03:10:53,215 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-16 03:10:53,406 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-16 03:10:53,593 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-16 03:10:53,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:10:57,035 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:10:57,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1987412430] [2023-02-16 03:10:57,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1987412430] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:10:57,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [515315583] [2023-02-16 03:10:57,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:10:57,036 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:10:57,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:10:57,037 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:10:57,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Waiting until timeout for monitored process [2023-02-16 03:10:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:10:57,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 79 conjunts are in the unsatisfiable core [2023-02-16 03:10:57,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:10:57,570 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-16 03:10:57,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-02-16 03:10:57,600 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-16 03:10:57,608 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:10:57,609 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-16 03:10:57,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:10:57,618 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-16 03:10:57,655 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:10:57,655 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-16 03:10:57,696 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-16 03:10:57,707 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-16 03:10:57,725 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-16 03:10:57,729 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-16 03:10:58,254 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-16 03:10:58,298 INFO L321 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2023-02-16 03:10:58,298 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-16 03:10:58,304 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-16 03:10:58,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:10:58,309 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-16 03:10:58,323 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-16 03:10:58,395 INFO L321 Elim1Store]: treesize reduction 56, result has 35.6 percent of original size [2023-02-16 03:10:58,396 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-16 03:10:58,442 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-16 03:10:58,483 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-16 03:10:58,624 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-16 03:10:58,625 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:10:58,656 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_934 (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_934) |c_create_sub_list_insert_sub_~head#1.base|) (bvadd |c_create_sub_list_insert_sub_~head#1.offset| (_ bv4 32)))) (_ bv1 1)))) is different from false [2023-02-16 03:10:59,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [515315583] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:10:59,712 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:10:59,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 22 [2023-02-16 03:10:59,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385326765] [2023-02-16 03:10:59,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:10:59,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-02-16 03:10:59,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:10:59,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-02-16 03:10:59,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=879, Unknown=30, NotChecked=60, Total=1056 [2023-02-16 03:10:59,714 INFO L87 Difference]: Start difference. First operand 172 states and 195 transitions. Second operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 20 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:11:05,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:11:05,046 INFO L93 Difference]: Finished difference Result 187 states and 210 transitions. [2023-02-16 03:11:05,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-02-16 03:11:05,046 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 20 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2023-02-16 03:11:05,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:11:05,047 INFO L225 Difference]: With dead ends: 187 [2023-02-16 03:11:05,047 INFO L226 Difference]: Without dead ends: 187 [2023-02-16 03:11:05,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 57 SyntacticMatches, 8 SemanticMatches, 48 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=243, Invalid=2055, Unknown=58, NotChecked=94, Total=2450 [2023-02-16 03:11:05,048 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 57 mSDsluCounter, 701 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 17 mSolverCounterUnsat, 15 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 15 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:11:05,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 774 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 958 Invalid, 15 Unknown, 0 Unchecked, 3.0s Time] [2023-02-16 03:11:05,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2023-02-16 03:11:05,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2023-02-16 03:11:05,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 137 states have (on average 1.3357664233576643) internal successors, (183), 163 states have internal predecessors, (183), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (14), 10 states have call predecessors, (14), 13 states have call successors, (14) [2023-02-16 03:11:05,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 210 transitions. [2023-02-16 03:11:05,052 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 210 transitions. Word has length 35 [2023-02-16 03:11:05,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:11:05,052 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 210 transitions. [2023-02-16 03:11:05,053 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 20 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-16 03:11:05,053 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 210 transitions. [2023-02-16 03:11:05,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-16 03:11:05,053 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:11:05,053 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-16 03:11:05,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (20)] Forceful destruction successful, exit code 0 [2023-02-16 03:11:05,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-02-16 03:11:05,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:11:05,467 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-16 03:11:05,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:11:05,467 INFO L85 PathProgramCache]: Analyzing trace with hash 2012582843, now seen corresponding path program 1 times [2023-02-16 03:11:05,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:11:05,467 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1600040340] [2023-02-16 03:11:05,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:11:05,468 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-16 03:11:05,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:11:05,469 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:11:05,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-02-16 03:11:05,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:11:05,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 95 conjunts are in the unsatisfiable core [2023-02-16 03:11:05,910 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:11:05,916 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-16 03:11:05,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-16 03:11:05,959 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-16 03:11:05,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:05,983 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-16 03:11:05,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:05,993 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-16 03:11:06,008 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-16 03:11:06,035 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:11:06,035 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-16 03:11:06,117 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-16 03:11:06,140 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-16 03:11:06,157 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-16 03:11:06,162 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-16 03:11:07,644 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 79 [2023-02-16 03:11:07,670 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 71 [2023-02-16 03:11:07,742 INFO L321 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2023-02-16 03:11:07,742 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 124 treesize of output 150 [2023-02-16 03:11:07,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:07,748 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 154 treesize of output 106 [2023-02-16 03:11:07,755 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:07,759 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 30 treesize of output 27 [2023-02-16 03:11:07,775 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-16 03:11:07,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:07,794 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-16 03:11:07,965 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-02-16 03:11:07,965 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-16 03:11:07,978 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-16 03:11:08,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2023-02-16 03:11:08,091 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-16 03:11:08,371 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-16 03:11:08,373 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-16 03:11:08,577 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-16 03:11:08,577 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:11:09,425 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_create_sub_list_insert_sub_~head#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_1064 (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_1064) |c_create_sub_list_insert_sub_~head#1.base|) .cse1))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_1063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1064 (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_1064) |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_1063) |c_create_sub_list_insert_sub_~head#1.base|) .cse1)))))) is different from false [2023-02-16 03:11:09,489 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_create_sub_list_~sub#1.offset| (_ bv4 32)))) (and (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_30| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_30|))) (forall ((v_ArrVal_1063 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1064 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1062 (_ BitVec 32))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| |v_create_sub_list_insert_sub_~sub~0#1.base_30| v_ArrVal_1064) |c_create_sub_list_~sub#1.base|) .cse0) (_ bv4 32)) (select (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_30| v_ArrVal_1062) (select (select (store |c_#memory_$Pointer$.base| |v_create_sub_list_insert_sub_~sub~0#1.base_30| v_ArrVal_1063) |c_create_sub_list_~sub#1.base|) .cse0)))))) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_30| (_ BitVec 32))) (or (forall ((v_ArrVal_1064 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| |v_create_sub_list_insert_sub_~sub~0#1.base_30| v_ArrVal_1064) |c_create_sub_list_~sub#1.base|) .cse0))) (bvule .cse1 (bvadd .cse1 (_ bv4 32))))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_30|))))))) is different from false [2023-02-16 03:11:17,615 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:11:17,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1600040340] [2023-02-16 03:11:17,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1600040340] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:11:17,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1647015671] [2023-02-16 03:11:17,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:11:17,615 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:11:17,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:11:17,617 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:11:17,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Waiting until timeout for monitored process [2023-02-16 03:11:18,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:11:18,514 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 99 conjunts are in the unsatisfiable core [2023-02-16 03:11:18,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:11:18,523 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-16 03:11:18,547 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-16 03:11:18,553 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-16 03:11:18,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:18,573 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-16 03:11:18,579 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:18,580 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-16 03:11:18,622 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:11:18,622 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-16 03:11:18,635 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-16 03:11:18,688 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-16 03:11:18,696 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-16 03:11:18,715 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-16 03:11:18,719 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-16 03:11:23,210 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 91 [2023-02-16 03:11:23,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:23,221 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-16 03:11:23,226 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-16 03:11:23,258 INFO L321 Elim1Store]: treesize reduction 34, result has 24.4 percent of original size [2023-02-16 03:11:23,258 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-16 03:11:23,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:23,263 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-16 03:11:23,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:23,311 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-16 03:11:23,688 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-16 03:11:23,688 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 26 [2023-02-16 03:11:23,709 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-02-16 03:11:23,710 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-16 03:11:24,001 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-16 03:11:24,024 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-16 03:11:24,024 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-16 03:11:24,032 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 03:11:24,041 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-16 03:11:24,129 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-16 03:11:24,133 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-16 03:11:24,371 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-16 03:11:24,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:11:24,447 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_create_sub_list_insert_sub_~head#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_1203 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1204 (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_1204) |c_create_sub_list_insert_sub_~head#1.base|) .cse0) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1203) |c_create_sub_list_insert_sub_~head#1.base|) .cse0)))) (forall ((v_ArrVal_1204 (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_1204) |c_create_sub_list_insert_sub_~head#1.base|) .cse0))) (bvule .cse1 (bvadd .cse1 (_ bv4 32))))))) is different from false [2023-02-16 03:11:35,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1647015671] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:11:35,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:11:35,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 30 [2023-02-16 03:11:35,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649426380] [2023-02-16 03:11:35,736 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:11:35,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-02-16 03:11:35,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:11:35,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-02-16 03:11:35,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1350, Unknown=26, NotChecked=228, Total=1722 [2023-02-16 03:11:35,737 INFO L87 Difference]: Start difference. First operand 186 states and 210 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-16 03:11:46,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:11:46,304 INFO L93 Difference]: Finished difference Result 186 states and 209 transitions. [2023-02-16 03:11:46,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-16 03:11:46,305 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-16 03:11:46,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:11:46,306 INFO L225 Difference]: With dead ends: 186 [2023-02-16 03:11:46,306 INFO L226 Difference]: Without dead ends: 186 [2023-02-16 03:11:46,306 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 51 SyntacticMatches, 5 SemanticMatches, 52 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 553 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=211, Invalid=2318, Unknown=33, NotChecked=300, Total=2862 [2023-02-16 03:11:46,307 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 44 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 1090 mSolverCounterSat, 10 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 765 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1090 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2023-02-16 03:11:46,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 765 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1090 Invalid, 18 Unknown, 0 Unchecked, 4.7s Time] [2023-02-16 03:11:46,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2023-02-16 03:11:46,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2023-02-16 03:11:46,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 137 states have (on average 1.3284671532846715) internal successors, (182), 163 states have internal predecessors, (182), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (14), 10 states have call predecessors, (14), 13 states have call successors, (14) [2023-02-16 03:11:46,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 209 transitions. [2023-02-16 03:11:46,312 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 209 transitions. Word has length 35 [2023-02-16 03:11:46,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:11:46,312 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 209 transitions. [2023-02-16 03:11:46,312 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-16 03:11:46,312 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 209 transitions. [2023-02-16 03:11:46,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-02-16 03:11:46,315 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:11:46,315 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, 1, 1, 1] [2023-02-16 03:11:46,321 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (22)] Ended with exit code 0 [2023-02-16 03:11:46,531 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-02-16 03:11:46,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:11:46,722 INFO L420 AbstractCegarLoop]: === Iteration 18 === 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-16 03:11:46,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:11:46,722 INFO L85 PathProgramCache]: Analyzing trace with hash -541096591, now seen corresponding path program 1 times [2023-02-16 03:11:46,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:11:46,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1521149024] [2023-02-16 03:11:46,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:11:46,722 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-16 03:11:46,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:11:46,724 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-16 03:11:46,724 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-16 03:11:46,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:11:46,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 13 conjunts are in the unsatisfiable core [2023-02-16 03:11:46,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:11:47,010 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-16 03:11:47,010 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-16 03:11:47,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:11:47,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1521149024] [2023-02-16 03:11:47,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1521149024] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-16 03:11:47,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-16 03:11:47,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-02-16 03:11:47,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064465933] [2023-02-16 03:11:47,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-16 03:11:47,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-16 03:11:47,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:11:47,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-16 03:11:47,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-02-16 03:11:47,011 INFO L87 Difference]: Start difference. First operand 186 states and 209 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 03:11:47,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:11:47,360 INFO L93 Difference]: Finished difference Result 190 states and 206 transitions. [2023-02-16 03:11:47,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-16 03:11:47,361 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 38 [2023-02-16 03:11:47,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:11:47,362 INFO L225 Difference]: With dead ends: 190 [2023-02-16 03:11:47,362 INFO L226 Difference]: Without dead ends: 190 [2023-02-16 03:11:47,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 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-16 03:11:47,363 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 86 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-16 03:11:47,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 607 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-16 03:11:47,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-02-16 03:11:47,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 186. [2023-02-16 03:11:47,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 163 states have internal predecessors, (178), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (14), 10 states have call predecessors, (14), 13 states have call successors, (14) [2023-02-16 03:11:47,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 205 transitions. [2023-02-16 03:11:47,374 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 205 transitions. Word has length 38 [2023-02-16 03:11:47,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:11:47,374 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 205 transitions. [2023-02-16 03:11:47,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-16 03:11:47,375 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 205 transitions. [2023-02-16 03:11:47,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-02-16 03:11:47,375 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:11:47,375 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-16 03:11:47,384 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 (23)] Ended with exit code 0 [2023-02-16 03:11:47,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:11:47,584 INFO L420 AbstractCegarLoop]: === Iteration 19 === 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-16 03:11:47,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:11:47,584 INFO L85 PathProgramCache]: Analyzing trace with hash -796271557, now seen corresponding path program 1 times [2023-02-16 03:11:47,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:11:47,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [849903945] [2023-02-16 03:11:47,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:11:47,585 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-16 03:11:47,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:11:47,586 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:11:47,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-02-16 03:11:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:11:47,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 356 conjuncts, 47 conjunts are in the unsatisfiable core [2023-02-16 03:11:47,907 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:11:48,044 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-16 03:11:48,049 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-16 03:11:48,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:48,089 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-16 03:11:48,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:11:48,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-16 03:11:48,113 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:11:48,113 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-16 03:11:48,155 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-16 03:11:48,159 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-16 03:11:48,259 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-16 03:11:48,264 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-16 03:11:48,343 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-16 03:11:48,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:11:48,539 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:11:48,539 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-16 03:11:49,015 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_create_sub_list_insert_sub_~head#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_1426 (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_1426) |c_create_sub_list_insert_sub_~head#1.base|) .cse0) (_ bv4 32)) (bvadd |c_create_sub_list_insert_sub_~head#1.offset| (_ bv8 32)))) (forall ((v_ArrVal_1426 (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_1426) |c_create_sub_list_insert_sub_~head#1.base|) .cse0))) (bvule .cse1 (bvadd .cse1 (_ bv4 32))))) (forall ((v_ArrVal_1425 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$.base| |c_create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1425) |c_create_sub_list_insert_sub_~head#1.base|) .cse0) |c_create_sub_list_insert_sub_~head#1.base|)))) is different from false [2023-02-16 03:11:52,687 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:11:52,687 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-16 03:11:52,692 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 32 [2023-02-16 03:11:52,699 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 15 treesize of output 11 [2023-02-16 03:11:52,747 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:11:52,748 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 31 [2023-02-16 03:11:52,751 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 36 treesize of output 24 [2023-02-16 03:11:52,757 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-16 03:11:52,772 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:11:52,772 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-16 03:11:52,775 INFO L173 IndexEqualityManager]: detected equality via solver [2023-02-16 03:11:52,777 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 28 treesize of output 10 [2023-02-16 03:11:54,256 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:11:54,257 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-16 03:11:54,474 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-16 03:11:54,475 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-16 03:11:54,498 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-16 03:11:54,498 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-16 03:11:54,530 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-16 03:11:54,530 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:11:54,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [849903945] [2023-02-16 03:11:54,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [849903945] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-16 03:11:54,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:11:54,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 29 [2023-02-16 03:11:54,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611125502] [2023-02-16 03:11:54,530 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:11:54,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-16 03:11:54,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:11:54,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-16 03:11:54,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=733, Unknown=7, NotChecked=54, Total=870 [2023-02-16 03:11:54,532 INFO L87 Difference]: Start difference. First operand 186 states and 205 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-16 03:11:57,209 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-16 03:12:14,341 WARN L233 SmtUtils]: Spent 16.76s on a formula simplification. DAG size of input: 83 DAG size of output: 52 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 03:12:16,345 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-16 03:12:18,979 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-16 03:12:21,058 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-16 03:12:23,108 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-16 03:12:25,615 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-16 03:12:27,808 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-16 03:12:29,810 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-16 03:12:36,285 WARN L233 SmtUtils]: Spent 6.17s on a formula simplification. DAG size of input: 110 DAG size of output: 76 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-16 03:12:46,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:12:46,188 INFO L93 Difference]: Finished difference Result 202 states and 217 transitions. [2023-02-16 03:12:46,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-02-16 03:12:46,188 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-16 03:12:46,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:12:46,189 INFO L225 Difference]: With dead ends: 202 [2023-02-16 03:12:46,189 INFO L226 Difference]: Without dead ends: 202 [2023-02-16 03:12:46,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 389 ImplicationChecksByTransitivity, 33.7s TimeCoverageRelationStatistics Valid=312, Invalid=2234, Unknown=8, NotChecked=98, Total=2652 [2023-02-16 03:12:46,190 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 163 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 1133 mSolverCounterSat, 36 mSolverCounterUnsat, 33 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 23.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 1133 IncrementalHoareTripleChecker+Invalid, 33 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 23.8s IncrementalHoareTripleChecker+Time [2023-02-16 03:12:46,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 1043 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 1133 Invalid, 33 Unknown, 88 Unchecked, 23.8s Time] [2023-02-16 03:12:46,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-02-16 03:12:46,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 192. [2023-02-16 03:12:46,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 141 states have (on average 1.2765957446808511) internal successors, (180), 169 states have internal predecessors, (180), 13 states have call successors, (13), 12 states have call predecessors, (13), 13 states have return successors, (14), 10 states have call predecessors, (14), 13 states have call successors, (14) [2023-02-16 03:12:46,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 207 transitions. [2023-02-16 03:12:46,194 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 207 transitions. Word has length 41 [2023-02-16 03:12:46,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:12:46,194 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 207 transitions. [2023-02-16 03:12:46,194 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-16 03:12:46,194 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 207 transitions. [2023-02-16 03:12:46,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-16 03:12:46,195 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:12:46,195 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-16 03:12:46,206 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 (24)] Ended with exit code 0 [2023-02-16 03:12:46,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-16 03:12:46,407 INFO L420 AbstractCegarLoop]: === Iteration 20 === 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-16 03:12:46,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:12:46,408 INFO L85 PathProgramCache]: Analyzing trace with hash 782352299, now seen corresponding path program 1 times [2023-02-16 03:12:46,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:12:46,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1278587325] [2023-02-16 03:12:46,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:12:46,408 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-16 03:12:46,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:12:46,410 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-16 03:12:46,411 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-16 03:12:46,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:12:46,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-16 03:12:46,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:12:46,773 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-16 03:12:46,779 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-16 03:12:46,893 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-16 03:12:47,014 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:12:47,014 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-16 03:12:47,030 WARN L859 $PredicateComparison]: unable to prove that (exists ((v_ArrVal_1527 (_ BitVec 32)) (v_ArrVal_1528 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_41| (_ BitVec 32)) (|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |v_create_sub_list_insert_sub_~sub~0#1.base_41|)) (= |c_#length| (store (store |c_old(#length)| |v_create_sub_list_insert_sub_~sub~0#1.base_41| v_ArrVal_1527) |create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1528)) (not (= |create_sub_list_insert_sub_~sub~0#1.base| |c_create_sub_list_#in~sub#1.base|)))) is different from true [2023-02-16 03:12:47,085 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:12:47,085 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-16 03:12:47,089 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-16 03:12:47,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:12:47,166 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:12:47,166 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-16 03:12:47,180 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:12:47,181 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-16 03:12:47,265 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-16 03:12:47,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:12:47,674 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-16 03:12:47,674 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-16 03:12:51,007 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:12:51,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1278587325] [2023-02-16 03:12:51,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1278587325] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:12:51,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [336521318] [2023-02-16 03:12:51,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:12:51,007 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:12:51,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:12:51,009 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-16 03:12:51,010 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-16 03:12:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:12:51,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-16 03:12:51,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:12:51,542 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-16 03:12:51,547 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-16 03:12:51,738 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-16 03:12:51,907 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:12:51,907 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-16 03:12:52,082 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:12:52,082 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-16 03:12:52,086 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-16 03:12:52,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:12:52,547 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:12:52,547 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-16 03:12:52,564 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:12:52,565 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-16 03:12:52,598 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-16 03:12:52,598 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:12:53,316 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-16 03:12:53,316 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-16 03:12:55,452 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_insert_top_~top~0#1.offset| (_ bv16 32))) (.cse1 (bvadd |c_ULTIMATE.start_insert_top_~top~0#1.offset| (_ bv24 32)))) (and (or (forall ((v_ArrVal_1642 (_ BitVec 32)) (v_ArrVal_1641 (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_53| (_ BitVec 32)) (|v_create_sub_list_insert_sub_~sub~0#1.base_54| (_ BitVec 32))) (or (not (bvule .cse0 (select (store (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_54| v_ArrVal_1641) |v_create_sub_list_insert_sub_~sub~0#1.base_53| v_ArrVal_1642) |c_ULTIMATE.start_insert_top_~top~0#1.base|))) (= |c_ULTIMATE.start_insert_top_~top~0#1.base| |v_create_sub_list_insert_sub_~sub~0#1.base_53|) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_54|))))) (bvule (bvadd |c_ULTIMATE.start_insert_top_~top~0#1.offset| (_ bv20 32)) .cse1)) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_54| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_54|))) (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_53| (_ BitVec 32))) (or (= |c_ULTIMATE.start_insert_top_~top~0#1.base| |v_create_sub_list_insert_sub_~sub~0#1.base_53|) (forall ((v_ArrVal_1642 (_ BitVec 32)) (v_ArrVal_1641 (_ BitVec 32))) (let ((.cse2 (select (store (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_54| v_ArrVal_1641) |v_create_sub_list_insert_sub_~sub~0#1.base_53| v_ArrVal_1642) |c_ULTIMATE.start_insert_top_~top~0#1.base|))) (or (not (bvule .cse0 .cse2)) (bvule .cse1 .cse2)))))))))) is different from false [2023-02-16 03:12:55,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [336521318] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:12:55,461 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:12:55,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 17] total 21 [2023-02-16 03:12:55,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410875222] [2023-02-16 03:12:55,462 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:12:55,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-16 03:12:55,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:12:55,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-16 03:12:55,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=538, Unknown=5, NotChecked=94, Total=702 [2023-02-16 03:12:55,470 INFO L87 Difference]: Start difference. First operand 192 states and 207 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-16 03:12:57,666 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-16 03:13:02,662 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-16 03:13:06,823 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-16 03:13:09,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:13:09,174 INFO L93 Difference]: Finished difference Result 289 states and 329 transitions. [2023-02-16 03:13:09,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-02-16 03:13:09,175 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-16 03:13:09,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:13:09,176 INFO L225 Difference]: With dead ends: 289 [2023-02-16 03:13:09,176 INFO L226 Difference]: Without dead ends: 289 [2023-02-16 03:13:09,176 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=115, Invalid=878, Unknown=7, NotChecked=122, Total=1122 [2023-02-16 03:13:09,177 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 144 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 1495 mSolverCounterSat, 24 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 1689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1495 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 167 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:13:09,177 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 448 Invalid, 1689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1495 Invalid, 3 Unknown, 167 Unchecked, 9.1s Time] [2023-02-16 03:13:09,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2023-02-16 03:13:09,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 200. [2023-02-16 03:13:09,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 147 states have (on average 1.272108843537415) internal successors, (187), 174 states have internal predecessors, (187), 14 states have call successors, (14), 13 states have call predecessors, (14), 14 states have return successors, (16), 12 states have call predecessors, (16), 14 states have call successors, (16) [2023-02-16 03:13:09,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 217 transitions. [2023-02-16 03:13:09,182 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 217 transitions. Word has length 45 [2023-02-16 03:13:09,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:13:09,182 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 217 transitions. [2023-02-16 03:13:09,182 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-16 03:13:09,182 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 217 transitions. [2023-02-16 03:13:09,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-16 03:13:09,183 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:13:09,183 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-16 03:13:09,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (26)] Forceful destruction successful, exit code 0 [2023-02-16 03:13:09,393 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-16 03:13:09,583 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-16 03:13:09,583 INFO L420 AbstractCegarLoop]: === Iteration 21 === 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-16 03:13:09,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:13:09,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1563009013, now seen corresponding path program 1 times [2023-02-16 03:13:09,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:13:09,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1069905401] [2023-02-16 03:13:09,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:13:09,584 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-16 03:13:09,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:13:09,585 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-16 03:13:09,587 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-16 03:13:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:13:09,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-16 03:13:09,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:13:09,973 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-16 03:13:09,983 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-16 03:13:10,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:13:10,020 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-16 03:13:10,038 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:13:10,038 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-16 03:13:10,066 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-16 03:13:10,134 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-16 03:13:10,186 WARN L859 $PredicateComparison]: unable to prove that (and (not (= (_ bv0 32) (bvadd |c_#StackHeapBarrier| (_ bv1 32)))) (exists ((v_ArrVal_1756 (_ 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_1756)) (bvult |create_sub_list_insert_sub_~sub~0#1.base| |c_#StackHeapBarrier|))) (not (= (_ bv0 32) |c_#StackHeapBarrier|))) is different from true [2023-02-16 03:13:10,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:13:10,236 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-16 03:13:10,305 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-16 03:13:10,312 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-16 03:13:10,411 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:13:10,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 12 treesize of output 18 [2023-02-16 03:13:10,653 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-16 03:13:10,653 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:13:11,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:13:11,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1069905401] [2023-02-16 03:13:11,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1069905401] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:13:11,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [666144356] [2023-02-16 03:13:11,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:13:11,143 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:13:11,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:13:11,145 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-16 03:13:11,145 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-16 03:13:12,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:13:12,515 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 27 conjunts are in the unsatisfiable core [2023-02-16 03:13:12,517 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:13:12,523 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-16 03:13:12,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:13:12,597 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-16 03:13:12,675 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-16 03:13:12,803 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-16 03:13:12,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:13:12,918 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-16 03:13:12,934 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-16 03:13:12,986 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-16 03:13:13,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:13:13,057 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-16 03:13:13,187 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-16 03:13:13,187 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:13:17,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [666144356] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:13:17,289 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:13:17,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 20 [2023-02-16 03:13:17,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807070913] [2023-02-16 03:13:17,290 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:13:17,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-16 03:13:17,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:13:17,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-16 03:13:17,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=474, Unknown=8, NotChecked=90, Total=650 [2023-02-16 03:13:17,291 INFO L87 Difference]: Start difference. First operand 200 states and 217 transitions. Second operand has 21 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 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-16 03:13:21,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:13:21,101 INFO L93 Difference]: Finished difference Result 323 states and 353 transitions. [2023-02-16 03:13:21,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-02-16 03:13:21,102 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 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-16 03:13:21,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:13:21,103 INFO L225 Difference]: With dead ends: 323 [2023-02-16 03:13:21,103 INFO L226 Difference]: Without dead ends: 323 [2023-02-16 03:13:21,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 86 SyntacticMatches, 4 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=178, Invalid=870, Unknown=16, NotChecked=126, Total=1190 [2023-02-16 03:13:21,103 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 281 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 44 mSolverCounterUnsat, 77 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 1558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 77 IncrementalHoareTripleChecker+Unknown, 354 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-02-16 03:13:21,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 381 Invalid, 1558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 1083 Invalid, 77 Unknown, 354 Unchecked, 3.1s Time] [2023-02-16 03:13:21,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2023-02-16 03:13:21,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 263. [2023-02-16 03:13:21,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 199 states have (on average 1.256281407035176) internal successors, (250), 226 states have internal predecessors, (250), 19 states have call successors, (19), 18 states have call predecessors, (19), 20 states have return successors, (25), 18 states have call predecessors, (25), 19 states have call successors, (25) [2023-02-16 03:13:21,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 294 transitions. [2023-02-16 03:13:21,109 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 294 transitions. Word has length 51 [2023-02-16 03:13:21,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:13:21,110 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 294 transitions. [2023-02-16 03:13:21,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 2.8333333333333335) internal successors, (51), 17 states have internal predecessors, (51), 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-16 03:13:21,110 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 294 transitions. [2023-02-16 03:13:21,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-02-16 03:13:21,113 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:13:21,113 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-16 03:13:21,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Ended with exit code 0 [2023-02-16 03:13:21,330 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (28)] Ended with exit code 0 [2023-02-16 03:13:21,528 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-16 03:13:21,529 INFO L420 AbstractCegarLoop]: === Iteration 22 === 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-16 03:13:21,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:13:21,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1563009014, now seen corresponding path program 1 times [2023-02-16 03:13:21,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:13:21,529 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51630519] [2023-02-16 03:13:21,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:13:21,530 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-16 03:13:21,530 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:13:21,531 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-16 03:13:21,537 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-16 03:13:21,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:13:21,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-16 03:13:21,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:13:21,949 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-16 03:13:21,984 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-16 03:13:21,985 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-16 03:13:22,006 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-16 03:13:22,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 7 [2023-02-16 03:13:22,125 WARN L859 $PredicateComparison]: unable to prove that (and (not (= (_ bv0 32) (bvadd |c_#StackHeapBarrier| (_ bv1 32)))) (exists ((|create_sub_list_insert_sub_~sub~0#1.base| (_ BitVec 32)) (v_ArrVal_1988 (_ BitVec 1))) (and (= |c_#valid| (store |c_old(#valid)| |create_sub_list_insert_sub_~sub~0#1.base| v_ArrVal_1988)) (bvult |create_sub_list_insert_sub_~sub~0#1.base| |c_#StackHeapBarrier|))) (not (= (_ bv0 32) |c_#StackHeapBarrier|))) is different from true [2023-02-16 03:13:22,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:13:22,162 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-16 03:13:22,243 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-16 03:13:22,251 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-16 03:13:22,353 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 03:13:22,353 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-16 03:13:22,476 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-16 03:13:22,477 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:13:22,717 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:13:22,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51630519] [2023-02-16 03:13:22,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [51630519] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:13:22,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1061747144] [2023-02-16 03:13:22,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:13:22,717 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:13:22,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:13:22,718 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-16 03:13:22,720 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-16 03:13:23,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:13:23,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 21 conjunts are in the unsatisfiable core [2023-02-16 03:13:23,972 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:13:24,017 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-16 03:13:24,018 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-16 03:13:24,095 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:13:24,118 INFO L321 Elim1Store]: treesize reduction 23, result has 32.4 percent of original size [2023-02-16 03:13:24,118 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 2 case distinctions, treesize of input 21 treesize of output 36 [2023-02-16 03:13:24,200 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:13:24,201 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-16 03:13:24,289 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-16 03:13:24,384 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:13:24,402 INFO L321 Elim1Store]: treesize reduction 23, result has 32.4 percent of original size [2023-02-16 03:13:24,402 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 2 case distinctions, treesize of input 30 treesize of output 45 [2023-02-16 03:13:24,471 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-16 03:13:24,471 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-16 03:13:24,542 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-16 03:13:24,631 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:13:24,650 INFO L321 Elim1Store]: treesize reduction 23, result has 32.4 percent of original size [2023-02-16 03:13:24,650 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 2 case distinctions, treesize of input 30 treesize of output 45 [2023-02-16 03:13:24,944 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-16 03:13:24,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:13:25,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1061747144] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:13:25,062 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:13:25,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 21 [2023-02-16 03:13:25,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369329599] [2023-02-16 03:13:25,062 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:13:25,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-16 03:13:25,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:13:25,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-16 03:13:25,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=500, Unknown=13, NotChecked=94, Total=702 [2023-02-16 03:13:25,063 INFO L87 Difference]: Start difference. First operand 263 states and 294 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-16 03:13:29,352 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-16 03:13:29,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-16 03:13:29,824 INFO L93 Difference]: Finished difference Result 351 states and 391 transitions. [2023-02-16 03:13:29,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-16 03:13:29,825 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-16 03:13:29,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-16 03:13:29,826 INFO L225 Difference]: With dead ends: 351 [2023-02-16 03:13:29,826 INFO L226 Difference]: Without dead ends: 351 [2023-02-16 03:13:29,826 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 84 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=199, Invalid=849, Unknown=16, NotChecked=126, Total=1190 [2023-02-16 03:13:29,827 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 446 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 716 mSolverCounterSat, 104 mSolverCounterUnsat, 157 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 716 IncrementalHoareTripleChecker+Invalid, 157 IncrementalHoareTripleChecker+Unknown, 359 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2023-02-16 03:13:29,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 414 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 716 Invalid, 157 Unknown, 359 Unchecked, 4.0s Time] [2023-02-16 03:13:29,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2023-02-16 03:13:29,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 263. [2023-02-16 03:13:29,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 199 states have (on average 1.2512562814070352) internal successors, (249), 226 states have internal predecessors, (249), 19 states have call successors, (19), 18 states have call predecessors, (19), 20 states have return successors, (25), 18 states have call predecessors, (25), 19 states have call successors, (25) [2023-02-16 03:13:29,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 293 transitions. [2023-02-16 03:13:29,833 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 293 transitions. Word has length 51 [2023-02-16 03:13:29,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-16 03:13:29,833 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 293 transitions. [2023-02-16 03:13:29,833 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-16 03:13:29,833 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 293 transitions. [2023-02-16 03:13:29,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-02-16 03:13:29,833 INFO L187 NwaCegarLoop]: Found error trace [2023-02-16 03:13:29,833 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-16 03:13:29,844 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (29)] Forceful destruction successful, exit code 0 [2023-02-16 03:13:30,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (30)] Forceful destruction successful, exit code 0 [2023-02-16 03:13:30,245 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,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-02-16 03:13:30,245 INFO L420 AbstractCegarLoop]: === Iteration 23 === 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-16 03:13:30,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-16 03:13:30,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1008297216, now seen corresponding path program 1 times [2023-02-16 03:13:30,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-16 03:13:30,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [859353974] [2023-02-16 03:13:30,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:13:30,246 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-16 03:13:30,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-16 03:13:30,247 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-16 03:13:30,249 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (31)] Waiting until timeout for monitored process [2023-02-16 03:13:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:13:30,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 29 conjunts are in the unsatisfiable core [2023-02-16 03:13:30,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:13:30,749 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-16 03:13:30,953 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:13:30,954 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-16 03:13:30,963 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:13:30,963 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-16 03:13:31,060 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-16 03:13:31,061 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:13:36,283 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 98 treesize of output 94 [2023-02-16 03:13:36,364 INFO L321 Elim1Store]: treesize reduction 7, result has 77.4 percent of original size [2023-02-16 03:13:36,364 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 80 treesize of output 97 [2023-02-16 03:13:36,968 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-16 03:13:36,969 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-16 03:13:37,113 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-16 03:13:37,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [859353974] [2023-02-16 03:13:37,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [859353974] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:13:37,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [408771666] [2023-02-16 03:13:37,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-16 03:13:37,114 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-02-16 03:13:37,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-02-16 03:13:37,115 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-02-16 03:13:37,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (32)] Waiting until timeout for monitored process [2023-02-16 03:13:37,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-16 03:13:37,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 48 conjunts are in the unsatisfiable core [2023-02-16 03:13:37,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-16 03:13:37,867 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-16 03:13:37,872 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-16 03:13:38,188 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-16 03:13:38,423 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:13:38,424 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-16 03:13:40,610 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:13:40,611 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-16 03:13:40,614 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-16 03:13:42,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:13:42,826 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-16 03:13:42,826 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-16 03:13:42,840 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:13:42,840 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-16 03:13:43,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-16 03:13:43,016 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-16 03:13:43,025 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-16 03:13:43,025 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-16 03:13:43,242 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-02-16 03:13:43,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-16 03:13:48,777 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-16 03:13:48,777 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 47 treesize of output 71 [2023-02-16 03:13:48,805 INFO L321 Elim1Store]: treesize reduction 7, result has 30.0 percent of original size [2023-02-16 03:13:48,805 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-16 03:13:50,879 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_insert_top_~top~0#1.offset| (_ bv24 32)))) (and (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_79| (_ BitVec 32))) (or (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_78| (_ BitVec 32))) (or (= |c_ULTIMATE.start_insert_top_~top~0#1.base| |v_create_sub_list_insert_sub_~sub~0#1.base_78|) (forall ((v_ArrVal_2236 (_ BitVec 32)) (v_prenex_23 (_ BitVec 32)) (v_ArrVal_2377 (_ BitVec 32)) (v_ArrVal_2376 (_ BitVec 32))) (or (= v_prenex_23 |c_ULTIMATE.start_insert_top_~top~0#1.base|) (bvule .cse0 (select (store (store (store |c_#length| |v_create_sub_list_insert_sub_~sub~0#1.base_79| v_ArrVal_2377) |v_create_sub_list_insert_sub_~sub~0#1.base_78| v_ArrVal_2376) v_prenex_23 v_ArrVal_2236) |c_ULTIMATE.start_insert_top_~top~0#1.base|)))))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_79|))))) (or (forall ((|v_create_sub_list_insert_sub_~sub~0#1.base_79| (_ BitVec 32))) (not (= (_ bv0 1) (select |c_#valid| |v_create_sub_list_insert_sub_~sub~0#1.base_79|)))) (bvule (bvadd |c_ULTIMATE.start_insert_top_~top~0#1.offset| (_ bv20 32)) .cse0)))) is different from false [2023-02-16 03:13:50,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [408771666] provided 0 perfect and 1 imperfect interpolant sequences [2023-02-16 03:13:50,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-16 03:13:50,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 16] total 27 [2023-02-16 03:13:50,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942446657] [2023-02-16 03:13:50,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-16 03:13:50,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-16 03:13:50,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-16 03:13:50,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-16 03:13:50,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1424, Unknown=6, NotChecked=76, Total=1640 [2023-02-16 03:13:50,890 INFO L87 Difference]: Start difference. First operand 263 states and 293 transitions. Second operand has 28 states, 26 states have (on average 2.6923076923076925) internal successors, (70), 22 states have internal predecessors, (70), 9 states have call successors, (10), 6 states have call predecessors, (10), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-02-16 03:13:53,356 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-16 03:13:55,385 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-16 03:14:01,491 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-16 03:14:03,499 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-16 03:14:05,524 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-16 03:14:07,582 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-16 03:14:10,163 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-16 03:14:12,184 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-16 03:14:14,200 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-16 03:14:16,207 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-16 03:14:18,213 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-16 03:14:20,217 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-16 03:14:22,220 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-16 03:14:24,226 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-16 03:14:26,238 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-16 03:14:28,248 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-16 03:14:32,983 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-16 03:14:35,007 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-16 03:14:43,126 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]