./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test23_3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a31fd051 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/ldv-memsafety/memleaks_test23_3.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 b04cfdc033f25419ae30b8c067b1e8de34cd963e91f12bceeafd05a3d125e0b7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 13:10:19,347 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:10:19,349 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:10:19,370 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:10:19,376 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:10:19,377 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:10:19,378 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:10:19,379 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:10:19,385 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:10:19,386 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:10:19,386 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:10:19,387 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:10:19,388 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:10:19,390 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:10:19,390 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:10:19,391 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:10:19,391 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:10:19,392 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:10:19,393 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:10:19,394 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:10:19,395 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:10:19,396 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:10:19,396 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:10:19,397 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:10:19,399 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:10:19,399 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:10:19,399 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:10:19,400 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:10:19,400 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:10:19,401 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:10:19,401 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:10:19,402 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:10:19,402 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:10:19,403 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:10:19,403 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:10:19,404 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:10:19,404 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:10:19,404 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:10:19,405 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:10:19,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:10:19,406 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:10:19,406 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 13:10:19,437 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:10:19,439 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:10:19,440 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:10:19,440 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:10:19,441 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:10:19,441 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:10:19,442 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:10:19,442 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:10:19,442 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:10:19,442 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:10:19,443 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:10:19,443 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:10:19,443 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:10:19,443 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:10:19,443 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:10:19,443 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 13:10:19,444 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 13:10:19,444 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 13:10:19,444 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:10:19,444 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:10:19,444 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:10:19,444 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:10:19,444 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:10:19,444 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:10:19,445 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:10:19,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:10:19,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:10:19,445 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:10:19,445 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 13:10:19,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 13:10:19,445 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:10:19,452 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:10:19,452 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:10:19,452 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:10:19,452 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 -> b04cfdc033f25419ae30b8c067b1e8de34cd963e91f12bceeafd05a3d125e0b7 [2023-02-15 13:10:19,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:10:19,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:10:19,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:10:19,642 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:10:19,642 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:10:19,643 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test23_3.i [2023-02-15 13:10:20,621 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:10:20,784 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:10:20,790 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_3.i [2023-02-15 13:10:20,803 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/844ec0b41/580bddd3c74f4268a58465eb042f3e68/FLAG73ea40c29 [2023-02-15 13:10:20,813 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/844ec0b41/580bddd3c74f4268a58465eb042f3e68 [2023-02-15 13:10:20,824 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:10:20,825 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:10:20,830 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:10:20,830 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:10:20,832 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:10:20,833 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:10:20" (1/1) ... [2023-02-15 13:10:20,833 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6434fb3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:10:20, skipping insertion in model container [2023-02-15 13:10:20,833 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:10:20" (1/1) ... [2023-02-15 13:10:20,838 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:10:20,921 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:10:21,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:10:21,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-15 13:10:21,266 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@100cbd6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:10:21, skipping insertion in model container [2023-02-15 13:10:21,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:10:21,267 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-15 13:10:21,268 INFO L158 Benchmark]: Toolchain (without parser) took 442.78ms. Allocated memory is still 144.7MB. Free memory was 81.5MB in the beginning and 108.0MB in the end (delta: -26.6MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2023-02-15 13:10:21,269 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory was 86.9MB in the beginning and 86.8MB in the end (delta: 73.1kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 13:10:21,270 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.39ms. Allocated memory is still 144.7MB. Free memory was 81.2MB in the beginning and 108.0MB in the end (delta: -26.8MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2023-02-15 13:10:21,271 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 117.4MB. Free memory was 86.9MB in the beginning and 86.8MB in the end (delta: 73.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 437.39ms. Allocated memory is still 144.7MB. Free memory was 81.2MB in the beginning and 108.0MB in the end (delta: -26.8MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 576]: 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/ldv-memsafety/memleaks_test23_3.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 b04cfdc033f25419ae30b8c067b1e8de34cd963e91f12bceeafd05a3d125e0b7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-a31fd05 [2023-02-15 13:10:23,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 13:10:23,007 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 13:10:23,045 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 13:10:23,046 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 13:10:23,046 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 13:10:23,047 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 13:10:23,049 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 13:10:23,050 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 13:10:23,050 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 13:10:23,051 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 13:10:23,052 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 13:10:23,052 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 13:10:23,053 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 13:10:23,054 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 13:10:23,054 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 13:10:23,055 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 13:10:23,056 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 13:10:23,057 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 13:10:23,058 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 13:10:23,059 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 13:10:23,060 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 13:10:23,061 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 13:10:23,061 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 13:10:23,063 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 13:10:23,064 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 13:10:23,064 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 13:10:23,065 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 13:10:23,065 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 13:10:23,066 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 13:10:23,066 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 13:10:23,067 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 13:10:23,067 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 13:10:23,068 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 13:10:23,068 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 13:10:23,069 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 13:10:23,069 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 13:10:23,069 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 13:10:23,070 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 13:10:23,070 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 13:10:23,071 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 13:10:23,074 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-15 13:10:23,089 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 13:10:23,090 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 13:10:23,090 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 13:10:23,090 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 13:10:23,091 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 13:10:23,091 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 13:10:23,091 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 13:10:23,091 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 13:10:23,091 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 13:10:23,092 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 13:10:23,092 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 13:10:23,092 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 13:10:23,092 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 13:10:23,092 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 13:10:23,092 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 13:10:23,093 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 13:10:23,093 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 13:10:23,093 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 13:10:23,093 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 13:10:23,093 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 13:10:23,093 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 13:10:23,094 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 13:10:23,094 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 13:10:23,094 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 13:10:23,094 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 13:10:23,094 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 13:10:23,094 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 13:10:23,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:10:23,095 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 13:10:23,095 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 13:10:23,095 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 13:10:23,095 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 13:10:23,095 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 13:10:23,095 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 13:10:23,096 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 13:10:23,096 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 13:10:23,096 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 13:10:23,096 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 -> b04cfdc033f25419ae30b8c067b1e8de34cd963e91f12bceeafd05a3d125e0b7 [2023-02-15 13:10:23,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 13:10:23,448 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 13:10:23,450 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 13:10:23,450 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 13:10:23,451 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 13:10:23,452 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test23_3.i [2023-02-15 13:10:24,468 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 13:10:24,713 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 13:10:24,716 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test23_3.i [2023-02-15 13:10:24,739 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89b83b120/3cbd50487b3143c59bf2049901377739/FLAGe6ead0bc2 [2023-02-15 13:10:24,750 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/89b83b120/3cbd50487b3143c59bf2049901377739 [2023-02-15 13:10:24,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 13:10:24,753 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 13:10:24,754 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 13:10:24,754 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 13:10:24,756 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 13:10:24,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:10:24" (1/1) ... [2023-02-15 13:10:24,757 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a108d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:10:24, skipping insertion in model container [2023-02-15 13:10:24,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 01:10:24" (1/1) ... [2023-02-15 13:10:24,761 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 13:10:24,807 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:10:25,130 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:10:25,148 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-15 13:10:25,154 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 13:10:25,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:10:25,200 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 13:10:25,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 13:10:25,288 INFO L208 MainTranslator]: Completed translation [2023-02-15 13:10:25,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:10:25 WrapperNode [2023-02-15 13:10:25,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 13:10:25,289 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 13:10:25,289 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 13:10:25,290 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 13:10:25,294 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:10:25" (1/1) ... [2023-02-15 13:10:25,324 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:10:25" (1/1) ... [2023-02-15 13:10:25,348 INFO L138 Inliner]: procedures = 174, calls = 117, calls flagged for inlining = 29, calls inlined = 14, statements flattened = 187 [2023-02-15 13:10:25,348 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 13:10:25,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 13:10:25,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 13:10:25,350 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 13:10:25,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:10:25" (1/1) ... [2023-02-15 13:10:25,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:10:25" (1/1) ... [2023-02-15 13:10:25,369 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:10:25" (1/1) ... [2023-02-15 13:10:25,370 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:10:25" (1/1) ... [2023-02-15 13:10:25,377 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:10:25" (1/1) ... [2023-02-15 13:10:25,388 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:10:25" (1/1) ... [2023-02-15 13:10:25,391 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:10:25" (1/1) ... [2023-02-15 13:10:25,395 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:10:25" (1/1) ... [2023-02-15 13:10:25,398 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 13:10:25,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 13:10:25,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 13:10:25,402 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 13:10:25,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:10:25" (1/1) ... [2023-02-15 13:10:25,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 13:10:25,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 13:10:25,422 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-02-15 13:10:25,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-02-15 13:10:25,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-15 13:10:25,464 INFO L130 BoogieDeclarations]: Found specification of procedure LDV_INIT_LIST_HEAD [2023-02-15 13:10:25,465 INFO L138 BoogieDeclarations]: Found implementation of procedure LDV_INIT_LIST_HEAD [2023-02-15 13:10:25,465 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2023-02-15 13:10:25,466 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2023-02-15 13:10:25,466 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-02-15 13:10:25,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-02-15 13:10:25,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-02-15 13:10:25,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-02-15 13:10:25,467 INFO L130 BoogieDeclarations]: Found specification of procedure free_reports [2023-02-15 13:10:25,467 INFO L138 BoogieDeclarations]: Found implementation of procedure free_reports [2023-02-15 13:10:25,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 13:10:25,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-02-15 13:10:25,467 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-02-15 13:10:25,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-15 13:10:25,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 13:10:25,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-02-15 13:10:25,468 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2023-02-15 13:10:25,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2023-02-15 13:10:25,468 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2023-02-15 13:10:25,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2023-02-15 13:10:25,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 13:10:25,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 13:10:25,647 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 13:10:25,649 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 13:10:26,194 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 13:10:26,198 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 13:10:26,199 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2023-02-15 13:10:26,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:10:26 BoogieIcfgContainer [2023-02-15 13:10:26,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 13:10:26,209 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 13:10:26,209 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 13:10:26,211 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 13:10:26,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 01:10:24" (1/3) ... [2023-02-15 13:10:26,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3314980c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:10:26, skipping insertion in model container [2023-02-15 13:10:26,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 01:10:25" (2/3) ... [2023-02-15 13:10:26,212 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3314980c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 01:10:26, skipping insertion in model container [2023-02-15 13:10:26,212 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 01:10:26" (3/3) ... [2023-02-15 13:10:26,213 INFO L112 eAbstractionObserver]: Analyzing ICFG memleaks_test23_3.i [2023-02-15 13:10:26,224 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 13:10:26,225 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 76 error locations. [2023-02-15 13:10:26,263 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 13:10:26,267 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;@72197983, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 13:10:26,267 INFO L358 AbstractCegarLoop]: Starting to check reachability of 76 error locations. [2023-02-15 13:10:26,270 INFO L276 IsEmpty]: Start isEmpty. Operand has 199 states, 108 states have (on average 1.8425925925925926) internal successors, (199), 184 states have internal predecessors, (199), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-15 13:10:26,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 13:10:26,275 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:26,275 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:10:26,276 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:10:26,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:26,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1617164409, now seen corresponding path program 1 times [2023-02-15 13:10:26,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:26,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [993360300] [2023-02-15 13:10:26,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:26,288 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:26,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:26,290 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:10:26,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-02-15 13:10:26,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:26,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 13:10:26,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:26,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 13:10:26,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-15 13:10:26,552 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:10:26,552 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:26,554 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [993360300] [2023-02-15 13:10:26,554 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [993360300] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:10:26,554 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:10:26,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:10:26,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080019714] [2023-02-15 13:10:26,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:10:26,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:10:26,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:26,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:10:26,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:10:26,592 INFO L87 Difference]: Start difference. First operand has 199 states, 108 states have (on average 1.8425925925925926) internal successors, (199), 184 states have internal predecessors, (199), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:10:27,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:27,125 INFO L93 Difference]: Finished difference Result 226 states and 243 transitions. [2023-02-15 13:10:27,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:10:27,127 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-02-15 13:10:27,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:27,133 INFO L225 Difference]: With dead ends: 226 [2023-02-15 13:10:27,134 INFO L226 Difference]: Without dead ends: 222 [2023-02-15 13:10:27,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:10:27,137 INFO L413 NwaCegarLoop]: 199 mSDtfsCounter, 28 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 459 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 459 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 13:10:27,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 825 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 459 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 13:10:27,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2023-02-15 13:10:27,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 206. [2023-02-15 13:10:27,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 114 states have (on average 1.7894736842105263) internal successors, (204), 189 states have internal predecessors, (204), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2023-02-15 13:10:27,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 223 transitions. [2023-02-15 13:10:27,183 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 223 transitions. Word has length 12 [2023-02-15 13:10:27,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:27,184 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 223 transitions. [2023-02-15 13:10:27,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 5 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:10:27,184 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 223 transitions. [2023-02-15 13:10:27,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 13:10:27,185 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:27,185 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:10:27,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-02-15 13:10:27,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:27,385 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting LDV_INIT_LIST_HEADErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:10:27,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:27,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1617164410, now seen corresponding path program 1 times [2023-02-15 13:10:27,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:27,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [465615071] [2023-02-15 13:10:27,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:27,387 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:27,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:27,388 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:10:27,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-02-15 13:10:27,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:27,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 13:10:27,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:27,477 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:10:27,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:10:27,546 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:10:27,546 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:27,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [465615071] [2023-02-15 13:10:27,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [465615071] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:10:27,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:10:27,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:10:27,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426864591] [2023-02-15 13:10:27,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:10:27,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:10:27,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:27,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:10:27,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:10:27,549 INFO L87 Difference]: Start difference. First operand 206 states and 223 transitions. Second operand has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:10:28,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:28,057 INFO L93 Difference]: Finished difference Result 231 states and 247 transitions. [2023-02-15 13:10:28,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:10:28,058 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-02-15 13:10:28,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:28,059 INFO L225 Difference]: With dead ends: 231 [2023-02-15 13:10:28,059 INFO L226 Difference]: Without dead ends: 231 [2023-02-15 13:10:28,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:10:28,060 INFO L413 NwaCegarLoop]: 196 mSDtfsCounter, 35 mSDsluCounter, 874 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 13:10:28,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 1070 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 13:10:28,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2023-02-15 13:10:28,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 206. [2023-02-15 13:10:28,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 114 states have (on average 1.7719298245614035) internal successors, (202), 189 states have internal predecessors, (202), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2023-02-15 13:10:28,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 221 transitions. [2023-02-15 13:10:28,068 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 221 transitions. Word has length 12 [2023-02-15 13:10:28,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:28,069 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 221 transitions. [2023-02-15 13:10:28,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:10:28,069 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 221 transitions. [2023-02-15 13:10:28,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 13:10:28,070 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:28,070 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:10:28,076 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 (3)] Ended with exit code 0 [2023-02-15 13:10:28,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:28,276 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting LDV_INIT_LIST_HEADErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:10:28,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:28,277 INFO L85 PathProgramCache]: Analyzing trace with hash -934992552, now seen corresponding path program 1 times [2023-02-15 13:10:28,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:28,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [203102827] [2023-02-15 13:10:28,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:28,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:28,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:28,280 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:10:28,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-02-15 13:10:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:28,348 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 7 conjunts are in the unsatisfiable core [2023-02-15 13:10:28,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:28,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:10:28,375 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:10:28,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:28,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [203102827] [2023-02-15 13:10:28,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [203102827] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:10:28,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:10:28,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:10:28,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251045230] [2023-02-15 13:10:28,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:10:28,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:10:28,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:28,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:10:28,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:10:28,378 INFO L87 Difference]: Start difference. First operand 206 states and 221 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:10:28,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:28,412 INFO L93 Difference]: Finished difference Result 218 states and 233 transitions. [2023-02-15 13:10:28,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:10:28,412 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-02-15 13:10:28,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:28,413 INFO L225 Difference]: With dead ends: 218 [2023-02-15 13:10:28,413 INFO L226 Difference]: Without dead ends: 218 [2023-02-15 13:10:28,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:10:28,414 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 20 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 820 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:10:28,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 820 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:10:28,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-02-15 13:10:28,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 197. [2023-02-15 13:10:28,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 110 states have (on average 1.7636363636363637) internal successors, (194), 181 states have internal predecessors, (194), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2023-02-15 13:10:28,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 211 transitions. [2023-02-15 13:10:28,421 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 211 transitions. Word has length 12 [2023-02-15 13:10:28,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:28,421 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 211 transitions. [2023-02-15 13:10:28,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:10:28,422 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 211 transitions. [2023-02-15 13:10:28,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 13:10:28,422 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:28,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:10:28,437 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 (4)] Ended with exit code 0 [2023-02-15 13:10:28,637 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:28,639 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:10:28,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:28,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1617078937, now seen corresponding path program 1 times [2023-02-15 13:10:28,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:28,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [18962713] [2023-02-15 13:10:28,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:28,641 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:28,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:28,642 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:10:28,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-02-15 13:10:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:28,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 13:10:28,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:28,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:10:28,712 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:10:28,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:28,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [18962713] [2023-02-15 13:10:28,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [18962713] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:10:28,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:10:28,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:10:28,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687513878] [2023-02-15 13:10:28,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:10:28,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:10:28,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:28,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:10:28,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:10:28,714 INFO L87 Difference]: Start difference. First operand 197 states and 211 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:10:28,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:28,739 INFO L93 Difference]: Finished difference Result 218 states and 232 transitions. [2023-02-15 13:10:28,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:10:28,739 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-02-15 13:10:28,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:28,740 INFO L225 Difference]: With dead ends: 218 [2023-02-15 13:10:28,740 INFO L226 Difference]: Without dead ends: 218 [2023-02-15 13:10:28,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:10:28,741 INFO L413 NwaCegarLoop]: 222 mSDtfsCounter, 123 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 756 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:10:28,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 756 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:10:28,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2023-02-15 13:10:28,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 197. [2023-02-15 13:10:28,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 110 states have (on average 1.7545454545454546) internal successors, (193), 181 states have internal predecessors, (193), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2023-02-15 13:10:28,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 210 transitions. [2023-02-15 13:10:28,747 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 210 transitions. Word has length 12 [2023-02-15 13:10:28,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:28,747 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 210 transitions. [2023-02-15 13:10:28,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:10:28,747 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 210 transitions. [2023-02-15 13:10:28,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 13:10:28,748 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:28,748 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:10:28,757 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 (5)] Ended with exit code 0 [2023-02-15 13:10:28,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:28,955 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:10:28,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:28,955 INFO L85 PathProgramCache]: Analyzing trace with hash -935078024, now seen corresponding path program 1 times [2023-02-15 13:10:28,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:28,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658871526] [2023-02-15 13:10:28,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:28,956 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:28,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:28,958 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:10:28,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-02-15 13:10:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:29,006 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 13:10:29,007 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:29,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:10:29,023 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:10:29,023 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:29,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [658871526] [2023-02-15 13:10:29,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [658871526] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:10:29,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:10:29,024 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:10:29,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386778106] [2023-02-15 13:10:29,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:10:29,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 13:10:29,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:29,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 13:10:29,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:10:29,025 INFO L87 Difference]: Start difference. First operand 197 states and 210 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:10:29,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:29,053 INFO L93 Difference]: Finished difference Result 202 states and 214 transitions. [2023-02-15 13:10:29,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:10:29,053 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2023-02-15 13:10:29,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:29,054 INFO L225 Difference]: With dead ends: 202 [2023-02-15 13:10:29,054 INFO L226 Difference]: Without dead ends: 202 [2023-02-15 13:10:29,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:10:29,055 INFO L413 NwaCegarLoop]: 204 mSDtfsCounter, 106 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:10:29,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 708 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:10:29,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-02-15 13:10:29,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 199. [2023-02-15 13:10:29,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 112 states have (on average 1.7410714285714286) internal successors, (195), 183 states have internal predecessors, (195), 8 states have call successors, (8), 6 states have call predecessors, (8), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2023-02-15 13:10:29,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 212 transitions. [2023-02-15 13:10:29,060 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 212 transitions. Word has length 12 [2023-02-15 13:10:29,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:29,060 INFO L495 AbstractCegarLoop]: Abstraction has 199 states and 212 transitions. [2023-02-15 13:10:29,060 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:10:29,061 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 212 transitions. [2023-02-15 13:10:29,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-02-15 13:10:29,061 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:29,061 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:10:29,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-02-15 13:10:29,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:29,268 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:10:29,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:29,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1077372438, now seen corresponding path program 1 times [2023-02-15 13:10:29,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:29,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1190884118] [2023-02-15 13:10:29,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:29,270 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:29,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:29,271 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:10:29,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-15 13:10:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:29,315 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 13:10:29,316 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:29,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:10:29,332 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:10:29,332 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:29,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1190884118] [2023-02-15 13:10:29,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1190884118] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:10:29,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:10:29,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 13:10:29,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859024299] [2023-02-15 13:10:29,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:10:29,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:10:29,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:29,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:10:29,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:10:29,334 INFO L87 Difference]: Start difference. First operand 199 states and 212 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:10:29,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:29,562 INFO L93 Difference]: Finished difference Result 211 states and 226 transitions. [2023-02-15 13:10:29,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:10:29,563 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2023-02-15 13:10:29,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:29,564 INFO L225 Difference]: With dead ends: 211 [2023-02-15 13:10:29,564 INFO L226 Difference]: Without dead ends: 203 [2023-02-15 13:10:29,564 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:10:29,564 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 51 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:10:29,565 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 372 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 13:10:29,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2023-02-15 13:10:29,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 193. [2023-02-15 13:10:29,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 107 states have (on average 1.766355140186916) internal successors, (189), 178 states have internal predecessors, (189), 8 states have call successors, (8), 6 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-02-15 13:10:29,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 205 transitions. [2023-02-15 13:10:29,568 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 205 transitions. Word has length 13 [2023-02-15 13:10:29,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:29,568 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 205 transitions. [2023-02-15 13:10:29,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-02-15 13:10:29,569 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 205 transitions. [2023-02-15 13:10:29,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 13:10:29,569 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:29,569 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:10:29,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-02-15 13:10:29,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:29,776 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:10:29,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:29,776 INFO L85 PathProgramCache]: Analyzing trace with hash 609549957, now seen corresponding path program 1 times [2023-02-15 13:10:29,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:29,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [862817237] [2023-02-15 13:10:29,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:29,777 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:29,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:29,778 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:10:29,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-02-15 13:10:29,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:29,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 15 conjunts are in the unsatisfiable core [2023-02-15 13:10:29,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:29,902 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_malloc_#res.base| (_ BitVec 32))) (and (= (_ bv0 1) (select |c_old(#valid)| |ldv_malloc_#res.base|)) (exists ((v_ArrVal_23 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_malloc_#res.base| v_ArrVal_23))))) is different from true [2023-02-15 13:10:29,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:10:29,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:10:29,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:10:29,971 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:10:29,971 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:29,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [862817237] [2023-02-15 13:10:29,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [862817237] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:10:29,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:10:29,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:10:29,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649092415] [2023-02-15 13:10:29,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:10:29,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:10:29,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:29,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:10:29,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=28, Unknown=1, NotChecked=10, Total=56 [2023-02-15 13:10:29,973 INFO L87 Difference]: Start difference. First operand 193 states and 205 transitions. Second operand has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 13:10:30,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:30,512 INFO L93 Difference]: Finished difference Result 244 states and 259 transitions. [2023-02-15 13:10:30,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-02-15 13:10:30,513 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2023-02-15 13:10:30,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:30,514 INFO L225 Difference]: With dead ends: 244 [2023-02-15 13:10:30,514 INFO L226 Difference]: Without dead ends: 244 [2023-02-15 13:10:30,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=76, Unknown=1, NotChecked=18, Total=132 [2023-02-15 13:10:30,515 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 462 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 465 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 222 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 13:10:30,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [465 Valid, 203 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 423 Invalid, 0 Unknown, 222 Unchecked, 0.5s Time] [2023-02-15 13:10:30,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2023-02-15 13:10:30,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 202. [2023-02-15 13:10:30,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 116 states have (on average 1.7413793103448276) internal successors, (202), 186 states have internal predecessors, (202), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2023-02-15 13:10:30,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 220 transitions. [2023-02-15 13:10:30,519 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 220 transitions. Word has length 16 [2023-02-15 13:10:30,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:30,519 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 220 transitions. [2023-02-15 13:10:30,519 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-02-15 13:10:30,519 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 220 transitions. [2023-02-15 13:10:30,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 13:10:30,519 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:30,520 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:10:30,529 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-02-15 13:10:30,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:30,720 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:10:30,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:30,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1600340348, now seen corresponding path program 1 times [2023-02-15 13:10:30,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:30,721 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1202536838] [2023-02-15 13:10:30,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:30,721 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:30,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:30,723 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:10:30,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 (9)] Waiting until timeout for monitored process [2023-02-15 13:10:30,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:30,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 13:10:30,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:30,827 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 13:10:30,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:10:30,857 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:10:30,857 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:30,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1202536838] [2023-02-15 13:10:30,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1202536838] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:10:30,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:10:30,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:10:30,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520507408] [2023-02-15 13:10:30,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:10:30,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:10:30,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:30,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:10:30,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:10:30,859 INFO L87 Difference]: Start difference. First operand 202 states and 220 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:10:31,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:31,230 INFO L93 Difference]: Finished difference Result 252 states and 278 transitions. [2023-02-15 13:10:31,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:10:31,231 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2023-02-15 13:10:31,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:31,232 INFO L225 Difference]: With dead ends: 252 [2023-02-15 13:10:31,232 INFO L226 Difference]: Without dead ends: 252 [2023-02-15 13:10:31,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:10:31,233 INFO L413 NwaCegarLoop]: 171 mSDtfsCounter, 65 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-02-15 13:10:31,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 633 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-02-15 13:10:31,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2023-02-15 13:10:31,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 227. [2023-02-15 13:10:31,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 143 states have (on average 1.7622377622377623) internal successors, (252), 211 states have internal predecessors, (252), 8 states have call successors, (8), 7 states have call predecessors, (8), 8 states have return successors, (10), 8 states have call predecessors, (10), 8 states have call successors, (10) [2023-02-15 13:10:31,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 270 transitions. [2023-02-15 13:10:31,238 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 270 transitions. Word has length 25 [2023-02-15 13:10:31,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:31,238 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 270 transitions. [2023-02-15 13:10:31,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:10:31,238 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 270 transitions. [2023-02-15 13:10:31,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-02-15 13:10:31,239 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:31,239 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:10:31,253 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-02-15 13:10:31,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:31,446 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:10:31,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:31,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1600340347, now seen corresponding path program 1 times [2023-02-15 13:10:31,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:31,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [351908604] [2023-02-15 13:10:31,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:31,447 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:31,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:31,448 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:10:31,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-02-15 13:10:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:31,546 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 13:10:31,548 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:31,553 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:10:31,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:10:31,596 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:10:31,596 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:31,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [351908604] [2023-02-15 13:10:31,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [351908604] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:10:31,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:10:31,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-02-15 13:10:31,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683314620] [2023-02-15 13:10:31,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:10:31,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:10:31,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:31,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:10:31,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:10:31,597 INFO L87 Difference]: Start difference. First operand 227 states and 270 transitions. Second operand has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:10:32,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:32,135 INFO L93 Difference]: Finished difference Result 284 states and 313 transitions. [2023-02-15 13:10:32,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:10:32,137 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2023-02-15 13:10:32,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:32,138 INFO L225 Difference]: With dead ends: 284 [2023-02-15 13:10:32,138 INFO L226 Difference]: Without dead ends: 284 [2023-02-15 13:10:32,138 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:10:32,138 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 99 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 13:10:32,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 631 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 13:10:32,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2023-02-15 13:10:32,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 229. [2023-02-15 13:10:32,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 146 states have (on average 1.7397260273972603) internal successors, (254), 212 states have internal predecessors, (254), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-15 13:10:32,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 275 transitions. [2023-02-15 13:10:32,160 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 275 transitions. Word has length 25 [2023-02-15 13:10:32,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:32,161 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 275 transitions. [2023-02-15 13:10:32,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:10:32,162 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 275 transitions. [2023-02-15 13:10:32,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-02-15 13:10:32,163 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:32,163 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:10:32,185 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-02-15 13:10:32,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:32,371 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:10:32,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:32,372 INFO L85 PathProgramCache]: Analyzing trace with hash -328716411, now seen corresponding path program 1 times [2023-02-15 13:10:32,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:32,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [383897934] [2023-02-15 13:10:32,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:32,372 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:32,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:32,373 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:10:32,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 (11)] Waiting until timeout for monitored process [2023-02-15 13:10:32,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:32,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 13:10:32,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:32,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:10:32,477 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:10:32,477 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:32,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [383897934] [2023-02-15 13:10:32,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [383897934] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:10:32,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:10:32,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:10:32,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005674000] [2023-02-15 13:10:32,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:10:32,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-02-15 13:10:32,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:32,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-02-15 13:10:32,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-02-15 13:10:32,479 INFO L87 Difference]: Start difference. First operand 229 states and 275 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:10:32,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:32,540 INFO L93 Difference]: Finished difference Result 229 states and 274 transitions. [2023-02-15 13:10:32,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 13:10:32,540 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2023-02-15 13:10:32,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:32,541 INFO L225 Difference]: With dead ends: 229 [2023-02-15 13:10:32,541 INFO L226 Difference]: Without dead ends: 229 [2023-02-15 13:10:32,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:10:32,542 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 114 mSDsluCounter, 624 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:10:32,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 808 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 13:10:32,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-02-15 13:10:32,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2023-02-15 13:10:32,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 146 states have (on average 1.7328767123287672) internal successors, (253), 212 states have internal predecessors, (253), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-15 13:10:32,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 274 transitions. [2023-02-15 13:10:32,546 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 274 transitions. Word has length 27 [2023-02-15 13:10:32,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:32,546 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 274 transitions. [2023-02-15 13:10:32,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:10:32,546 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 274 transitions. [2023-02-15 13:10:32,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 13:10:32,547 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:32,547 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:10:32,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-02-15 13:10:32,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:32,757 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:10:32,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:32,757 INFO L85 PathProgramCache]: Analyzing trace with hash -444952336, now seen corresponding path program 1 times [2023-02-15 13:10:32,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:32,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1906834390] [2023-02-15 13:10:32,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:32,758 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:32,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:32,759 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:10:32,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-02-15 13:10:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:32,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 13:10:32,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:32,905 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 13:10:32,946 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 13:10:32,946 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 13:10:32,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:10:32,988 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:10:32,989 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:32,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1906834390] [2023-02-15 13:10:32,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1906834390] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:10:32,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:10:32,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-02-15 13:10:32,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843986839] [2023-02-15 13:10:32,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:10:32,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:10:32,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:32,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:10:32,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:10:32,990 INFO L87 Difference]: Start difference. First operand 229 states and 274 transitions. Second operand has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:10:33,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:33,525 INFO L93 Difference]: Finished difference Result 242 states and 284 transitions. [2023-02-15 13:10:33,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:10:33,526 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2023-02-15 13:10:33,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:33,527 INFO L225 Difference]: With dead ends: 242 [2023-02-15 13:10:33,527 INFO L226 Difference]: Without dead ends: 242 [2023-02-15 13:10:33,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-02-15 13:10:33,527 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 191 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 13:10:33,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 521 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 13:10:33,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2023-02-15 13:10:33,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 225. [2023-02-15 13:10:33,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 146 states have (on average 1.678082191780822) internal successors, (245), 208 states have internal predecessors, (245), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-15 13:10:33,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 266 transitions. [2023-02-15 13:10:33,531 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 266 transitions. Word has length 33 [2023-02-15 13:10:33,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:33,531 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 266 transitions. [2023-02-15 13:10:33,531 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:10:33,531 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 266 transitions. [2023-02-15 13:10:33,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-02-15 13:10:33,532 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:33,532 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:10:33,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-02-15 13:10:33,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:33,741 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:10:33,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:33,741 INFO L85 PathProgramCache]: Analyzing trace with hash -444952335, now seen corresponding path program 1 times [2023-02-15 13:10:33,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:33,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231172502] [2023-02-15 13:10:33,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:33,742 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:33,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:33,743 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:10:33,745 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-02-15 13:10:33,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:33,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 13:10:33,862 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:33,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 7 [2023-02-15 13:10:33,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:10:33,899 WARN L859 $PredicateComparison]: unable to prove that (exists ((|ldv_zalloc_#t~malloc13#1.base| (_ BitVec 32))) (and (exists ((v_ArrVal_198 (_ BitVec 32))) (= |c_#length| (store |c_old(#length)| |ldv_zalloc_#t~malloc13#1.base| v_ArrVal_198))) (= (select |c_old(#valid)| |ldv_zalloc_#t~malloc13#1.base|) (_ bv0 1)))) is different from true [2023-02-15 13:10:33,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:10:33,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-15 13:10:33,940 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-02-15 13:10:33,940 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-02-15 13:10:33,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:10:33,991 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:10:33,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:33,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231172502] [2023-02-15 13:10:33,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231172502] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:10:33,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:10:33,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:10:33,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027569388] [2023-02-15 13:10:33,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:10:33,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:10:33,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:33,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:10:33,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=21, Unknown=1, NotChecked=8, Total=42 [2023-02-15 13:10:33,993 INFO L87 Difference]: Start difference. First operand 225 states and 266 transitions. Second operand has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:10:34,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:34,496 INFO L93 Difference]: Finished difference Result 280 states and 309 transitions. [2023-02-15 13:10:34,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:10:34,496 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2023-02-15 13:10:34,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:34,497 INFO L225 Difference]: With dead ends: 280 [2023-02-15 13:10:34,497 INFO L226 Difference]: Without dead ends: 280 [2023-02-15 13:10:34,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=29, Unknown=1, NotChecked=10, Total=56 [2023-02-15 13:10:34,498 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 182 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 303 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 13:10:34,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 376 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 396 Invalid, 0 Unknown, 303 Unchecked, 0.5s Time] [2023-02-15 13:10:34,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2023-02-15 13:10:34,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 225. [2023-02-15 13:10:34,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 146 states have (on average 1.6506849315068493) internal successors, (241), 208 states have internal predecessors, (241), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-15 13:10:34,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 262 transitions. [2023-02-15 13:10:34,502 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 262 transitions. Word has length 33 [2023-02-15 13:10:34,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:34,502 INFO L495 AbstractCegarLoop]: Abstraction has 225 states and 262 transitions. [2023-02-15 13:10:34,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:10:34,503 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 262 transitions. [2023-02-15 13:10:34,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-02-15 13:10:34,503 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:34,503 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:10:34,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-02-15 13:10:34,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:34,711 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:10:34,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:34,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1897494371, now seen corresponding path program 1 times [2023-02-15 13:10:34,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:34,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1540545293] [2023-02-15 13:10:34,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:34,712 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:34,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:34,714 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:10:34,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-02-15 13:10:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:34,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 13:10:34,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:34,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:10:34,834 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:10:34,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:34,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1540545293] [2023-02-15 13:10:34,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1540545293] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:10:34,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:10:34,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:10:34,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162071033] [2023-02-15 13:10:34,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:10:34,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:10:34,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:34,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:10:34,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:10:34,835 INFO L87 Difference]: Start difference. First operand 225 states and 262 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:10:34,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:34,849 INFO L93 Difference]: Finished difference Result 267 states and 308 transitions. [2023-02-15 13:10:34,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:10:34,851 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2023-02-15 13:10:34,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:34,852 INFO L225 Difference]: With dead ends: 267 [2023-02-15 13:10:34,852 INFO L226 Difference]: Without dead ends: 267 [2023-02-15 13:10:34,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:10:34,854 INFO L413 NwaCegarLoop]: 193 mSDtfsCounter, 37 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:10:34,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 574 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:10:34,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2023-02-15 13:10:34,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 229. [2023-02-15 13:10:34,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 150 states have (on average 1.6333333333333333) internal successors, (245), 212 states have internal predecessors, (245), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-15 13:10:34,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 266 transitions. [2023-02-15 13:10:34,862 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 266 transitions. Word has length 35 [2023-02-15 13:10:34,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:34,862 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 266 transitions. [2023-02-15 13:10:34,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:10:34,862 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 266 transitions. [2023-02-15 13:10:34,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 13:10:34,865 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:34,866 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:10:34,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-02-15 13:10:35,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:35,066 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:10:35,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:35,067 INFO L85 PathProgramCache]: Analyzing trace with hash -1307216555, now seen corresponding path program 1 times [2023-02-15 13:10:35,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:35,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047981782] [2023-02-15 13:10:35,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:35,067 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:35,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:35,082 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:10:35,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-02-15 13:10:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:35,199 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 13:10:35,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:35,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:10:35,417 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:10:35,418 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:35,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047981782] [2023-02-15 13:10:35,418 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1047981782] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:10:35,418 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:10:35,418 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:10:35,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541264067] [2023-02-15 13:10:35,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:10:35,418 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 13:10:35,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:35,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 13:10:35,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-02-15 13:10:35,419 INFO L87 Difference]: Start difference. First operand 229 states and 266 transitions. Second operand has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:10:35,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:35,697 INFO L93 Difference]: Finished difference Result 227 states and 263 transitions. [2023-02-15 13:10:35,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:10:35,698 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 36 [2023-02-15 13:10:35,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:35,698 INFO L225 Difference]: With dead ends: 227 [2023-02-15 13:10:35,698 INFO L226 Difference]: Without dead ends: 227 [2023-02-15 13:10:35,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:10:35,699 INFO L413 NwaCegarLoop]: 167 mSDtfsCounter, 248 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 685 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:10:35,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 685 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 13:10:35,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2023-02-15 13:10:35,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2023-02-15 13:10:35,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 150 states have (on average 1.6133333333333333) internal successors, (242), 210 states have internal predecessors, (242), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-15 13:10:35,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 263 transitions. [2023-02-15 13:10:35,703 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 263 transitions. Word has length 36 [2023-02-15 13:10:35,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:35,703 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 263 transitions. [2023-02-15 13:10:35,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2023-02-15 13:10:35,703 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 263 transitions. [2023-02-15 13:10:35,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 13:10:35,703 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:35,703 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:10:35,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-02-15 13:10:35,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:35,911 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:10:35,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:35,911 INFO L85 PathProgramCache]: Analyzing trace with hash 359927496, now seen corresponding path program 1 times [2023-02-15 13:10:35,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:35,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1682332241] [2023-02-15 13:10:35,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:35,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:35,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:35,913 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:10:35,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-02-15 13:10:36,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:36,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 13:10:36,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:36,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:10:36,060 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:10:36,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:36,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1682332241] [2023-02-15 13:10:36,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1682332241] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:10:36,060 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:10:36,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:10:36,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948349773] [2023-02-15 13:10:36,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:10:36,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:10:36,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:36,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:10:36,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:10:36,062 INFO L87 Difference]: Start difference. First operand 227 states and 263 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:10:36,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:36,077 INFO L93 Difference]: Finished difference Result 250 states and 288 transitions. [2023-02-15 13:10:36,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 13:10:36,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 40 [2023-02-15 13:10:36,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:36,079 INFO L225 Difference]: With dead ends: 250 [2023-02-15 13:10:36,079 INFO L226 Difference]: Without dead ends: 250 [2023-02-15 13:10:36,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:10:36,081 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 43 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 566 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:10:36,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 566 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:10:36,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2023-02-15 13:10:36,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 229. [2023-02-15 13:10:36,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 152 states have (on average 1.605263157894737) internal successors, (244), 212 states have internal predecessors, (244), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-15 13:10:36,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 265 transitions. [2023-02-15 13:10:36,086 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 265 transitions. Word has length 40 [2023-02-15 13:10:36,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:36,087 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 265 transitions. [2023-02-15 13:10:36,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:10:36,087 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 265 transitions. [2023-02-15 13:10:36,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 13:10:36,088 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:36,089 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:10:36,109 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-02-15 13:10:36,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:36,297 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:10:36,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:36,297 INFO L85 PathProgramCache]: Analyzing trace with hash -2125965028, now seen corresponding path program 1 times [2023-02-15 13:10:36,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:36,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [44730350] [2023-02-15 13:10:36,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:36,298 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:36,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:36,299 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:10:36,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-02-15 13:10:36,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:36,445 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 13:10:36,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:36,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 13:10:36,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:10:36,517 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:10:36,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:36,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [44730350] [2023-02-15 13:10:36,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [44730350] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:10:36,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:10:36,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:10:36,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768075433] [2023-02-15 13:10:36,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:10:36,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:10:36,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:36,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:10:36,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:10:36,519 INFO L87 Difference]: Start difference. First operand 229 states and 265 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:10:37,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:37,078 INFO L93 Difference]: Finished difference Result 284 states and 316 transitions. [2023-02-15 13:10:37,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-02-15 13:10:37,079 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2023-02-15 13:10:37,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:37,080 INFO L225 Difference]: With dead ends: 284 [2023-02-15 13:10:37,080 INFO L226 Difference]: Without dead ends: 284 [2023-02-15 13:10:37,080 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:10:37,080 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 121 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 444 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-02-15 13:10:37,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 805 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 444 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-02-15 13:10:37,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2023-02-15 13:10:37,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 228. [2023-02-15 13:10:37,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 152 states have (on average 1.5855263157894737) internal successors, (241), 211 states have internal predecessors, (241), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-15 13:10:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 262 transitions. [2023-02-15 13:10:37,084 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 262 transitions. Word has length 42 [2023-02-15 13:10:37,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:37,084 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 262 transitions. [2023-02-15 13:10:37,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:10:37,085 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 262 transitions. [2023-02-15 13:10:37,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 13:10:37,085 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:37,085 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:10:37,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-02-15 13:10:37,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:37,294 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:10:37,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:37,294 INFO L85 PathProgramCache]: Analyzing trace with hash -2125965027, now seen corresponding path program 1 times [2023-02-15 13:10:37,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:37,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [286938860] [2023-02-15 13:10:37,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:37,295 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:37,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:37,305 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:10:37,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-02-15 13:10:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:37,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 16 conjunts are in the unsatisfiable core [2023-02-15 13:10:37,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:37,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:10:37,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:10:37,578 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:10:37,578 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:37,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [286938860] [2023-02-15 13:10:37,578 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [286938860] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:10:37,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:10:37,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-02-15 13:10:37,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677916198] [2023-02-15 13:10:37,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:10:37,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-02-15 13:10:37,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:37,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-02-15 13:10:37,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-02-15 13:10:37,580 INFO L87 Difference]: Start difference. First operand 228 states and 262 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:10:38,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:38,227 INFO L93 Difference]: Finished difference Result 310 states and 342 transitions. [2023-02-15 13:10:38,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-02-15 13:10:38,227 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 42 [2023-02-15 13:10:38,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:38,228 INFO L225 Difference]: With dead ends: 310 [2023-02-15 13:10:38,228 INFO L226 Difference]: Without dead ends: 310 [2023-02-15 13:10:38,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-02-15 13:10:38,229 INFO L413 NwaCegarLoop]: 188 mSDtfsCounter, 142 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-02-15 13:10:38,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 837 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-02-15 13:10:38,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2023-02-15 13:10:38,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 228. [2023-02-15 13:10:38,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 152 states have (on average 1.5723684210526316) internal successors, (239), 211 states have internal predecessors, (239), 9 states have call successors, (9), 7 states have call predecessors, (9), 8 states have return successors, (12), 9 states have call predecessors, (12), 9 states have call successors, (12) [2023-02-15 13:10:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 260 transitions. [2023-02-15 13:10:38,233 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 260 transitions. Word has length 42 [2023-02-15 13:10:38,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:38,233 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 260 transitions. [2023-02-15 13:10:38,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:10:38,233 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 260 transitions. [2023-02-15 13:10:38,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 13:10:38,233 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:38,233 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:10:38,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 (18)] Forceful destruction successful, exit code 0 [2023-02-15 13:10:38,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:38,442 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:10:38,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:38,443 INFO L85 PathProgramCache]: Analyzing trace with hash -2001953137, now seen corresponding path program 1 times [2023-02-15 13:10:38,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:38,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [746415514] [2023-02-15 13:10:38,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:38,443 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:38,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:38,444 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:10:38,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-02-15 13:10:38,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:38,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 13:10:38,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:38,689 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 13:10:38,689 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 19 treesize of output 27 [2023-02-15 13:10:38,869 INFO L321 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2023-02-15 13:10:38,869 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 40 [2023-02-15 13:10:38,930 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 0 case distinctions, treesize of input 15 treesize of output 11 [2023-02-15 13:10:39,006 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-02-15 13:10:39,006 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 43 [2023-02-15 13:10:39,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:10:39,329 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:10:39,342 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 13:10:39,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 43 [2023-02-15 13:10:39,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:10:39,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:10:39,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:39,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [746415514] [2023-02-15 13:10:39,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [746415514] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:10:39,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:10:39,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-02-15 13:10:39,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071619218] [2023-02-15 13:10:39,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:10:39,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-02-15 13:10:39,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:39,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-02-15 13:10:39,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2023-02-15 13:10:39,443 INFO L87 Difference]: Start difference. First operand 228 states and 260 transitions. Second operand has 16 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:10:41,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:10:41,578 INFO L93 Difference]: Finished difference Result 297 states and 332 transitions. [2023-02-15 13:10:41,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 13:10:41,579 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 42 [2023-02-15 13:10:41,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:10:41,580 INFO L225 Difference]: With dead ends: 297 [2023-02-15 13:10:41,580 INFO L226 Difference]: Without dead ends: 297 [2023-02-15 13:10:41,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=554, Unknown=0, NotChecked=0, Total=702 [2023-02-15 13:10:41,580 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 578 mSDsluCounter, 605 mSDsCounter, 0 mSdLazyCounter, 1037 mSolverCounterSat, 87 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 578 SdHoareTripleChecker+Valid, 697 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 1037 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-02-15 13:10:41,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [578 Valid, 697 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 1037 Invalid, 5 Unknown, 0 Unchecked, 1.8s Time] [2023-02-15 13:10:41,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2023-02-15 13:10:41,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 250. [2023-02-15 13:10:41,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 172 states have (on average 1.569767441860465) internal successors, (270), 229 states have internal predecessors, (270), 10 states have call successors, (10), 8 states have call predecessors, (10), 9 states have return successors, (14), 12 states have call predecessors, (14), 10 states have call successors, (14) [2023-02-15 13:10:41,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 294 transitions. [2023-02-15 13:10:41,586 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 294 transitions. Word has length 42 [2023-02-15 13:10:41,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:10:41,586 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 294 transitions. [2023-02-15 13:10:41,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.769230769230769) internal successors, (36), 14 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:10:41,587 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 294 transitions. [2023-02-15 13:10:41,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-02-15 13:10:41,587 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:10:41,587 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:10:41,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2023-02-15 13:10:41,797 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:41,797 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:10:41,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:10:41,798 INFO L85 PathProgramCache]: Analyzing trace with hash -2001953136, now seen corresponding path program 1 times [2023-02-15 13:10:41,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:10:41,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394969778] [2023-02-15 13:10:41,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:10:41,799 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:10:41,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:10:41,800 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:10:41,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-02-15 13:10:41,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:10:41,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 35 conjunts are in the unsatisfiable core [2023-02-15 13:10:41,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:10:42,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:10:42,055 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 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:10:42,072 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-02-15 13:10:42,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-02-15 13:10:42,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:10:42,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-02-15 13:10:42,313 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-02-15 13:10:42,313 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 14 [2023-02-15 13:10:42,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:10:42,443 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:10:42,443 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:10:42,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394969778] [2023-02-15 13:10:42,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1394969778] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:10:42,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:10:42,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-02-15 13:10:42,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975538680] [2023-02-15 13:10:42,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:10:42,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 13:10:42,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:10:42,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 13:10:42,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=106, Unknown=1, NotChecked=0, Total=132 [2023-02-15 13:10:42,445 INFO L87 Difference]: Start difference. First operand 250 states and 294 transitions. Second operand has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:10:45,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:10:47,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:10:49,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:10:51,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:10:53,402 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:10:55,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:10:59,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:11:01,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:11:03,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:11:06,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:11:08,604 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-02-15 13:11:08,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:11:08,621 INFO L93 Difference]: Finished difference Result 288 states and 324 transitions. [2023-02-15 13:11:08,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 13:11:08,622 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 42 [2023-02-15 13:11:08,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:11:08,623 INFO L225 Difference]: With dead ends: 288 [2023-02-15 13:11:08,623 INFO L226 Difference]: Without dead ends: 288 [2023-02-15 13:11:08,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=98, Invalid=362, Unknown=2, NotChecked=0, Total=462 [2023-02-15 13:11:08,623 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 603 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 1087 mSolverCounterSat, 81 mSolverCounterUnsat, 53 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 1221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 1087 IncrementalHoareTripleChecker+Invalid, 53 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.8s IncrementalHoareTripleChecker+Time [2023-02-15 13:11:08,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 426 Invalid, 1221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 1087 Invalid, 53 Unknown, 0 Unchecked, 25.8s Time] [2023-02-15 13:11:08,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2023-02-15 13:11:08,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 248. [2023-02-15 13:11:08,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 172 states have (on average 1.5465116279069768) internal successors, (266), 227 states have internal predecessors, (266), 10 states have call successors, (10), 8 states have call predecessors, (10), 9 states have return successors, (14), 12 states have call predecessors, (14), 10 states have call successors, (14) [2023-02-15 13:11:08,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 290 transitions. [2023-02-15 13:11:08,632 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 290 transitions. Word has length 42 [2023-02-15 13:11:08,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:11:08,633 INFO L495 AbstractCegarLoop]: Abstraction has 248 states and 290 transitions. [2023-02-15 13:11:08,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.272727272727273) internal successors, (36), 9 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:11:08,633 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 290 transitions. [2023-02-15 13:11:08,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-02-15 13:11:08,633 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:11:08,633 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:11:08,643 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 (20)] Ended with exit code 0 [2023-02-15 13:11:08,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:11:08,841 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_LEAK === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:11:08,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:11:08,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1930984993, now seen corresponding path program 1 times [2023-02-15 13:11:08,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:11:08,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [205718896] [2023-02-15 13:11:08,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:11:08,842 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:11:08,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:11:08,844 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:11:08,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-02-15 13:11:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:11:08,963 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjunts are in the unsatisfiable core [2023-02-15 13:11:08,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:11:08,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:11:08,972 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:11:08,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:11:08,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [205718896] [2023-02-15 13:11:08,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [205718896] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:11:08,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:11:08,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 13:11:08,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609618727] [2023-02-15 13:11:08,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:11:08,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 13:11:08,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:11:08,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 13:11:08,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 13:11:08,974 INFO L87 Difference]: Start difference. First operand 248 states and 290 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:11:08,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:11:08,991 INFO L93 Difference]: Finished difference Result 270 states and 311 transitions. [2023-02-15 13:11:08,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 13:11:08,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 43 [2023-02-15 13:11:08,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:11:08,998 INFO L225 Difference]: With dead ends: 270 [2023-02-15 13:11:08,999 INFO L226 Difference]: Without dead ends: 270 [2023-02-15 13:11:08,999 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-02-15 13:11:09,000 INFO L413 NwaCegarLoop]: 189 mSDtfsCounter, 47 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:11:09,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 547 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 13:11:09,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-02-15 13:11:09,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 250. [2023-02-15 13:11:09,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 174 states have (on average 1.5344827586206897) internal successors, (267), 229 states have internal predecessors, (267), 10 states have call successors, (10), 8 states have call predecessors, (10), 9 states have return successors, (14), 12 states have call predecessors, (14), 10 states have call successors, (14) [2023-02-15 13:11:09,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 291 transitions. [2023-02-15 13:11:09,021 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 291 transitions. Word has length 43 [2023-02-15 13:11:09,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:11:09,022 INFO L495 AbstractCegarLoop]: Abstraction has 250 states and 291 transitions. [2023-02-15 13:11:09,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-02-15 13:11:09,022 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 291 transitions. [2023-02-15 13:11:09,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 13:11:09,023 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:11:09,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:11:09,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-02-15 13:11:09,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:11:09,224 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:11:09,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:11:09,225 INFO L85 PathProgramCache]: Analyzing trace with hash -269786093, now seen corresponding path program 1 times [2023-02-15 13:11:09,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:11:09,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958056951] [2023-02-15 13:11:09,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:11:09,225 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:11:09,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:11:09,228 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:11:09,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-02-15 13:11:09,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:11:09,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 43 conjunts are in the unsatisfiable core [2023-02-15 13:11:09,423 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:11:09,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 13:11:09,554 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:11:09,602 INFO L321 Elim1Store]: treesize reduction 70, result has 30.7 percent of original size [2023-02-15 13:11:09,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 51 [2023-02-15 13:11:09,641 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-15 13:11:09,641 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 19 treesize of output 11 [2023-02-15 13:11:09,891 INFO L321 Elim1Store]: treesize reduction 70, result has 30.7 percent of original size [2023-02-15 13:11:09,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 51 [2023-02-15 13:11:10,162 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2023-02-15 13:11:10,334 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2023-02-15 13:11:10,641 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:11:10,645 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-15 13:11:10,645 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 43 [2023-02-15 13:11:10,744 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-15 13:11:10,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:11:10,805 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:11:10,805 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:11:10,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958056951] [2023-02-15 13:11:10,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958056951] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:11:10,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:11:10,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2023-02-15 13:11:10,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803248295] [2023-02-15 13:11:10,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:11:10,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-02-15 13:11:10,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:11:10,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-02-15 13:11:10,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2023-02-15 13:11:10,806 INFO L87 Difference]: Start difference. First operand 250 states and 291 transitions. Second operand has 19 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:11:13,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:11:13,931 INFO L93 Difference]: Finished difference Result 314 states and 351 transitions. [2023-02-15 13:11:13,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 13:11:13,931 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 45 [2023-02-15 13:11:13,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:11:13,932 INFO L225 Difference]: With dead ends: 314 [2023-02-15 13:11:13,932 INFO L226 Difference]: Without dead ends: 314 [2023-02-15 13:11:13,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=190, Invalid=932, Unknown=0, NotChecked=0, Total=1122 [2023-02-15 13:11:13,933 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 612 mSDsluCounter, 1047 mSDsCounter, 0 mSdLazyCounter, 1271 mSolverCounterSat, 53 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 1158 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 1271 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-02-15 13:11:13,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 1158 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 1271 Invalid, 9 Unknown, 0 Unchecked, 2.5s Time] [2023-02-15 13:11:13,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2023-02-15 13:11:13,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 275. [2023-02-15 13:11:13,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 196 states have (on average 1.5) internal successors, (294), 252 states have internal predecessors, (294), 11 states have call successors, (11), 10 states have call predecessors, (11), 11 states have return successors, (16), 12 states have call predecessors, (16), 11 states have call successors, (16) [2023-02-15 13:11:13,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 321 transitions. [2023-02-15 13:11:13,937 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 321 transitions. Word has length 45 [2023-02-15 13:11:13,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:11:13,938 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 321 transitions. [2023-02-15 13:11:13,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 15 states have (on average 2.533333333333333) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:11:13,938 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 321 transitions. [2023-02-15 13:11:13,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 13:11:13,938 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:11:13,938 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:11:13,963 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Ended with exit code 0 [2023-02-15 13:11:14,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:11:14,147 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:11:14,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:11:14,147 INFO L85 PathProgramCache]: Analyzing trace with hash -269786092, now seen corresponding path program 1 times [2023-02-15 13:11:14,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:11:14,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207602903] [2023-02-15 13:11:14,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:11:14,148 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:11:14,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:11:14,149 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:11:14,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-02-15 13:11:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:11:14,314 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 67 conjunts are in the unsatisfiable core [2023-02-15 13:11:14,317 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:11:14,365 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-02-15 13:11:14,375 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:11:14,610 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:11:14,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:11:14,663 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:11:14,687 INFO L321 Elim1Store]: treesize reduction 36, result has 25.0 percent of original size [2023-02-15 13:11:14,687 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 3 case distinctions, treesize of input 30 treesize of output 43 [2023-02-15 13:11:14,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:11:14,698 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 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 13:11:14,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-02-15 13:11:14,790 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-15 13:11:14,790 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 19 treesize of output 11 [2023-02-15 13:11:15,062 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 13:11:15,062 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 16 treesize of output 26 [2023-02-15 13:11:15,096 INFO L321 Elim1Store]: treesize reduction 26, result has 33.3 percent of original size [2023-02-15 13:11:15,096 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 24 treesize of output 26 [2023-02-15 13:11:15,397 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-15 13:11:15,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:11:15,488 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2023-02-15 13:11:15,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:11:15,863 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 13:11:15,867 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-02-15 13:11:16,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:11:16,031 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:11:16,031 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:11:16,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207602903] [2023-02-15 13:11:16,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [207602903] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:11:16,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:11:16,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2023-02-15 13:11:16,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392166336] [2023-02-15 13:11:16,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:11:16,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-02-15 13:11:16,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:11:16,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-02-15 13:11:16,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2023-02-15 13:11:16,032 INFO L87 Difference]: Start difference. First operand 275 states and 321 transitions. Second operand has 21 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:11:21,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:11:21,619 INFO L93 Difference]: Finished difference Result 349 states and 387 transitions. [2023-02-15 13:11:21,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-02-15 13:11:21,621 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 45 [2023-02-15 13:11:21,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:11:21,622 INFO L225 Difference]: With dead ends: 349 [2023-02-15 13:11:21,622 INFO L226 Difference]: Without dead ends: 349 [2023-02-15 13:11:21,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=184, Invalid=1148, Unknown=0, NotChecked=0, Total=1332 [2023-02-15 13:11:21,622 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 562 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 2007 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 563 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 2050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 2007 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:11:21,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [563 Valid, 1282 Invalid, 2050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 2007 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2023-02-15 13:11:21,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2023-02-15 13:11:21,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 295. [2023-02-15 13:11:21,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 212 states have (on average 1.5235849056603774) internal successors, (323), 270 states have internal predecessors, (323), 13 states have call successors, (13), 11 states have call predecessors, (13), 13 states have return successors, (18), 13 states have call predecessors, (18), 13 states have call successors, (18) [2023-02-15 13:11:21,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 354 transitions. [2023-02-15 13:11:21,627 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 354 transitions. Word has length 45 [2023-02-15 13:11:21,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:11:21,627 INFO L495 AbstractCegarLoop]: Abstraction has 295 states and 354 transitions. [2023-02-15 13:11:21,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:11:21,627 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 354 transitions. [2023-02-15 13:11:21,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 13:11:21,627 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:11:21,628 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:11:21,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-02-15 13:11:21,836 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:11:21,836 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:11:21,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:11:21,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1036278110, now seen corresponding path program 1 times [2023-02-15 13:11:21,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:11:21,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246731574] [2023-02-15 13:11:21,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:11:21,837 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:11:21,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:11:21,838 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:11:21,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-02-15 13:11:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:11:22,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 44 conjunts are in the unsatisfiable core [2023-02-15 13:11:22,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:11:22,310 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 13:11:22,311 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 37 [2023-02-15 13:11:22,501 INFO L321 Elim1Store]: treesize reduction 44, result has 37.1 percent of original size [2023-02-15 13:11:22,501 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 46 [2023-02-15 13:11:22,738 INFO L321 Elim1Store]: treesize reduction 118, result has 27.6 percent of original size [2023-02-15 13:11:22,739 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 38 treesize of output 73 [2023-02-15 13:11:22,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:11:23,128 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2023-02-15 13:11:23,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:11:23,384 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:11:23,445 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:11:23,498 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:11:23,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2023-02-15 13:11:24,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:11:24,111 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:11:24,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:11:24,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246731574] [2023-02-15 13:11:24,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [246731574] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:11:24,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:11:24,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2023-02-15 13:11:24,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915216268] [2023-02-15 13:11:24,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:11:24,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 13:11:24,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:11:24,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 13:11:24,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=334, Unknown=2, NotChecked=0, Total=380 [2023-02-15 13:11:24,112 INFO L87 Difference]: Start difference. First operand 295 states and 354 transitions. Second operand has 20 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 18 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:11:39,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:11:39,480 INFO L93 Difference]: Finished difference Result 462 states and 534 transitions. [2023-02-15 13:11:39,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 13:11:39,481 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 18 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 45 [2023-02-15 13:11:39,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:11:39,482 INFO L225 Difference]: With dead ends: 462 [2023-02-15 13:11:39,482 INFO L226 Difference]: Without dead ends: 462 [2023-02-15 13:11:39,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=313, Invalid=1245, Unknown=2, NotChecked=0, Total=1560 [2023-02-15 13:11:39,483 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 1743 mSDsluCounter, 847 mSDsCounter, 0 mSdLazyCounter, 1622 mSolverCounterSat, 163 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1744 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 1790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1622 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2023-02-15 13:11:39,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1744 Valid, 937 Invalid, 1790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1622 Invalid, 5 Unknown, 0 Unchecked, 5.3s Time] [2023-02-15 13:11:39,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2023-02-15 13:11:39,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 318. [2023-02-15 13:11:39,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 236 states have (on average 1.521186440677966) internal successors, (359), 292 states have internal predecessors, (359), 14 states have call successors, (14), 11 states have call predecessors, (14), 13 states have return successors, (19), 14 states have call predecessors, (19), 14 states have call successors, (19) [2023-02-15 13:11:39,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 392 transitions. [2023-02-15 13:11:39,488 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 392 transitions. Word has length 45 [2023-02-15 13:11:39,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:11:39,496 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 392 transitions. [2023-02-15 13:11:39,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 18 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:11:39,496 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 392 transitions. [2023-02-15 13:11:39,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-02-15 13:11:39,497 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:11:39,497 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:11:39,518 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2023-02-15 13:11:39,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:11:39,707 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:11:39,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:11:39,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1036278109, now seen corresponding path program 1 times [2023-02-15 13:11:39,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:11:39,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785693424] [2023-02-15 13:11:39,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:11:39,708 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:11:39,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:11:39,716 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:11:39,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2023-02-15 13:11:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:11:39,979 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 69 conjunts are in the unsatisfiable core [2023-02-15 13:11:39,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:11:40,033 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 13:11:40,033 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 13:11:40,149 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:11:40,149 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 13:11:40,169 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 13:11:40,169 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 13:11:40,212 INFO L321 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-02-15 13:11:40,212 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 11 [2023-02-15 13:11:40,216 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2023-02-15 13:11:40,352 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-02-15 13:11:40,352 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 3 case distinctions, treesize of input 20 treesize of output 22 [2023-02-15 13:11:40,369 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:11:40,369 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 1 case distinctions, treesize of input 18 treesize of output 24 [2023-02-15 13:11:40,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:11:40,555 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:11:40,676 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 36 treesize of output 47 [2023-02-15 13:11:40,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2023-02-15 13:11:40,833 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:11:40,834 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 13:11:40,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:11:40,856 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:11:40,856 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 13:11:40,862 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:11:40,958 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:11:40,959 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 13:11:40,962 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:11:40,982 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:11:40,982 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 13:11:40,985 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:11:41,104 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:11:41,104 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 13:11:41,108 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:11:41,125 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:11:41,125 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 13:11:41,129 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:11:41,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:11:41,241 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:11:41,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:11:41,250 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:11:41,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2023-02-15 13:11:41,459 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2023-02-15 13:11:41,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:11:41,613 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:11:41,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:11:41,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1785693424] [2023-02-15 13:11:41,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1785693424] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:11:41,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:11:41,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2023-02-15 13:11:41,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311655033] [2023-02-15 13:11:41,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:11:41,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-02-15 13:11:41,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:11:41,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-02-15 13:11:41,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=409, Unknown=0, NotChecked=0, Total=462 [2023-02-15 13:11:41,614 INFO L87 Difference]: Start difference. First operand 318 states and 392 transitions. Second operand has 22 states, 20 states have (on average 1.95) internal successors, (39), 18 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:11:49,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:11:49,243 INFO L93 Difference]: Finished difference Result 471 states and 557 transitions. [2023-02-15 13:11:49,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-15 13:11:49,244 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 1.95) internal successors, (39), 18 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 45 [2023-02-15 13:11:49,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:11:49,245 INFO L225 Difference]: With dead ends: 471 [2023-02-15 13:11:49,245 INFO L226 Difference]: Without dead ends: 471 [2023-02-15 13:11:49,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=349, Invalid=1907, Unknown=0, NotChecked=0, Total=2256 [2023-02-15 13:11:49,246 INFO L413 NwaCegarLoop]: 122 mSDtfsCounter, 781 mSDsluCounter, 1374 mSDsCounter, 0 mSdLazyCounter, 2175 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 784 SdHoareTripleChecker+Valid, 1496 SdHoareTripleChecker+Invalid, 2256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 2175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-02-15 13:11:49,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [784 Valid, 1496 Invalid, 2256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 2175 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-02-15 13:11:49,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2023-02-15 13:11:49,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 318. [2023-02-15 13:11:49,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 236 states have (on average 1.5127118644067796) internal successors, (357), 292 states have internal predecessors, (357), 14 states have call successors, (14), 11 states have call predecessors, (14), 13 states have return successors, (19), 14 states have call predecessors, (19), 14 states have call successors, (19) [2023-02-15 13:11:49,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 390 transitions. [2023-02-15 13:11:49,257 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 390 transitions. Word has length 45 [2023-02-15 13:11:49,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:11:49,257 INFO L495 AbstractCegarLoop]: Abstraction has 318 states and 390 transitions. [2023-02-15 13:11:49,257 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 1.95) internal successors, (39), 18 states have internal predecessors, (39), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:11:49,257 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 390 transitions. [2023-02-15 13:11:49,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-15 13:11:49,257 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:11:49,257 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:11:49,267 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (25)] Forceful destruction successful, exit code 0 [2023-02-15 13:11:49,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:11:49,467 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:11:49,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:11:49,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1566398444, now seen corresponding path program 1 times [2023-02-15 13:11:49,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:11:49,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [950218732] [2023-02-15 13:11:49,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:11:49,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-15 13:11:49,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:11:49,469 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:11:49,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2023-02-15 13:11:49,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:11:49,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 70 conjunts are in the unsatisfiable core [2023-02-15 13:11:49,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:11:49,787 INFO L321 Elim1Store]: treesize reduction 44, result has 34.3 percent of original size [2023-02-15 13:11:49,787 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 24 treesize of output 41 [2023-02-15 13:11:50,024 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:11:50,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:11:50,235 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 19 treesize of output 18 [2023-02-15 13:11:50,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:11:50,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:11:50,316 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:11:50,330 INFO L321 Elim1Store]: treesize reduction 36, result has 25.0 percent of original size [2023-02-15 13:11:50,330 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2023-02-15 13:11:50,455 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:11:50,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 36 [2023-02-15 13:11:50,754 INFO L321 Elim1Store]: treesize reduction 22, result has 55.1 percent of original size [2023-02-15 13:11:50,754 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 51 [2023-02-15 13:11:50,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:11:50,981 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:11:50,982 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 45 treesize of output 45 [2023-02-15 13:11:51,059 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:11:51,059 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 45 treesize of output 45 [2023-02-15 13:11:51,070 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-02-15 13:11:51,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-02-15 13:11:51,791 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:11:51,791 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 28 [2023-02-15 13:11:51,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:11:51,963 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:11:51,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:11:51,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [950218732] [2023-02-15 13:11:51,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [950218732] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:11:51,963 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:11:51,963 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2023-02-15 13:11:51,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110175979] [2023-02-15 13:11:51,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:11:51,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-02-15 13:11:51,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:11:51,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-02-15 13:11:51,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=631, Unknown=0, NotChecked=0, Total=702 [2023-02-15 13:11:51,973 INFO L87 Difference]: Start difference. First operand 318 states and 390 transitions. Second operand has 27 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 20 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:11:59,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:11:59,423 INFO L93 Difference]: Finished difference Result 375 states and 431 transitions. [2023-02-15 13:11:59,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2023-02-15 13:11:59,423 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 20 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 47 [2023-02-15 13:11:59,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:11:59,424 INFO L225 Difference]: With dead ends: 375 [2023-02-15 13:11:59,424 INFO L226 Difference]: Without dead ends: 375 [2023-02-15 13:11:59,425 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=283, Invalid=2369, Unknown=0, NotChecked=0, Total=2652 [2023-02-15 13:11:59,425 INFO L413 NwaCegarLoop]: 111 mSDtfsCounter, 533 mSDsluCounter, 1641 mSDsCounter, 0 mSdLazyCounter, 2508 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 533 SdHoareTripleChecker+Valid, 1752 SdHoareTripleChecker+Invalid, 2571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 2508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-02-15 13:11:59,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [533 Valid, 1752 Invalid, 2571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 2508 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2023-02-15 13:11:59,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2023-02-15 13:11:59,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 331. [2023-02-15 13:11:59,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 331 states, 247 states have (on average 1.5263157894736843) internal successors, (377), 303 states have internal predecessors, (377), 15 states have call successors, (15), 12 states have call predecessors, (15), 14 states have return successors, (20), 15 states have call predecessors, (20), 15 states have call successors, (20) [2023-02-15 13:11:59,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 412 transitions. [2023-02-15 13:11:59,430 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 412 transitions. Word has length 47 [2023-02-15 13:11:59,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:11:59,430 INFO L495 AbstractCegarLoop]: Abstraction has 331 states and 412 transitions. [2023-02-15 13:11:59,430 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 23 states have (on average 1.7391304347826086) internal successors, (40), 20 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:11:59,430 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 412 transitions. [2023-02-15 13:11:59,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-02-15 13:11:59,430 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:11:59,431 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:11:59,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (26)] Forceful destruction successful, exit code 0 [2023-02-15 13:11:59,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:11:59,631 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting free_reportsErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:11:59,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:11:59,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1566398443, now seen corresponding path program 1 times [2023-02-15 13:11:59,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:11:59,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008360227] [2023-02-15 13:11:59,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:11:59,632 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:11:59,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:11:59,634 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:11:59,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Waiting until timeout for monitored process [2023-02-15 13:11:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:11:59,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 86 conjunts are in the unsatisfiable core [2023-02-15 13:11:59,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:11:59,937 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-02-15 13:12:00,005 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 13:12:00,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-02-15 13:12:00,239 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:12:00,262 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:12:00,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:12:00,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-02-15 13:12:00,528 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 19 treesize of output 18 [2023-02-15 13:12:00,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-02-15 13:12:00,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:12:00,625 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 0 case distinctions, treesize of input 16 treesize of output 18 [2023-02-15 13:12:00,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:12:00,648 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-02-15 13:12:00,648 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 43 [2023-02-15 13:12:00,756 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 0 case distinctions, treesize of input 19 treesize of output 11 [2023-02-15 13:12:00,760 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-02-15 13:12:01,120 INFO L321 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2023-02-15 13:12:01,120 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-15 13:12:01,142 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2023-02-15 13:12:01,142 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2023-02-15 13:12:01,461 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2023-02-15 13:12:01,475 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:12:01,475 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 65 treesize of output 61 [2023-02-15 13:12:01,594 INFO L321 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2023-02-15 13:12:01,594 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 65 treesize of output 61 [2023-02-15 13:12:01,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2023-02-15 13:12:02,570 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-02-15 13:12:02,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 31 [2023-02-15 13:12:02,576 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-02-15 13:12:02,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 26 [2023-02-15 13:12:02,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:12:02,819 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:12:02,819 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:12:02,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008360227] [2023-02-15 13:12:02,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2008360227] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:12:02,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:12:02,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2023-02-15 13:12:02,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687867233] [2023-02-15 13:12:02,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:12:02,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-02-15 13:12:02,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:12:02,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-02-15 13:12:02,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=673, Unknown=0, NotChecked=0, Total=756 [2023-02-15 13:12:02,821 INFO L87 Difference]: Start difference. First operand 331 states and 412 transitions. Second operand has 28 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 20 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:12:11,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 13:12:11,908 INFO L93 Difference]: Finished difference Result 361 states and 409 transitions. [2023-02-15 13:12:11,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-02-15 13:12:11,909 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 20 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 47 [2023-02-15 13:12:11,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 13:12:11,910 INFO L225 Difference]: With dead ends: 361 [2023-02-15 13:12:11,910 INFO L226 Difference]: Without dead ends: 361 [2023-02-15 13:12:11,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 602 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=277, Invalid=2273, Unknown=0, NotChecked=0, Total=2550 [2023-02-15 13:12:11,910 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 400 mSDsluCounter, 1437 mSDsCounter, 0 mSdLazyCounter, 2994 mSolverCounterSat, 45 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 400 SdHoareTripleChecker+Valid, 1535 SdHoareTripleChecker+Invalid, 3043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 2994 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2023-02-15 13:12:11,911 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [400 Valid, 1535 Invalid, 3043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 2994 Invalid, 4 Unknown, 0 Unchecked, 6.2s Time] [2023-02-15 13:12:11,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2023-02-15 13:12:11,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 309. [2023-02-15 13:12:11,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 229 states have (on average 1.4934497816593886) internal successors, (342), 283 states have internal predecessors, (342), 13 states have call successors, (13), 11 states have call predecessors, (13), 12 states have return successors, (17), 14 states have call predecessors, (17), 13 states have call successors, (17) [2023-02-15 13:12:11,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 372 transitions. [2023-02-15 13:12:11,915 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 372 transitions. Word has length 47 [2023-02-15 13:12:11,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 13:12:11,915 INFO L495 AbstractCegarLoop]: Abstraction has 309 states and 372 transitions. [2023-02-15 13:12:11,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 20 states have internal predecessors, (40), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:12:11,915 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 372 transitions. [2023-02-15 13:12:11,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-02-15 13:12:11,915 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 13:12:11,915 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 13:12:11,927 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (27)] Forceful destruction successful, exit code 0 [2023-02-15 13:12:12,124 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:12:12,125 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [free_reportsErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, free_reportsErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 73 more)] === [2023-02-15 13:12:12,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 13:12:12,125 INFO L85 PathProgramCache]: Analyzing trace with hash 463879875, now seen corresponding path program 1 times [2023-02-15 13:12:12,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 13:12:12,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1170628957] [2023-02-15 13:12:12,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 13:12:12,125 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 13:12:12,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 13:12:12,127 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 13:12:12,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (28)] Waiting until timeout for monitored process [2023-02-15 13:12:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 13:12:12,464 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 73 conjunts are in the unsatisfiable core [2023-02-15 13:12:12,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 13:12:12,512 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-02-15 13:12:12,513 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 13:12:12,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:12:12,632 INFO L321 Elim1Store]: treesize reduction 70, result has 30.7 percent of original size [2023-02-15 13:12:12,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 51 [2023-02-15 13:12:12,678 INFO L321 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2023-02-15 13:12:12,679 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2023-02-15 13:12:12,938 INFO L321 Elim1Store]: treesize reduction 92, result has 31.3 percent of original size [2023-02-15 13:12:12,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 37 treesize of output 67 [2023-02-15 13:12:13,281 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-02-15 13:12:13,281 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 1 case distinctions, treesize of input 47 treesize of output 38 [2023-02-15 13:12:13,399 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-02-15 13:12:13,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:12:13,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:12:13,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:12:13,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:12:13,747 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-02-15 13:12:13,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 12 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 116 [2023-02-15 13:12:13,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:12:13,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:12:13,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:12:13,811 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-02-15 13:12:13,815 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 12 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 47 [2023-02-15 13:12:14,476 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:12:14,476 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 13:12:14,480 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:12:14,532 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 13:12:14,532 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 91 [2023-02-15 13:12:14,811 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:12:14,812 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 13:12:14,818 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:12:14,875 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 13:12:14,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 91 [2023-02-15 13:12:15,224 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 13:12:15,224 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 91 [2023-02-15 13:12:15,294 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:12:15,294 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 13:12:15,302 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-02-15 13:12:15,562 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-02-15 13:12:15,562 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 1 case distinctions, treesize of input 14 treesize of output 20 [2023-02-15 13:12:15,625 INFO L321 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2023-02-15 13:12:15,625 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 92 treesize of output 91 [2023-02-15 13:12:15,653 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-02-15 13:12:16,479 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 15 treesize of output 7 [2023-02-15 13:12:17,344 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-02-15 13:12:17,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 147 treesize of output 122 [2023-02-15 13:12:25,176 WARN L233 SmtUtils]: Spent 7.40s on a formula simplification. DAG size of input: 79 DAG size of output: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 13:12:29,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 13:12:29,596 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 13:12:29,596 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 13:12:29,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1170628957] [2023-02-15 13:12:29,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1170628957] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 13:12:29,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 13:12:29,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2023-02-15 13:12:29,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379754264] [2023-02-15 13:12:29,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 13:12:29,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-02-15 13:12:29,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 13:12:29,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-02-15 13:12:29,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=485, Unknown=0, NotChecked=0, Total=552 [2023-02-15 13:12:29,598 INFO L87 Difference]: Start difference. First operand 309 states and 372 transitions. Second operand has 24 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-02-15 13:12:47,035 WARN L233 SmtUtils]: Spent 8.68s on a formula simplification. DAG size of input: 166 DAG size of output: 126 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 13:13:38,282 WARN L233 SmtUtils]: Spent 46.97s on a formula simplification. DAG size of input: 176 DAG size of output: 135 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)