./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/array01-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 7e1ff0e6 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/array01-alloca-2.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 c01598788c0e593641b4d52eb46aec8832108f2ffb3b67e30286093c8a1926f8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-15 00:56:25,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 00:56:25,242 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 00:56:25,262 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 00:56:25,263 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 00:56:25,263 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 00:56:25,264 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 00:56:25,266 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 00:56:25,267 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 00:56:25,267 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 00:56:25,268 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 00:56:25,269 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 00:56:25,269 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 00:56:25,270 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 00:56:25,271 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 00:56:25,272 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 00:56:25,272 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 00:56:25,273 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 00:56:25,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 00:56:25,275 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 00:56:25,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 00:56:25,277 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 00:56:25,278 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 00:56:25,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 00:56:25,281 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 00:56:25,282 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 00:56:25,282 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 00:56:25,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 00:56:25,283 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 00:56:25,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 00:56:25,284 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 00:56:25,284 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 00:56:25,285 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 00:56:25,286 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 00:56:25,286 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 00:56:25,287 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 00:56:25,287 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 00:56:25,287 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 00:56:25,288 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 00:56:25,288 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 00:56:25,289 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 00:56:25,290 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-02-15 00:56:25,304 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 00:56:25,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 00:56:25,305 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 00:56:25,305 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 00:56:25,306 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 00:56:25,306 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 00:56:25,306 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 00:56:25,306 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 00:56:25,307 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 00:56:25,307 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 00:56:25,307 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 00:56:25,307 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 00:56:25,307 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 00:56:25,308 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 00:56:25,308 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 00:56:25,308 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 00:56:25,308 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 00:56:25,308 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 00:56:25,308 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 00:56:25,309 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 00:56:25,309 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 00:56:25,309 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 00:56:25,309 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 00:56:25,309 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 00:56:25,310 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 00:56:25,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 00:56:25,310 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 00:56:25,310 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 00:56:25,310 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-02-15 00:56:25,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-02-15 00:56:25,311 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 00:56:25,311 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 00:56:25,311 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 00:56:25,311 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 00:56:25,311 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 -> c01598788c0e593641b4d52eb46aec8832108f2ffb3b67e30286093c8a1926f8 [2023-02-15 00:56:25,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 00:56:25,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 00:56:25,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 00:56:25,506 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 00:56:25,506 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 00:56:25,507 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/array01-alloca-2.i [2023-02-15 00:56:26,553 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 00:56:26,757 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 00:56:26,757 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/array01-alloca-2.i [2023-02-15 00:56:26,767 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac0c356c1/3aa959c5425f46a0a04bfc87f96c53e9/FLAG7dd910db9 [2023-02-15 00:56:26,781 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac0c356c1/3aa959c5425f46a0a04bfc87f96c53e9 [2023-02-15 00:56:26,783 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 00:56:26,784 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 00:56:26,785 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 00:56:26,785 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 00:56:26,787 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 00:56:26,788 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:56:26" (1/1) ... [2023-02-15 00:56:26,790 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75139573 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:26, skipping insertion in model container [2023-02-15 00:56:26,790 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:56:26" (1/1) ... [2023-02-15 00:56:26,794 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 00:56:26,824 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 00:56:27,053 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 00:56:27,060 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 00:56:27,062 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@c346e8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:27, skipping insertion in model container [2023-02-15 00:56:27,062 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 00:56:27,062 INFO L184 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-02-15 00:56:27,063 INFO L158 Benchmark]: Toolchain (without parser) took 278.67ms. Allocated memory is still 169.9MB. Free memory was 130.8MB in the beginning and 119.4MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 00:56:27,064 INFO L158 Benchmark]: CDTParser took 0.70ms. Allocated memory is still 169.9MB. Free memory was 112.4MB in the beginning and 112.1MB in the end (delta: 241.3kB). There was no memory consumed. Max. memory is 16.1GB. [2023-02-15 00:56:27,067 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.84ms. Allocated memory is still 169.9MB. Free memory was 130.8MB in the beginning and 119.4MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-02-15 00:56:27,068 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.70ms. Allocated memory is still 169.9MB. Free memory was 112.4MB in the beginning and 112.1MB in the end (delta: 241.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.84ms. Allocated memory is still 169.9MB. Free memory was 130.8MB in the beginning and 119.4MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 529]: 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/array-memsafety/array01-alloca-2.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 c01598788c0e593641b4d52eb46aec8832108f2ffb3b67e30286093c8a1926f8 --- Real Ultimate output --- This is Ultimate 0.2.2-?-7e1ff0e [2023-02-15 00:56:28,614 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-02-15 00:56:28,616 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-02-15 00:56:28,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-02-15 00:56:28,648 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-02-15 00:56:28,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-02-15 00:56:28,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-02-15 00:56:28,653 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-02-15 00:56:28,657 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-02-15 00:56:28,660 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-02-15 00:56:28,661 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-02-15 00:56:28,662 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-02-15 00:56:28,663 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-02-15 00:56:28,664 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-02-15 00:56:28,665 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-02-15 00:56:28,667 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-02-15 00:56:28,668 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-02-15 00:56:28,669 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-02-15 00:56:28,670 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-02-15 00:56:28,673 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-02-15 00:56:28,674 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-02-15 00:56:28,675 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-02-15 00:56:28,676 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-02-15 00:56:28,676 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-02-15 00:56:28,681 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-02-15 00:56:28,682 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-02-15 00:56:28,682 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-02-15 00:56:28,683 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-02-15 00:56:28,683 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-02-15 00:56:28,684 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-02-15 00:56:28,684 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-02-15 00:56:28,689 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-02-15 00:56:28,690 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-02-15 00:56:28,690 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-02-15 00:56:28,691 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-02-15 00:56:28,691 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-02-15 00:56:28,692 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-02-15 00:56:28,692 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-02-15 00:56:28,692 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-02-15 00:56:28,693 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-02-15 00:56:28,693 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-02-15 00:56:28,696 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-02-15 00:56:28,721 INFO L113 SettingsManager]: Loading preferences was successful [2023-02-15 00:56:28,721 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-02-15 00:56:28,722 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-02-15 00:56:28,722 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-02-15 00:56:28,723 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-02-15 00:56:28,723 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-02-15 00:56:28,724 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-02-15 00:56:28,724 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-02-15 00:56:28,724 INFO L138 SettingsManager]: * Use SBE=true [2023-02-15 00:56:28,724 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-02-15 00:56:28,725 INFO L138 SettingsManager]: * sizeof long=4 [2023-02-15 00:56:28,725 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-02-15 00:56:28,725 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-02-15 00:56:28,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-02-15 00:56:28,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-02-15 00:56:28,725 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-02-15 00:56:28,726 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-02-15 00:56:28,726 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-02-15 00:56:28,726 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-02-15 00:56:28,726 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-02-15 00:56:28,726 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-02-15 00:56:28,726 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-02-15 00:56:28,726 INFO L138 SettingsManager]: * sizeof long double=12 [2023-02-15 00:56:28,726 INFO L138 SettingsManager]: * Use constant arrays=true [2023-02-15 00:56:28,727 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-02-15 00:56:28,727 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-02-15 00:56:28,727 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-02-15 00:56:28,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 00:56:28,727 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-02-15 00:56:28,727 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-02-15 00:56:28,727 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-02-15 00:56:28,728 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-02-15 00:56:28,728 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-02-15 00:56:28,728 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-02-15 00:56:28,728 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-02-15 00:56:28,728 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-02-15 00:56:28,729 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-02-15 00:56:28,729 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 -> c01598788c0e593641b4d52eb46aec8832108f2ffb3b67e30286093c8a1926f8 [2023-02-15 00:56:29,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-02-15 00:56:29,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-02-15 00:56:29,053 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-02-15 00:56:29,053 INFO L271 PluginConnector]: Initializing CDTParser... [2023-02-15 00:56:29,054 INFO L275 PluginConnector]: CDTParser initialized [2023-02-15 00:56:29,055 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/array01-alloca-2.i [2023-02-15 00:56:30,157 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-02-15 00:56:30,353 INFO L351 CDTParser]: Found 1 translation units. [2023-02-15 00:56:30,357 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/array01-alloca-2.i [2023-02-15 00:56:30,364 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4daabd58/8c85696f63cc45709161c4c07299a4c6/FLAG1473763c1 [2023-02-15 00:56:30,374 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f4daabd58/8c85696f63cc45709161c4c07299a4c6 [2023-02-15 00:56:30,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-02-15 00:56:30,376 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-02-15 00:56:30,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-02-15 00:56:30,379 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-02-15 00:56:30,381 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-02-15 00:56:30,382 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:56:30" (1/1) ... [2023-02-15 00:56:30,383 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8d06619 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:30, skipping insertion in model container [2023-02-15 00:56:30,383 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 12:56:30" (1/1) ... [2023-02-15 00:56:30,388 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-02-15 00:56:30,408 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 00:56:30,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 00:56:30,601 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-02-15 00:56:30,611 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-02-15 00:56:30,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 00:56:30,639 INFO L203 MainTranslator]: Completed pre-run [2023-02-15 00:56:30,657 INFO L210 PostProcessor]: Analyzing one entry point: main [2023-02-15 00:56:30,674 INFO L208 MainTranslator]: Completed translation [2023-02-15 00:56:30,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:30 WrapperNode [2023-02-15 00:56:30,675 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-02-15 00:56:30,676 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-02-15 00:56:30,676 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-02-15 00:56:30,676 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-02-15 00:56:30,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:30" (1/1) ... [2023-02-15 00:56:30,710 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:30" (1/1) ... [2023-02-15 00:56:30,729 INFO L138 Inliner]: procedures = 117, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 55 [2023-02-15 00:56:30,730 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-02-15 00:56:30,731 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-02-15 00:56:30,731 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-02-15 00:56:30,732 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-02-15 00:56:30,737 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:30" (1/1) ... [2023-02-15 00:56:30,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:30" (1/1) ... [2023-02-15 00:56:30,744 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:30" (1/1) ... [2023-02-15 00:56:30,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:30" (1/1) ... [2023-02-15 00:56:30,760 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:30" (1/1) ... [2023-02-15 00:56:30,764 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:30" (1/1) ... [2023-02-15 00:56:30,768 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:30" (1/1) ... [2023-02-15 00:56:30,770 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:30" (1/1) ... [2023-02-15 00:56:30,771 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-02-15 00:56:30,774 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-02-15 00:56:30,775 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-02-15 00:56:30,775 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-02-15 00:56:30,775 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:30" (1/1) ... [2023-02-15 00:56:30,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-02-15 00:56:30,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-02-15 00:56:30,799 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 00:56:30,830 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 00:56:30,861 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-02-15 00:56:30,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-02-15 00:56:30,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-02-15 00:56:30,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-02-15 00:56:30,865 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-02-15 00:56:30,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-02-15 00:56:30,998 INFO L235 CfgBuilder]: Building ICFG [2023-02-15 00:56:30,999 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2023-02-15 00:56:31,200 INFO L276 CfgBuilder]: Performing block encoding [2023-02-15 00:56:31,204 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-02-15 00:56:31,204 INFO L300 CfgBuilder]: Removed 3 assume(true) statements. [2023-02-15 00:56:31,205 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:56:31 BoogieIcfgContainer [2023-02-15 00:56:31,206 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-02-15 00:56:31,207 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-02-15 00:56:31,207 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-02-15 00:56:31,209 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-02-15 00:56:31,209 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 12:56:30" (1/3) ... [2023-02-15 00:56:31,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d4806d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:56:31, skipping insertion in model container [2023-02-15 00:56:31,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 12:56:30" (2/3) ... [2023-02-15 00:56:31,210 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59d4806d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 12:56:31, skipping insertion in model container [2023-02-15 00:56:31,210 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 12:56:31" (3/3) ... [2023-02-15 00:56:31,211 INFO L112 eAbstractionObserver]: Analyzing ICFG array01-alloca-2.i [2023-02-15 00:56:31,224 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-02-15 00:56:31,224 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-02-15 00:56:31,263 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-02-15 00:56:31,268 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;@68f85dc, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-02-15 00:56:31,268 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2023-02-15 00:56:31,272 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:31,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 00:56:31,275 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:56:31,276 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 00:56:31,276 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-15 00:56:31,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:56:31,281 INFO L85 PathProgramCache]: Analyzing trace with hash 889508873, now seen corresponding path program 1 times [2023-02-15 00:56:31,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:56:31,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1636791697] [2023-02-15 00:56:31,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:56:31,291 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:56:31,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:56:31,313 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 00:56:31,347 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 00:56:31,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:56:31,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 00:56:31,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:56:31,448 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 00:56:31,466 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 00:56:31,467 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 00:56:31,467 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:56:31,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1636791697] [2023-02-15 00:56:31,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1636791697] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 00:56:31,468 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 00:56:31,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-02-15 00:56:31,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117984463] [2023-02-15 00:56:31,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 00:56:31,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-02-15 00:56:31,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:56:31,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-02-15 00:56:31,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 00:56:31,506 INFO L87 Difference]: Start difference. First operand has 31 states, 21 states have (on average 1.7619047619047619) internal successors, (37), 30 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:31,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:56:31,550 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2023-02-15 00:56:31,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-02-15 00:56:31,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 00:56:31,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:56:31,558 INFO L225 Difference]: With dead ends: 30 [2023-02-15 00:56:31,558 INFO L226 Difference]: Without dead ends: 28 [2023-02-15 00:56:31,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-02-15 00:56:31,563 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 23 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 00:56:31,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 26 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 00:56:31,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-02-15 00:56:31,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-02-15 00:56:31,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.55) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:31,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2023-02-15 00:56:31,611 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 6 [2023-02-15 00:56:31,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:56:31,611 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2023-02-15 00:56:31,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:31,611 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2023-02-15 00:56:31,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 00:56:31,612 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:56:31,612 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 00:56:31,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-02-15 00:56:31,819 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 00:56:31,820 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-15 00:56:31,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:56:31,821 INFO L85 PathProgramCache]: Analyzing trace with hash 889508874, now seen corresponding path program 1 times [2023-02-15 00:56:31,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:56:31,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1280948002] [2023-02-15 00:56:31,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:56:31,822 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 00:56:31,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:56:31,824 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 00:56:31,831 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 00:56:31,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:56:31,887 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2023-02-15 00:56:31,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:56:31,917 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 00:56:31,942 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 00:56:31,943 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 00:56:31,944 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:56:31,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1280948002] [2023-02-15 00:56:31,944 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1280948002] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 00:56:31,944 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 00:56:31,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 00:56:31,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776384036] [2023-02-15 00:56:31,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 00:56:31,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 00:56:31,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:56:31,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 00:56:31,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 00:56:31,947 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:32,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:56:32,053 INFO L93 Difference]: Finished difference Result 57 states and 62 transitions. [2023-02-15 00:56:32,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 00:56:32,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 00:56:32,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:56:32,055 INFO L225 Difference]: With dead ends: 57 [2023-02-15 00:56:32,055 INFO L226 Difference]: Without dead ends: 57 [2023-02-15 00:56:32,055 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 00:56:32,056 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 33 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 00:56:32,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 102 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 00:56:32,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-02-15 00:56:32,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 31. [2023-02-15 00:56:32,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 30 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:32,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2023-02-15 00:56:32,061 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 6 [2023-02-15 00:56:32,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:56:32,061 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2023-02-15 00:56:32,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:32,061 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2023-02-15 00:56:32,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-02-15 00:56:32,062 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:56:32,062 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-02-15 00:56:32,083 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 00:56:32,268 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 00:56:32,268 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-15 00:56:32,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:56:32,269 INFO L85 PathProgramCache]: Analyzing trace with hash 889568456, now seen corresponding path program 1 times [2023-02-15 00:56:32,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:56:32,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [189613146] [2023-02-15 00:56:32,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:56:32,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 00:56:32,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:56:32,271 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 00:56:32,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 (4)] Waiting until timeout for monitored process [2023-02-15 00:56:32,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:56:32,301 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 00:56:32,303 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:56:32,320 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 8 treesize of output 7 [2023-02-15 00:56:32,357 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 00:56:32,357 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 00:56:32,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:56:32,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [189613146] [2023-02-15 00:56:32,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [189613146] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 00:56:32,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 00:56:32,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 00:56:32,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345171841] [2023-02-15 00:56:32,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 00:56:32,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 00:56:32,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:56:32,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 00:56:32,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 00:56:32,360 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:32,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:56:32,434 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2023-02-15 00:56:32,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 00:56:32,435 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-02-15 00:56:32,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:56:32,435 INFO L225 Difference]: With dead ends: 35 [2023-02-15 00:56:32,435 INFO L226 Difference]: Without dead ends: 35 [2023-02-15 00:56:32,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 00:56:32,436 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 33 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 00:56:32,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 43 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 00:56:32,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2023-02-15 00:56:32,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2023-02-15 00:56:32,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.5) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:32,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2023-02-15 00:56:32,439 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 6 [2023-02-15 00:56:32,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:56:32,439 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2023-02-15 00:56:32,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:32,439 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2023-02-15 00:56:32,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 00:56:32,440 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:56:32,440 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:56:32,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-02-15 00:56:32,650 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 00:56:32,650 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-15 00:56:32,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:56:32,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1091210163, now seen corresponding path program 1 times [2023-02-15 00:56:32,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:56:32,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218247537] [2023-02-15 00:56:32,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:56:32,654 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 00:56:32,654 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:56:32,657 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 00:56:32,661 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 00:56:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:56:32,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 4 conjunts are in the unsatisfiable core [2023-02-15 00:56:32,748 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:56:32,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:56:32,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:56:32,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:56:32,843 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:56:32,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [218247537] [2023-02-15 00:56:32,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [218247537] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:56:32,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 00:56:32,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-02-15 00:56:32,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706598213] [2023-02-15 00:56:32,847 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 00:56:32,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 00:56:32,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:56:32,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 00:56:32,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-02-15 00:56:32,849 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:32,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:56:32,909 INFO L93 Difference]: Finished difference Result 55 states and 59 transitions. [2023-02-15 00:56:32,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 00:56:32,911 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-15 00:56:32,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:56:32,912 INFO L225 Difference]: With dead ends: 55 [2023-02-15 00:56:32,912 INFO L226 Difference]: Without dead ends: 55 [2023-02-15 00:56:32,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2023-02-15 00:56:32,913 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 104 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 00:56:32,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 115 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 00:56:32,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-02-15 00:56:32,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 36. [2023-02-15 00:56:32,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 35 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:32,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2023-02-15 00:56:32,916 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 10 [2023-02-15 00:56:32,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:56:32,916 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2023-02-15 00:56:32,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:32,916 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2023-02-15 00:56:32,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-02-15 00:56:32,918 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:56:32,918 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:56:32,935 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-02-15 00:56:33,126 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 00:56:33,129 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-15 00:56:33,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:56:33,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1900556789, now seen corresponding path program 1 times [2023-02-15 00:56:33,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:56:33,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1135339251] [2023-02-15 00:56:33,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:56:33,130 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 00:56:33,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:56:33,135 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 00:56:33,136 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 00:56:33,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:56:33,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 11 conjunts are in the unsatisfiable core [2023-02-15 00:56:33,174 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:56:33,206 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 8 treesize of output 7 [2023-02-15 00:56:33,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:56:33,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:56:33,595 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:56:33,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:56:33,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1135339251] [2023-02-15 00:56:33,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1135339251] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:56:33,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 00:56:33,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-02-15 00:56:33,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543026925] [2023-02-15 00:56:33,595 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 00:56:33,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-02-15 00:56:33,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:56:33,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-02-15 00:56:33,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-15 00:56:33,596 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:34,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:56:34,246 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2023-02-15 00:56:34,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-02-15 00:56:34,247 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2023-02-15 00:56:34,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:56:34,248 INFO L225 Difference]: With dead ends: 86 [2023-02-15 00:56:34,248 INFO L226 Difference]: Without dead ends: 86 [2023-02-15 00:56:34,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2023-02-15 00:56:34,249 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 205 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-02-15 00:56:34,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 70 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-02-15 00:56:34,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-02-15 00:56:34,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 48. [2023-02-15 00:56:34,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 40 states have (on average 1.35) internal successors, (54), 47 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:34,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 54 transitions. [2023-02-15 00:56:34,253 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 54 transitions. Word has length 10 [2023-02-15 00:56:34,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:56:34,253 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 54 transitions. [2023-02-15 00:56:34,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:34,253 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 54 transitions. [2023-02-15 00:56:34,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 00:56:34,253 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:56:34,253 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:56:34,273 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 00:56:34,471 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 00:56:34,472 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-15 00:56:34,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:56:34,473 INFO L85 PathProgramCache]: Analyzing trace with hash -680998148, now seen corresponding path program 1 times [2023-02-15 00:56:34,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:56:34,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1024849923] [2023-02-15 00:56:34,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:56:34,473 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 00:56:34,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:56:34,474 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 00:56:34,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-02-15 00:56:34,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:56:34,557 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 00:56:34,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:56:34,568 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 00:56:34,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 00:56:34,587 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 00:56:34,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:56:34,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1024849923] [2023-02-15 00:56:34,588 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1024849923] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 00:56:34,588 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 00:56:34,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-02-15 00:56:34,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629728955] [2023-02-15 00:56:34,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 00:56:34,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 00:56:34,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:56:34,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 00:56:34,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 00:56:34,605 INFO L87 Difference]: Start difference. First operand 48 states and 54 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:34,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:56:34,662 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2023-02-15 00:56:34,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 00:56:34,662 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-15 00:56:34,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:56:34,663 INFO L225 Difference]: With dead ends: 45 [2023-02-15 00:56:34,664 INFO L226 Difference]: Without dead ends: 45 [2023-02-15 00:56:34,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 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 00:56:34,664 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 29 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 00:56:34,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 26 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 00:56:34,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-02-15 00:56:34,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-02-15 00:56:34,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.275) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:34,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2023-02-15 00:56:34,668 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 12 [2023-02-15 00:56:34,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:56:34,668 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2023-02-15 00:56:34,668 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:34,668 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2023-02-15 00:56:34,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 00:56:34,668 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:56:34,668 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:56:34,683 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 (7)] Ended with exit code 0 [2023-02-15 00:56:34,875 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 00:56:34,875 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-15 00:56:34,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:56:34,875 INFO L85 PathProgramCache]: Analyzing trace with hash -680998147, now seen corresponding path program 1 times [2023-02-15 00:56:34,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:56:34,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [685179131] [2023-02-15 00:56:34,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:56:34,876 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:56:34,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:56:34,877 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 00:56:34,884 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 00:56:34,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:56:34,937 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 12 conjunts are in the unsatisfiable core [2023-02-15 00:56:34,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:56:34,953 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 00:56:35,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 00:56:35,024 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 00:56:35,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:56:35,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [685179131] [2023-02-15 00:56:35,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [685179131] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 00:56:35,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 00:56:35,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 00:56:35,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563774315] [2023-02-15 00:56:35,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 00:56:35,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 00:56:35,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:56:35,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 00:56:35,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-02-15 00:56:35,026 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:35,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:56:35,157 INFO L93 Difference]: Finished difference Result 73 states and 81 transitions. [2023-02-15 00:56:35,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 00:56:35,158 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-15 00:56:35,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:56:35,159 INFO L225 Difference]: With dead ends: 73 [2023-02-15 00:56:35,159 INFO L226 Difference]: Without dead ends: 73 [2023-02-15 00:56:35,159 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 00:56:35,159 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 77 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 00:56:35,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 75 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 00:56:35,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-02-15 00:56:35,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 53. [2023-02-15 00:56:35,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 52 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:35,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2023-02-15 00:56:35,163 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 12 [2023-02-15 00:56:35,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:56:35,163 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2023-02-15 00:56:35,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:35,163 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2023-02-15 00:56:35,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-02-15 00:56:35,163 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:56:35,164 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:56:35,178 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 00:56:35,378 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 00:56:35,379 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-15 00:56:35,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:56:35,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1074025157, now seen corresponding path program 1 times [2023-02-15 00:56:35,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:56:35,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1105148075] [2023-02-15 00:56:35,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:56:35,381 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 00:56:35,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:56:35,386 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 00:56:35,389 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 00:56:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:56:35,452 INFO L263 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 00:56:35,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:56:35,466 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 8 treesize of output 7 [2023-02-15 00:56:35,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:56:35,794 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:56:36,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:56:36,048 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:56:36,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1105148075] [2023-02-15 00:56:36,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1105148075] provided 1 perfect and 1 imperfect interpolant sequences [2023-02-15 00:56:36,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-02-15 00:56:36,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2023-02-15 00:56:36,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314968218] [2023-02-15 00:56:36,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 00:56:36,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 00:56:36,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:56:36,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 00:56:36,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-02-15 00:56:36,049 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:36,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:56:36,197 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2023-02-15 00:56:36,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 00:56:36,198 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-02-15 00:56:36,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:56:36,198 INFO L225 Difference]: With dead ends: 57 [2023-02-15 00:56:36,198 INFO L226 Difference]: Without dead ends: 57 [2023-02-15 00:56:36,198 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-02-15 00:56:36,199 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 34 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 00:56:36,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 33 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 00:56:36,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-02-15 00:56:36,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 45. [2023-02-15 00:56:36,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 44 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:36,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2023-02-15 00:56:36,202 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 12 [2023-02-15 00:56:36,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:56:36,202 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2023-02-15 00:56:36,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:36,202 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2023-02-15 00:56:36,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 00:56:36,203 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:56:36,203 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:56:36,215 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 00:56:36,417 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 00:56:36,417 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-15 00:56:36,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:56:36,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1604227594, now seen corresponding path program 1 times [2023-02-15 00:56:36,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:56:36,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [708824613] [2023-02-15 00:56:36,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:56:36,418 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 00:56:36,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:56:36,421 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 00:56:36,422 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 00:56:36,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:56:36,466 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 5 conjunts are in the unsatisfiable core [2023-02-15 00:56:36,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:56:36,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 00:56:36,497 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 00:56:36,497 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:56:36,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [708824613] [2023-02-15 00:56:36,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [708824613] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 00:56:36,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 00:56:36,497 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 00:56:36,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152264715] [2023-02-15 00:56:36,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 00:56:36,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-02-15 00:56:36,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:56:36,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-02-15 00:56:36,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-02-15 00:56:36,499 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:36,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:56:36,543 INFO L93 Difference]: Finished difference Result 68 states and 77 transitions. [2023-02-15 00:56:36,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-02-15 00:56:36,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-15 00:56:36,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:56:36,544 INFO L225 Difference]: With dead ends: 68 [2023-02-15 00:56:36,544 INFO L226 Difference]: Without dead ends: 68 [2023-02-15 00:56:36,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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 00:56:36,545 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 32 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 00:56:36,545 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 62 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-02-15 00:56:36,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-02-15 00:56:36,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 47. [2023-02-15 00:56:36,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 44 states have (on average 1.2272727272727273) internal successors, (54), 46 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:36,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2023-02-15 00:56:36,548 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 14 [2023-02-15 00:56:36,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:56:36,548 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2023-02-15 00:56:36,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:36,548 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2023-02-15 00:56:36,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-02-15 00:56:36,548 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:56:36,548 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:56:36,564 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 00:56:36,764 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 00:56:36,764 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-15 00:56:36,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:56:36,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1346062156, now seen corresponding path program 1 times [2023-02-15 00:56:36,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:56:36,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [214336983] [2023-02-15 00:56:36,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:56:36,765 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 00:56:36,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:56:36,769 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 00:56:36,775 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 00:56:36,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:56:36,806 INFO L263 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 9 conjunts are in the unsatisfiable core [2023-02-15 00:56:36,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:56:36,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:56:36,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:56:36,941 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:56:36,941 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:56:36,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [214336983] [2023-02-15 00:56:36,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [214336983] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:56:36,941 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 00:56:36,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2023-02-15 00:56:36,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841714706] [2023-02-15 00:56:36,941 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 00:56:36,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-02-15 00:56:36,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:56:36,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-02-15 00:56:36,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2023-02-15 00:56:36,942 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:37,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:56:37,116 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2023-02-15 00:56:37,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-02-15 00:56:37,117 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-02-15 00:56:37,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:56:37,117 INFO L225 Difference]: With dead ends: 70 [2023-02-15 00:56:37,117 INFO L226 Difference]: Without dead ends: 70 [2023-02-15 00:56:37,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2023-02-15 00:56:37,118 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 203 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 00:56:37,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 60 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 00:56:37,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-02-15 00:56:37,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 45. [2023-02-15 00:56:37,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 42 states have (on average 1.2142857142857142) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:37,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2023-02-15 00:56:37,123 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 14 [2023-02-15 00:56:37,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:56:37,123 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2023-02-15 00:56:37,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:37,123 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2023-02-15 00:56:37,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 00:56:37,123 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:56:37,123 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:56:37,143 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 00:56:37,324 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 00:56:37,324 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-15 00:56:37,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:56:37,324 INFO L85 PathProgramCache]: Analyzing trace with hash 265956368, now seen corresponding path program 1 times [2023-02-15 00:56:37,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:56:37,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1928445406] [2023-02-15 00:56:37,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:56:37,325 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 00:56:37,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:56:37,326 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 00:56:37,328 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 00:56:37,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:56:37,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 00:56:37,401 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:56:37,453 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 00:56:37,453 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:56:37,523 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 00:56:37,523 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:56:37,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1928445406] [2023-02-15 00:56:37,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1928445406] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:56:37,523 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 00:56:37,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-02-15 00:56:37,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956978239] [2023-02-15 00:56:37,524 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 00:56:37,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-02-15 00:56:37,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:56:37,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-02-15 00:56:37,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-02-15 00:56:37,529 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:37,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:56:37,626 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2023-02-15 00:56:37,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-02-15 00:56:37,627 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-15 00:56:37,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:56:37,628 INFO L225 Difference]: With dead ends: 59 [2023-02-15 00:56:37,628 INFO L226 Difference]: Without dead ends: 59 [2023-02-15 00:56:37,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-02-15 00:56:37,629 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 26 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-02-15 00:56:37,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 111 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-02-15 00:56:37,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-15 00:56:37,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2023-02-15 00:56:37,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 52 states have (on average 1.1923076923076923) internal successors, (62), 54 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:37,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2023-02-15 00:56:37,640 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 16 [2023-02-15 00:56:37,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:56:37,640 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2023-02-15 00:56:37,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:37,640 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2023-02-15 00:56:37,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-02-15 00:56:37,643 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:56:37,643 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:56:37,650 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 00:56:37,850 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 00:56:37,851 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-15 00:56:37,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:56:37,851 INFO L85 PathProgramCache]: Analyzing trace with hash -745160882, now seen corresponding path program 1 times [2023-02-15 00:56:37,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:56:37,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2051037686] [2023-02-15 00:56:37,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:56:37,852 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 00:56:37,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:56:37,854 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 00:56:37,855 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 00:56:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:56:37,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 17 conjunts are in the unsatisfiable core [2023-02-15 00:56:37,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:56:37,911 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 8 treesize of output 7 [2023-02-15 00:56:38,119 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 00:56:38,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:56:38,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-02-15 00:56:38,457 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:56:38,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2051037686] [2023-02-15 00:56:38,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2051037686] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:56:38,457 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 00:56:38,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-02-15 00:56:38,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195208728] [2023-02-15 00:56:38,458 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 00:56:38,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-02-15 00:56:38,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:56:38,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-02-15 00:56:38,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2023-02-15 00:56:38,459 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:39,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:56:39,103 INFO L93 Difference]: Finished difference Result 90 states and 101 transitions. [2023-02-15 00:56:39,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-02-15 00:56:39,104 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-02-15 00:56:39,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:56:39,106 INFO L225 Difference]: With dead ends: 90 [2023-02-15 00:56:39,106 INFO L226 Difference]: Without dead ends: 90 [2023-02-15 00:56:39,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2023-02-15 00:56:39,107 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 184 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-02-15 00:56:39,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 62 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-02-15 00:56:39,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2023-02-15 00:56:39,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 79. [2023-02-15 00:56:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 76 states have (on average 1.2105263157894737) internal successors, (92), 78 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:39,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 92 transitions. [2023-02-15 00:56:39,110 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 92 transitions. Word has length 16 [2023-02-15 00:56:39,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:56:39,110 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 92 transitions. [2023-02-15 00:56:39,110 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:39,110 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 92 transitions. [2023-02-15 00:56:39,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-02-15 00:56:39,110 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:56:39,111 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:56:39,120 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 00:56:39,320 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 00:56:39,320 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-15 00:56:39,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:56:39,320 INFO L85 PathProgramCache]: Analyzing trace with hash -2114005431, now seen corresponding path program 1 times [2023-02-15 00:56:39,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:56:39,321 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [371614109] [2023-02-15 00:56:39,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-02-15 00:56:39,321 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 00:56:39,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:56:39,322 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 00:56:39,324 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 00:56:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:56:39,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 6 conjunts are in the unsatisfiable core [2023-02-15 00:56:39,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:56:39,427 WARN L859 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_#t~malloc8#1.base_11| (_ BitVec 32))) (and (= (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~malloc8#1.base_11| (_ bv0 1)) |c_#valid|) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~malloc8#1.base_11|) (_ bv0 1)))) is different from true [2023-02-15 00:56:39,428 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-02-15 00:56:39,428 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-02-15 00:56:39,428 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:56:39,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [371614109] [2023-02-15 00:56:39,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [371614109] provided 1 perfect and 0 imperfect interpolant sequences [2023-02-15 00:56:39,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-02-15 00:56:39,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-02-15 00:56:39,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027130988] [2023-02-15 00:56:39,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-02-15 00:56:39,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-02-15 00:56:39,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:56:39,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-02-15 00:56:39,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=8, Unknown=1, NotChecked=4, Total=20 [2023-02-15 00:56:39,429 INFO L87 Difference]: Start difference. First operand 79 states and 92 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:39,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:56:39,477 INFO L93 Difference]: Finished difference Result 78 states and 91 transitions. [2023-02-15 00:56:39,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-02-15 00:56:39,478 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2023-02-15 00:56:39,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:56:39,478 INFO L225 Difference]: With dead ends: 78 [2023-02-15 00:56:39,478 INFO L226 Difference]: Without dead ends: 59 [2023-02-15 00:56:39,478 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=13, Unknown=1, NotChecked=6, Total=30 [2023-02-15 00:56:39,479 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 8 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-02-15 00:56:39,479 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 36 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 24 Unchecked, 0.0s Time] [2023-02-15 00:56:39,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2023-02-15 00:56:39,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2023-02-15 00:56:39,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 57 states have (on average 1.1754385964912282) internal successors, (67), 58 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:39,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2023-02-15 00:56:39,481 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 18 [2023-02-15 00:56:39,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:56:39,482 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2023-02-15 00:56:39,482 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:39,482 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2023-02-15 00:56:39,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-02-15 00:56:39,482 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:56:39,483 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1] [2023-02-15 00:56:39,491 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 00:56:39,683 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 00:56:39,683 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-15 00:56:39,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:56:39,683 INFO L85 PathProgramCache]: Analyzing trace with hash 302966996, now seen corresponding path program 2 times [2023-02-15 00:56:39,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:56:39,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1786770188] [2023-02-15 00:56:39,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 00:56:39,684 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 00:56:39,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:56:39,685 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 00:56:39,688 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 00:56:39,749 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 00:56:39,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 00:56:39,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 14 conjunts are in the unsatisfiable core [2023-02-15 00:56:39,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:56:39,771 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 8 treesize of output 7 [2023-02-15 00:56:40,124 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:56:40,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:56:41,015 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:56:41,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:56:41,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1786770188] [2023-02-15 00:56:41,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1786770188] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:56:41,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 00:56:41,015 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-02-15 00:56:41,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281599826] [2023-02-15 00:56:41,015 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 00:56:41,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-02-15 00:56:41,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:56:41,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-02-15 00:56:41,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=218, Unknown=0, NotChecked=0, Total=306 [2023-02-15 00:56:41,016 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:43,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-15 00:56:44,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:56:44,878 INFO L93 Difference]: Finished difference Result 371 states and 417 transitions. [2023-02-15 00:56:44,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 00:56:44,879 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-02-15 00:56:44,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:56:44,880 INFO L225 Difference]: With dead ends: 371 [2023-02-15 00:56:44,880 INFO L226 Difference]: Without dead ends: 371 [2023-02-15 00:56:44,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 218 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=327, Invalid=665, Unknown=0, NotChecked=0, Total=992 [2023-02-15 00:56:44,881 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 455 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 455 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-02-15 00:56:44,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [455 Valid, 248 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-02-15 00:56:44,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2023-02-15 00:56:44,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 83. [2023-02-15 00:56:44,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 81 states have (on average 1.1975308641975309) internal successors, (97), 82 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:44,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2023-02-15 00:56:44,885 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 22 [2023-02-15 00:56:44,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:56:44,886 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2023-02-15 00:56:44,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:44,887 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2023-02-15 00:56:44,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-02-15 00:56:44,888 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:56:44,888 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:56:44,898 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 00:56:45,089 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 00:56:45,089 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-15 00:56:45,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:56:45,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1708692345, now seen corresponding path program 2 times [2023-02-15 00:56:45,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:56:45,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1414462260] [2023-02-15 00:56:45,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 00:56:45,090 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 00:56:45,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:56:45,091 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 00:56:45,093 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 00:56:45,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 00:56:45,149 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 00:56:45,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-15 00:56:45,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:56:45,169 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 8 treesize of output 7 [2023-02-15 00:56:45,448 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:56:45,448 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:56:46,678 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:56:46,678 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:56:46,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1414462260] [2023-02-15 00:56:46,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1414462260] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:56:46,678 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 00:56:46,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 20 [2023-02-15 00:56:46,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495450635] [2023-02-15 00:56:46,678 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 00:56:46,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 00:56:46,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:56:46,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 00:56:46,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2023-02-15 00:56:46,679 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:49,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:56:49,738 INFO L93 Difference]: Finished difference Result 148 states and 167 transitions. [2023-02-15 00:56:49,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-02-15 00:56:49,739 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-02-15 00:56:49,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:56:49,739 INFO L225 Difference]: With dead ends: 148 [2023-02-15 00:56:49,739 INFO L226 Difference]: Without dead ends: 136 [2023-02-15 00:56:49,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=295, Invalid=1037, Unknown=0, NotChecked=0, Total=1332 [2023-02-15 00:56:49,740 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 355 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-02-15 00:56:49,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 174 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-02-15 00:56:49,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-02-15 00:56:49,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 92. [2023-02-15 00:56:49,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 90 states have (on average 1.1777777777777778) internal successors, (106), 91 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:49,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 106 transitions. [2023-02-15 00:56:49,743 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 106 transitions. Word has length 28 [2023-02-15 00:56:49,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:56:49,743 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 106 transitions. [2023-02-15 00:56:49,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.7) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:56:49,743 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 106 transitions. [2023-02-15 00:56:49,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-02-15 00:56:49,744 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:56:49,744 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:56:49,756 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 (16)] Ended with exit code 0 [2023-02-15 00:56:49,944 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 00:56:49,944 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-15 00:56:49,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:56:49,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1233071133, now seen corresponding path program 3 times [2023-02-15 00:56:49,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:56:49,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [480753925] [2023-02-15 00:56:49,945 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 00:56:49,945 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 00:56:49,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:56:49,947 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 00:56:49,949 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 00:56:50,063 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-02-15 00:56:50,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 00:56:50,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-15 00:56:50,069 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:56:50,076 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 8 treesize of output 7 [2023-02-15 00:56:50,901 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 00:56:50,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:57:08,844 WARN L233 SmtUtils]: Spent 6.22s on a formula simplification that was a NOOP. DAG size: 38 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 00:57:15,154 WARN L233 SmtUtils]: Spent 5.66s on a formula simplification that was a NOOP. DAG size: 27 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-02-15 00:57:15,162 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2023-02-15 00:57:15,162 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:57:15,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [480753925] [2023-02-15 00:57:15,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [480753925] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:57:15,162 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 00:57:15,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 25 [2023-02-15 00:57:15,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631387385] [2023-02-15 00:57:15,162 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 00:57:15,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-02-15 00:57:15,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:57:15,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-02-15 00:57:15,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=544, Unknown=2, NotChecked=0, Total=650 [2023-02-15 00:57:15,163 INFO L87 Difference]: Start difference. First operand 92 states and 106 transitions. Second operand has 26 states, 25 states have (on average 2.4) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:57:18,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:57:18,772 INFO L93 Difference]: Finished difference Result 116 states and 131 transitions. [2023-02-15 00:57:18,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-02-15 00:57:18,773 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.4) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2023-02-15 00:57:18,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:57:18,774 INFO L225 Difference]: With dead ends: 116 [2023-02-15 00:57:18,774 INFO L226 Difference]: Without dead ends: 97 [2023-02-15 00:57:18,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 24.6s TimeCoverageRelationStatistics Valid=203, Invalid=851, Unknown=2, NotChecked=0, Total=1056 [2023-02-15 00:57:18,775 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 159 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2023-02-15 00:57:18,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 146 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2023-02-15 00:57:18,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-02-15 00:57:18,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2023-02-15 00:57:18,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 90 states have (on average 1.1666666666666667) internal successors, (105), 91 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:57:18,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 105 transitions. [2023-02-15 00:57:18,777 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 105 transitions. Word has length 36 [2023-02-15 00:57:18,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:57:18,777 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 105 transitions. [2023-02-15 00:57:18,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.4) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:57:18,777 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 105 transitions. [2023-02-15 00:57:18,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2023-02-15 00:57:18,778 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:57:18,778 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:57:18,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-02-15 00:57:18,988 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 00:57:18,989 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-15 00:57:18,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:57:18,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1584580368, now seen corresponding path program 4 times [2023-02-15 00:57:18,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:57:18,991 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1818297748] [2023-02-15 00:57:18,991 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-02-15 00:57:18,991 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 00:57:18,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:57:18,992 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 00:57:18,993 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 00:57:19,103 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-02-15 00:57:19,103 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 00:57:19,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-15 00:57:19,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:57:19,164 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 8 treesize of output 7 [2023-02-15 00:57:20,424 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-15 00:57:20,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:57:23,384 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-02-15 00:57:23,385 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:57:23,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1818297748] [2023-02-15 00:57:23,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1818297748] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:57:23,386 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 00:57:23,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2023-02-15 00:57:23,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382057546] [2023-02-15 00:57:23,386 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 00:57:23,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-02-15 00:57:23,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:57:23,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-02-15 00:57:23,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2023-02-15 00:57:23,387 INFO L87 Difference]: Start difference. First operand 92 states and 105 transitions. Second operand has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:57:30,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:57:30,329 INFO L93 Difference]: Finished difference Result 171 states and 193 transitions. [2023-02-15 00:57:30,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-02-15 00:57:30,331 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 40 [2023-02-15 00:57:30,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:57:30,332 INFO L225 Difference]: With dead ends: 171 [2023-02-15 00:57:30,332 INFO L226 Difference]: Without dead ends: 171 [2023-02-15 00:57:30,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=435, Invalid=1125, Unknown=0, NotChecked=0, Total=1560 [2023-02-15 00:57:30,333 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 549 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 244 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-02-15 00:57:30,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [549 Valid, 181 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 244 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-02-15 00:57:30,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2023-02-15 00:57:30,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 131. [2023-02-15 00:57:30,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 129 states have (on average 1.1550387596899225) internal successors, (149), 130 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:57:30,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 149 transitions. [2023-02-15 00:57:30,335 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 149 transitions. Word has length 40 [2023-02-15 00:57:30,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:57:30,335 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 149 transitions. [2023-02-15 00:57:30,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.8421052631578947) internal successors, (54), 20 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:57:30,335 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 149 transitions. [2023-02-15 00:57:30,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-02-15 00:57:30,336 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:57:30,336 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1] [2023-02-15 00:57:30,354 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 00:57:30,552 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 00:57:30,552 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-15 00:57:30,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:57:30,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1048882662, now seen corresponding path program 3 times [2023-02-15 00:57:30,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:57:30,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1565804901] [2023-02-15 00:57:30,553 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 00:57:30,553 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 00:57:30,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:57:30,554 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 00:57:30,556 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 00:57:30,736 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-02-15 00:57:30,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 00:57:30,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 20 conjunts are in the unsatisfiable core [2023-02-15 00:57:30,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:57:30,780 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 8 treesize of output 7 [2023-02-15 00:57:32,479 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:57:32,479 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:57:36,831 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:57:36,831 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:57:36,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1565804901] [2023-02-15 00:57:36,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1565804901] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:57:36,831 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 00:57:36,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 29 [2023-02-15 00:57:36,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627270541] [2023-02-15 00:57:36,831 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 00:57:36,831 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-15 00:57:36,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:57:36,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-15 00:57:36,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=638, Unknown=0, NotChecked=0, Total=870 [2023-02-15 00:57:36,832 INFO L87 Difference]: Start difference. First operand 131 states and 149 transitions. Second operand has 30 states, 29 states have (on average 3.103448275862069) internal successors, (90), 30 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:57:47,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-15 00:58:12,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:58:12,825 INFO L93 Difference]: Finished difference Result 1691 states and 1901 transitions. [2023-02-15 00:58:12,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-02-15 00:58:12,827 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.103448275862069) internal successors, (90), 30 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2023-02-15 00:58:12,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:58:12,830 INFO L225 Difference]: With dead ends: 1691 [2023-02-15 00:58:12,830 INFO L226 Difference]: Without dead ends: 1691 [2023-02-15 00:58:12,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 932 ImplicationChecksByTransitivity, 32.2s TimeCoverageRelationStatistics Valid=1194, Invalid=2588, Unknown=0, NotChecked=0, Total=3782 [2023-02-15 00:58:12,832 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 1779 mSDsluCounter, 845 mSDsCounter, 0 mSdLazyCounter, 1262 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1779 SdHoareTripleChecker+Valid, 908 SdHoareTripleChecker+Invalid, 1277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2023-02-15 00:58:12,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1779 Valid, 908 Invalid, 1277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1262 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2023-02-15 00:58:12,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1691 states. [2023-02-15 00:58:12,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1691 to 179. [2023-02-15 00:58:12,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 177 states have (on average 1.1807909604519775) internal successors, (209), 178 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:58:12,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 209 transitions. [2023-02-15 00:58:12,840 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 209 transitions. Word has length 46 [2023-02-15 00:58:12,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:58:12,841 INFO L495 AbstractCegarLoop]: Abstraction has 179 states and 209 transitions. [2023-02-15 00:58:12,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.103448275862069) internal successors, (90), 30 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:58:12,841 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 209 transitions. [2023-02-15 00:58:12,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-02-15 00:58:12,844 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:58:12,844 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:58:12,854 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 00:58:13,054 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 00:58:13,055 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-15 00:58:13,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:58:13,056 INFO L85 PathProgramCache]: Analyzing trace with hash -311505665, now seen corresponding path program 5 times [2023-02-15 00:58:13,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:58:13,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033385762] [2023-02-15 00:58:13,056 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-02-15 00:58:13,056 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 00:58:13,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:58:13,057 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 00:58:13,061 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 00:58:13,225 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2023-02-15 00:58:13,225 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 00:58:13,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 31 conjunts are in the unsatisfiable core [2023-02-15 00:58:13,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:58:13,257 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 8 treesize of output 7 [2023-02-15 00:58:14,993 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 90 proven. 113 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-02-15 00:58:14,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:58:21,614 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 0 proven. 215 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:58:21,614 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:58:21,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033385762] [2023-02-15 00:58:21,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033385762] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:58:21,614 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 00:58:21,614 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 35 [2023-02-15 00:58:21,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [708234109] [2023-02-15 00:58:21,614 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 00:58:21,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-02-15 00:58:21,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:58:21,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-02-15 00:58:21,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1018, Unknown=0, NotChecked=0, Total=1190 [2023-02-15 00:58:21,615 INFO L87 Difference]: Start difference. First operand 179 states and 209 transitions. Second operand has 35 states, 35 states have (on average 3.1714285714285713) internal successors, (111), 35 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:58:43,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:58:43,590 INFO L93 Difference]: Finished difference Result 321 states and 364 transitions. [2023-02-15 00:58:43,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2023-02-15 00:58:43,592 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.1714285714285713) internal successors, (111), 35 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 60 [2023-02-15 00:58:43,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:58:43,593 INFO L225 Difference]: With dead ends: 321 [2023-02-15 00:58:43,593 INFO L226 Difference]: Without dead ends: 292 [2023-02-15 00:58:43,594 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 783 ImplicationChecksByTransitivity, 19.9s TimeCoverageRelationStatistics Valid=858, Invalid=4112, Unknown=0, NotChecked=0, Total=4970 [2023-02-15 00:58:43,595 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 733 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 1095 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 1103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2023-02-15 00:58:43,595 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 612 Invalid, 1103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1095 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2023-02-15 00:58:43,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2023-02-15 00:58:43,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 188. [2023-02-15 00:58:43,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 186 states have (on average 1.1720430107526882) internal successors, (218), 187 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:58:43,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 218 transitions. [2023-02-15 00:58:43,607 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 218 transitions. Word has length 60 [2023-02-15 00:58:43,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:58:43,607 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 218 transitions. [2023-02-15 00:58:43,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.1714285714285713) internal successors, (111), 35 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:58:43,607 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 218 transitions. [2023-02-15 00:58:43,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2023-02-15 00:58:43,608 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:58:43,608 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:58:43,618 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-02-15 00:58:43,808 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 00:58:43,809 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-15 00:58:43,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:58:43,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1198865259, now seen corresponding path program 6 times [2023-02-15 00:58:43,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:58:43,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [126323092] [2023-02-15 00:58:43,809 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-02-15 00:58:43,809 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 00:58:43,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:58:43,811 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 00:58:43,813 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 00:58:44,006 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2023-02-15 00:58:44,006 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 00:58:44,014 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 24 conjunts are in the unsatisfiable core [2023-02-15 00:58:44,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:58:44,058 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 8 treesize of output 7 [2023-02-15 00:58:46,071 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 132 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-02-15 00:58:46,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:58:48,657 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 132 proven. 78 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-02-15 00:58:48,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:58:48,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [126323092] [2023-02-15 00:58:48,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [126323092] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:58:48,657 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 00:58:48,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2023-02-15 00:58:48,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593690296] [2023-02-15 00:58:48,658 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 00:58:48,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-02-15 00:58:48,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:58:48,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-02-15 00:58:48,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2023-02-15 00:58:48,659 INFO L87 Difference]: Start difference. First operand 188 states and 218 transitions. Second operand has 30 states, 30 states have (on average 3.033333333333333) internal successors, (91), 30 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:58:56,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:58:56,019 INFO L93 Difference]: Finished difference Result 266 states and 303 transitions. [2023-02-15 00:58:56,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-02-15 00:58:56,021 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.033333333333333) internal successors, (91), 30 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2023-02-15 00:58:56,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:58:56,021 INFO L225 Difference]: With dead ends: 266 [2023-02-15 00:58:56,021 INFO L226 Difference]: Without dead ends: 188 [2023-02-15 00:58:56,022 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=386, Invalid=1506, Unknown=0, NotChecked=0, Total=1892 [2023-02-15 00:58:56,022 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 487 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2023-02-15 00:58:56,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 407 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2023-02-15 00:58:56,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-02-15 00:58:56,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2023-02-15 00:58:56,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 186 states have (on average 1.1612903225806452) internal successors, (216), 187 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:58:56,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 216 transitions. [2023-02-15 00:58:56,025 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 216 transitions. Word has length 68 [2023-02-15 00:58:56,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:58:56,025 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 216 transitions. [2023-02-15 00:58:56,025 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.033333333333333) internal successors, (91), 30 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:58:56,025 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 216 transitions. [2023-02-15 00:58:56,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2023-02-15 00:58:56,026 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:58:56,026 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:58:56,035 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 (21)] Ended with exit code 0 [2023-02-15 00:58:56,234 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 00:58:56,235 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-15 00:58:56,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:58:56,235 INFO L85 PathProgramCache]: Analyzing trace with hash 253880091, now seen corresponding path program 7 times [2023-02-15 00:58:56,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:58:56,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1922886340] [2023-02-15 00:58:56,235 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-02-15 00:58:56,235 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 00:58:56,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:58:56,236 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 00:58:56,238 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 00:58:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-02-15 00:58:56,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 32 conjunts are in the unsatisfiable core [2023-02-15 00:58:56,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:58:56,410 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 8 treesize of output 7 [2023-02-15 00:58:58,713 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 120 proven. 164 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-02-15 00:58:58,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:59:08,527 INFO L134 CoverageAnalysis]: Checked inductivity of 308 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:59:08,527 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:59:08,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1922886340] [2023-02-15 00:59:08,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1922886340] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:59:08,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 00:59:08,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 41 [2023-02-15 00:59:08,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607113196] [2023-02-15 00:59:08,527 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 00:59:08,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-02-15 00:59:08,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:59:08,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-02-15 00:59:08,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1453, Unknown=0, NotChecked=0, Total=1640 [2023-02-15 00:59:08,529 INFO L87 Difference]: Start difference. First operand 188 states and 216 transitions. Second operand has 41 states, 41 states have (on average 3.3902439024390243) internal successors, (139), 41 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:59:39,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 00:59:39,397 INFO L93 Difference]: Finished difference Result 358 states and 402 transitions. [2023-02-15 00:59:39,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2023-02-15 00:59:39,399 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.3902439024390243) internal successors, (139), 41 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 76 [2023-02-15 00:59:39,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 00:59:39,400 INFO L225 Difference]: With dead ends: 358 [2023-02-15 00:59:39,400 INFO L226 Difference]: Without dead ends: 301 [2023-02-15 00:59:39,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=1033, Invalid=5447, Unknown=0, NotChecked=0, Total=6480 [2023-02-15 00:59:39,402 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 918 mSDsluCounter, 1156 mSDsCounter, 0 mSdLazyCounter, 2169 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 918 SdHoareTripleChecker+Valid, 1207 SdHoareTripleChecker+Invalid, 2174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 2169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.6s IncrementalHoareTripleChecker+Time [2023-02-15 00:59:39,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [918 Valid, 1207 Invalid, 2174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 2169 Invalid, 0 Unknown, 0 Unchecked, 14.6s Time] [2023-02-15 00:59:39,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2023-02-15 00:59:39,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 196. [2023-02-15 00:59:39,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 194 states have (on average 1.1546391752577319) internal successors, (224), 195 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:59:39,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 224 transitions. [2023-02-15 00:59:39,405 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 224 transitions. Word has length 76 [2023-02-15 00:59:39,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 00:59:39,405 INFO L495 AbstractCegarLoop]: Abstraction has 196 states and 224 transitions. [2023-02-15 00:59:39,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.3902439024390243) internal successors, (139), 41 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 00:59:39,405 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 224 transitions. [2023-02-15 00:59:39,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-02-15 00:59:39,405 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 00:59:39,405 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 00:59:39,420 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 00:59:39,626 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 00:59:39,626 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-15 00:59:39,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 00:59:39,627 INFO L85 PathProgramCache]: Analyzing trace with hash 266089230, now seen corresponding path program 8 times [2023-02-15 00:59:39,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 00:59:39,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [910434514] [2023-02-15 00:59:39,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-02-15 00:59:39,627 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 00:59:39,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 00:59:39,628 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 00:59:39,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-02-15 00:59:39,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-02-15 00:59:39,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 00:59:39,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 34 conjunts are in the unsatisfiable core [2023-02-15 00:59:39,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 00:59:39,797 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 8 treesize of output 7 [2023-02-15 00:59:42,998 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 38 proven. 282 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:59:42,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 00:59:55,525 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-02-15 00:59:55,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 00:59:55,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [910434514] [2023-02-15 00:59:55,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [910434514] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 00:59:55,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 00:59:55,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 48 [2023-02-15 00:59:55,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24608943] [2023-02-15 00:59:55,526 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 00:59:55,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-02-15 00:59:55,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 00:59:55,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-02-15 00:59:55,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=1990, Unknown=0, NotChecked=0, Total=2256 [2023-02-15 00:59:55,527 INFO L87 Difference]: Start difference. First operand 196 states and 224 transitions. Second operand has 48 states, 48 states have (on average 3.2916666666666665) internal successors, (158), 48 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:00:25,913 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-02-15 01:00:33,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-02-15 01:00:33,122 INFO L93 Difference]: Finished difference Result 442 states and 493 transitions. [2023-02-15 01:00:33,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2023-02-15 01:00:33,124 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 3.2916666666666665) internal successors, (158), 48 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 80 [2023-02-15 01:00:33,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-02-15 01:00:33,124 INFO L225 Difference]: With dead ends: 442 [2023-02-15 01:00:33,124 INFO L226 Difference]: Without dead ends: 292 [2023-02-15 01:00:33,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2152 ImplicationChecksByTransitivity, 34.0s TimeCoverageRelationStatistics Valid=1973, Invalid=9583, Unknown=0, NotChecked=0, Total=11556 [2023-02-15 01:00:33,127 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 1126 mSDsluCounter, 1730 mSDsCounter, 0 mSdLazyCounter, 3240 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 1811 SdHoareTripleChecker+Invalid, 3250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 3240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.4s IncrementalHoareTripleChecker+Time [2023-02-15 01:00:33,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1126 Valid, 1811 Invalid, 3250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 3240 Invalid, 0 Unknown, 0 Unchecked, 14.4s Time] [2023-02-15 01:00:33,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2023-02-15 01:00:33,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 188. [2023-02-15 01:00:33,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 186 states have (on average 1.1451612903225807) internal successors, (213), 187 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:00:33,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 213 transitions. [2023-02-15 01:00:33,130 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 213 transitions. Word has length 80 [2023-02-15 01:00:33,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-02-15 01:00:33,130 INFO L495 AbstractCegarLoop]: Abstraction has 188 states and 213 transitions. [2023-02-15 01:00:33,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 3.2916666666666665) internal successors, (158), 48 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:00:33,130 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 213 transitions. [2023-02-15 01:00:33,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-02-15 01:00:33,131 INFO L187 NwaCegarLoop]: Found error trace [2023-02-15 01:00:33,131 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2023-02-15 01:00:33,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-02-15 01:00:33,337 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:00:33,337 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2023-02-15 01:00:33,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2023-02-15 01:00:33,337 INFO L85 PathProgramCache]: Analyzing trace with hash 2070264980, now seen corresponding path program 9 times [2023-02-15 01:00:33,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-02-15 01:00:33,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1364843637] [2023-02-15 01:00:33,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-02-15 01:00:33,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-02-15 01:00:33,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-02-15 01:00:33,339 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-02-15 01:00:33,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-02-15 01:00:34,082 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-02-15 01:00:34,082 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-02-15 01:00:34,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 26 conjunts are in the unsatisfiable core [2023-02-15 01:00:34,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-02-15 01:00:34,130 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 8 treesize of output 7 [2023-02-15 01:00:36,712 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-15 01:00:36,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-02-15 01:00:44,997 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-02-15 01:00:44,998 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-02-15 01:00:44,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1364843637] [2023-02-15 01:00:44,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1364843637] provided 0 perfect and 2 imperfect interpolant sequences [2023-02-15 01:00:44,998 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-02-15 01:00:44,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 31 [2023-02-15 01:00:44,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875205222] [2023-02-15 01:00:44,998 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-02-15 01:00:44,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-02-15 01:00:44,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-02-15 01:00:44,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-02-15 01:00:44,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=777, Unknown=0, NotChecked=0, Total=992 [2023-02-15 01:00:44,999 INFO L87 Difference]: Start difference. First operand 188 states and 213 transitions. Second operand has 32 states, 31 states have (on average 3.2903225806451615) internal successors, (102), 32 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-02-15 01:00:59,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []